Adaptive Large Neighborhood Search
There has already been a lot of research on Local Search Heuristics in Computer Science. Local Search improves an initial solution by manipulating rather small parts of the solution.
Lutz, Roman
openaire +3 more sources
Revisiting the Self-adaptive Large Neighborhood Search
This paper revisits the Self-Adaptive Large Neighborhood Search introduced by Laborie and Godard. We propose a variation in the weight-update mechanism especially useful when the LNS operators available in the portfolio exhibit unequal running times. We also propose some generic relaxations working for a large family of problems in a black-box fashion.
Charles Thomas 0005, Pierre Schaus
openaire +2 more sources
An Adaptive Large Neighborhood Search for relocating vehicles in electric carsharing services [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maurizio Bruglieri +2 more
openaire +4 more sources
Bi-Objective Adaptive Large Neighborhood Search Algorithm for the Healthcare Waste Periodic Location Inventory Routing Problem. [PDF]
There has been an unexpected increase in the amount of healthcare waste during the COVID-19 pandemic. Managing healthcare waste is vital, as improper practices in the waste system can lead to the further spread of the virus.
Aydemir-Karadag A.
europepmc +2 more sources
Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Renata Turkes +2 more
openaire +2 more sources
Adaptive large neighborhood search for mixed integer programming [PDF]
AbstractLarge Neighborhood Search (LNS) heuristics are among the most powerful but also most expensive heuristics for mixed integer programs (MIP). Ideally, a solver adaptively concentrates its limited computational budget by learning which LNS heuristics work best for the MIP problem at hand.
openaire +2 more sources
An adaptive large neighborhood search algorithm for the tugboat scheduling problem
10.1016/j.cie.2023 ...
Xin Wang +3 more
openaire +1 more source
An adaptive large neighborhood search for the multiple-day music rehearsal problems
Abstract This paper presents an Adaptive Large Neighborhood Search (ALNS) framework to solve the Multiple-Day Music Rehearsal Problem (MMRP), where music pieces with different player sets and durations are arranged in a predefined number of rehearsal days so that the total days of attendance and waiting times experienced by all players are minimized.
Jarumaneeroj, Pisit, Sakulsom, Noppadon
openaire +1 more source
Adaptive Large Neighborhood Search on the Graphics Processing Unit
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lukas Bach +2 more
openaire +3 more sources
A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems [PDF]
In this study, we improved the variable neighborhood search (VNS) algorithm for solving uncapacitated multilevel lot-sizing (MLLS) problems. The improvement is two-fold.
Xu, Yuchun +4 more
core +1 more source

