Searching for authors named "Luis Paquete" – sorted by Relevance.
15 documents found, showing 1 through 10.
Next 10 →
-
T.: Empirical analysis of tabu search for the lexicographic optimization of the examination timetabling problem
- …An examination timetable of an educational institution is a mapping t: E--> T, where E is a set of examinations and T is a set of time slots. The Examination Timetabling Problem ETP(E, T, f) is the problem of finding an optimal mapping sopt C S, where S is the set of all possible mappings from E to …
- Cited by 3 (0 self) – Add To MetaCart
-
An experimental investigation of iterated local search for coloring graphs
- …Abstract. Graph coloring is a well known problem from graph theory that, when attacldng it with local search algorithms, is typically treated as a series of constraint satisfaction problems: for a given number of colors k one has to find a feasible coloring: once such a coloring is found, the number…
- Cited by 6 (4 self) – Add To MetaCart
-
A two-phase local search for the biobjective traveling salesman problem
- …lpaquete,tom¡ Abstract. This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial solution by optimizing only one single objective, and then (ii) to start from this solution a search…
- Cited by 11 (5 self) – Add To MetaCart
-
Algorithms for the Multiobjective Traveling Salesman Problem
- …The information provided is the sole responsibility of the authors and does not necessarily reflect the opinion of the members of IRIDIA. The authors take full responsability for any copyright breaches that may result from publication of this paper in the IRIDIA – Technical Report Series. IRIDIA is …
- Add To MetaCart
-
Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study
- …lpaquete,machud,tom¡ Abstract. In this article, we study Pareto local optimum sets for the biobjective Traveling Salesman Problem applying straightforward extensions of local search algorithms for the single objective case. The performance of the local search algorithms is illustrated by experimenta…
- Cited by 6 (3 self) – Add To MetaCart
-
On local optima in multiobjective combinatorial optimization problems
- …Abstract. In this article, local optimality in multiobjective combinatorial optimization is used as a baseline for the design and analysis of two iterative improvement algorithms. Both algorithms search in a neighborhood that is defined on a collection of sets of feasible solutions and their accepta…
- Cited by 1 (1 self) – Add To MetaCart
-
On the design of ACO for the biobjective quadratic assignment problem
- …Abstract. Few applications of ACO algorithms to multiobjective problems have been presented so far and it is not clear how to design an effective ACO algorithms for such problems. In this article, we study the performance of several ACO variants for the biobjective Quadratic Assignment Problem that …
- Cited by 3 (1 self) – Add To MetaCart
-
Classification of Metaheuristics and Design of Experiments for the Analysis of Components
- …This report discusses two different approaches to the description of metaheuristics.…
- Cited by 1 (0 self) – Add To MetaCart
-
Metaheuristics for the vehicle routing problem with stochastic demands
- …Abstract. In the vehicle routing problem with stochastic demands a vehicle has to serve a set of customers whose exact demand is known only upon arrival at the customer’s location. The objective is to find a permutation of the customers (an a priori tour) that minimizes the expected distance travele…
- Cited by 6 (3 self) – Add To MetaCart
-
Hybrid metaheuristics for the vehicle routing problem with stochastic demands
- …and was founded in 1988 by the Dalle Molle Foundation which promoted quality of life.…
- Cited by 5 (5 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
