Assigning and scheduling vehicle routes in a stochastic time dependent environment is a crucial management problem. The assumption that in a real-life environment everything goes according to an a priori determined static schedule is unrealistic, resulting in a planning gap (i.e. difference in performance between planned route and actual route). Our methodology introduces the traffic congestion component based on queueing theory, thereby introducing an analytical expression for the expected travel. In real life travel times are subject to uncertainty, we solve a time dependent vehicle routing problem to find robust solutions, that can potentially absorb such uncertainties. We model uncertainty as perturbations that are randomly inserted on the routes, we optimize the perturbed solutions via Tabu Search. We conduct experiments on a set of 32 cities, and found that the perturbed solutions generally cope better with the uncertainty than the non-perturbed solutions, with a small increase in expected travel times.


    Access

    Download


    Export, share and cite



    Title :

    Stochastic vehicle routing with random time dependent travel times subject to perturbations



    Publication date :

    2007-01-01


    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629



    Stochastic Vehicle Routing with Random Travel Times

    Kenyon, A. S. / Morton, D. P. | British Library Online Contents | 2003


    Stochastic Vehicle Routing with Random Travel Times

    Kenyon, Astrid S. | Online Contents | 2003



    A vehicle routing problem with stochastic travel times

    Woensel, T. van / Kerbache, L. / Peremans, H. et al. | Tema Archive | 2003


    Dynamic Vehicle Routing Problem with Real-time Time-dependent Travel Times

    Zhao, X. / Concalves, G. / Dupas, R. | British Library Conference Proceedings | 2009