Vehicle routing optimization problem is one of the major research topics in logistics distribution field. Suitable vehicle routing selection is vital to reduce the logistics cost. The paper presents a hybrid optimization method to solve the vehicle routing problem with time windows. In the hybrid optimization method, discrete particle swarm optimization algorithm is used to assign the customers on routes and simulated annealing (SA) algorithm to avoid becoming trapped in local optimum. The simulation results have shown that the proposed method is feasible and effective for the vehicle routing problem with time windows.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Logistics Distribution Vehicle Routing Problem with Time Windows


    Contributors:

    Published in:

    Advanced Materials Research ; 468-471 ; 2047-2051


    Publication date :

    2012-02-27


    Size :

    5 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Reliable Vehicle Routing and Scheduling with Time Windows towards City Logistics

    Taniguchi, E. / Yamada, T. | British Library Conference Proceedings | 2003


    A vehicle routing problem with flexible time windows

    Taş, Duygu / Van Woensel, Tom / JABALI, OLA | BASE | 2014

    Free access

    Agents Toward Vehicle Routing Problem With Time Windows

    Kalina, Petr / Vokřínek, Jiří / Mařík, Vladimír | Taylor & Francis Verlag | 2015


    A vehicle routing problem with flexible time windows

    Tas, D. / Jabali, O. / Woensel, van, T. | BASE | 2013

    Free access

    Hydrogen Vehicle Routing Problem with Time Windows and Vehicle Capacity

    Abibou, Soukayna / El Bourakadi, Dounia / Yahyaouy, Ali et al. | IEEE | 2024