A hybrid bat algorithm to solve the capacitated vehicle routing problem
- 1 October 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 222-225
Abstract
The vehicle routing problem (VRP) is one of the important problems that has been examined extensively over the past decades. The problem holds a central position within the fields of transportation logistics and supply chain management. Due to the NP-hard nature of the problem, many researchers have developed several heuristics and metaheuristics to solve the problem. This research proposes a hybrid bat algorithm to solve the VRP. The algorithm employs the Bat algorithm hybridized with a modified kmeans algorithm. The proposed solution technique adopts the methodology of cluster first route second to decompose the original VRP into traveling sales man problems (TSPs) with reduced complexity. Benchmark test instances from the literature are used to prove the efficiency of the proposed hybrid algorithm.Keywords
This publication has 9 references indexed in Scilit:
- Chaotic discrete bat algorithm for capacitated vehicle routing problemInternational Journal of Autonomous and Adaptive Communications Systems, 2019
- Adapted Bat Algorithm for Capacitated Vehicle Routing ProblemInternational Review on Computers and Software (IRECOS), 2015
- A Hybrid Bat Algorithm with Path Relinking for Capacitated Vehicle Routing ProblemMathematical Problems in Engineering, 2013
- Bat algorithm: literature review and applicationsInternational Journal of Bio-Inspired Computation, 2013
- Integrating nature-inspired optimization algorithms to K-means clustering2012
- A New Metaheuristic Bat-Inspired Algorithm2010
- Models, relaxations and exact approaches for the capacitated vehicle routing problemDiscrete Applied Mathematics, 2002
- Complexity of vehicle routing and scheduling problemsNetworks, 1981
- The Truck Dispatching ProblemManagement Science, 1959