Displaying similar documents to “Formulation Space Search Approach for the Teacher/Class Timetabling Problem”

Adaptive search heuristics for the generalized assignment problem.

Helena Ramalhinho Lourenço, Daniel Serra (2002)

Mathware and Soft Computing

Similarity:

The Generalized Assignment Problem consists of assigning a set of tasks to a set of agents at minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, requiring a certain amount of the agent's resource. We present the application of a MAX-MIN Ant System (MMAS) and a greedy randomized adaptive search procedure (GRASP) to the generalized assignment problem based on hybrid approaches. The MMAS heuristic can be seen as an...

Large neighborhood improvements for solving car sequencing problems

Bertrand Estellon, Frédéric Gardi, Karim Nouioua (2006)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The 𝒩 P -hard problem of car sequencing has received a lot of attention these last years. Whereas a direct approach based on integer programming or constraint programming is generally fruitless when the number of vehicles to sequence exceeds the hundred, several heuristics have shown their efficiency. In this paper, very large-scale neighborhood improvement techniques based on integer programming and linear assignment are presented for solving car sequencing problems. The effectiveness...

France Telecom workforce scheduling problem: a challenge

Sebastian Pokutta, Gautier Stauffer (2009)

RAIRO - Operations Research

Similarity:

In this paper, we describe the methodology used to tackle France Telecom workforce scheduling problem (the subject of the Roadef Challenge 2007) and we report the results obtained on the different data sets provided for the competition. Since the problem at hand appears to be NP-hard and due to the high dimensions of the instance sets, we use a two-step heuristical approach. We first devise a problem-tailored heuristic that provides good feasible solutions and then we use a meta-heuristic...

A Variable Neighborhood Search Approach for Solving the Maximum Set Splitting Problem

Matic, Dragan (2012)

Serdica Journal of Computing

Similarity:

This paper presents a Variable neighbourhood search (VNS) approach for solving the Maximum Set Splitting Problem (MSSP). The algorithm forms a system of neighborhoods based on changing the component for an increasing number of elements. An efficient local search procedure swaps the components of pairs of elements and yields a relatively short running time. Numerical experiments are performed on the instances known in the literature: minimum hitting set and Steiner triple systems. Computational...

Consistency checking within local search applied to the frequency assignment with polarization problem

Michel Vasquez, Audrey Dupont, Djamal Habet (2003)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

We present a hybrid approach for the Frequency Assignment Problem with Polarization. This problem, viewed as Max-CSP, is treated as a sequence of decision problems, CSP like. The proposed approach combines the Arc-Consistency techniques with a performed Tabu Search heuristic. The resulting algorithm gives some high quality solutions and has proved its robustness on instances with approximately a thousand variables and nearly ten thousand constraints.

Experiments with variants of ant algorithms.

Thomas Stützle, Sebastian Linke (2002)

Mathware and Soft Computing

Similarity:

A number of extensions of Ant System, the first ant colony optimization (ACO) algorithm, were proposed in the literature. These extensions typically achieve much improved computational results when compared to the original Ant System. However, many design choices of Ant System are left untouched including the fact that solutions are constructed, that real-numbers are used to simulate pheromone trails, and that explicit pheromone evaporation is used. In this article we experimentally...

New representation to reduce the search space for the resource-constrained project scheduling problem

Khaled Moumene, Jacques A. Ferland (2008)

RAIRO - Operations Research

Similarity:

This paper describes a new representation for the solutions of the resource-constrained project scheduling problem (RCPSP) denoted Activity Set List. The most efficient heuristics for the problem use the activity list representation and the serial SGS method to construct the corresponding solution (schedule). The activity list may induce a search space of representations much larger then the space of schedules because the same schedule can correspond to many different activity list...

A tabu search algorithm to schedule university examinations.

Ramón Alvarez-Valdés, Enric Crespo, José M. Tamarit (1997)

Qüestiió

Similarity:

Scheduling examinations in a large university is an increasingly complex problem, due to its size, the growing flexibility of students' curricula and the interest in including a wide set of objectives and constraints. In this paper we present a new algorithm for this problem and its application to a university in Spain. A combination of heuristics, based on Tabu Search, first finds a solution in which no student has two exams simultaneously and then improves it by evenly...

A review on the ant colony optimization metaheuristic: basis, models and new trends.

Oscar Cordón, Francisco Herrera, Thomas Stützle (2002)

Mathware and Soft Computing

Similarity:

Ant Colony Optimization (ACO) is a recent metaheuristic method that is inspired by the behavior of real ant colonies. In this paper, we review the underlying ideas of this approach that lead from the biological inspiration to the ACO metaheuristic, which gives a set of rules of how to apply ACO algorithms to challenging combinatorial problems. We present some of the algorithms that were developed under this framework, give an overview of current applications, and analyze the relationship...