Show simple item record

dc.contributor.authorHernando, L.
dc.contributor.authorMendiburu, A.
dc.contributor.authorLozano, J.A.
dc.description.abstractA number of local search based algorithms have been designed to escape from the local optima, such as, iterated local search or variable neighborhood search. The neighborhood chosen for the local search as well as the escape technique play a key role in the performance of these algorithms. Of course, a specific strategy has a different effect on distinct problems or instances. In this paper, we focus on a permutation-based combinatorial optimization problem: the linear ordering problem. We provide a theoretical landscape analysis for the adjacent swap, the swap and the insert neighborhoods. By making connections to other different problems found in the Combinatorics field, we prove that there are some moves in the local optima that will necessarily return a worse or equal solution. The number of these non-better solutions that could be avoided by the escape techniques is considerably large with respect to the number of neighbors. This is a valuable information that can be included in any of those algorithms designed to escape from the local optima, increasing their efficiency.en_US
dc.description.sponsorshipTIN2016-78365-R IT1244-19en_US
dc.rightsReconocimiento-NoComercial-CompartirIgual 3.0 Españaen_US
dc.subjectPermutation-based Combinatorial Optimization Problemsen_US
dc.subjectLinear Ordering Problemen_US
dc.subjectLocal Optimaen_US
dc.subjectLandscape Analysisen_US
dc.titleJourney to the center of the linear ordering problemen_US
dc.journal.titleGECCO '20: Proceedings of the 2020 Genetic and Evolutionary Computation Conferenceen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record

Reconocimiento-NoComercial-CompartirIgual 3.0 España
Except where otherwise noted, this item's license is described as Reconocimiento-NoComercial-CompartirIgual 3.0 España