An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem

Computers and Operations Research

Volumn 35, Issue 10, 2008, Pages 3331-3346

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

^a UNIVERSITÉ D'ANGERS   (France)

^b DEPARTAMENTO DE FÍSICA   (Mexico)

Author keywords

Evaluation function; Heuristics; Linear arrangement; Simulated annealing

Indexed keywords

BENCHMARKING; GRAPH THEORY; LINEAR SYSTEMS; PROBLEM SOLVING; SIMULATED ANNEALING;

EVALUATION FUNCTION; LINEAR ARRANGEMENT;

ALGORITHMS;

EID: 40249116812     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2007.03.001     Document Type: Article

References (36)

1. Harper L.H. Optimal assignment of numbers to vertices. SIAM Journal on Applied Mathematics 12 1 (1964) 131-135
2. Adolphson D., and Hu T.C. Optimal linear ordering. SIAM Journal on Applied Mathematics 25 3 (1973) 403-423
3. Diaz J., Petit J., and Serna M. A survey of graph layout problems. ACM Computing Surveys 34 3 (2002) 313-356
4. Lai Y.-L., and Williams K. A survey of solved problems and applications on bandwidth edgesum and profile of graphs. Graph Theory 31 (1999) 75-94
5. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), W.H. Freeman, New York
6. McAllister AJ. A new heuristic algorithm for the linear arrangement problem. Technical Report TR-99-126a, Faculty of Computer Science, University of New Brunswick; 1999.
7. Bar-Yehuda R., Even G., Feldman J., and 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
8. Koren Y, Harel D. A multi-scale algorithm for the linear arrangement problem. In: Lecture Notes in Computer Science, vol. 2573. 2006. p. 293-306.
9. Safro I., Ron D., and Brandt A. Graph minimum linear arrangement by multilevel weighted edge contractions. Journal of Algorithms 60 1 (2006) 24-41
10. Petit J. Experiments on the minimum linear arrangement problem. The ACM Journal of Experimental Algorithmics 2003;8.
11. Rodriguez-Tello E, Hao J-K, Torres-Jimenez J. Memetic algorithms for the MinLA problem. In: Lecture notes in computer science, vol. 3871. 2006. p. 73-84.
12. Petit J. Combining spectral sequencing and parallel simulated annealing for the MinLA problem. Parallel Processing Letters 13 1 (2003) 71-91
13. Juvan M., and Mohar B. Optimal linear labelings and eigenvalues of graphs. Discrete Applied Mathematics 36 2 (1992) 153-168
14. Rodriguez-Tello E, Hao J-K, Torres-Jimenez J. A refined evaluation function for the MinLA problem. In: Lecture notes in computer science, vol. 4293. 2006. p. 392-403.
15. Aarts E.H., and Laarhoven P.J.V. Statistical cooling: a general approach to combinatorial optimization problems. Philips Journal of Research 40 (1985) 193-226
16. Huang M., Romeo F., and Sangiovanni-Vincentelli A. An efficient general cooling schedule for simulated annealing. Proceedings of the IEEE international conference on computer aided design. Santa Clara, CA, USA (1986), IEEE Press, New York 381-384
17. Lam J, Delosme J-M. Performance of a new annealing schedule In: Proceedings of the 25th ACM/IEEE design automation conference. Atlantic City, NJ, USA. New York: IEEE Press; 1988. p. 306-11.
18. Greene J., and Supowit K.J. Simulated annealing without rejected moves. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 5 1 (1988) 221-228
19. Grover LK. A new simulated annealing algorithm for standard cell placement. In: Proceedings of the IEEE international conference on computer aided design. Santa Clara, CA, USA. New York: IEEE Press; 1986. p. 378-80.
20. Boese K.D., and Kahng A.B. Best-so-far vs. where-you-are: implications for optimal finite-time annealing. Systems and Control Letters 22 1 (1994) 71-78
21. Hajek B. Cooling schedules for optimal annealing. Mathematics of Operations Research 13 2 (1988) 311-329
22. Strenski P.N., and Kirkpatrick S. Analysis of finite length annealing schedules. Algorithmica 6 1 (1991) 346-366
23. Grover LK. Standard cell placement using simulated sintering. In: Proceedings of the 24th ACM/IEEE design automation conference. Miami Beach, FL, USA. New York: IEEE Press; 1987. p. 56-9.
24. Johnson D.S., Aragon C.R., McGeoch L.A., and Schevon C. Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning. Operations Research 37 6 (1989) 865-892
25. Rose J., Klebsch W., and Wolf J. Temperature measurement and equilibrium dynamics of simulated annealing placements. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 9 3 (1990) 253-259
26. Varanelli J.M., and Cohoon J.P. A fast method for generalized starting temperature determination in homogeneous two-stage simulated annealing systems. Computers and Operations Research 26 5 (1999) 481-503
27. Hogg R.V., and Craig A.T. Introduction to mathematical statistics (1970), Macmillan, New York
28. Falkenauer E. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics 2 (1996) 5-30
29. Charon I., and Hudry O. The noising method: a new method for combinatorial optimization. Operations Research Letters 14 3 (1993) 133-137
30. Gu J., and Huang X. Efficient local search with search space smoothing: a case study of the traveling salesman problem (TSP). IEEE Transactions on Systems, Man and Cybernetics 24 5 (1994) 728-735
31. Johnson D.S., Aragon C.R., McGeoch L.A., and Schevon C. Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning. Operations Research 39 3 (1991) 378-406
32. Aarts E.H., and Korst J.H. Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing (1989), Wiley, New York
33. Otten RHJM, Ginneken LPPP. Stop criterion in simulated annealing. In: Proceedings of the IEEE international conference on computer design: VLSI in computers and processors. Rye Brook, NY, USA. New York: IEEE Press; 1988. p. 549-52.
34. White SR. Concepts of scale in simulated annealing. In: Proceedings of the IEEE international conference on computer design. Port Chester, NY, USA. New York: IEEE Press; 1984. p. 646-51.
35. Poupaert E., and Deville Y. Simulated annealing with estimated temperature. AI Communications 13 1 (2000) 19-26
36. Kirkpatrick S., Gelatt C., and Vecchi M. Optimization by simulated annealing. Science 220 (1983) 671-680