Comparative Study on Constructive Heuristics for the Vertex Separation Problem
The vertex separation problem (VSP) consists of finding a linear ordering of the vertices of an input graph that minimizes the maximum number of vertex separators at each cut-point induced by the ordering. VSP is an NP-hard problem whose efficient solution is relevant in fields such as very large scale integration design, computer language compiler design, graph drawing and bioinformatics. In the literature reviewed, we found several exact algorithms and two metaheuristics based on the variable neighborhood search approach. These metaheuristics are currently the best stochastic algorithms for solving VSP. One of the key points of their efficiency is the usage of heuristics to construct a high-quality initial solution that considerably improves the algorithm performance. In this chapter we augment the literature on VSP by proposing a new set of heuristics. The proposed constructive heuristics are compared with the best ones found in the state-of-the-art and with random solution generator (Rnd). Experimental results demonstrate the importance of constructive algorithms. The best constructive improves Rnd by 89.96 % in solution quality.
- 6.Gusted, J.: On the path width of chordal graphs. Discrete Appl. Math. 45(3), 233–248 (1993)Google Scholar
- 8.Leiserson, C.: Area-efficient graph layouts (for VLSI). In: Proceedings of IEEE Symposium on Foundations of Computer Science, pp. 270–281 (1980)Google Scholar
- 9.Bodlaender, H., Gustedt, J., Telle, J.: Linear time register allocation for a fixed number of registers. In: Proceedings of the Symposium on Discrete Algorithms (1998)Google Scholar
- 10.Kornai, A.: Narrowness, path-width, and their application in natural language processing. Discrete Appl. Math. 36, 87–92 (1997). (Elsevier Science Publishers B. V. (1992))Google Scholar
- 13.Sánchez-Oro, J., Pantrigo, J., Duarte, A.: Combining intensification and diversification strategies in VNS. An application to the Vertex separation problem. Comput. Oper. Res. 52(part B), 209–219 (2013)Google Scholar
- 14.VSPLIB 2012. Home page: http://www.optsicom.es/vsp/