Title: A discrete salp swarm algorithm for the vehicle routing problem with time windows

Authors: Huajun Chen; Yanguang Cai

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

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.

Keywords: DSSA; discrete salp swarm algorithm; VRPTW; vehicle routing problem with time windows; local search; optimal solution; random exchange.

DOI: 10.1504/IJAACS.2023.134843

International Journal of Autonomous and Adaptive Communications Systems, 2023 Vol.16 No.6, pp.552 - 563

Received: 01 Jun 2021
Accepted: 10 Oct 2021
Published online: 14 Nov 2023 *

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