Scatter search for the cutwidth minimization problem
- First Online:
- 330 Downloads
The cutwidth minimization problem consists of finding a linear layout of a graph so that the maximum linear cut of edges is minimized. This NP-hard problem has applications in network scheduling, automatic graph drawing and information retrieval. We propose a heuristic method based on the Scatter Search (SS) methodology for finding approximate solutions to this optimization problem. This metaheuristic explores solution space by evolving a set of reference points. Our SS method is based on a GRASP constructive algorithm, a local search strategy based on insertion moves and voting-based combination methods. We also introduce a new measure to control the diversity in the search process. Empirical results with 252 previously reported instances indicate that the proposed procedure compares favorably to previous metaheuristics for this problem, such as Simulated Annealing and Evolutionary Path Relinking.
KeywordsCutwidth Metaheuristics Scatter search
Unable to display preview. Download preview PDF.
- Andrade, D. V., & Resende, M. G. C. (2007a). GRASP with path-relinking for network migration scheduling. In Proceedings of international network optimization conference. Google Scholar
- Andrade, D. V., & Resende, M. G. C. (2007b). GRASP with evolutionary path-relinking. In Proceedings of seventh metaheuristics international conference (MIC). Google Scholar
- Botafogo, R. A. (1993). Cluster analysis for hypertext systems. In 16th annual international ACM-SIGIR conference on research and development in information retrieval (pp. 116–125). Google Scholar
- Cohoon, J., & Sahni, S. (1987). Heuristics for the board permutation problem. Journal of VLSI and Computer Systems, 2, 37–61. Google Scholar
- Gavril, F. (1977). Some NP-complete problems on graphs. In Proceedings of the 11th conference on information sciences and systems (pp. 91–95). Google Scholar
- Resende, M. G. C., & Andrade, D. V. (2009). Method and system for network migration scheduling. United States Patent Application Publication US2009/0168665. Google Scholar
- Resende, M. G. C., & Ribeiro, C. C. (2003). Greedy randomized adaptive search procedures. In F. Glover & G. Kochenberger (Eds.), Handbook of metaheuristics (pp. 219–250). Norwell: Kluwer Academic. Google Scholar
- Rolim, J., Sýkora, O., & Vrt’o, I. (1995). Cutwidth of the de Bruijn graph. RAIRO. Informatique Théorique et Applications, 29(6), 509–514. Google Scholar