AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (1.9 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

A Multi-Objective Discrete Artificial Bee Colony Scheduling Algorithm with Referential Search Strategy

School of Automotive and Traffic Engineering, Jiangsu University of Technology, Changzhou 213001, China
School of Computer Science, Liaocheng University, Liaocheng 252000, China
Department of Mechanical Engineering, University of Tehran, Tehran 999067, Iran
School of Aviation and Transportation, Jiangsu College of Engineering and Technology, Nantong 226006, China
Show Author Information

Abstract

With the popularization of industrial intelligence, Automated Guided Vehicles (AGVs) have gradually become an efficient means of transportation in manufacturing workshops. Previous studies on this issue mainly considered the transportation cost of AGVs, while ignoring the optimization of customer satisfaction. This paper studies the AGV scheduling problem with time and capacity constraints for material handling in an intelligent manufacturing workshop. To better reflect real production conditions and simultaneously minimize AGV carbon emissions while maximizing customer satisfaction, a Mixed-Integer Linear Programming (MILP) model is developed. A Multi-objective Discrete Artificial Bee Colony algorithm (MDABC) is proposed, which employs an adaptive selection strategy to ensure that different neighborhoods of solutions are fully explored. The reference search strategy is introduced to carry out in-depth search according to the effective information carried by high quality solutions. In addition, in order to avoid the algorithm falling into local optimality, a high-quality generation strategy is proposed. Comprehensive comparisons with state-of-the-art algorithms and statistical analyses demonstrate that the proposed MDABC achieves superior performance.

References

【1】
【1】
 
 
Tsinghua Science and Technology
Pages 259-273

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Fan X, Sang H, Zhang X, et al. A Multi-Objective Discrete Artificial Bee Colony Scheduling Algorithm with Referential Search Strategy. Tsinghua Science and Technology, 2026, 31(1): 259-273. https://doi.org/10.26599/TST.2024.9010174
Part of a topical collection:

1834

Views

132

Downloads

0

Crossref

0

Web of Science

0

Scopus

0

CSCD

Received: 31 July 2024
Revised: 26 August 2024
Accepted: 13 September 2024
Published: 25 August 2025
© The author(s) 2026.

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).