AbstractContainer movement by trucks with time constraints at origins and destinations is modeled as an asymmetric “multi-Traveling Salesmen Problem with Time Windows” (m-TSPTW) with social constraints. A two-phase exact algorithm based on dynamic programming (DP) is proposed that finds the best routes for a fleet of trucks. Since the m-TSPTW problem is NP-hard, the computational time for optimally solving large size problems becomes prohibitive. For large size problems, we develop a hybrid methodology consisting of DP in conjunction with genetic algorithms. The developed algorithms are compared with an insertion heuristic method. Computational results demonstrate the efficiency of the developed algorithms.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Container movement by trucks in metropolitan networks: modeling and optimization


    Beteiligte:


    Erscheinungsdatum :

    2004-03-19


    Format / Umfang :

    25 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch






    Modeling and Route Guidance of Trucks in Metropolitan Areas

    P. Ioannou / A. Chassiakos | NTIS | 2000


    Longer Trucks for Climate-Friendly Transports in Metropolitan Regions

    Lindt, Christoph / Janka, Maren-Linn / Dehdari, Payam | Springer Verlag | 2020


    Integration and Optimization of Quay Cranes and Trucks at Container Terminal

    Zhao, Q.Y. / Cao, J.X. / Gao, Z.J. | British Library Conference Proceedings | 2014