Keyword: heuristics: local search

Found 320 papers in total
A composite algorithm for multiprocessor scheduling
2011,
A composite algorithm is developed for the classical problem of scheduling independent...
Simulation and optimisation of intermodal barge transport networks
2011,
This work deals with two key aspects in the competitiveness of intermodal transport...
A large neighbourhood search heuristic for the aircraft and passenger recovery problem
2011,
This paper introduces a large neighbourhood search heuristic for an airline recovery...
A flexible tolerance genetic algorithm for optimal problems with nonlinear equality constraints
2009,
A hybrid method called a flexible tolerance genetic algorithm (FTGA) is proposed in...
Design of rectangular packings: Block structure‐based reconstruction algorithm
2008,
Consideration was given to the problems of orthogonal packing of rectangulars in a...
Local search and lower bounds for the patient admission scheduling problem
2011,
We propose a multi‐neighborhood local search procedure to solve a healthcare...
Goal programming using multiple objective hybrid metaheuristic algorithm
2011,
In this paper, a Goal Programming (GP) model is converted into a...
Using local search to speed up filtering algorithms for some NP‐hard constraints
2011,
This paper proposes to use local search inside filtering algorithms of combinatorial...
The parameterized complexity of k‐flip local search for SAT and MAX SAT
2011,
SAT and MAX SAT are among the most prominent problems for which local search...
Stable assignment with couples: Parameterized complexity and local search
2011,
We study the Hospitals/Residents with Couples problem, a variant of the classical...
Adaptive memory programming: local search parallel algorithms for phylogenetic tree construction
2011,
One of the most important aspect of molecular and computational biology is the...
Combining Constraint Programming and Local Search for Job‐Shop Scheduling
2011,
Since their introduction, local search algorithms have consistently represented the...
Cooperating local search for the maximum clique problem
2011,
The advent of desktop multi‐core computers has dramatically improved the...
Scattered and track data interpolation using an efficient strip searching procedure
2011,
A new local algorithm for bivariate interpolation of large sets of scattered and track...
Understanding the behavior of Solution‐Guided Search for job‐shop scheduling
2011,
This paper investigates reasons behind the behavior of constructive...
An effective hybrid algorithm for integrated process planning and scheduling
2010,
Process planning and scheduling are two of the most important functions in the...
Hybridizing Evolutionary Algorithms with Variable‐Depth Search to Overcome Local Optima
2011,
Hybridizing evolutionary algorithms with local search has become a popular trend in...
Recent progress of local search in handling the time window constraints of the vehicle routing problem
2010,
Vehicle routing and scheduling problems have a wide range of applications and have...
Local search-based metaheuristics for the split delivery vehicle routing problem
2010,
The split delivery vehicle routing problem is a variant of the standard vehicle...
Mathematical models and solution methods for optimal container terminal yard layouts
2010,
In this paper, we introduce an integer linear program for planning the layout of...
Dynamic job shop scheduling using variable neighbourhood search
2010,
In this paper a scheduling method based on variable neighbourhood search (VNS) is...
A memetic algorithm for bi-objective integrated forward/reverse logistics network design
2010,
Logistics network design is a major strategic issue due to its impact on the...
Variable neighborhood search for the dial-a-ride problem
2010,
In dial-a-ride problems passengers have to be transported between pre-specified pickup...
Fast neighborhood search for the single machine earliness–tardiness scheduling problem
2010,
This paper addresses the one machine scheduling problem in which n jobs have distinct...
Papers per page: