A hybrid two-stage sweep algorithm for capacitated vehicle routing problem

Capacitated Vehicle Routing Problem (CVRP) is a variant of Vehicle Routing Problem (VRP), where CVRP is only considered the capacity restrictions, and the object is to minimize the cost of the vehicles serve all customers. In this study, we proposed an approach which is hybrid two-phase sweep algorithm (SA) and greedy search for solving CVRP. At the first stage of SA, all customers are clustered by SA and define each cluster as a block. The second stage is to reconstruct each neighbour clusters based on the first stage. Then the greedy search is applied to minimize the cost of each vehicle. Finally, the computational result on standard instances show the proposed approach is effective.

[1]  Pei-Chann Chang,et al.  A block based estimation of distribution algorithm using bivariate model for scheduling problems , 2014, Soft Comput..

[2]  Magdalene Marinaki,et al.  A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem , 2010, Expert Syst. Appl..

[3]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[4]  Li Jian.  Solving Capacitated Vehicle Routing Problems via Genetic Particle Swarm Optimization , 2009, 2009 Third International Symposium on Intelligent Information Technology Application.

[5]  Pei-Chann Chang,et al.  A block recombination approach to solve green vehicle routing problem , 2015 .

[6]  Haibin Duan,et al.  An Improved Greedy Genetic Algorithm for Solving Travelling Salesman Problem , 2009, 2009 Fifth International Conference on Natural Computation.

[7]  M. M. Flood.  The Traveling-Salesman Problem , 1956 .

[8]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[9]  Lawrence Bodin,et al.  Classification in vehicle routing and scheduling , 1981, Networks.

[10]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[11]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[12]  Barrie M. Baker,et al.  A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..

[13]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[14]  Manoj Kumar Tiwari,et al.  A block-based evolutionary algorithm for flow-shop scheduling problem , 2013, Appl. Soft Comput..

[15]  Bin Yu,et al.  An ant colony optimization model: The period vehicle routing problem with time windows , 2011 .

[16]  Cigdem Alabas-Uslu,et al.  A self-adaptive local search algorithm for the classical vehicle routing problem , 2011, Expert Syst. Appl..

[17]  Pei-Chann Chang,et al.  Block Based Imperial Competitive Algorithm with Greedy Search for Traveling Salesman Problem , 2014 .

[18]  Mitsuo Gen,et al.  A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries , 2010 .

[19]  Roberto D. Galvão,et al.  Vehicle Routing Problems with Simultaneous Pick-up and Delivery Service , 2002 .