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.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Sequencing traversing cars in a warehouse using ant-colony systems


    Beteiligte:
    Novoa, C.M. (Autor:in) / Büchter, H. (Autor:in)

    Erscheinungsdatum :

    2005



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Traversing machine rack and traversing machine

    WANG LU / LI LI / SHEN CHAOQUN et al. | Europäisches Patentamt | 2020

    Freier Zugriff

    Surface traversing engine

    GIL EHUD / SPIRA YEHUDA / PARDO ELI | Europäisches Patentamt | 2025

    Freier Zugriff

    CORDAGE TRAVERSING DEVICE

    BALL NATHAN / WALKER DANIEL / KAHAUNAELE GINO | Europäisches Patentamt | 2025

    Freier Zugriff

    WALL-TRAVERSING VEHICLE

    ETO HARUHIKO | Europäisches Patentamt | 2024

    Freier Zugriff