A Modified Artificial Bee Colony Algorithm for Scheduling Optimization of Multi-aisle AS/RS System

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A modified artificial bee colony algorithm is proposed for solving the scheduling optimization problem of multi-aisle automatic storage/retrieval system. The optimization model of the problem is analyzed and founded, in which the sequence constraint of tasks and calculation of the number of aisles are more realistic. According to the features of the problem, the encoding and decoding strategies for solutions to MABC algorithm are redesigned. Probability selection-based updating method is also introduced to enhance the neighborhood search and preserve the good fragments. The experimental results show that MABC can obtain better results than PSO and GA algorithm, and is a competitive approach for AS/RS scheduling optimization.

Cite

CITATION STYLE

APA

Yan, X., Chan, F. T. S., Zhang, Z., Lv, C., & Li, S. (2020). A Modified Artificial Bee Colony Algorithm for Scheduling Optimization of Multi-aisle AS/RS System. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12145 LNCS, pp. 94–103). Springer. https://doi.org/10.1007/978-3-030-53956-6_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free