Sequencing traversing cars in a warehouse using ant-colony systems

This paper presents an application of the ant-colony systems (ACS) algorithm for sequencing traversing-cars in a warehouse system. We extend the basic ant-colony optimization algorithm (ACO) for minimizing the time required to serve a set of incoming requests to the traversing-cars. We also develop a greedy algorithm. The comparison between ACS and the greedy algorithm indicates that the ACS algorithm is competitive and fast. In many warehouse management situations, the rule for sequencing requests for traversing cars in the FIFO rule. The results on this paper show that the ACS algorithm applies to warehouse traffic sequencing.