A decomposition-based chemical reaction optimization for multi-objective vehicle routing problem for simultaneous delivery and pickup with time windows
- 344 Downloads
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.
KeywordsMulti-objective optimization Chemical reaction optimization Decomposition Vehicle routing problem with simultaneous delivery and pickup and time windows
The authors would also like to thank Prof. J. Wang for providing the 45 MOVRPTW Instances, Prof. H. L. Liu for providing the source codes of TMOEA/D. This work is partially supported by National Natural Science Foundation of China (Nos. U1534208, 61272283, U1334211), Shaanxi Science and Technology Innovation Project (2015KTZDGY01-04).
- 2.Xu Y, Lim MH, Ong YS (2008) Automatic configuration of metaheuristic algorithms for complex combinatorial optimization problems. In: 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence). IEEE, pp 2380–2387Google Scholar
- 7.Wang J, Zhou Y, Wang Y et al (2016) Multiobjective vehicle routing problems with simultaneous delivery and pickup and time windows: formulation, instances, and algorithms IEEE Trans Cybern 46(3):582–594. doi: 10.1109/TCYB.2015.2409837
- 8.Hsu WH, Chiang TCA (2012) Multiobjective evolutionary algorithm with enhanced reproduction operators for the vehicle routing problem with time windows. In: IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 1–8Google Scholar
- 10.Li H, Landa-Silva D (2011) An adaptive evolutionary multi-objective approach based on simulated annealing. Evol Comput 19(4):561–595Google Scholar
- 18.Li H, Wang L, Hei X (2015) Decomposition-based chemical reaction optimization (CRO) and an extended CRO algorithms for multiobjective optimization. J Comput Sci. doi: 10.1016/j.jocs.2015.09.003
- 21.Liu HL, Gu F, Cheung Y (2010) T-MOEA/D: MOEA/D with objective transform in multi-objective problems. In: 2010 international conference of information science and management engineering (ISME), vol 2. IEEE, pp 282–285Google Scholar