Abstract:
Abstract. We present a MAX-MIN Ant System for the Group Shop Scheduling problem and propose several extensions aiming for a more eective intensication and diversication of the search process. Group Shop Scheduling is a general Shop Scheduling problem covering Job Shop Scheduling and Open Shop Scheduling. In general, in Shop Scheduling problems good solutions are scattered all over the search space. It is widely recognized that for such kind of problems, eective intensication and diversication mechanisms are needed to achieve good results. Our main result shows that a basic MAX-MIN Ant System { and potentially any other Ant Colony Optimization algorithm { can be improved by keeping a number of elite solutions found during the search, and using them to guide the search process. 1
Citations
|
479
|
Ant system: optimization by a colony of cooperating agents
– Dorigo, Maniezzo, et al.
- 1996
|
|
342
|
Ant colony system: A cooperative learning approach to the traveling salesman problem
– Dorigo, Gambardella
- 1997
|
|
248
|
Scheduling – Theory, Algorithms and Systems
– Pinedo
|
|
215
|
G.: The Ant Colony Optimization Meta-heuristic
– Dorigo, Caro
- 1999
|
|
165
|
A survey of optimization by building and using probabilistic models
– Pelikan, Goldberg, et al.
- 2002
|
|
152
|
Scheduling Algorithms
– Brucker
- 2004
|
|
149
|
From recombination of genes to the estimation of distributions i. binary parameters
– Mühlenbein, Paaß
- 1996
|
|
101
|
Benchmarks for basic scheduling problems
– Taillard
- 1993
|
|
81
|
A Fast Taboo Search Algorithm for the Job Shop Problem
– Nowicki, Smutnicki
- 1996
|
|
50
|
Algorithms for solving production scheduling problems
– Giffler, Thompson
- 1960
|
|
32
|
M.: HC-ACO: The Hyper-cube Framework for Ant Colony Optimization. MIC’2001
– Blum, Roli, et al.
- 2001
|
|
23
|
Model-based search for combinatorial optimization
– Zlochin, Birattari, et al.
- 2004
|
|
17
|
M.: Ant Colony Optimization for FOP Shop Scheduling: A Case Study on Different Pheromone Representations
– Blum, Sampels
- 2002
|
|
7
|
M.: When Model Bias is Stronger than Selection Pressure
– Blum, Sampels
|
|
6
|
Updating ACO pheromones using stochastic gradient ascent and cross-entropy methods
– Dorigo, Zlochin, et al.
- 2002
|
|
6
|
Parallel ant colonies for the quadratic assignment problem. Future Generation Computer Systems
– Talbi, Roux, et al.
- 2001
|
|
4
|
Information Exchange in Multi Colony Ant Algorithms
– Middendorf, Reischle, et al.
- 2000
|
|
4
|
On metaheuristic algorithms for combinatorial optimization problems
– Yagiura, Ibaraki
- 2001
|
|
3
|
Multiple Ant Colonies Algorithm Based on Colony Level Interactions
– Kawamura, Yamamoto, et al.
- 2000
|
|
1
|
Modern Heuristic Search Methods, chapter Reactive Search: Toward Self{tuning Heuristics. Jossey{Bass
– Battiti
- 1996
|
|
1
|
Also available as
– McGraw-Hill
- 1999
|
|
1
|
Intensi and Diversi Strategies in Ant Colony System
– Randall, Tonkes
- 2000
|
|
1
|
Metaheuristics for Goup Shop Scheduling
– Sampels, Blum, et al.
- 2002
|
|
