Title: An improved salp swarm algorithm for collaborative scheduling of discrete manufacturing logistics 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: Considering the constraints of time windows and capacity in the case of a single factory and multiple customers, a collaborative scheduling of discrete manufacturing logistics with time windows (CSDMLTW) model is established. The problem includes the discrete manufacturing process and the logistics transportation scheduling process. In the discrete manufacturing process, parallel machine scheduling (PMS) is considered. Logistics transportation scheduling considers the vehicle routing problem with time windows (VRPTW). In this paper, an improved salp swarm algorithm (ISSA) is proposed to solve the CSDMLTW problem based on the basic principle of the salp swarm algorithm (SSA). Compared with the simulated annealing algorithm, genetic algorithm, and particle swarm optimisation algorithm, the results are relatively better. Experimental results verify the feasibility of solving this problem.

Keywords: parallel machine scheduling; vehicle routing; discrete manufacturing; collaborative scheduling.

DOI: 10.1504/IJAACS.2024.138207

International Journal of Autonomous and Adaptive Communications Systems, 2024 Vol.17 No.3, pp.215 - 232

Received: 27 Dec 2021
Accepted: 11 Apr 2022
Published online: 30 Apr 2024 *

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