The Concept of Ant Colony Algorithm for Scheduling of Flexible Manufacturing Systems
-
Krzysztof Kalinowski [1] ; Bożena Skołud [1]
-
[1] Silesian University of Technology
Silesian University of Technology
Gliwice, Polonia
-
- Localización: International Joint Conference SOCO’16-CISIS’16-ICEUTE’16: San Sebastián, Spain, October 19th-21st, 2016 Proceedings / coord. por Manuel Graña Romay, José Manuel López Guede, Oier Etxaniz, Álvaro Herrero Cosío, Héctor Quintián Pardo, Emilio Santiago Corchado Rodríguez, 2017, ISBN 978-3-319-47364-2, págs. 408-415
- Idioma: inglés
- Texto completo no disponible (Saber más ...)
-
Resumen
The paper presents the conception of algorithm for scheduling of manufacturing systems with consideration of flexible resources and production routes. The proposed algorithm is based on ant colony optimisation (ACO) mechanisms. Although ACO metaheuristics do not guarantee finding optimal solutions, and their performance strongly depends on the intensification and the diversification parameters tuning, they are an interesting alternatives in solving NP hard problems. Their effectiveness and comparison with other methods are presented e.g. in [1, 4, 8]. The discussed search space is defined by the graph of operations planning relationships of the set of orders – the directed AND/OR-type graph describing precedence relations between all operations for scheduling. In the structure of the graph the notation ‘operation on the node’ is used. The presented model supports complex production orders, with hierarchical structures of processes and their execution according to both forward and backward strategies.
