DocumentCode :
185225
Title :
Precedence constraints treatment in ant colony optimization
Author :
Serbencu, Adrian E. ; Minzu, Viorel ; Serbencu, Adriana
Author_Institution :
Dept. of Autom. Control & Electr. Eng., Dunarea de Jos Univ. of Galati, Galati, Romania
fYear :
2014
fDate :
17-19 Oct. 2014
Firstpage :
87
Lastpage :
92
Abstract :
When Ant System algorithm is used to solve combinatorial optimization problems with precedence constraints, the computation of components list that can be used to extend the current partial solution is time consuming. For every component, the algorithm tests if the precedence constraints are met. In this work, a treatment list of components is proposed, aiming to avoid the test of precedence constraints for every component and for every ant. The list is not a fixed sequence of components, but it is equivalent to a total order between predefined groups of components. Search biases can appear and some solutions are proposed. The use of this technique is exemplified by an Ant Colony Optimization algorithm for the Tasks to Workstations Assignment(TWA) problem. The effectiveness of the proposed approach is validated by computational tests.
Keywords :
ant colony optimisation; combinatorial mathematics; scheduling; task analysis; TWA problem; ant colony optimization; ant system algorithm; combinatorial optimization; precedence constraints treatment; tasks to workstations assignment; Ant colony optimization; Heuristic algorithms; Job shop scheduling; Mathematical model; Optimization; Single machine scheduling; Workstations;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
System Theory, Control and Computing (ICSTCC), 2014 18th International Conference
Conference_Location :
Sinaia
Type :
conf
DOI :
10.1109/ICSTCC.2014.6982396
Filename :
6982396
Link To Document :
بازگشت