An improved salp swarm algorithm for collaborative scheduling of discrete manufacturing logistics with multiple depots
by Huajun Chen; Yanguang Cai
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 18, No. 1, 2025

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.

Online publication date: Tue, 04-Feb-2025

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