Designing a hybrid genetic algorithm for the linear ordering problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2723, Issue , 2003, Pages 1053-1064

  Huang, Gaofeng ^a   Lim, Andrew ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Genetic Algorithm; Hybridization; Linear Ordering Problem

Indexed keywords

ALGORITHMS; CALCULATIONS; COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; SET THEORY;

HYBRID GENETIC ALGORITHMS; HYBRIDIZATION; LINEAR ORDERING PROBLEMS; LOCAL SEARCH;

EVOLUTIONARY ALGORITHMS;

EID: 21144444779     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45105-6_115     Document Type: Article

References (14)

1. M. Laguna, R. Martí and V. Campos: Intensification and diversification with elite tabu search solutions for the linear ordering problem, Computer and Operation Research, vol.26, pp. 1217-1230, (1999)
2. V. Campos, M. Laguna and R. Martí: Scatter Search for the Linear Ordering Problem, New Ideas in Optimization, D. Corne, M. Dorigo and F. Glover (Eds.), McGraw-Hill, pp. 331-339 (1999)
3. Carlos García González and Dionisio Pérez-Brito: A Variable Neighborhood Search for Solving the Linear Ordering Problem, In the Proceedings of MIC'2001 - 4th Metaheuristics International Conference, pp. 181-185, Porto, Portugal, (2001)
4. Alexandre Belloni and Abilio Lucena: Lagrangian Based Heuristics for the Linear Ordering Problem, In the Proceedings of MIC'2001 - 4th Metaheuristics International Conference, pp. 445-449, Porto, Portugal, (2001)
5. S. Chanas and P. Kobylanski: A New Heuristic Algorithm Solving the Linear Ordring Problem, Computational Optimization and Applications, vol.6, pp. 191-205, (1996)
6. M. Grotschel, M. Junger and G. Reinelt: A Cutting Plane Algorithm for the Linear Ordering Problem, Operations Research, vol.32, no.6, pp. 1995-1220, (1984)
7. M. Groetschel, M. Juenger and G. Reinelt: Optimal Triangulation of Large Real World Input-Output Matrices, Statistische Hefte 25, 261-295, (1984)
8. J. E. Mitchell and B. Borchers: Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm, High Performance Optimization, Kluwer Academic Publishers, Dordrecht, The Netherlands, H. Frenk et al. (Eds.), pp. 349-366, (2000)
9. R.M. Karp: Reducibility among combinatorial problems, In R.E. Miller and J.W. Thatcher (Eds.), Complexcity of Computer Computations, pp. 85-103, New York, (1972)
10. D. Goldberg and R. Lingle: Alleles, loci, and the traveling salesman problem, in the Proceedings of the 1st International Conference on Genetic ALgorithms and Their Applications, pp. 154-159, Lawrence Erlbaum, Hillsdale, New Jersey, (1985).
11. D. Goldberg: Genetic Algorithms in Search, Optimization and Machine Learing, Addison-Wesley, Reading, MA, (1989)
12. I. Oliver, D. Smith, and J. Holland: A study of permutation crossover operators on the tsp, in the Proceedings of the 2nd International Conference on Genetic ALgorithms and Their Applications, pp. 224-230, Hillsdale, New Jersey, (1987).
13. G. Syswerda: Schedule Optimization Using Genetic Algorithms, in L. Davis (Ed.) Handbook of Genetic ALgorithms, pp. 332-349, New York, (1991)
14. Z. Michalewicz: Genetic Algorithms + Data Structure = Evolution Programs, Springer-Verlag, Berlin Heidelberg, (1992)