A MATLAB-Based Application to Solve Vehicle Routing Problem Using GA

Application of vehicle routing problem in real-life logistics operations is a need of today’s world, and this paper focuses on developing a vehicle routing problem for the delivery and pickup of products from multiple depot to the graphically scattered customers. The proposed model can be used in real-life applications of various logistic operations where there is a need to determine the optimized location of warehouse for setup so that the demand of customers is fully satisfied. To do so, a genetic algorithm-based solution methodology is proposed to solve the above-stated problem. The proposed algorithm is tested on generated data based on real-life scenarios. The experiments show that the proposed algorithm successfully finds the potential locations for warehouse setup based on the demand and location of customers for minimum transportation cost. The presented approach can provide good solutions to a large-scale problem generally found in real life.

[1]  Douglas Moura Miranda,et al.  The vehicle routing problem with hard time windows and stochastic travel and service time , 2016, Expert Syst. Appl..

[2]  Fu-Cheng Wang,et al.  Modeling and analyses of a connected multi-car train system employing the inerter , 2017 .

[3]  Robert H. Storer,et al.  An approximate dynamic programming approach for the vehicle routing problem with stochastic demands , 2009, Eur. J. Oper. Res..

[4]  Michel Gendreau,et al.  Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach , 2014, Eur. J. Oper. Res..

[5]  S. C. Liu,et al.  A heuristic method for the combined location routing and inventory problem , 2005 .

[6]  Deniz Aksen,et al.  Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation , 2007 .

[7]  Khaled Ghédira,et al.  Variable Neighborhood Search based Set Covering ILP Model for the Vehicle Routing Problem with Time Windows , 2014, ICCS.

[8]  Ruey-Maw Chen,et al.  Optimal multi-depot location decision using particle swarm optimization , 2017 .

[9]  Pierre Borne,et al.  Insertion of new depot locations for the optimization of multi-vehicles multi-depots pickup and Delivery Problems using Genetic Algorithm , 2015, 2015 International Conference on Industrial Engineering and Systems Management (IESM).

[10]  Magdalene Marinaki,et al.  Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands , 2013, Appl. Soft Comput..

[11]  Ioannis Minis,et al.  Single vehicle routing with a predefined customer sequence and multiple depot returns , 2008, Eur. J. Oper. Res..

[12]  Wen-Chyuan Chiang,et al.  A metaheuristic for the vehicle-routeing problem with soft time windows , 2004, J. Oper. Res. Soc..

[13]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[14]  Ibrahim H. Osman,et al.  Hybrid Genetic Algorithm, Simulated Annealing and Tabu Search Methods for Vehicle Routing Problems with Time Windows , 1997 .

[15]  Giovanni Righini,et al.  A Column Generation Algorithm for a Rich Vehicle-Routing Problem , 2009, Transp. Sci..

[16]  Nagraj Balakrishnan,et al.  Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows , 1993 .

[17]  Daniel Granot,et al.  The vehicle routing problem with pickups and deliveries on some special graphs , 2002, Discret. Appl. Math..

[18]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[19]  Mitsuo Gen,et al.  A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries , 2010, The 40th International Conference on Computers & Indutrial Engineering.

[20]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .