This paper addresses the Vehicle Routing Problem with Time Windows (VRPTW) and shows that implementing algorithms for solving various instances of VRPs can significantly reduce transportation costs that occur during the delivery process. Two metaheuristic algorithms were developed for solving VRPTW: Simulated Annealing and Iterated Local Search. Both algorithms generate initial feasible solution using constructive heuristics and use operators and various strategies for an iterative improvement. The algorithms were tested on Solomon’s benchmark problems and real world vehicle routing problems with time windows. In total, 44 real world problems were optimized in the case study using described algorithms. Obtained results showed that the same distribution task can be accomplished with savings up to 40% in the total travelled distance and that manually constructed routes are very ineffective.


    Access

    Download


    Export, share and cite



    Title :

    Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms


    Contributors:
    Filip Taner (author) / Ante Galić (author) / Tonči Carić (author)


    Publication date :

    2012




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    Solving Vehicle Routing Problem with Time Windows by Genetic Algorithm

    Jiang, Dali / Zhang, Mingshan / Wang, Feng | ASCE | 2002


    High-Level Relay Hybrid Metaheuristic Method for Multi-Depot Vehicle Routing Problem with Time Windows

    Noori, S. / Ghannadpour, S. F. | British Library Online Contents | 2012


    Solving Vehicle Routing Problem with Time Windows by Genetic Algorithm

    Jiang, D. / Zhang, M. / Wang, F. et al. | British Library Conference Proceedings | 2002