Partial neighborhood local searches - Archive ouverte HAL
Journal Articles International Transactions in Operational Research Year : 2022

Partial neighborhood local searches

Recherches locales à voisinage partiel

Abstract

In this work, we study partial neighborhood local search (PNLS) techniques, which consist of adaptive walks where moves are chosen in a random subset of the current solution neighborhood. PNLSs balance between intensification and diversification is mainly determined by its single parameter λ designing the subset size. We analyze and discuss three PNLSs variants, using the abstraction of several combinatorial optimization problems into fitness landscapes: NK landscapes, Unconstrained Binary Quadratic Programming, Flow-shop scheduling, and Quadratic Assignment. Our empirical study first analyses the structure of these landscapes through indicators. Then, we perform a parameter study of PNLSs for two computational budgets to study the impact of the sample size on the balance between intensification and diversification on different landscapes. Moreover, these experiments allow us to set an appropriate parameter value to compare the ability of PNLSs to reach good-quality solutions accurately. Finally, we compare PNLS variants with two classical metaheuristics, identifying links between landscape characteristics and algorithms behavior.
Fichier principal
Vignette du fichier
Partial_neighborhood_Local_Searches_for_Navigating_Through_Fitness_Landscapes.pdf (433.39 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03384306 , version 1 (09-02-2023)
hal-03384306 , version 2 (17-01-2024)

Identifiers

Cite

Sara Tari, Matthieu Basseur, Adrien Goëffon. Partial neighborhood local searches. International Transactions in Operational Research, 2022, 29 (5), pp.2761-2788. ⟨10.1111/itor.12983⟩. ⟨hal-03384306v2⟩
87 View
105 Download

Altmetric

Share

More