A decomposition-based chemical reaction optimization for multi-objective vehicle routing problem for simultaneous delivery and pickup with time windows

A practical variant of the vehicle routing problem (VRP), with simultaneous delivery and pickup and time windows (VRPSDPTW) is a challenging combinatorial optimization problem that has five optimization objectives in transportation and distribution logistics. Chemical reaction optimization has been used to solve mono and multi-objective problems. However, almost all attempts to solve multi-objective problems have included continues problems less than four objectives. This paper studies discrete multi-objective VRPSDPTW using decomposition-based multi-objective optimization chemical reaction optimization. In the proposed algorithm, each decomposed sub-problem is represented by a chemical molecule. All of the molecules are divided into a few groups, with each molecule having several neighboring molecules. To balance the diversity and convergence, we designed operators of on-wall ineffective collision and inter-molecular ineffective collision for a local search, as well as operators of decomposition and synthesis to enhance global convergence. The proposed approach is compared with two different algorithms on hypervolume performance measures. Experimental results show that the proposed algorithm outperform the other algorithms in most benchmarks.

[1]  Maoguo Gong,et al.  Complex Network Clustering by Multiobjective Discrete Particle Swarm Optimization Based on Decomposition , 2014, IEEE Transactions on Evolutionary Computation.

[2]  Kay Chen Tan,et al.  A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows , 2003, Comput. Optim. Appl..

[3]  Gilbert Laporte,et al.  A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading , 2014, Comput. Oper. Res..

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

[5]  John E. Dennis,et al.  Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..

[6]  Victor O. K. Li,et al.  Chemical Reaction Optimization: a tutorial , 2012, Memetic Computing.

[7]  Lu Gan,et al.  Orthogonal Multiobjective Chemical Reaction Optimization Approach for the Brushless DC Motor Design , 2015, IEEE Transactions on Magnetics.

[8]  János Botzheim,et al.  Modeling of loss aversion in solving fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm , 2010, Memetic Comput..

[9]  Tsung-Che Chiang,et al.  A multiobjective evolutionary algorithm with enhanced reproduction operators for the vehicle routing problem with time windows , 2012, 2012 IEEE Congress on Evolutionary Computation.

[10]  Yiliang Xu,et al.  Automatic configuration of metaheuristic algorithms for complex combinatorial optimization problems , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[11]  Hui Li,et al.  An Adaptive Evolutionary Multi-Objective Approach Based on Simulated Annealing , 2011, Evolutionary Computation.

[12]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[13]  Hisao Ishibuchi,et al.  Behavior of Multiobjective Evolutionary Algorithms on Many-Objective Knapsack Problems , 2015, IEEE Transactions on Evolutionary Computation.

[14]  Abir Chaabani,et al.  An Efficient Chemical Reaction Optimization Algorithm for Multiobjective Optimization , 2015, IEEE Transactions on Cybernetics.

[15]  F. Wilcoxon Individual Comparisons by Ranking Methods , 1945 .

[16]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[17]  Ye Tian,et al.  A Knee Point-Driven Evolutionary Algorithm for Many-Objective Optimization , 2015, IEEE Transactions on Evolutionary Computation.

[18]  Zibin Zheng,et al.  Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms , 2016, IEEE Transactions on Cybernetics.

[19]  Jin Xu,et al.  Chemical Reaction Optimization for Task Scheduling in Grid Computing , 2011, IEEE Transactions on Parallel and Distributed Systems.

[20]  Lei Wang,et al.  Decomposition-based chemical reaction optimization (CRO) and an extended CRO algorithms for multiobjective optimization , 2016, J. Comput. Sci..

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

[22]  Marco César Goldbarg,et al.  Memetic algorithm for the Traveling Car Renter Problem: an experimental investigation , 2012, Memetic Comput..

[23]  Yiu-ming Cheung,et al.  T-MOEA/D: MOEA/D with Objective Transform in Multi-objective Problems , 2010, 2010 International Conference of Information Science and Management Engineering.

[24]  Xiaodong Li,et al.  A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows , 2015, Comput. Oper. Res..

[25]  Jianguo Zhu,et al.  Hysteresis Modeling of High-Temperature Superconductor Using Simplified Preisach Model , 2015, IEEE Transactions on Magnetics.