Chemical reaction optimization with unified tabu search for the vehicle routing problem
- 237 Downloads
This study proposes a new approach combining the chemical reaction optimization framework with the unified tabu search (UTS) heuristic to solve the capacitated vehicle routing problem (CVRP). The CVRP is one of the most well-studied problems not only because of its real-life applications but also due to the fact that the CVRP could be used to evaluate the efficiency of new algorithms and optimization methods. Chemical reaction optimization (CRO) is a new optimization framework mimicking the nature of chemical reactions. The CRO method has proved to be very effective for solving NP-hard optimization problems such as the quadratic assignment problem, neural network training, the knapsack problem, and the traveling salesman problem. We also present the design of elementary chemical reaction operations, the adaptation of the UTS algorithm to educate solutions in these operations. Finally, a thorough testing against well-known benchmark problems has been conducted. Experimental results show that the proposed algorithm is efficient and highly competitive in comparison with several prominent algorithms for this problem. The presented methodology may be a fine approach for developing similar algorithms to address other routing variants.
KeywordsCapacitated vehicle routing problem Chemical reaction optimization Tabu search Metaheuristic
The authors are grateful to the anonymous reviewers and the editors for their comments which have helped to improve the manuscript. This study was funded by the National Natural Science Foundation of China (Grant Nos. 61133005, 61432005, 61370095, 61472124, 61202109, and 61472126) and the International Science & Technology Cooperation Program of China (Grant Nos. 2015DFA11240, 2014DFBS0010). T-L. Dam was also partially supported by science research fund of Hanoi University of Industry, Hanoi, Vietnam.
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
This article does not contain any studies with human participants or animals performed by any of the authors.
- Astudillo L, Melin P, Castillo O (2013) Nature inspired chemical optimization to design a type-2 fuzzy controller for a mobile robot. In: IFSA world congress and NAFIPS annual meeting (IFSA/NAFIPS), 2013 Joint, pp 1423–1428Google Scholar
- Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization, vol 1. Wiley, Chichester, pp 315–338Google Scholar
- de la O D, Castillo O, Meléndez A, Melin P, Astudillo L, Sánchez C, (2015) Optimization of reactive fuzzy controllers for mobile robots based on the chemical reactions algorithm. In: Melin P, Castillo O, Kacprzyk J (eds) Design of intelligent systems based on fuzzy logic, neural networks and nature-inspired optimization, studies in computational intelligence, vol 601. Springer, New York, pp 253–266Google Scholar
- Holland J (1975) Adaptations in natural and artificial systems. University of Michigan Press, ann arborGoogle Scholar
- Li K, Zhang Z, Xu Y, Gao B, He L (2012) Chemical reaction optimization for heterogeneous computing environments. In: ISPA ’12 proceedings of the 2012 IEEE 10th international symposium on parallel and distributed processing with applications. IEEE Computer Society, Washington, ISPA ’12, pp 17–23Google Scholar
- Pan B, Lam A, Li V (2011) Network coding optimization based on chemical reaction optimization. In: Global telecommunications conference (GLOBECOM 2011), 2011 IEEE, pp 1–5Google Scholar
- Sánchez C, Melin P, Astudillo L (2014) Chemical optimization method for modular neural networks applied in emotion classification. In: Castillo O, Melin P, Pedrycz W, Kacprzyk J (eds) Recent advances on hybrid approaches for designing intelligent systems, studies in computational intelligence, vol 547. Springer, New York, pp 381–390Google Scholar
- Sun J, Wang Y, Li J, Gao K (2011) Hybrid algorithm based on chemical reaction optimization and lin-kernighan local search for the traveling salesman problem. In: 2011 Seventh international conference on natural computation (ICNC), vol 3, pp 1518–1521Google Scholar