Real-life vehicle routing problems encounter a number of complexities that are not considered by the classical models found in the vehicle routing literature. In this paper we consider a dynamic real-life vehicle routing problem which is a combined load acceptance and generalised vehicle routing problem incorporating a diversity of practical complexities. Among those are time window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs and capacity, multi-dimensional capacity constraints, order/vehicle compatibility constraints, orders with multiple pickup, delivery and service locations, different start and end locations for vehicles, route restrictions associated to orders and vehicles, and drivers’ working hours. We propose iterative improvement approaches based on Large Neighborhood Search. Our algorithms are characterised by very fast response times and thus, can be used within dynamic routing systems where input data can change at any time.


    Access

    Download


    Export, share and cite



    Title :

    Solving a Dynamic Real-Life Vehicle Routing Problem


    Contributors:
    Goel, Asvin (author) / Gruhn, Volker (author)

    Publication date :

    2006-01-01


    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629




    Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion

    Kim, Gitae / Ong, Yew Soon / Cheong, Taesu et al. | IEEE | 2016


    Multi-agent platform for solving the dynamic vehicle routing problem

    Barbucha, Dariusz / Jedrzejowicz, Piotr | IEEE | 2008


    Fixed Charge Flow Heuristics for Solving a Dynamic Vehicle Routing Problem

    Joernsten, K. O. / Statens vag- och trafikinstitut(VTI) | British Library Conference Proceedings | 1985


    Solving the Single Vehicle Routing Problem with Variable Capacity

    Louveaux, François V | Online Contents | 2016