Memetic algorithms for the MinLA problem

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

Volumn 3871 LNCS, Issue , 2006, Pages 73-84

  Rodriguez Tello, Eduardo ^a   Hao, Jin Kao ^a   Torres Jimenez, Jose ^b  

^a UNIVERSITÉ D'ANGERS   (France)

^b UNIVERSIDAD AUTÓNOMA DE GUERRERO   (Mexico)

Author keywords

Heuristics; Linear Arrangement; Memetic Algorithms

Indexed keywords

ANNEALING; BENCHMARKING; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

HEURISTICS; LINEAR ARRANGEMENT; MEMETIC ALGORITHMS;

ALGORITHMS;

EID: 33745748881     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11740698_7     Document Type: Conference Paper

References (23)

1. T. Bäck, U. Hammel, and H. P. Schwefel. Evolutionary computation: Comments on the history and current state. IEEE Transactions on Evolutionary Computation, 1(1):3-17, 1997.
2. R. Bar-Yehuda, G. Even, J. Feldman, and S. Naor. Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems. Journal of Graph Algorithms and Applications, 5(4):1-27, 1996.
3. D. Corne, M. Dorigo, F. Glover, D. Dasgupta, P. Moscato, R. Poli, and K. V. Price, editors. New Ideas in Optimization (Part 4: Memetic Algorithms). McGraw-Hill, 1999.
4. L. Davis. Handbook of Genetic Algorithms. Van Nostrad, New York, 1991.
5. J. Diaz, J. Petit, and M. Serna. A survey of graph layout problems. ACM Comput. Surv., 34(3):313-356, 2002.
6. S. Even and Y. Shiloah. NP-completeness of several arrangement problems. Technical Report CS0043, Computer Science Department, Technion, Israel Institute of Technology, Haifa, Israel, January 1975.
7. B. Freisleben and P. Merz. A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. In Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, pages 616-621. IEEE Press, 1996.
8. P. Galinier and J. Hao. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 3(4):379-397, 1999.
9. M. Garey and D. Johnson. Computers and Intractability: A guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
10. J. J. Grefenstette. Incorporating problem specific knowledge into genetic algorithms. In L. Davis, editor, Genetic Algorithms and Simulated Annealing, pages 42-60, London, 1987. Morgan Kaufmann Publishers.
11. L. Harper. Optimal assignment of numbers to vertices. Journal of SIAM, 12(1):131-135, 1964.
12. W. E. Hart, N. Krasnogor, and J. E. Smith, editors. Recent Advances in Memetic Algorithms and Related Search Technologies. Springer-Verlag, 2004.
13. M. Juvan and B. Mohar. Optimal linear labelings and eigenvalues of graphs. Discrete Applied Mathematics, 36(2):153-168, 1992.
14. Y. Koren and D. Harel. A multi-scale algorithm for the linear arrangement problem. In L. Kucera, editor, Proceedings of 28th Inter. Workshop on Graph-Theoretic Concepts in Computer Science (WG'02), volume 2573 of LNCS, pages 293-306. Springer Verlag, 2002.
15. A. J. McAllister. A new heuristic algorithm for the linear arrangement problem. Technical Report TR-99-126a, Faculty of Computer Science, University of New Brunswick, 1999.
16. P. Merz and B. Freisieben. Fitness landscapes, memetic algorithms and greedy operators for graph bi-partitioning. Evolutionary Computation, 8(1):61-91, 2000.
17. J. Petit. Approximation heuristics and benchmarkings for the MinLA problem. In Alex '98 - Building Bridges Between Theory and Applications, pages 112-128, 1998.
18. J. Petit. Layout Problems. PhD thesis, Universitat Politécnica de Catalunya, 2001.
19. J. Petit. Combining spectral sequencing and parallel simulated annealing for the MinLA problem. Parallel Processing Letters, 13(1):71-91, 2003.
20. T. Poranen. A genetic hillclimbing algorithm for the optimal linear arrangement problem. Technical report, University of Tampere, Finland, June 2002.
21. I. Safro, D. Ron, and A. Brandt. Graph minimum linear arrangement by multilevel weighted edge contractions. Journal of Algorithms, 2004. in press.
22. M. Tomassini. A survey of genetic algorithms. Annual Reviews of Computational Physics, 111:87-118, 1995.
23. X. Yao, F. Wang, K. Padmanabhan, and S. Salcedo-Sanz. Hybrid evolutionary approaches to terminal assignment in communications networks. In W. E. Hart, N. Krasnogor, and J. E. Smith, editors, Recent Advances in Memetic Algorithms and Related Search Technologies, pages 129-160. Springer-Verlag, 2004.