Results 1 - 10 of 800

A Hybrid Scatter Search Heuristic for Personalized Crew Rostering in the Airline Industry

by Broos Maenhout, Mario Vanhoucke , 2007
"... The crew scheduling problem in the airline industry is extensively investigated in the operations research literature since efficient crew employment can drastically reduce operational costs of airline companies. Given the flight schedule of an airline company, crew scheduling is the process of assi ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
of assigning all necessary crew members in such a way that the airline is able to operate all its flights and constructing a roster line for each employee minimizing the corresponding overall cost for personnel. In this paper, we present a scatter search algorithm for the airline crew rostering problem

A hybrid scatter search/ . . .

by Dieter Debels, Bert De Reyck, Roel Leus, Mario Vanhoucke
"... In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively small ..."
Abstract - Add to MetaCart
instances. In this paper, we present a new meta-heuristic for this problem, able to provide near-optimal heuristic solutions. The procedure combines elements from scatter search, a generic population-based evolutionary search method, and a recently introduced heuristic method for the optimisation

A Hybrid Scatter Search / Electromagnetism Meta-Heuristic for Project Scheduling

by Departement Toegepaste, Economische Wetenschappen, D. Debels, B. De Reyck, Dieter Debels, Bert De, Reyck Roel Leus, Mario Vanhoucke
"... In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively small ..."
Abstract - Add to MetaCart
instances. In this paper, we present a new meta-heuristic for this problem, able to provide near-optimal heuristic solutions. The procedure combines elements from scatter search, a generic population-based evolutionary search method, and a recently introduced heuristic method for the optimisation

A hybrid scatter search/electromagnetism meta-heuristic for project scheduling

by Dieter Debels A, Bert De Reyck B, Roel Leus C, Mario Vanhoucke A , 2003
"... In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively small ..."
Abstract - Add to MetaCart
instances. In this paper, we present a new meta-heuristic for this problem, able to provide near-optimal heuristic solutions for relatively large instances. The procedure combines elements from scatter search, a generic population-based evolutionary search method, and from a recently introduced heuristic

1 A Hybrid Scatter Search / Electromagnetism Meta-Heuristic for Project Scheduling

by Dieter Debels, Bert De, Reyck Roel, Leus Mario Vanhoucke
"... In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively small ..."
Abstract - Add to MetaCart
instances. In this paper, we present a new meta-heuristic for this problem, able to provide near-optimal heuristic solutions for relatively large instances. The procedure combines elements from scatter search, a generic population-based evolutionary search method, and from a recently introduced heuristic

Hybrid heuristics for the maximum diversity problem

by Micael Gallego, Abraham Duarte, Manuel Laguna, Rafael Martí , 2006
"... The maximum diversity problem presents a challenge to solution methods based on heuristic optimization. We undertake the development of hybrid procedures within the scatter search framework with the goal of uncovering the most effective designs to tackle this difficult but important problem. Our res ..."
Abstract - Cited by 7 (4 self) - Add to MetaCart
The maximum diversity problem presents a challenge to solution methods based on heuristic optimization. We undertake the development of hybrid procedures within the scatter search framework with the goal of uncovering the most effective designs to tackle this difficult but important problem. Our

Hybrid Heuristics for Multimodal Homecare Scheduling

by Andrea Rendl, Matthias Prandtstetter , Gerhard Hiermann, Jakob Puchinger, Günther Raidl
"... We focus on hybrid solution methods for a large-scale realworld multimodal homecare scheduling (MHS) problem, where the objective is to find an optimal roster for nurses who travel in tours from patient to patient, using different modes of transport. In a first step, we generate a valid initial sol ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
solution using Constraint Programming (CP). In a second step, we improve the solution using one of the following metaheuristic approaches: (1) variable neighborhood descent, (2) variable neighborhood search, (3) an evolutionary algorithm, (4) scatter search and (5) a simulated annealing hyper heuristic

A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems. Applied intelligence, doi

by Ying Xu, Rong Qu , 2010
"... Abstract. This paper investigates the first hybrid scatter search and path relinking meta-heuristic for the Delay-Constrained Least-Cost (DCLC) multicast routing problem. The underpinning mathematic model of the DCLC problem is the constrained Steiner tree problem in graphs, a well known NP-complete ..."
Abstract - Cited by 8 (2 self) - Add to MetaCart
Abstract. This paper investigates the first hybrid scatter search and path relinking meta-heuristic for the Delay-Constrained Least-Cost (DCLC) multicast routing problem. The underpinning mathematic model of the DCLC problem is the constrained Steiner tree problem in graphs, a well known NP

Population Heuristics

by J.E. Beasley , 1999
"... Standard heuristics in Operations Research (such as greedy, tabu search and simulated annealing) work on improving a single current solution. Population heuristics use a number of current solutions and combine them together to generate new solutions. Heuristic algorithms encountered in the literatu ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
in the literature that can generically be classified as population heuristics include genetic algorithms, hybrid genetic algorithms, memetic algorithms, scatter search algorithms and bionomic algorithms. In this tutorial paper we discuss the basic features of population heuristics and provide practical advice

Local Search With Constraint Propagation and Conflict-Based Heuristics

by Narendra Jussien, Olivier Lhomme , 2002
"... Search algorithms for solving CSP (Constraint Satisfaction Problems) usually fall into one of two main families: local search algorithms and systematic algorithms. Both families have their advantages. Designing hybrid approaches seems promising since those advantages may be combined into a single ap ..."
Abstract - Cited by 76 (17 self) - Add to MetaCart
Search algorithms for solving CSP (Constraint Satisfaction Problems) usually fall into one of two main families: local search algorithms and systematic algorithms. Both families have their advantages. Designing hybrid approaches seems promising since those advantages may be combined into a single
Results 1 - 10 of 800