This paper expands the typical Vehicle Routing Problem, and synthetically considers the situation of customs with soft time windows and a depot with several distributing vehicle types. After constructing a mathematical model for the problem, the paper emphasizes the procedure of TS algorithm for solving this problem. Finally, combined with Adaptive Memory procedure, the paper presents the pseudo-code description of TS algorithm. Some computational results are reported too.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Study on Model and Algorithm of the Heterogeneous Fleet Vehicle Routing Problem with Soft Time Windows


    Beteiligte:
    Du, Wen (Autor:in) / Yuan, Qingda (Autor:in) / Zhou, Zailing (Autor:in)

    Kongress:

    International Conference on Traffic and Transportation Studies (ICTTS) 2002 ; 2002 ; Guilin, China



    Erscheinungsdatum :

    10.07.2002




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Study on Model and Algorithm of the Heterogeneous Fleet Vehicle Routing Problem with Soft Time Windows

    Du, W. / Yuan, Q. / Zhou, Z. et al. | British Library Conference Proceedings | 2002


    Optimasi Rute Pengiriman dengan Heterogeneous Fleet Vehicle Routing Problem with Time Windows

    Hendrawan, Edwin / Widyadana, I Gede Agus | BASE | 2018

    Freier Zugriff

    A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows

    Koç, Çaʇri / Bektaş, Tolga / Laporte, Gilbert et al. | BASE | 2015

    Freier Zugriff