2006 | OriginalPaper | Buchkapitel
Solving a Bi-objective Flowshop Scheduling Problem by Pareto-Ant Colony Optimization
verfasst von : Joseph M. Pasia, Richard F. Hartl, Karl F. Doerner
Erschienen in: Ant Colony Optimization and Swarm Intelligence
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
In this paper we investigate the performance of pareto ant colony optimization (PACO) in solving a bi-objective permutation flowshop problem. We hybridize this technique by incorporating path relinking (PR) in four different ways. Several test instances are used to test the effectiveness of the different approaches. Computational results show that hybridizing PACO with PR improves the performance of PACO. The hybrid algorithms also show competitive results compared to other state of the art metaheuristics.