Results 11 to 20 of about 11,269,656 (310)
Large Neighborhood Search with Decision Diagrams
Local search is a popular technique to solve combinatorial optimization problems efficiently. To escape local minima one generally uses metaheuristics or try to design large neighborhoods around the current best solution. A somewhat more black box approach consists in using an optimization solver to explore a large neighborhood.
Gillard, Xavier, Schaus, Pierre
openaire +3 more sources
Large Neighborhood Search [PDF]
Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better candidate solutions in each iteration and hence traverse a more
Pisinger, David, Røpke, Stefan
openaire +3 more sources
A Coordinated Vehicle-Drone Arc Routing Approach Based on Improved Adaptive Large Neighborhood Search. [PDF]
Through urban traffic patrols, problems such as traffic congestion and accidents can be found and dealt with in time to maintain the stability of the urban traffic system.
Wu G, Zhao K, Cheng J, Ma M.
europepmc +2 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
A Hybrid Adaptive Large Neighborhood Heuristic for a Real-Life Dial-a-Ride Problem
The transportation of elderly and impaired people is commonly solved as a Dial-A-Ride Problem (DARP). The DARP aims to design pick-up and delivery vehicle routing schedules.
Slim Belhaiza
doaj +2 more sources
Learning Large Neighborhood Search for Vehicle Routing in Airport Ground Handling [PDF]
Dispatching vehicle fleets to serve flights is a key task in airport ground handling (AGH). Due to the notable growth of flights, it is challenging to simultaneously schedule multiple types of operations (services) for a large number of flights, where ...
Jianan Zhou +5 more
semanticscholar +1 more source
An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem [PDF]
In this paper, we study a problem that integrates the vessel scheduling problem with the berth allocation into a collaborative problem denoted as the multi-port continuous berth allocation problem (MCBAP). This problem optimizes the berth allocation of a
Bernardo Martin-Iradi +2 more
semanticscholar +1 more source
Constraint-based Very Large-Scale Neighborhood search [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mouthuy, Sébastien +2 more
openaire +5 more sources
This paper presents an effective stochastic algorithm that embeds a large neighborhood decomposition technique into a variable neighborhood search for solving the permutation flow-shop scheduling problem. The algorithm first constructs a permutation as a
Mehrdad Amirghasemi
doaj +1 more source
Large Neighborhood Search for Electric Vehicle Fleet Scheduling
This work considers the problem of planning how a fleet of shared electric vehicles is charged and used for serving a set of reservations. While exact approaches can be used to efficiently solve small to medium-sized instances of this problem, heuristic ...
Steffen Limmer +2 more
doaj +1 more source

