Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation

  • Jano I. van Hemert
  • J. A. La Poutré
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3242)


We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to maximise the number of loads transported, while keeping to capacity and time constraints. Loads arrive while the problem is being solved, which makes it a real-time routing problem. The solver is a self-adaptive evolutionary algorithm that ensures feasible solutions at all times. We investigate under what conditions the exploration of fruitful regions improves the effectiveness of the evolutionary algorithm.


Evolutionary Algorithm Candidate Solution Capacity Constraint Success Ratio Dynamic Vehicle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bertsimas, D., Simchi-Levi, D.: A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Operations Research 44, 286–304 (1996)MATHCrossRefGoogle Scholar
  2. 2.
    Savelsbergh, M., Sol, M.: The general pickup and delivery problem. Transportation Science 29, 17–29 (1995)MATHCrossRefGoogle Scholar
  3. 3.
    Psaraftis, H.: Dynamic vehicle routing: status and prospects. Annals of Operations Research 61, 143–164 (1995)MATHCrossRefGoogle Scholar
  4. 4.
    Ghiani, G., Guerriero, F., Laporte, G., Musmanno, R.: Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. Technical report, Center of Excellence for High Performance Computing, Univ. of Calabria, Italy (2003)Google Scholar
  5. 5.
    de Paepe, W.: Complexity Results and Competitive Analysis for Vehicle Routing Problems. PhD thesis, Research School for Operations Management and Logistics, Technical University of Eindhoven (2002)Google Scholar
  6. 6.
    Laporte, G., Louveaux, F.: Formulations and bounds for the stochastic capacitated vehicle routing problem with uncertain supplies, pp. 443–455. Elsevier Science Publishers B.V., Amsterdam (1990)Google Scholar
  7. 7.
    Laporte, G., Louveaux, F., Mercure, H.: The vehicle routing problem with stochastic travel times. Transportation Science 26, 161–170 (1992)MATHCrossRefGoogle Scholar
  8. 8.
    Bianchi, L.: Notes on dynamic vehicle routing — the state of the art. Technical report, IDSIA, Galleria 2, 6928 Manno-Lugano, Switzerland (2000)Google Scholar
  9. 9.
    Golden, B., Assad, A.: Vehicle Routing: methods and studies. Elsevier Science Publishers B.V., Amsterdam (1988)MATHGoogle Scholar
  10. 10.
    Psaraftis, H.: Dynamic vehicle routing problems. In: [9], ch. 11, pp. 223–248.Google Scholar
  11. 11.
    Powell, W.: A comparative review of alternative algorithms for the dynamic vehicle routing problem. In: [9], ch. 12, pp. 249–291.Google Scholar
  12. 12.
    Powell, W.: A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers. Transportation Science 30, 195–219 (1996)MATHCrossRefGoogle Scholar
  13. 13.
    Gendreau, M., Potvin, J.Y.: Dynamic vehicle routing and dispatching. In: Crainic, T., Laporte, G. (eds.) Fleet Management and Logistics, pp. 115–126. Kluwer, Boston (1998)Google Scholar
  14. 14.
    Solomon, M.: The vehicle routing and scheduling problems with time window constraints. Operations Research 35, 254–265 (1987)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Branke, J.: Evolutionary Optimization in Dynamic Environments. Genetic Algorithms and Evolutionary Computation, vol. 3. Kluwer Academic Publishers, Dordrecht (2001)Google Scholar
  16. 16.
    Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Science (to appear)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jano I. van Hemert
    • 1
  • J. A. La Poutré
    • 1
  1. 1.Dutch National Research Institute for Mathematics and Computer ScienceAmsterdamThe Netherlands

Personalised recommendations