Advertisement

4OR

, Volume 9, Issue 3, pp 321–324 | Cite as

Solving real-world vehicle routing problems in uncertain environments

  • Jorge E. Mendoza
PhD Thesis

Abstract

This is a summary of the Ph.D. thesis defended by the author in December 2009 at École des Mines de Nantes and Universidad de los Andes in Bogotá. The thesis was advised by Christelle Guéret and Andrés L. Medaglia and co-advised by Bruno Castanier and Nubia Velasco. The manuscript is written in English and it is available from the author upon request. The focus of the dissertation is to study real-world vehicle routing problems (VRPs) in uncertain environments. First, the thesis proposes a set of new methods for the VRP faced by a public utility and reports how these methods were embedded into a decision support system. Second, the thesis introduces a stochastic VRP widely found in practice but never studied in the literature before: the multi-compartment VRP with stochastic demands (MC-VRPSD). To solve the problem the dissertation proposes a set of solution methods that offer different tradeoffs between accuracy, speed, simplicity and flexibility. Lastly, the thesis proposes two multiobjective approaches to address the risk behavior of decision makers towards the cost spread in stochastic routing problems and applies them to the MC-VRPSD.

Keywords

Vehicle routing Stochastic demands Multi-compartment Heuristics Memetic algorithms Pilot method Multi-objective optimization 

MSC classification (2000)

90B06 90B90 90C15 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Deb K, Pratap A, Sameer A, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2): 182–197CrossRefGoogle Scholar
  2. Dror M, Trudeau P (1986) Stochastic vehicle routing with modified savings algorithm. Eur J Oper Res 23(2): 228–235CrossRefGoogle Scholar
  3. Mendoza JE, Castanier B, Guéret C, Medaglia AL, Velasco N (2008a) Approximating the expected cost of recourse on a multi-compartment vehicle routing problem with stochastic demands. Technical report 08/03/AUTO, École des Mines de NantesGoogle Scholar
  4. Mendoza JE, Castanier B, Guéret C, Medaglia AL, Velasco N (2008b) An instance generator for vehicle routing problems with stochastic demands. Technical report 08/1/AUTO, École des Mines de NantesGoogle Scholar
  5. Mendoza JE, Castanier B, Guéret C, Medaglia AL, Velasco N (2009a) A simulation-based MOEA for the multi-compartment vehicle routing problem with stochastic demands. In: Proceedings of the VIII metaheuristics international conference (MIC). Hamburg, GermanyGoogle Scholar
  6. Mendoza JE, Medaglia AL, Velasco N (2009b) An evolutionary-based decision support system for vehicle routing: the case of a public utility. Decis Support Syst 46(3): 730–742CrossRefGoogle Scholar
  7. Mendoza JE, Castanier B, Guéret C, Medaglia AL, Velasco N (2010a) A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Comput Oper Res 37(11): 1886–1898CrossRefGoogle Scholar
  8. Mendoza JE, Castanier B, Guéret C, Medaglia AL, Velasco N (2010b) Constructive heuristics for the multi-compartment vehicle routing problem with stochastic demands. Transp Sci (in press)Google Scholar
  9. Voß S, Fink A, Duin C (2005) Looking ahead with the pilot method. Ann Oper Res 136(1): 285–302CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  1. 1.Équipe Optimisation des Systèmes de Production et Logistiques, LISA (EA CNRS 4094)Université Catholique de l’OuestAngersFrance

Personalised recommendations