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.


    Access

    Download


    Export, share and cite



    Title :

    Sequencing traversing cars in a warehouse using ant-colony systems


    Contributors:
    Novoa, C.M. (author) / Büchter, H. (author)

    Publication date :

    2005



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Traversing machine rack and traversing machine

    WANG LU / LI LI / SHEN CHAOQUN et al. | European Patent Office | 2020

    Free access

    Surface traversing engine

    GIL EHUD / SPIRA YEHUDA / PARDO ELI | European Patent Office | 2025

    Free access

    CORDAGE TRAVERSING DEVICE

    BALL NATHAN / WALKER DANIEL / KAHAUNAELE GINO | European Patent Office | 2025

    Free access

    WALL-TRAVERSING VEHICLE

    ETO HARUHIKO | European Patent Office | 2024

    Free access