Memetic grey wolf optimiser algorithm for solving the cumulative CVRP
by Yanguang Cai; Gewen Huang; Yuanhang Qi; Helie Huang; Yunjian Xu
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 16, No. 6, 2023

Abstract: The cumulative capacitated vehicle routing problem (CCVRP) is a variation in the vehicle routing problem that aims to minimise the waiting time of all clients. This paper proposes a memetic grey wolf optimiser algorithm (MGWOA) to solve this problem. A bidirectional conversion strategy based on grouping and combining is proposed to realise the conversion between grey wolf positions and vehicle routing groups. The neighbourhood search optimisation strategy with roulette wheel selection and the continual optimisation strategy for optimal solutions based on routing reconstruction are proposed to optimise the routing group. The experimental results show that: the MGWOA proposed can effectively solve the CCVRP problems; the solving accuracy and stability of the proposed algorithm were verified by comparison with five other meta-heuristic algorithms; the bidirectional conversion strategy, the neighbourhood search optimisation strategy, and the continual optimisation strategy proposed improve the convergence speed and the convergence accuracy of the MGWOA.

Online publication date: Tue, 14-Nov-2023

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