Chaotic discrete bat algorithm for capacitated vehicle routing problem
by Yanguang Cai; Yuanhang Qi; Hao Cai; Helie Huang; Houren Chen
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 12, No. 2, 2019

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.

Online publication date: Thu, 28-Mar-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com