Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
A New Ant Colony Optimization Algorithm with an Escape Mechanism for Scheduling Problems
verfasst von : Tsai-Duan Lin, Chuin-Chieh Hsu, Da-Ren Chen, Sheng-Yung Chiu
Erschienen in: Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Ant colony optimization (ACO) algorithm is an evolutionary technologyoften used to resolve difficult combinatorial optimization problems, such as single machine scheduling problems, flow shop or job shop scheduling problems, etc. In this study, we propose a new ACO algorithm with an escape mechanism modifying the pheromone updating rules to escape local optimal solutions. The proposed method is used to resolve a single machine total weighted tardiness problem, a flow shop scheduling problem for makespan minimization, and a job shop scheduling problem for makespan minimization. Compared with existing algorithms, the proposed algorithm will resolve the scheduling problems with less artificial ants and obtain better or at least the same, solution quality.