Optimization of multi objective vehicle routing problem using a new hybrid algorithm based on particle swarm optimization and artificial bee colony algorithm considering Precedence constraints

The vehicle routing problem is the basic problem of distribution planning which seeks to find the best route with minimum displacement cost considering the number of customers, their constraints, and number and capacity of the available vehicles. In this study, the traveling salesman problem and vehicle routing models are firstly described and, after that, the multi objective vehicle routing model is proposed to consider the Precedence constraints among customers. There are different meta-heuristic algorithms that can solve such NP-hard problems. In the present study, a solver algorithm is proposed which is based on a combination of the particle swarm optimization and the artificial bee colony algorithms. Additionally, by presenting an operational sample, using data of customers in a region, considering different constraints of the problem and its functions, and using penalty method as well as additional segmentation constraint method, the best vehicle route is obtained and the results of each algorithm together with its hybrid algorithm are demonstrated.

[1]  Ismail Karaoglan,et al.  A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery , 2013, Comput. Ind. Eng..

[2]  Nasser R. Sabar,et al.  Meta-harmony search algorithm for the vehicle routing problem with time windows , 2015, Inf. Sci..

[3]  Nebojsa Bacanin,et al.  Artificial Bee Colony Algorithm Hybridized with Firefly Algorithm for Cardinality Constrained Mean-Variance Portfolio Selection Problem , 2014 .

[4]  Xia Li,et al.  A novel hybrid shuffled frog leaping algorithm for vehicle routing problem with time windows , 2015, Inf. Sci..

[5]  Vili Podgorelec,et al.  A survey of genetic algorithms for solving multi depot vehicle routing problem , 2015, Appl. Soft Comput..

[6]  Abdullah Konak,et al.  A simulating annealing algorithm to solve the green vehicle routing & scheduling problem with hierarchical objectives and weighted tardiness , 2015, Appl. Soft Comput..

[7]  X. D. Chen,et al.  An Optimization Model for the Vehicle Routing Problem in Multi-product Frozen Food Delivery , 2014 .

[8]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[9]  Vahid Kayvanfar,et al.  Enhanced intelligent water drops and cuckoo search algorithms for solving the capacitated vehicle routing problem , 2016, Inf. Sci..

[10]  Narges Norouzi,et al.  Evaluating of the particle swarm optimization in a periodic vehicle routing problem , 2015 .

[11]  Richard F. Hartl,et al.  The multi-objective generalized consistent vehicle routing problem , 2015, Eur. J. Oper. Res..

[12]  Zheng Wang,et al.  A heuristic approach and a tabu search for the heterogeneous multi-type fleet vehicle routing problem with time windows and an incompatible loading constraint , 2015, Comput. Ind. Eng..

[13]  Manish Kumar,et al.  An ant colony optimization technique for solving min-max Multi-Depot Vehicle Routing Problem , 2013, Swarm Evol. Comput..

[14]  Tarek Y. ElMekkawy,et al.  Hybridized ant colony algorithm for the Multi Compartment Vehicle Routing Problem , 2015, Appl. Soft Comput..

[15]  Bruce L. Golden,et al.  The open vehicle routing problem: Algorithms, large-scale test problems, and computational results , 2007, Comput. Oper. Res..

[16]  Sumaiya Iqbal,et al.  Solving the multi-objective Vehicle Routing Problem with Soft Time Windows with the help of bees , 2015, Swarm Evol. Comput..

[17]  Juan Antonio Sicilia,et al.  An optimization algorithm for solving the rich vehicle routing problem based on Variable Neighborhood Search and Tabu Search metaheuristics , 2016, J. Comput. Appl. Math..

[18]  谷野 哲三,et al.  Multi-objective programming and goal programming : theory and applications , 2003 .

[19]  W. H. Ip,et al.  Design and development of a hybrid artificial bee colony algorithm for the environmental vehicle routing problem , 2014 .

[20]  Yoonho Seo,et al.  Discrete Optimization An efficient genetic algorithm for the traveling salesman problem with precedence constraints , 2002 .

[21]  Yi-Ting Huang,et al.  A Hybrid Algorithm Based on ACO and PSO for Capacitated Vehicle Routing Problems , 2012 .

[22]  Chao Wang,et al.  A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows , 2015, Comput. Ind. Eng..

[23]  R. J. Kuo,et al.  Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand - A case study on garbage collection system , 2012, Appl. Math. Comput..

[24]  Anand Subramanian,et al.  Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery , 2011, Oper. Res. Lett..

[25]  Noraini Mohd Razali.  An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints , 2015 .

[26]  Dantong Ouyang,et al.  A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization , 2009, Oper. Res. Lett..

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