Advertisement

OR Spectrum

, Volume 30, Issue 1, pp 149–165 | Cite as

Indirect search for the vehicle routing problem with pickup and delivery and time windows

  • Ulrich Derigs
  • Thomas Döhmer
Regular Article

Abstract

The vehicle routing problem with pickup and delivery and time windows (VRPPDTW) is one of the prominent members studied in the class of rich vehicle routing problems and it has become one of the challenges for developing heuristics which are accurate and fast at the same time. Indirect local search heuristics are ideally suited to flexibly handle complex constraints as those occurring in rich combinatorial optimization problems by separating the problem of securing feasibility of solutions from the objective-driven metaheuristic search process using simple encodings and appropriate decoders. In this paper we show that the approach of indirect local search with greedy decoding (GIST) is not only flexible and simple but when applied to the VRPPDTW it also gives results which are competitive with state-of-the-art VRPPDTW-methods by Li and Lim, as well as Pankratz.

Keywords

Local Search Travel Cost Vehicle Rout Problem Schedule Rule Partial Schedule 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Campbell A.M., Savelsbergh M. (2004) Efficient insertion heuristics for vehicle routing and scheduling problems. Transpor. Sci. 38(3):369–378CrossRefGoogle Scholar
  2. Derigs, U., Kabath, M., Zils, M.: Adaptive genetic algorithms: a methodology for dynamic autoconfiguration of genetic search algorithms. In: META-Heuristics: Advances and Trends in Local Search Paradigm for Optimization, pp. 281–286. Kluwer Dorohrecht (1999)Google Scholar
  3. Derigs, U., Heckmann, M., Ploch, R., Ziemek, O., Zils, M.: AGA-Konzept und AGAPE-Toolbox und deren Verwendung im Rahmen der prototypischen Entwicklung der DSS-Komponente eines Leitstandes zur Feinsteuerung. In: OR Proceedings pp. 281–286 (1999)Google Scholar
  4. Derigs, U., Döhmer, T.: ROUTER: A fast and flexible local sarch algorithm for a class of rich vehicle routing problems. In: Operations Research Proceedings, pp. 144–149 (2004)Google Scholar
  5. Derigs U., Jenal O. (2005) A GA-based decision support system for professional course scheduling at Ford Service Organisation. OR Spect. 27(1):147–162CrossRefGoogle Scholar
  6. Derigs, U., Döhmer, T., Jenal, O.: Indirect Search With Greedy Decoding Technique (GIST)—An Approach for Solving Rich Combinatorial Optimization Problems. MIC (2005)Google Scholar
  7. Dueck G., Scheuer T. (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J. Comput Phys 90, 161–175CrossRefGoogle Scholar
  8. Gottlieb J. (2000) Evolutionary Algorithms for Constrained Optimization Problems. Shaker Verlag, AachenGoogle Scholar
  9. Li H., Lim A. (2003) A metaheuristic for the pickup and delivery problem with time windows. Int. J. Artif. Intell Tools 12(2):173–186CrossRefGoogle Scholar
  10. Lourenco H.R., Paixao J.P., Portugal R. (2001) Multiobjective metaheuristics for the bus-driver scheduling problem. Transport. Sci. 35(3):331–343CrossRefGoogle Scholar
  11. Michalewicz Z. (1995) Heuristic Methods for Evolutionary Computation Techniques. J. Heurist. 1(1):177–206Google Scholar
  12. Pankratz G. (2005) A Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows. OR Spect. 27, 21–41CrossRefGoogle Scholar
  13. Savelsbergh M.W.P., Sol M. (1995) The general pickup and delivery problem. Transport. Sci. 29, 17–29CrossRefGoogle Scholar
  14. Solomon M.M. (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–264Google Scholar
  15. Toth P., Vigo D. (eds) (2002) The vehicle routing problem, SIAM Monographs on Discrete Mathematics and Applications vol. 9. SIAM, PhiladelphiaGoogle Scholar

Copyright information

© Springer-Verlag 2006

Authors and Affiliations

  1. 1.Department of Information Systems and Operations Research (WINFORS)University of CologneCologneGermany

Personalised recommendations