The number of online market places for freight matching is on the rise. Online market places help small trucking companies find shipping customers. However, they do not provide cargo consolidation strategies. This lack of effective consolidation has adverse effects on the shipping industry and greenhouse gas emission. To that extent, this article addresses Multiple Vehicle Pickup and Delivery Problem with Time Windows (MVPDPTW). We propose a Mixed Integer Programming (MIP) model and a branch-and-cut algorithm geared towards identifying effective freight consolidation opportunities. For emission studies, we used a cost conversion technique from the literature to convert emission levels into monetary values. On real-world logistics company test instances, our model identified routes with lower cost and lower emission levels than the actual routes.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Freight Consolidation Problem with Time Windows, Pickup and Delivery Sequence


    Beteiligte:
    Krishnan Devaraj R. (Autor:in) / Liu Tieming (Autor:in)


    Erscheinungsdatum :

    2019




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    Genetic Algorithm for a Pickup and Delivery Problem with Time Windows

    Jung, Soojung / Haghani, Ali | Transportation Research Record | 2000



    Waiting strategies for the dynamic pickup and delivery problem with time windows

    Mitrović-Minić, Snežana / Laporte, Gilbert | Elsevier | 2003


    The Delivery Dispatching Problem with Time Windows for Urban Consolidation Centers

    van Heeswijk, W. J. A. / Mes, M. R. K. / Schutten, J. M. J. | British Library Online Contents | 2019