Comparison of heuristic approaches for the multiple depot vehicle scheduling problem [PDF]
Given a set of timetabled tasks, the multi-depot vehicle scheduling problemis a well-known problem that consists of determining least-cost schedulesfor vehicles assigned to several depots such that each task is accomplishedexactly once by a vehicle.
Desaulniers, G. +3 more
core +1 more source
Location management for the supply of PD fluid via large neighborhood search based virus optimization algorithm. [PDF]
Atthirawong W, Luangpaiboon P.
europepmc +1 more source
In this paper, we consider the workflow scheduling problem with soft deadlines and fuzzy time uncertainties in cloud manufacturing environments. Workflow tasks in cloud manufacturing often involve uncertain execution and logistics times due to large ...
Haiyan Xu, Fanhao Ma, Long Chen
doaj +1 more source
Tabu Search for the Single Row Facility Layout Problem Using Exhaustive 2-Opt and Insertion Neighborhoods [PDF]
The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard.
Ghosh, Diptesh, Kothari, Ravi
core
Reinforced Adaptive Large Neighborhood Search
The Large Neighborhood Search metaheuristic for solving Constrained Optimization Problems has been proved to be effective on a wide range of problems. This Local Search heuristic has the particu- larity of using a complete search (such as Constraint Programming) to explore the large neighborhoods obtained by relaxing a fragment of the variables of the ...
Mairy, Jean-Baptiste +3 more
openaire +1 more source
Tabu Search for the Single Row Facility Layout Problem in FMS using a 3-opt Neighborhood [PDF]
Since material handling agents in a FMS are most efficient when moving in straight lines, a common layout of machines in a FMS is a single row layout. This allows a floor designer to model the problem of generating an optimal machine layout in a FMS as a
Ghosh, Diptesh, Kothari, Ravi
core
A Large Neighborhood Search heuristic for Supply Chain Network Design [PDF]
24 pagesMany exact or approximate solution techniques have been used to solve facility location problems and more generally supply chain network design problems.
Dejax, Pierre +2 more
core +2 more sources
Bi-Objective Adaptive Large Neighborhood Search Algorithm for the Healthcare Waste Periodic Location Inventory Routing Problem. [PDF]
Aydemir-Karadag A.
europepmc +1 more source
Large Neighborhood Search applied to the Software Module Clustering problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Monçores, Marlon C. +2 more
openaire +1 more source
An improved large neighborhood search algorithm for solving dynamic pickup and delivery problems
The large-scale dynamic pickup and delivery problem (DPDP), characterized by a vast number of orders, complex constraints, and the uncertainties introduced by its dynamic nature, poses significant challenges to existing vehicle routing algorithms ...
Qingxia Shang +6 more
doaj +1 more source

