A discrete salp swarm algorithm for the vehicle routing problem with time windows
by Huajun Chen; Yanguang Cai
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 16, No. 6, 2023

Abstract: The emphasis on this paper is about implementing an algorithm for the vehicle routing problem with time windows (VRPTW), which is a key class of vehicle routing problem. Due to its NP-hard feature, it is quite difficult to solve it within an acceptable calculation time. As a result, many metaheuristics have been developed to find suboptimal solutions to VRPTW. To settle the VRPTW, a discrete salp swarm algorithm (DSSA) is put forward. To prove the property of this algorithm in solving solutions, the algorithm is applied to the Solomon benchmark. Compared with existing methods, DSSA provides relatively better results in total distance.

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