Sciweavers

440 search results - page 13 / 88
» Local Search Heuristics for the Multidimensional Assignment ...
Sort
View
HM
2007
Springer
135views Optimization» more  HM 2007»
14 years 1 months ago
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
Igor Pesek, Andrea Schaerf, Janez Zerovnik
IJCAI
2003
13 years 9 months ago
Maximizing Flexibility: A Retraction Heuristic for Oversubscribed Scheduling Problems
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time fra...
Laurence A. Kramer, Stephen F. Smith
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
13 years 11 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius
ICCAD
1993
IEEE
81views Hardware» more  ICCAD 1993»
13 years 11 months ago
Inverter minimization in multi-level logic networks
In this paper, we look at the problem of inverter minimization in multi-level logic networks. The network is specified in terms of a set of base functions and the inversion opera...
Alok Jain, Randal E. Bryant
GECCO
2006
Springer
216views Optimization» more  GECCO 2006»
13 years 11 months ago
Comparative analysis of the sailor assignment problem
In this work the performance of several local search and metaheuristic methods is compared to previously reported work using evolutionary algorithms. The results show that while m...
Joseph Vannucci, Deon Garrett, Dipankar Dasgupta