Basic variable neighborhood search for the minimum sitting arrangement problem

Eduardo G. Pardo (), Antonio García-Sánchez (), Marc Sevaux () and Abraham Duarte ()
Additional contact information
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

Journal of Heuristics, 2020, vol. 26, issue 2, No 4, 249-268

Abstract: 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.

Keywords: Sitting arrangement problem; Variable neighborhood search; Basic variable neighborhood search; Graph embedding; Linear layout (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10732-019-09432-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joheur:v:26:y:2020:i:2:d:10.1007_s10732-019-09432-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10732

DOI: 10.1007/s10732-019-09432-x

Access Statistics for this article

Journal of Heuristics is currently edited by Manuel Laguna

More articles in Journal of Heuristics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().