Vehicle routing problem with considering multi-middle depots for perishable food delivery

Article history: Received October 20, 2015 Received in revised format February 28, 2016 Accepted March 4 2016 Available online March 6 2016 Today, distributing high quality perishable foods is one of the challenging issues in food industry. This paper introduces a deterministic vehicle routing problem model with multiple middle depots and proposes the freshness of perishable foods as a new concept to obtain optimal delivery routes. For the proposed mathematical model, profit maximization of delivering the product, minimization of the transportation costs and vehicle traveling time, and maximum level of delivered product perishability (loss of freshness) are considered. GAMS software is implemented to show the authority of the model. Furthermore, genetic algorithm (GA) has been developed to solve the model for large size instances. Several problems are tested in order to compare the exact and the GA solutions. Growing Science Ltd. All rights reserved. 6 © 201

[1]  Pedro Amorim,et al.  The impact of food perishability issues in the vehicle routing problem , 2014, Comput. Ind. Eng..

[2]  Christos D. Tarantilis,et al.  Distribution of fresh meat , 2002 .

[3]  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 .

[4]  Rafael Martinelli,et al.  A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints , 2014, Discret. Optim..

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

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

[7]  Lidija Zadnik Stirn,et al.  A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food , 2008 .

[8]  J. Gustavsson.  Global food losses and food waste , 2011 .

[9]  L. Sparks,et al.  Temperature Controlled Supply Chains , 2007 .

[10]  P. Bhave,et al.  Integer programming formulations of vehicle routing problems , 1985 .

[11]  Gilbert Laporte,et al.  Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave , 1989 .

[12]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[13]  Diego Klabjan,et al.  Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems , 2013, Networks.

[14]  Philip M. Wolfe,et al.  An inventory model for deteriorating items , 1991 .

[15]  Ulrich Dorndorf,et al.  A Branch-and-Bound Algorithm , 2002 .

[16]  Iraj Mahdavi,et al.  An Uncertain Decision Making Process Considering Customers and Services in Evaluating Banks: A Case Study , 2013, Int. J. Strateg. Decis. Sci..

[17]  Jyotirmoyee Bhattacharjya,et al.  Maritime Empty Container Repositioning: A Problem Review , 2014, Int. J. Strateg. Decis. Sci..

[18]  Hui-Chieh Li,et al.  Vehicle routing problem with time-windows for perishable food delivery , 2007 .

[19]  Rajesh Piplani,et al.  Vehicle scheduling and routing at a cross docking center for food supply chains , 2014 .

[20]  Gilbert Laporte,et al.  Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..

[21]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem , 2001 .

[22]  Steven Nahmias,et al.  Perishable Inventory Theory: A Review , 1982, Oper. Res..

[23]  Roberto Baldacci,et al.  A unified exact method for solving different classes of vehicle routing problems , 2009, Math. Program..