This paper proposes a heuristic decomposition approach for scheduling truck trips with the goal of satisfying the demand of a container single carrier while minimizing its costs. The approach foresees three phases: a pre-processing step, in which the demand is decomposed in two parts and a set of rules for combining trips are defined, and two optimization phases. The first mixed linear integer optimization model allows to combine trips two by two in order to decrease the number of empty or partially empty trips, while the second optimization problem enables assigning trucks to trips with the goal of minimizing travel costs. The efficiency of the proposed methodology is analyzed using a real simple case over a local network and the results are presented.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A decomposition approach for optimizing truck trips for a single carrier


    Beteiligte:


    Erscheinungsdatum :

    01.10.2013


    Format / Umfang :

    203771 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Optimizing multiple truck trips in a cooperative environment

    Caballini, Claudia / Rebecchi, Ilaria / Sacone, Simona | IEEE | 2016


    Empty truck trips problem at container terminals

    Islam, Samsul | Emerald Group Publishing | 2017


    Reducing Port-Related Truck Emissions: Coordinated Truck Appointments to Reduce Empty Truck Trips

    Schulte, Frederik / González, Rosa G. / Voß, Stefan | British Library Conference Proceedings | 2015


    Development of Algorithms to Convert Large Streams of Truck GPS Data into Truck Trips

    Thakur, Aayush / Pinjari, Abdul Rawoof / Zanjani, Akbar Bakhshi et al. | Transportation Research Record | 2015