Indirect search for the vehicle routing problem with pickup and delivery and time windows
- 265 Downloads
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.
KeywordsLocal Search Travel Cost Vehicle Rout Problem Schedule Rule Partial Schedule
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 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
- Gottlieb J. (2000) Evolutionary Algorithms for Constrained Optimization Problems. Shaker Verlag, AachenGoogle Scholar
- Michalewicz Z. (1995) Heuristic Methods for Evolutionary Computation Techniques. J. Heurist. 1(1):177–206Google Scholar
- Solomon M.M. (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–264Google Scholar
- Toth P., Vigo D. (eds) (2002) The vehicle routing problem, SIAM Monographs on Discrete Mathematics and Applications vol. 9. SIAM, PhiladelphiaGoogle Scholar