Results 1 to 10 of about 450,206 (177)
Parallel adaptive large neighborhood search based on spark to solve VRPTW [PDF]
Scientific ReportsAiming at the multi-objective vehicle path planning problem with time windows (VRPTW), a Spark-based parallel Adaptive Large Neighborhood Search algorithm (Spark-ALNS) is proposed to solve it.
Songzuo Liu +3 more
doaj +4 more sources
Data for a meta-analysis of the adaptive layer in adaptive large neighborhood search [PDF]
Data in Brief, 2020 Meta-analysis, a systematic statistical examination that combines the results of several independent studies, has the potential of obtaining problem- and implementation-independent knowledge and understanding of metaheuristic algorithms, but has not yet ...
Renata Turkeš +19 more
doaj +2 more sources
Explanation-based large neighborhood search [PDF]
Constraints, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lorca, Xavier +2 more
openaire +8 more sources
A Coordinated Vehicle–Drone Arc Routing Approach Based on Improved Adaptive Large Neighborhood Search [PDF]
Sensors, 2022 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.
Guohua Wu +3 more
doaj +2 more sources
Large Neighborhood Search for Electric Vehicle Fleet Scheduling
Energies, 2023 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 +2 more sources
Solving DCOPs with Distributed Large Neighborhood Search
, 2017 The field of Distributed Constraint Optimization has gained momentum in recent years, thanks to its ability to address various applications related to multi-agent cooperation. Nevertheless, solving Distributed Constraint Optimization Problems (DCOPs) optimally is NP-hard.
Fioretto, Ferdinando +4 more
openaire +4 more sources
A hybrid VNS matheuristic for a bin packing problem with a color constraint [PDF]
Yugoslav Journal of Operations Research, 2021 We study a new variant of the bin packing problem with a color constraint. Given a finite set of items, each item has a set of colors. Each bin has a color capacity, the total number of colors for a bin is the unification of colors for its items and ...
Kochetov Yury, Kondakov Arteam
doaj +1 more source
Constraint-based Very Large-Scale Neighborhood search [PDF]
Constraints, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mouthuy, Sébastien +2 more
openaire +5 more sources
A Single-Product Multi-Period Inventory Routing Problem under Intermittent Demand
Information, 2023 Demand fluctuations and uncertainty bring challenges to inventory management, and intermittent demand patterns increase the risk of inventory backlogs and raise inventory holding costs.
Xin Song, Daofang Chang, Tian Luo
doaj +1 more source
Large neighborhood local search for the p-median problem [PDF]
Yugoslav Journal of Operations Research, 2005 In this paper we consider the well known p-median problem. We introduce a new large neighborhood based on ideas of S.Lin and B.W. Kernighan for the graph partition problem. We study the behavior of the local improvement and Ant Colony algorithms with new
Kochetov Yuri +3 more
doaj +1 more source