IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v289y2021i3p1056-1066.html
   My bibliography  Save this article

Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem

Author

Listed:
  • Santos, Vinícius Gandra Martins
  • Carvalho, Marco Antonio Moreira de

Abstract

The cutwidth minimization problem (CMP) consists in determining a linear layout (i.e., a one-dimensional arrangement), of the vertices of a graph that minimizes the maximum number of edges crossing any consecutive pair of vertices. This problem has applications, for instance, in design of very large-scale integration circuits, graph drawing, and compiler design. The CMP is an NP-Hard problem and presents a challenge to exact methods and heuristics. In this study, the metaheuristic adaptive large neighborhood search is applied to the CMP. The computational experiments include 11,786 benchmark instances from four sets in the literature, and the obtained results are compared with state-of-the-art methods. The proposed method was demonstrated to be competitive, as it matched most optimal and best known results, improved some of the (not proved optimal) best known solutions, and provided the first upper bounds for unsolved instances.

Suggested Citation

  • Santos, Vinícius Gandra Martins & Carvalho, Marco Antonio Moreira de, 2021. "Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1056-1066.
    • Handle: RePEc:eee:ejores:v:289:y:2021:i:3:p:1056-1066
    DOI: 10.1016/j.ejor.2019.07.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719305776
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.07.013?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gintaras Palubeckis & Dalius Rubliauskas, 2012. "A branch-and-bound algorithm for the minimum cut linear arrangement problem," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 540-563, November.
    2. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    3. Marti, Rafael & Campos, Vicente & Pinana, Estefania, 2008. "A branch and bound algorithm for the matrix bandwidth minimization," European Journal of Operational Research, Elsevier, vol. 186(2), pages 513-528, April.
    4. Juan Pantrigo & Rafael Martí & Abraham Duarte & Eduardo Pardo, 2012. "Scatter search for the cutwidth minimization problem," Annals of Operations Research, Springer, vol. 199(1), pages 285-304, October.
    5. López-Ibáñez, Manuel & Dubois-Lacoste, Jérémie & Pérez Cáceres, Leslie & Birattari, Mauro & Stützle, Thomas, 2016. "The irace package: Iterated racing for automatic algorithm configuration," Operations Research Perspectives, Elsevier, vol. 3(C), pages 43-58.
    6. Pinana, Estefania & Plana, Isaac & Campos, Vicente & Marti, Rafael, 2004. "GRASP and path relinking for the matrix bandwidth minimization," European Journal of Operational Research, Elsevier, vol. 153(1), pages 200-210, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Molenbruch, Yves & Braekers, Kris & Caris, An, 2017. "Benefits of horizontal cooperation in dial-a-ride services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 97-119.
    2. Michele Samorani & Manuel Laguna, 2012. "Data-Mining-Driven Neighborhood Search," INFORMS Journal on Computing, INFORMS, vol. 24(2), pages 210-227, May.
    3. Vicente Campos & Estefanía Piñana & Rafael Martí, 2011. "Adaptive memory programming for matrix bandwidth minimization," Annals of Operations Research, Springer, vol. 183(1), pages 7-23, March.
    4. Ji, Bin & Yuan, Xiaohui & Yuan, Yanbin & Lei, Xiaohui & Fernando, Tyrone & Iu, Herbert H.C., 2019. "Exact and heuristic methods for optimizing lock-quay system in inland waterway," European Journal of Operational Research, Elsevier, vol. 277(2), pages 740-755.
    5. Adria Soriano & Margaretha Gansterer & Richard F. Hartl, 2018. "The two-region multi-depot pickup and delivery problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1077-1108, October.
    6. Arda, Yasemin & Cattaruzza, Diego & François, Véronique & Ogier, Maxime, 2024. "Home chemotherapy delivery: An integrated production scheduling and multi-trip vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 317(2), pages 468-486.
    7. Kallestad, Jakob & Hasibi, Ramin & Hemmati, Ahmad & Sörensen, Kenneth, 2023. "A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 309(1), pages 446-468.
    8. Juan Pantrigo & Rafael Martí & Abraham Duarte & Eduardo Pardo, 2012. "Scatter search for the cutwidth minimization problem," Annals of Operations Research, Springer, vol. 199(1), pages 285-304, October.
    9. Sergio Cavero & Eduardo G. Pardo & Abraham Duarte, 2022. "A general variable neighborhood search for the cyclic antibandwidth problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 657-687, March.
    10. Soriano, Adria & Vidal, Thibaut & Gansterer, Margaretha & Doerner, Karl, 2020. "The vehicle routing problem with arrival time diversification on a multigraph," European Journal of Operational Research, Elsevier, vol. 286(2), pages 564-575.
    11. David Woller & Jakub Rada & Miroslav Kulich, 2023. "The ALNS metaheuristic for the transmission maintenance scheduling," Journal of Heuristics, Springer, vol. 29(2), pages 349-382, June.
    12. Mladenovic, Nenad & Urosevic, Dragan & Pérez-Brito, Dionisio & García-González, Carlos G., 2010. "Variable neighbourhood search for bandwidth reduction," European Journal of Operational Research, Elsevier, vol. 200(1), pages 14-27, January.
    13. Zhang, Zhenzhen & Che, Yuxin & Liang, Zhe, 2024. "Split-demand multi-trip vehicle routing problem with simultaneous pickup and delivery in airport baggage transit," European Journal of Operational Research, Elsevier, vol. 312(3), pages 996-1010.
    14. Turkeš, Renata & Sörensen, Kenneth & Hvattum, Lars Magnus, 2021. "Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search," European Journal of Operational Research, Elsevier, vol. 292(2), pages 423-442.
    15. Felix Hübner & Patrick Gerhards & Christian Stürck & Rebekka Volk, 2021. "Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristics," Journal of Scheduling, Springer, vol. 24(3), pages 269-290, June.
    16. Pan, Binbin & Zhang, Zhenzhen & Lim, Andrew, 2021. "Multi-trip time-dependent vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 291(1), pages 218-231.
    17. Ji, Bin & Zhang, Dezhi & Zhang, Zheng & Yu, Samson S. & Van Woensel, Tom, 2022. "The generalized serial-lock scheduling problem on inland waterway: A novel decomposition-based solution framework and efficient heuristic approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    18. JANSSENS, Jochen & DE CORTE, Annelies & SÖRENSEN, Kenneth, 2016. "Water distribution network design optimisation with respect to reliability," Working Papers 2016007, University of Antwerp, Faculty of Business and Economics.
    19. Bach, Lukas & Hasle, Geir & Schulz, Christian, 2019. "Adaptive Large Neighborhood Search on the Graphics Processing Unit," European Journal of Operational Research, Elsevier, vol. 275(1), pages 53-66.
    20. Asghari, Mohammad & Jaber, Mohamad Y. & Mirzapour Al-e-hashem, S.M.J., 2023. "Coordinating vessel recovery actions: Analysis of disruption management in a liner shipping service," European Journal of Operational Research, Elsevier, vol. 307(2), pages 627-644.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:289:y:2021:i:3:p:1056-1066. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.