Search
Search Results
-
Variable Neighborhood Search with Dynamic Exploration for the Set Union Knapsack Problem
In the set-union knapsack problem (SUKP), we are given a set of elements, each with a positive weight, and a set of items, each with a positive...
-
Large neighborhood search for an aeronautical assembly line time-constrained scheduling problem with multiple modes and a resource leveling objective
This paper deals with a scheduling problem arising at the tactical decision level in aeronautical assembly line. It has the structure of a...
-
A variable neighborhood search for the budget-constrained maximal covering location problem with customer preference ordering
This paper introduces a variant of Maximal Covering Location Problem (MCLP) with customer preference ordering and limited budget for establishing...
-
A novel variable neighborhood strategy adaptive search for SALBP-2 problem with a limit on the number of machine’s types
This paper presents the novel method variable neighbourhood strategy adaptive search (VaNSAS) for solving the special case of assembly line balancing...
-
A large neighborhood search approach for the paint shop scheduling problem
Minimizing the setup costs caused by color changes is one of the main concerns for paint shop scheduling in the automotive industry. Yet, finding an...
-
Data dissemination protocol for VANETs to optimize the routing path using hybrid particle swarm optimization with sequential variable neighbourhood search
A vehicular Ad-Hoc Network (VANET) is a form of Mobile Ad-Hoc Network (MANET) which employs wireless routers that are inside every vehicle to operate...
-
Local Search
Improvement methods constitute the backbone of most metaheuristics. These methods repeatedly perform slight, local modifications on a current...
-
Very Large-Scale Neighborhood Search
Very Large-Scale Neighborhood Search is not an algorithm or a class of algorithms, but rather a conceptual framework which can be used for solving...
-
Virtual Machine Placement with Disk Anti-colocation Constraints Using Variable Neighborhood Search Heuristic
In a cloud computing environment, virtual machine placement (VMP) represents an important challenge to select the most suitable set of physical...
-
Q-learning-based multi-objective particle swarm optimization with local search within factories for energy-efficient distributed flow-shop scheduling problem
Given the increasing severity of ecological issues, sustainable development and green manufacturing have emerged as crucial areas of research and...
-
Local Search Learning
If local research constitutes the backbone of metaheuristics, tabu search, looking to learn how to iteratively modify a solution can be considered...
-
Applications to Random Search Methods with Joint Normal Search Variates
As an application of the previous description of a general method to accelerate random search algorithms, in the following we consider search...
-
Metaheuristics and Local Search
Combinatorial optimization, which includes sports scheduling problems as one of its areas of application, consists in finding optimal solutions to...
-
Evolutionary neighborhood discovery algorithm for agricultural routing planning in multiple fields
In recent years, operations research in agriculture has improved the harvested yield, reduced the cost and time required for field operations, and...
-
A General Mathematical Framework for Constrained Mixed-variable Blackbox Optimization Problems with Meta and Categorical Variables
A mathematical framework for modelling constrained mixed-variable optimization problems is presented in a blackbox optimization context. The...
-
Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
We describe the solver that we developed for the Sports Timetabling Competition ITC2021, a three-stage simulated annealing approach, that makes use...
-
Local search approaches for the test laboratory scheduling problem with variable task grou**
The Test Laboratory Scheduling Problem (TLSP) is a real-world scheduling problem that extends the well-known Resource-Constrained Project Scheduling...
-
Simulated maximum likelihood estimation of the sequential search model
We propose a new approach to simulate the likelihood of the sequential search model. By allowing search costs to be heterogeneous across consumers...
-
A large neighborhood search-based matheuristic for the load-dependent electric vehicle routing problem with time windows
Range anxiety of electric vehicles (EVs) still poses a major barrier in their adoption in the logistics operations despite the advancements in the...
-
Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance
This paper addresses to the permutation flowshop scheduling problem while considering the preventive maintenance in the non-resumable case. The...
