IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v26y2020i2d10.1007_s10732-019-09432-x.html
   My bibliography  Save this article

Basic variable neighborhood search for the minimum sitting arrangement problem

Author

Listed:
  • Eduardo G. Pardo

    (Universidad Rey Juan Carlos)

  • Antonio García-Sánchez

    (Universidad Politécnica de Madrid)

  • Marc Sevaux

    (Universitè de Bretagne-Sud)

  • Abraham Duarte

    (Universidad Rey Juan Carlos)

Abstract

The minimum sitting arrangement (MinSA) problem is a linear layout problem consisting in minimizing the number of errors produced when a signed graph is embedded into a line. This problem has been previously tackled by theoretical and heuristic approaches in the literature. In this paper we present a basic variable neighborhood search (BVNS) algorithm for solving the problem. First, we introduce a novel constructive scheme based on the identification of cliques from the input graph, when only the positive edges are considered. The solutions obtained by the constructive procedure are then used as a starting point for the proposed BVNS algorithm. Efficient implementations of the several configurations of the local search procedure within the BVNS are described. The algorithmic proposal is then compared with previous approaches in the state of the art for the MinSA over different sets of referred instances. The obtained results supported by non-parametric statistical tests, indicate that BVNS can be considered as the new state-of-the-art algorithm for the MinSA.

Suggested Citation

  • Eduardo G. Pardo & Antonio García-Sánchez & Marc Sevaux & Abraham Duarte, 2020. "Basic variable neighborhood search for the minimum sitting arrangement problem," Journal of Heuristics, Springer, vol. 26(2), pages 249-268, April.
    • Handle: RePEc:spr:joheur:v:26:y:2020:i:2:d:10.1007_s10732-019-09432-x
    DOI: 10.1007/s10732-019-09432-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-019-09432-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-019-09432-x?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. Abraham Duarte & Juan Pantrigo & Eduardo Pardo & Nenad Mladenovic, 2015. "Multi-objective variable neighborhood search: an application to combinatorial optimization problems," Journal of Global Optimization, Springer, vol. 63(3), pages 515-536, November.
    2. Pierre Hansen & Nenad Mladenović & Raca Todosijević & Saïd Hanafi, 2017. "Variable neighborhood search: basics and variants," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 423-454, September.
    3. 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.
    4. Eduardo G. Pardo & Mauricio Soto & Christopher Thraves, 2015. "Embedding signed graphs in the line," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 451-471, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cavero, Sergio & Pardo, Eduardo G. & Duarte, Abraham, 2023. "Efficient iterated greedy for the two-dimensional bandwidth minimization problem," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1126-1139.

    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. Abraham Duarte & Eduardo G. Pardo, 2020. "Special issue on recent innovations in variable neighborhood search," Journal of Heuristics, Springer, vol. 26(3), pages 335-338, June.
    2. 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.
    3. Yıldız, Gazi Bilal & Soylu, Banu, 2019. "A multiobjective post-sales guarantee and repair services network design problem," International Journal of Production Economics, Elsevier, vol. 216(C), pages 305-320.
    4. Weikang Fang & Zailin Guan & Peiyue Su & Dan Luo & Linshan Ding & Lei Yue, 2022. "Multi-Objective Material Logistics Planning with Discrete Split Deliveries Using a Hybrid NSGA-II Algorithm," Mathematics, MDPI, vol. 10(16), pages 1-30, August.
    5. Xiang Song & Dylan Jones & Nasrin Asgari & Tim Pigden, 2020. "Multi-objective vehicle routing and loading with time window constraints: a real-life application," Annals of Operations Research, Springer, vol. 291(1), pages 799-825, August.
    6. Julio Aracena & Christopher Thraves Caro, 2023. "The weighted sitting closer to friends than enemies problem in the line," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-21, January.
    7. Iliopoulou, Christina & Makridis, Michail A., 2023. "Critical multi-link disruption identification for public transport networks: A multi-objective optimization framework," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 626(C).
    8. Michel Vasquez & Mirsad Buljubasic & Saïd Hanafi, 2023. "An efficient scenario penalization matheuristic for a stochastic scheduling problem," Journal of Heuristics, Springer, vol. 29(2), pages 383-408, June.
    9. Soylu, Banu & Katip, Hatice, 2019. "A multiobjective hub-airport location problem for an airline network design," European Journal of Operational Research, Elsevier, vol. 277(2), pages 412-425.
    10. Micheal Arockiaraj & Jessie Abraham & Arul Jeya Shalini, 2019. "Node set optimization problem for complete Josephus cubes," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1180-1195, November.
    11. Lamiaa Dahite & Abdeslam Kadrani & Rachid Benmansour & Rym Nesrine Guibadj & Cyril Fonlupt, 2022. "Multi-Objective Model and Variable Neighborhood Search Algorithms for the Joint Maintenance Scheduling and Workforce Routing Problem," Mathematics, MDPI, vol. 10(11), pages 1-37, May.
    12. Andrei Nikolaev & Anna Kozlova, 2021. "Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search," Journal of Combinatorial Optimization, Springer, vol. 42(2), pages 212-230, August.
    13. Jun Pei & Zorica Dražić & Milan Dražić & Nenad Mladenović & Panos M. Pardalos, 2019. "Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 235-250, April.
    14. Söhnke Maecker & Liji Shen, 2020. "Solving parallel machine problems with delivery times and tardiness objectives," Annals of Operations Research, Springer, vol. 285(1), pages 315-334, February.
    15. Issam Krimi & Raca Todosijević & Rachid Benmansour & Mustapha Ratli & Abdessamad Ait Cadi & Afaf Aloullal, 2020. "Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints," Journal of Global Optimization, Springer, vol. 78(2), pages 349-373, October.
    16. Wu, Xueqi & Che, Ada, 2020. "Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search," Omega, Elsevier, vol. 94(C).
    17. Miguel A. González & Juan José Palacios & Camino R. Vela & Alejandro Hernández-Arauzo, 2017. "Scatter search for minimizing weighted tardiness in a single machine scheduling with setups," Journal of Heuristics, Springer, vol. 23(2), pages 81-110, June.
    18. Ritzinger, Ulrike & Puchinger, Jakob & Rudloff, Christian & Hartl, Richard F., 2022. "Comparison of anticipatory algorithms for a dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 301(2), pages 591-608.
    19. Angelo Sifaleras, 2023. "In memory of Professor Nenad Mladenović (1951–2022)," SN Operations Research Forum, Springer, vol. 4(1), pages 1-18, March.
    20. Cavero, Sergio & Pardo, Eduardo G. & Duarte, Abraham, 2023. "Efficient iterated greedy for the two-dimensional bandwidth minimization problem," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1126-1139.

    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:spr:joheur:v:26:y:2020:i:2:d:10.1007_s10732-019-09432-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.