A discrete bat algorithm for collaborative scheduling of discrete manufacturing logistics
by Huajun Chen; Yanguang Cai
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 17, No. 2, 2024

Abstract: In this paper, a collaborative scheduling of discrete manufacturing logistics (CSDML) model is established for a single factory with multiple customers, considering multi-vehicle, delay, time window and capacity constraints. Based on the basic principle of bat algorithm, discrete bat algorithm (DBA) is proposed to solve the CSDML problem. A coding and decoding scheme is proposed to map the continuous domain to the discrete domain, the objective function is defined, and a local search strategy is adopted to enhance the search effect of the algorithm. Compared with DBA with random search and DBA without search, the proposed algorithm can get better experimental results.

Online publication date: Fri, 01-Mar-2024

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