Abstract This paper describes an exact solution approach for the Vehicle Routing and scheduling Problem with Soft Time Windows (VRPSTW), and presents its application on a realistic logistics instance based on the VICS (Vehicle Information and Communication System) data, an ITS application in Japan. Exact solutions of VRPSTW have been compared with those of the Vehicle Routing and scheduling with Hard Time Windows (VRPHTW). Detailed analysis of environmental issues and idling time along with the traditional comparison of cost and number of vehicles, shows that the exact VRPSTW solutions are not only cost efficient but helpful in reducing congestion, which implies these are more environmentally sustainable.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An Analysis of Exact VRPTW Solutions on ITS Data-based Logistics Instances


    Beteiligte:


    Erscheinungsdatum :

    2011-09-27


    Format / Umfang :

    13 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Low cost parallel solutions for the VRPTW optimization problem

    Arbelaitz, O. / Rodriguez, C. / Zamakola, I. | Tema Archiv | 2001


    Search Algorithm for the Constraint Satisfaction Problem of VRPTW

    Cruz-Chavez, Marco Antonio / Diaz-Parral, Ocotlan / Hernandez, J.A. et al. | IEEE | 2007



    Flower Pollination Algorithm for Vehicle Routing Problem with Time Windows (VRPTW)

    Pratiwi, Asri Bekti / Rakhmawati, Ismi Yayuk / Winarko, Edi | BASE | 2021

    Freier Zugriff