A fuzzy mathematical model for supplier selection and order allocation considering green vehicle routing problem

2017 ◽  
Vol 27 (2) ◽  
pp. 151
Author(s):  
Roohollah Ramezanzadeh Baraki ◽  
Farhad Kianfar
Keyword(s):  
Mathematical Model ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Supplier Selection ◽  
Order Allocation ◽  
Routing Problem

scholarly journals Stochastic mathematical model for vehicle routing problem in collecting perishable products

DYNA ◽  
2015 ◽  
Vol 82 (189) ◽  
pp. 199-206 ◽  
Author(s):  
Elsa Cristina Gonzalez-L. ◽  
Wilson Adarme-Jaimes ◽  
Javier Arturo Orjuela-Castro
Keyword(s):  
Mathematical Model ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Perishable Products ◽  
Routing Problem

scholarly journals On the Selective Vehicle Routing Problem

Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 771 ◽  
Author(s):  
Cosmin Sabo ◽  
Petrică C. Pop ◽  
Andrei Horvat-Marc
Keyword(s):  
Mathematical Model ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Mixed Integer ◽  
The Novel ◽  
Routing Problem ◽  
Proposed Model ◽  
Benchmark Instances ◽  
Number Of Customers ◽  
Optimal Set

The Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle Routing Problem (VRP), in which we are looking for an optimal set of delivery or collection routes from a given depot to a number of customers divided into predefined, mutually exclusive, and exhaustive clusters, visiting exactly one customer from each cluster and fulfilling the capacity restrictions. This paper deals with a more generic version of the GVRP, introduced recently and called Selective Vehicle Routing Problem (SVRP). This problem generalizes the GVRP in the sense that the customers are divided into clusters, but they may belong to one or more clusters. The aim of this work is to describe a novel mixed integer programming based mathematical model of the SVRP. To validate the consistency of the novel mathematical model, a comparison between the proposed model and the existing models from literature is performed, on the existing benchmark instances for SVRP and on a set of additional benchmark instances used in the case of GVRP and adapted for SVRP. The proposed model showed better results against the existing models.

scholarly journals A A Multi-Objective Mathematical Model for Vehicle Routing Problem Considering the Time Window and Economic and Environmental Objectives Using the Metaheuristic Algorithm Based on Pareto Archive

2020 ◽  
Vol 1 (1) ◽  
pp. 58-68
Author(s):  
Elnaz Asadifard ◽  
Maryam Adlifard ◽  
Mohammad Taghipour ◽  
Nader Shamami
Keyword(s):  
Mathematical Model ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Window ◽  
Fixed Costs ◽  
Metaheuristic Algorithm ◽  
Routing Problem ◽  
Total Distance ◽  
Environmental Objectives ◽  
Single Objective

Purpose:  The purpose of this study is the well-known Heterogeneous Fleet Vehicle Routing Problem (HVRP) is one of the developed problems of vehicle routing, which involves optimizing a set of routes for a fleet of vehicles with different costs and capacities. Methods: HVRP is usually modeled as a single objective that aims to minimize overall transportation costs (total fixed costs and costs commensurate with total distance). Results: These vehicles are located in the central depot and serve customers’ demands. Implications: In this case, the number of vehicles available (of any type) may be limited.

Sign in / Sign up

Export Citation Format

Share Document