Skip to main content
SpringerLink
Log in

A general variable neighborhood search for the cyclic antibandwidth problem

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

Graph Layout Problems refer to a family of optimization problems where the aim is to assign the vertices of an input graph to the vertices of a structured host graph, optimizing a certain objective function. In this paper, we tackle one of these problems, named Cyclic Antibandwidth Problem, where the objective is to maximize the minimum distance of all adjacent vertices, computed in a cycle host graph. Specifically, we propose a General Variable Neighborhood Search which combines an efficient Variable Neighborhood Descent with a novel destruction–reconstruction shaking procedure. Additionally, our proposal takes advantage of two new exploration strategies for this problem: a criterion for breaking the tie of solutions with the same objective function and an efficient evaluation of neighboring solutions. Furthermore, two new neighborhood reduction strategies are proposed. We conduct a thorough computational experience by comparing the algorithm proposed with the current state-of-the-art methods over a set of previously reported instances. The associated results show the merit of the introduced algorithm, emerging as the best performance method in those instances where the optima are unknown. These results are further confirmed with nonparametric statistical tests.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Data availability

The data that support the findings of this study are available from the corresponding author upon request.

Notes

  1. Minimization of a maximum value or maximization of a minimum value.

References

  1. Ahuja, R.K., Ergun, O., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discret. Appl. Math. 123(1), 75–102 (2002)

    Article  MathSciNet  Google Scholar 

  2. Alway, G., Martin, D.: An algorithm for reducing the bandwidth of a matrix of symmetrical configuration. Comput. J. 8(3), 264–272 (1965)

    Article  Google Scholar 

  3. Bansal, R., Srivastava, K.: A memetic algorithm for the cyclic antibandwidth maximization problem. Soft. Comput. 15(2), 397–412 (2011)

    Article  Google Scholar 

  4. Bhatt, S.N., Thomson Leighton, F.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28(2), 300–343 (1984)

    Article  MathSciNet  Google Scholar 

  5. Cavero, S., Pardo, E.G., Laguna, M., Duarte, A.: Multistart search for the cyclic cutwidth minimization problem. Comput. Oper. Res. 126, 105–116 (2021)

    Article  MathSciNet  Google Scholar 

  6. Dobrev, S., Královič, R., Pardubská, D., Török, L., Vrt’o, I.: Antibandwidth and cyclic antibandwidth of Hamming graphs. Discret. Appl. Math. 161(10), 1402–1408 (2013)

  7. Duarte, A., Escudero, L.F., Martí, R., Mladenovic, N., Pantrigo, J.J., Sánchez-Oro, J.: Variable neighborhood search for the vertex separation problem. Comput. Oper. Res. 39(12), 3247–3255 (2012)

    Article  MathSciNet  Google Scholar 

  8. Duarte, A., Pantrigo, J.J., Pardo, E.G., Sánchez-Oro, J.: Parallel variable neighbourhood search strategies for the cutwidth minimization problem. IMA J. Manag. Math. 27(1), 55–73 (2016)

    Article  MathSciNet  Google Scholar 

  9. Duarte, A., Sánchez-Oro, J., Mladenović, N., Todosijević, R.: Variable Neighborhood Descent. In: Martí, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 341–367. Springer, Cham (2018)

    Chapter  Google Scholar 

  10. Duff, I.S., Grimes, R.G., Lewis, J.G.: Users Guide for the Harwell–Boeing Sparse Matrix Collection (Release I). RAL, Chilton (1992)

    Google Scholar 

  11. Díaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. 34(3), 313–356 (2002)

    Article  Google Scholar 

  12. Hale, W.: Frequency assignment: theory and applications. Proc. IEEE 68(12), 1497–1514 (1980)

    Article  Google Scholar 

  13. Hansen, P., Mladenović, N.: Variable Neighborhood Search. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 313–337. Springer, US, Boston, MA (2014)

    Chapter  Google Scholar 

  14. Hansen, P., Mladenović, N., Todosijević, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423–454 (2017)

    Article  MathSciNet  Google Scholar 

  15. Harper, L.H.: Optimal numberings and isoperimetric problems on graphs. J. Comb. Theory 1(3), 385–393 (1966)

    Article  MathSciNet  Google Scholar 

  16. Hromkovic, J., Muller, V., Sykora, O., Vrto, I.: On embeddings in cycles. Inf. Comput. 118(2), 302–305 (1995)

    Article  MathSciNet  Google Scholar 

  17. Jain, P., Srivastava, K., Saran, G.: Minimizing cyclic cutwidth of graphs using a memetic algorithm. J. Heurist. 22(6), 815–848 (2016)

    Article  Google Scholar 

  18. Leung, J.Y.-T., Vornberger, O., Witthoff, J.D.: On some variants of the bandwidth minimization problem. SIAM J. Comput. 13(3), 650–667 (1984)

    Article  MathSciNet  Google Scholar 

  19. López-Ibá nez, M., Dubois-Lacoste, J., P. Cáceres, L., Birattari, M., Stützle, T.: Iterated racing for automatic algorithm configuration. The irace package. Oper. Res. Perspect. 3, 43–58 (2016)

  20. Lozano, M., Duarte, A., Gortázar, F., Martí, R.: A hybrid metaheuristic for the cyclic antibandwidth problem. Knowl. Based Syst. 54, 103–113 (2013)

    Article  Google Scholar 

  21. Martí, R.: Multi-start methods. In: Handbook of Metaheuristics. International Series in Operations Research and Management Science, pp. 355–368. Springer, Boston (2003)

  22. Martí, R., Laguna, M., Glover, F., Campos, V.: Reducing the bandwidth of a sparse matrix with tabu search. Eur. J. Oper. Res. 135(2), 450–459 (2001)

    Article  MathSciNet  Google Scholar 

  23. Martí, R., Pantrigo, J.-J., Duarte, A., Campos, V., Glover, F.: Scatter search and path relinking : a tutorial on the linear arrangement problem. Int. J. Swarm Intell. Res. (IJSIR) 2(2), 1–21 (2011)

    Article  Google Scholar 

  24. Miller, Z., Pritikin, D.: On the separation number of a graph. Networks 19(6), 651–666 (1989)

    Article  MathSciNet  Google Scholar 

  25. Mladenović, N., Dražić, M., Kovačevic-Vujčić, V., Čangalović, M.: General variable neighborhood search for the continuous optimization. Eur. J. Oper. Res. 191(3), 753–770 (2008)

    Article  MathSciNet  Google Scholar 

  26. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)

    Article  MathSciNet  Google Scholar 

  27. Pardo, E.G., Martí, R., Duarte, A.: Linear Layout Problems. In: Martí, R., Panos, P., Resende, M.G. (eds.) Handbook of Heuristics, pp. 1–25. Springer, Cham (2016)

    Google Scholar 

  28. Pardo, E.G., Mladenović, N., Pantrigo, J.J., Duarte, A.: Variable formulation search for the cutwidth minimization problem. Appl. Soft Comput. 13(5), 2242–2252 (2013)

    Article  Google Scholar 

  29. Pardo, E.G., Soto, M., Thraves, C.: Embedding signed graphs in the line. J. Comb. Optim. 29(2), 451–471 (2015)

    Article  MathSciNet  Google Scholar 

  30. Pastore, T., Martínez-Gavara, A., Napoletano, A., Festa, P., Martí, R.: Tabu search for min-max edge crossing in graphs. Comput. Oper. Res. 114, 104830 (2020)

    Article  MathSciNet  Google Scholar 

  31. Piñana, E., Plana, I., Campos, V., Martí, R.: GRASP and path relinking for the matrix bandwidth minimization. Eur. J. Oper. Res. 153(1), 200–210 (2004)

    Article  MathSciNet  Google Scholar 

  32. Raspaud, A., Schröder, H., Sýkora, O., Torok, L., Vrt’o, I.: Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discret. Math. 309(11), 3541–3552 (2009)

  33. Raspaud, A., Sýkora, O., Vrt’o, I.: Congestion and dilation, similarities and differences: a survey. In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, pp. 14 (2000)

  34. Ren, J., Hao, J.-K., Rodriguez-Tello, E., Li, L., He, K.: A new iterated local search algorithm for the cyclic bandwidth problem. Knowl. Based Syst. 203, 106–136 (2020)

    Article  Google Scholar 

  35. Rodriguez-Tello, E., Hao, J.-K., Torres-Jimenez, J.: An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. Comput. Oper. Res. 35(10), 3331–3346 (2008)

    Article  Google Scholar 

  36. Rodriguez-Tello, E., Lardeux, F., Duarte, A., Narvaez-Teran, V.: Alternative evaluation functions for the cyclic bandwidth sum problem. Eur. J. Oper. Res. 273(3), 904–919 (2019)

    Article  MathSciNet  Google Scholar 

  37. Rodriguez-Tello, E., Narvaez-Teran, V., Lardeux, F.: Dynamic multi-armed bandit algorithm for the cyclic bandwidth sum problem. IEEE Access 7, 40258–40270 (2019)

    Article  Google Scholar 

  38. Rodriguez-Tello, E., Romero-Monsivais, H., Ramirez-Torres, G., Lardeux, F.: Tabu search for the cyclic bandwidth problem. Comput. Oper. Res. 57, 17–32 (2015)

    Article  MathSciNet  Google Scholar 

  39. Rost, M., Schmid, S.: Charting the complexity landscape of virtual network embeddings. In: 2018 IFIP Networking Conference (IFIP Networking) and Workshops, pp. 1–9 (2018)

  40. Skiena, S.S.: Graph Traversal. In The Algorithm Design Manual, 2nd edn. Springer Publishing Company, Berlin (1997)

    Google Scholar 

  41. Sánchez-Oro, J., José Pantrigo, J., Duarte, A.: Combining intensification and diversification strategies in VNS. An application to the vertex separation problem. Comput. Oper. Res. 52, 209–219 (2014)

    Article  MathSciNet  Google Scholar 

  42. Sýkora, O., Torok, L., Vrt’o, I.: The cyclic antibandwidth problem. Electr. Notes Discrete Math. 22, 223–227 (2005)

  43. Weili, Y., Xiaoxu, L., Ju, Z.: Dual bandwidth of some special trees. Journal–Zhengzhou Univ. Nat. Sci. Ed. 35(3), 16–19 (2003)

    MathSciNet  Google Scholar 

Download references

Acknowledgements

This research has been partially supported by the Ministerio de Ciencia, Innovación y Universidades (Grant Ref. PGC2018-095322-B-C22 and Grant Ref. FPU19/04098) and by Comunidad de Madrid and European Regional Development Fund (Grant Ref. P2018/TCS-4566).

Author information

Authors and Affiliations

  1. Universidad Rey Juan Carlos, Madrid, Spain

    Sergio Cavero, Eduardo G. Pardo & Abraham Duarte

Authors
  1. Sergio Cavero
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eduardo G. Pardo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abraham Duarte
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abraham Duarte.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cavero, S., Pardo, E.G. & Duarte, A. A general variable neighborhood search for the cyclic antibandwidth problem. Comput Optim Appl 81, 657–687 (2022). https://doi.org/10.1007/s10589-021-00334-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-021-00334-y

Keywords

Search

Navigation