In this paper, a scheduling and routing based on AGVs processing and waiting times and the existing paths in a jobshop manufacturing system is proposed. A mathematical formulation is developed to schedule and route multiple AGVs handling jobs to shops so that the total delay of AGVs including the earliness and tardiness is minimized. A Lagrangian relaxation method is developed and a sub-gradient algorithm is composed to update the iterations in the searching process of method. The results show that the method is efficient in larger sizes problems while exact method cannot obtain the solutions in reasonable time. Two different problems are solved using two algorithms of Lagrangian relaxation and linear relaxation. Statistical comparisons showed much better performance of Lagrangian relaxation approach in a negligible run time. For larger sizes that exact method cannot be obtained even in long run times, Lagrangian relaxation approach is useful and efficient.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Lagrangian relaxation method for optimizing delay of multiple autonomous guided vehicles


    Beteiligte:

    Erschienen in:

    Transportation Letters ; 10 , 6 ; 354-360


    Erscheinungsdatum :

    2018-11-02


    Format / Umfang :

    7 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Optimizing management of autonomous vehicles

    BHAGAT AKSHAY | Europäisches Patentamt | 2023

    Freier Zugriff

    OPTIMIZING MANAGEMENT OF AUTONOMOUS VEHICLES

    BHAGAT AKSHAY | Europäisches Patentamt | 2022

    Freier Zugriff

    Optimizing performance of autonomous vehicles

    NAGARAJAN SATHYA NARAYANAN / AGARWAL GAURAV | Europäisches Patentamt | 2022

    Freier Zugriff


    Hybrid machine vision method for autonomous guided vehicles

    Lu, Jian / Hamajima, Kyoko / Ishihara, Koji | SPIE | 2003