A multi-objective Two-Echelon Capacitated Vehicle Routing Problem for perishable products

This article addresses a general tri-objective two-echelon capacitated vehicle routing problem (2E-CVRP) to minimize the total travel cost, customers waiting times and carbon dioxide emissions simultaneously in distributing perishable products. In distributing perishable products, customers’ satisfaction is very important and is inversely proportional to the customers waiting times. The proposed model is a mixed integer non-linear programming (MINLP). By applying some linearization methods, the MINLP model exchanged to a mixed integer linear programming (MILP). This paper uses a non-dominated sorting genetic (NSGA-II) algorithm to solve the presented mathematical model. The related results would be compared with Lp-metric results in small-sized test problems and with multi objective particle swarm optimization (MOPSO) algorithm in medium and large sized test problems. In order to evaluate the quality of the solution sets, the results of two metaheuristic algorithms are compared based on four comparison metrics in medium sized problems. The obtained results indicate the efficiency of the NSGA-II algorithm.

[1]  Roberto Roberti,et al.  An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem , 2013, Oper. Res..

[2]  M. Esmaili,et al.  A NEW BI-OBJECTIVE MODEL FOR A TWO-ECHELON CAPACITATED VEHICLE ROUTING PROBLEM FOR PERISHABLE PRODUCTS WITH THE ENVIRONMENTAL FACTOR , 2017 .

[3]  Yacine Rekik,et al.  Multi-product multi-period Inventory Routing Problem with a transshipment option: A green approach , 2014 .

[4]  Teodor Gabriel Crainic,et al.  Two-Echelon Vehicle Routing Problem: A satellite location analysis , 2010 .

[5]  Sai Ho Chung,et al.  Survey of Green Vehicle Routing Problem: Past and future trends , 2014, Expert Syst. Appl..

[6]  Teodor Gabriel Crainic,et al.  An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics , 2012, Comput. Oper. Res..

[7]  Kannan Govindan,et al.  Two-echelon multiple-vehicle location-routing problem with time windows for optimization of sustainable supply chain network of perishable food , 2014 .

[8]  Fred W. Glover,et al.  Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program , 1974, Oper. Res..

[9]  Masoud Rabbani,et al.  Vehicle Routing with Time Windows and Customer Selection for Perishable Goods , 2015 .

[10]  Masoud Rabbani,et al.  Solving a bi-objective location routing problem by a NSGA-II combined with clustering approach: application in waste collection problem , 2017 .

[11]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[12]  Young Dae Ko,et al.  A vehicle routing problem of both refrigerated- and general-type vehicles for perishable food products delivery , 2016 .

[13]  Zhi-Yu Xu,et al.  A two-phase hybrid heuristic for the two-echelon vehicle routing problem , 2013, 2013 Chinese Automation Congress.

[14]  Maria Grazia Speranza,et al.  A survey on two-echelon routing problems , 2015, Comput. Oper. Res..

[15]  Hamidreza Maghsoudlou,et al.  Bi-objective optimization of a three-echelon multi-server supply-chain problem in congested systems: Modeling and solution , 2016, Comput. Ind. Eng..

[16]  Jacqueline M. Bloemhof,et al.  The time dependent two echelon capacitated vehicle routing problem with environmental considerations , 2015 .

[17]  Alexandre Salles da Cunha,et al.  A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem , 2015, Transp. Sci..

[18]  Daniele Vigo,et al.  The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics , 2011, Transp. Sci..

[19]  Meng Wang,et al.  The Multi-objective Optimization for Perishable Food Distribution Route Considering Temporal-spatial Distance , 2016, KES.

[20]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[21]  Teodor Gabriel Crainic,et al.  Models for Evaluating and Planning City Logistics Systems , 2009, Transp. Sci..

[22]  Ada M. Alvarez,et al.  Minimizing waiting times in a route design problem with multiple use of a single vehicle , 2013, Electron. Notes Discret. Math..

[23]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[24]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[25]  Simon Spoorendonk,et al.  A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem , 2013, Transp. Sci..

[26]  Mei-Shiang Chang,et al.  Production scheduling and vehicle routing with time windows for perishable food products , 2009, Comput. Oper. Res..

[27]  Jing Fan,et al.  The Vehicle Routing Problem with Simultaneous Pickup and Delivery Based on Customer Satisfaction , 2011 .

[28]  Behrouz Afshar-nadjafi,et al.  A Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet , 2014 .