Solving a bi-objective flowshop scheduling problem by pareto-ant colony optimization

Authors:
Joseph M. Pasia;Richard F. Hartl;Karl F. Doerner
Affiliations:
Department of Mathematics, University of the Philippines-Diliman, Quezon City, Philippines;Department of Management Science, University of Vienna, Vienna, Austria;Department of Management Science, University of Vienna, Vienna, Austria
Venue:
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Year:
2006

Citing 15
Cited 6

Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
The ant colony optimization meta-heuristic

New ideas in optimization
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows

New ideas in optimization
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems

Real-World Applications of Evolutionary Computing, EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoROB, and EvoFlight
SavingsAnts for the Vehicle Routing Problem

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Bi-Criterion Optimization with Multi Colony Ant Algorithms

EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
A Hybrid Evolutionary Approach for Multicriteria Optimization Problems: Application to the Flow Shop

EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
Beam-ACO: hybridizing ant colony optimization with beam search: an application to open shop scheduling

Computers and Operations Research
Design of multi-objective evolutionary algorithms: application to the flow-shop scheduling problem

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Solving multi-criteria optimization problems with population-based ACO

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Path relinking in pareto multi-objective genetic algorithms

EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Ant colony optimization for resource-constrained project scheduling

IEEE Transactions on Evolutionary Computation
Performance assessment of multiobjective optimizers: an analysis and review

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Local search guided by path relinking and heuristic bounds

EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Dynamic Policy Modeling for Chronic Diseases: Metaheuristic-Based Identification of Pareto-Optimal Screening Strategies

Operations Research
A Pareto ant colony algorithm applied to the class integration and test order problem

ICTSS'10 Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems
An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed

Computers and Operations Research
Selecting mutation operators with a multiobjective approach

Expert Systems with Applications: An International Journal
Literature review regarding Ant Colony Optimization applied to scheduling problems: Guidelines for implementation and directions for future research

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.