Hybridizing Genetic Algorithms with Branch and Bound Techniques for the Resolution of the TSP
In this paper some mixed techniques are outlined in order to combine the advantages of two very different methods for the resolution of combinatorial optimization problems (Genetic Algorithms and Branch and Bound Techniques), simultaneously avoiding their drawbacks. Due to the disparity between the basic techniques it is not suitable that they work at the same level so two models have been developed in which each technique assumes the role of being a tool of the other one. Parallelism is an important issue in these techniques.
KeywordsGenetic Algorithm Execution Time Combinatorial Optimization Problem Parallel Execution Hybrid Genetic Algorithm
Unable to display preview. Download preview PDF.
- 2.Davis L., “Handbook of genetic algorithms”, VNR Computer Library, 1991Google Scholar
- 3.Volgenant T., Jonker R. “A branch and bound algorithm for the symmetric travelling salesman problem based on the 1-tree relaxation.”, Univ. of Amsterdam, 1981Google Scholar
- 5.Nebro Urbaneja A.J. “Implementation and Evaluation of Parallel Schemes for Branch and Bound Techniques” MCS Tesis, Univ. of Málaga, 1991Google Scholar
- 6.Alba Torres E., Aldana Montes J.F. “Genetic Algorithms as Heuristic in Optimization Problems. An Overview” (in spanish), Technical Report, Dept. of Lenguajes y Ciencias de la Computación (Univ. of Málaga ), 1992Google Scholar
- 7.Suárez del Rey V. “Parallel Genetic. Algorithms for Combinatorial Problems over Shared-Memory Mutiprocessor Systems” (in spanish), MCS Tesis, Univ. of Málaga, 1994Google Scholar