Sciweavers

544 search results - page 17 / 109
» Improving Local Search for Fuzzy Scheduling Problems
Sort
View
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 1 months ago
Quick-and-dirty ant colony optimization
Ant colony optimization (ACO) is a well known metaheuristic. In the literature it has been used for tackling many optimization problems. Often, ACO is hybridized with a local sear...
Paola Pellegrini, Elena Moretti
GECCO
2000
Springer
141views Optimization» more  GECCO 2000»
13 years 10 months ago
A steady-state evolutionary algorithm for the job shop problem
This paper describes an evolutionary search scheduling algorithm (ESSA) for the job shop scheduling problem (JSSP). If no specific knowledge of the problem is included in the EA t...
Patrick van Bael, Dirk Devogelaere, Marcel Rijckae...
ICCAD
1995
IEEE
135views Hardware» more  ICCAD 1995»
13 years 10 months ago
An iterative improvement algorithm for low power data path synthesis
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
Anand Raghunathan, Niraj K. Jha
AIPS
2008
13 years 9 months ago
A New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem with Setup Times
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
Miguel A. González, Camino R. Vela, Ramiro ...
IJIS
2007
155views more  IJIS 2007»
13 years 7 months ago
Clustering web search results using fuzzy ants
Algorithms for clustering web search results have to be efficient and robust. Furthermore they must be able to cluster a dataset without using any kind of a priori information, s...
Steven Schockaert, Martine De Cock, Chris Cornelis...