This paper studies a set of rich vehicle routing problems incorporating various complexities found in real-life applications. The rich vehicle routing problem considers simultaneously four multiple constraints: multiple depots, multiple time windows, multiple trips, and multiple vehicle types. A metaheuristic algorithm called the general vehicle routing algorithm, based on the skewed variable neighborhood search, was designed to address the problem of any combination on five features. A slice of operators and heuristic approaches developed for the specific constraints is embedded in the general vehicle routing algorithm. Six combination vehicle routing problem types were investigated. The computational results demonstrated that the proposed algorithm is competitive for both benchmark instances and generated instances in accuracy of solution and computational time.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    General Metaheuristic Algorithm for a Set of Rich Vehicle Routing Problems


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:
    Qi, Mingyao (author) / Peng, Cheng (author) / Huang, Xiaoyu (author)


    Publication date :

    2016-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Drone Arc Routing Problems and Metaheuristic Solution Approach

    Islam Altin / Aydin Sipahioglu | DOAJ | 2024

    Free access

    Rich Vehicle Routing Problems and Applications

    Wen, Min | BASE | 2010

    Free access

    A Metaheuristic Approach to Emergency Vehicle Dispatch and Routing

    Giri, Aswin Raj / Chen, Tianjian / Rajendran, Vishnu Priya et al. | IEEE | 2022


    Performance analysis of a metaheuristic algorithm for the line-haul feeder vehicle routing problem

    Brandstätter, Christian / Reimann, Marc | Springer Verlag | 2018

    Free access