A genetic hillclimbing algorithm for the optimal linear arrangement problem

Fundamenta Informaticae

Volumn 68, Issue 4, 2005, Pages 333-356

  Poranen, Timo ^a  

^a Department of Computer Sciences ^*  (Finland)

Author keywords

Genetic algorithm; Hillclimbing; Optimal linear arrangement problem; Optimization

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; VLSI CIRCUITS;

HILLCLIMBING; OPTIMAL LINEAR ARRANGEMENT PROBLEM; VLSI CIRCUIT DESIGN;

GENETIC ALGORITHMS;

EID: 33645292924     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (36)

1. Aarts, E., Lenstra, J.: Local Search in Combinatorial Optimization, John Wiley and Sons, 1997.
2. Ahuja, R., Orlin, J., Tivari, A.: A greedy genetic algorithm for the quadratic assignment problem, Computers & Operations Research, 27(10), 2000, 917-934.
3. Arora, S., Frieze, A., Kaplan, H.: A new rounding procedure for the assignment problem with applications to dense graph arrangements, Proceedings of the 37th Annual Symposium of Foundations of Computer Science, 1996.
4. Bar-Yehuda, R., Even, G., Feldman, J., Naor, J.: Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems, Journal of Graph Algorithms and Applications, 5(4), 2001, 1-27.
5. Burkard, R., Çela, E., Pardalos, P., Pitsoulis, L.: The Quadratic Assignment Problem, in: Handbook of Combinatorial Optimization (P. Pardalos, D.-Z. Du, Eds.), Kluwer, 1998, 75-149.
6. Chung, F.: On optimal linear arrangements of trees, Computers & Mathematics with Applications., 10(1), 1984, 43-60.
7. Chung, F.: Labelings of graphs, in: Selected Topics in Graph Theory (L. Beineke, R. Wilson, Eds.), vol. 3, Academic Press, 1988, 151-168.
8. Easton, T., Horton, S., Parker, R.: A solvable case of the optimal linear arrangement problem on Halin graphs, Congressus Numerantium, 119, 1996, 3-17.
9. Eiben, A., Schoenauer, M.: Evolutionary computing, Information Processing Letters, 82(1), 2002, 1-6.
10. Even, G., Naor, J., Rao, S., Schieber, B.: Divide-and-conquer approximation algorithms via spreading metrics, Proceedings of the 36th Annual Symposium of Foundations of Computer Science, 1995.
11. Even S., Shiloach, Y.: NP-completeness of several arrangements problems, Technical report TR-43, The Technion, Haifa, 1978.
12. Fleurent, C., Ferland, J.: Genetic hybrids for the quadratic assignment problem, in: Quadratic Assignment and Related Problems (P. Pardalos, H. Wolkowicz, Eds.), AMS, 1994, 173-187.
13. Frederichson, G., Hambrusch, S.: Planar linear arrangements of outerplanar graphs, IEEE Transactions on Circuits and Systems, 35(3), 1988, 323-332.
14. Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-Completeness, W.H.Freeman, 1979.
15. Harper, L.: Optimal assignments of numbers to vertices, Journal of SIAM, 12(1), 1964, 131-135.
16. Hart, W., Krasnogor, N., Smith, J., Eds.: Recent Advances in Memetic Algorithms, vol. 166 of Studies in Fuzziness and Soft Computing, Springer, 2005.
17. Hendrickson, B., Leland, R.: The Chaco user's guide: version 2.0, Technical report SAND94-2692, Sandia National Laboratories, 1997.
18. Juvan, M., Mohar, B.: Optimal linear labelings and eigenvalues of graphs, Discrete Applied Mathematics, 36, 1992, 153-168.
19. Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing, Science, 220, 1983, 671-680.
20. Koren, Y., Harel, D.: Multi-Scale Algorithm for the Linear Arrangement Problem, Proceedings of the 28th International Workshop On Graph Theoretical Concepts In Computer Science, 2002.
21. van Laarhoven, P., Aarts, E.: Simulated Annealing: Theory and Applications, Kluwer, 1987.
22. Merz, P., Freisleben, B.: A Genetic Local Search Approach to the Quadratic Assignment Problem, Proceedings of the Seventh International Conference on Genetic Algorithms, 1997.
23. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E.: Equation of state calculation by fast computing machines, Journal of Chemical Physics, 21, 1953, 1087-1091.
24. Mitchell, M.: An Introduction to Genetic Algorithms, The MIT Press, 1996.
25. Mitchison, G., Durbin, R.: Optimal numberings of an n × n array, SIAM Journal on Algebraic and Discrete Methods, 7(4), 1986, 571-582.
26. Muradyan, D., Piliposjan, T.: Minimal numberings of vertices of a rectangular lattice, Akademiya Nauk Armenian SSR, 1(70), 1980, 21-27, (in Russian).
27. Petit, J.: Approximation heuristics and benchmarking for the MinLA problem, Technical Report LSI-97-41-R, Universitat Politècnica de Catalunya, Departament de Llenguatges i Sistemes Informàtics, 1997.
28. Petit, J.: Combining spectral sequencing and parallel simulated annealing for the MinLA problem, Technical report LSI-01-13-R, Universitat Politècnica de Catalunya, Departament de Llenguatges i Sistemes Informàtics, 2000.
29. Petit, J.: Layout Problems, Ph.D. Thesis, Universitat Politècnica de Catalunya, 2001.
30. Petit, J.: Experiments on the Minimum Arrangement Problem, ACM J. Experimental Algorithmics, 8(2.3), 2003, 1-33.
31. Poranen, T., Mäkinen, E., Nummenmaa, J.: How to draw a sequence diagram, Proceedings of the Eight Symposium of Programming Languages and Software Tools, 2003.
32. Reeves, C., Ed.: Modern Heuristic Techniques for Combinatorial Problems, McGraw-Hill, 1995.
33. Rumbaugh, J., Jacobson, I., Booch, G.: The Unified Modeling Language Reference Manual, Addison-Wesley, 1999.
34. Shahrokhi, F., Sýkora, O., Székely, L., Vrťo, I.: On bipartite drawings and the linear arrangement problem, SIAM Journal on Computing, 30(6), 2001, 1773-1789.
35. Shiloach, Y.: A minimum linear arrangement algorithm for undirected trees, SIAM Journal on Computing, 8(1), 1970, 15-32.
36. Yagiura, M., Ibaraki, T.: The use of dynamic programming in genetic algorithms for permutation problems, European Journal of Operational Reasearch, 92(2), 1996, 387-401.