Abstract
This paper studies the relationship between three linear layout problems: minimum linear arrangement, cutwidth minimization, and bandwidth minimization. Our research suggests that, given their correlation, optimizing one problem could optimize the others. The Variable Neighborhood Search metaheuristic can take advantage of this, especially by switching problem formulations during the search process. The paper presents experiments analyzing different strategies and provides insights about their effectiveness. Our findings indicate that the proposed variant of Variable Neighborhood Search outperforms traditional single-process optimization methods in terms of both solution quality and computational efficiency.
This research has been supported by the Grant Refs.: PID2021-125709OA-C22/OB-C21 and PID2021-126605NB-I00, funded by MCIN/AEI/10.13039/501100011033 and by ERDF, a way of making Europe. CIAICO/2021/224, funded by Generalitat Valenciana. M2988 and MCA06, funded by Universidad Rey Juan Carlos.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Cavero, S., Pardo, E.G., Duarte, A.: Efficient iterated greedy for the two-dimensional bandwidth minimization problem. Eur. J. Oper. Res. 306(3), 1126–1139 (2023)
Díaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. (CSUR) 34(3), 313–356 (2002)
Lim, A., Lin, J., Rodrigues, B., Xiao, F.: Ant colony optimization with hill climbing for the bandwidth minimization problem. App. Soft Comp. 6(2), 180–188 (2006)
Pardo, E.G., Mladenović, N., Pantrigo, J.J., Duarte, A.: Variable formulation search for the cutwidth minimization problem. App. Soft Comp. 13(5), 2242–2252 (2013)
Petit, J.: Experiments on the minimum linear arrangement problem. J. Exp. Algorithmics (JEA) 8 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Cavero, S., Colmenar, J.M., Pardo, E.G. (2024). A Variable Formulation Search Approach for Three Graph Layout Problems. In: Sevaux, M., Olteanu, AL., Pardo, E.G., Sifaleras, A., Makboul, S. (eds) Metaheuristics. MIC 2024. Lecture Notes in Computer Science, vol 14753 . Springer, Cham. https://doi.org/10.1007/978-3-031-62912-9_38
Download citation
DOI: https://doi.org/10.1007/978-3-031-62912-9_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-62911-2
Online ISBN: 978-3-031-62912-9
eBook Packages: Computer ScienceComputer Science (R0)