Title: An improved salp swarm algorithm for collaborative scheduling of discrete manufacturing logistics with multiple depots

Authors: Huajun Chen; Yanguang Cai

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

Abstract: Aiming at the situation of a single factory, multiple depots and multiple customers, considering storage, time windows and capacity constraints, a collaborative scheduling of discrete manufacturing logistics with multiple depots (CSDMLMD) model is established. This problem includes discrete manufacturing process, depot storage process and logistics transportation scheduling process. Based on the basic principle of salp swarm algorithm, an improved salp swarm algorithm (ISSA) is proposed to solve the CSDMLMD problem. It is compared with simulated annealing algorithm, genetic algorithm and particle swarm algorithm (PSO), and relatively good results can be obtained. The experimental results presented in this paper verify the feasibility of solving this problem.

Keywords: open shop scheduling; vehicle routing; discrete manufacturing; collaborative scheduling.

DOI: 10.1504/IJAACS.2025.144263

International Journal of Autonomous and Adaptive Communications Systems, 2025 Vol.18 No.1, pp.1 - 22

Received: 27 Jul 2022
Accepted: 13 Mar 2023
Published online: 04 Feb 2025 *

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