Title: Chaotic discrete bat algorithm for capacitated vehicle routing problem

Authors: Yanguang Cai; Yuanhang Qi; Hao Cai; Helie Huang; Houren Chen

Addresses: School of Automation, Guangdong University of Technology, Guangzhou, Guangdong 510006, China ' School of Automation, Guangdong University of Technology, Guangzhou, Guangdong 510006, China ' School of Automation, Guangdong University of Technology, Guangzhou, Guangdong 510006, China ' School of Automation, Guangdong University of Technology, Guangzhou, Guangdong 510006, China ' School of Automation, Guangdong University of Technology, Guangzhou, Guangdong 510006, China

Abstract: This paper presents a chaotic discrete bat algorithm for addressing the capacitated vehicle routing problem. The proposed algorithm presents new parameters and operations for the bat algorithm, and uses a penalty function method to address the constraint conditions. The proposed algorithm also introduces a chaotic initialisation for bat populations, and adopts a local search strategy which is combined with a two-opt strategy, insert strategy and exchange strategy to expand the local search space. Experimental results show that: the proposed algorithm is better than alternative algorithms in terms of optimisation capability, robustness and time consumption, and there are significant differences between the proposed algorithm and alternative algorithms.

Keywords: discrete bat algorithm; chaotic optimisation algorithm; capacitated vehicle routing problem; CVRP; vehicle routing problem.

DOI: 10.1504/IJAACS.2019.098589

International Journal of Autonomous and Adaptive Communications Systems, 2019 Vol.12 No.2, pp.91 - 108

Received: 28 Aug 2017
Accepted: 19 Feb 2018
Published online: 28 Mar 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article