An improved salp swarm algorithm for collaborative scheduling of discrete manufacturing logistics with time windows Online publication date: Tue, 30-Apr-2024
by Huajun Chen; Yanguang Cai
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 17, No. 3, 2024
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook