Chaotic discrete bat algorithm for capacitated vehicle routing problem

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.