Genetic local search with distance preserving recombination operator for a vehicle routing problem

European Journal of Operational Research

Volumn 151, Issue 2, 2003, Pages 352-364

  Jaszkiewicz, Andrzej ^a   Kominek, Paweł ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Combinatorial optimization; Local search; Population based metaheuristics; Vehicle routing problem

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING;

VEHICLE ROUTING PROBLEM;

OPERATIONS RESEARCH;

EID: 0042443457     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00830-5     Document Type: Conference Paper

References (21)

1. Ackley D.H. A Connectionist Machine for Genetic Hillclimbing. 1987;Kluwer Academic Press, Boston.
2. Boese K., Kahng A., Muddu S. A new adaptive multistart technique for combinatorial global optimization. Operations Research Letters. 16:1994;101-113.
3. Freisleben, B., Merz, P., 1996. A genetic local search algorithm for travelling salesman problem. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (Eds.), Proceedings of the 4th Conference on Parallel Problem Solving fram Nature-PPSN IV, pp. 890-900.
4. Galinier, P., Hao, J.-K., 1999. Hybrid evolutionary algorithms for graph coloring. Technical Report, Parc Scientifique Georges Besse, Nimes.
5. Glover F. Heuristic for integer programming using surrogate constraints. Decision Science. 8:1977;156-166.
6. Glover F. Scatter search and star-paths: Beyond the genetic metaphor. OR Spektrum. 17:1995;125-137.
7. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning. 1988;Addison-Wesley, Reading, MA.
8. Gorges-Schleuter, M., 1997. On the power of evolutionary optimization at the example of ATSP and large TSP Problems. In: European Conference on Artificial Life '97, Brighton, UK.
9. Jaszkiewicz, A., 1998. Genetic local search for multiple objective combinatorial optimization. Research report, Institute of Computing Science, Poznań University of Technology, RA-014/98, pp. 23.
10. Jones, T., Forrest, S., 1995. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. Santa Fe Institute Working Paper 95-02-022.
11. Lawler E.L., Lenstra J.K., Kan A.H.G., Shmoys D.B. The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. 1985;Wiley and Sons, New York.
12. Lin S., Kernighan B. An effective heuristic algorithm for the travelling salesman problem. Operations Research. 21:1973;498-516.
13. Michalewicz Z. Genetic. Algorithms+Data Structures=Evolution Programs:1992;Springer-Verlag, Berlin, Heidelberg.
14. Merz P., Freisleben B. Genetic local search for the TSP New results. Proceedings of the 1997 IEEE International Conference on Evolutionary Computation. 1997;159-164 IEEE Press, New York.
15. Merz P., Freisleben B. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation. 4(4):2000;337-352.
16. Mühlenbein H. Evolution in time and space - the parallel genetic algorithm. Rawlins G.J.E. Foundations of Genetic Algorithms. 1991;Morgan Kaufmann Publishers, Los Altos, CA.
17. Potvin J.Y., Bengio S. The vehicle routing problem with time windows - part II: Genetic search. INFORMS Journal of Computing. 8(2):1996;165-172.
18. Radcliffe N.J., Surry P.D. Formal memetic algorithms. Fogarty T. Evolutionary Computing: AISB Workshop. 1994;Springer-Verlag.
19. Sevaux M., Dauzère-Pérès S. Genetic algorithms to minimize the weighted number of late jobs on a single machine. European Journal of Operational Research. 151(2):2003;296-306.
20. Taillard É.D. Comparison of iterative searches for the quadratic assignment problem. Location Science. 3:1995;87-105.
21. Wolpert D.H., Macready W.G. No Free Lunch theorem for optimization. IEEE Transactions on Evolutionary Computation. 1(1):1997;67-82.