Multi-criteria optimization evolving artificial ants as a computational intelligence technique

This paper presents the application Ant Colony Optimization (ACO) to slve multi-criteria combinatorial optimization problems. The proposed decision support technique is validated on the Hybrid Flowshop Scheduling Problem with minimization of both the makespan and the total completion time of jobs. This problem is considered to be strongly NP-hard and has been little studied literature. Our algorithm is compared against other well-known heuristics from the literature adapted to solve this problem and experimental results show that our algorithm outperforms them.

[1]  Vladimir D. Noghin.  The Edgeworth-Pareto principle and the relative importance of criteria in the case of a fuzzy preference relation , 2003 .

[2]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[3]  Funda Sivrikaya-Serifoglu,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach , 2004, J. Oper. Res. Soc..

[4]  Jairo R. Montoya-Torres,et al.  Ant colony optimization algorithm for a Bi-criteria 2-stage hybrid flowshop scheduling problem , 2011, J. Intell. Manuf..

[5]  Jairo R. Montoya-Torres,et al.  Scheduling jobs on a k-stage flexible flow-shop , 2004, Proceedings of the 2004 IEEE Systems and Information Engineering Design Symposium, 2004..

[6]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[7]  Jatinder N. D. Gupta,et al.  Two-machine flowshop scheduling with a secondary criterion , 2003, Comput. Oper. Res..

[8]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[9]  H. Moskowitz,et al.  Generalized dynamic programming for multicriteria optimization , 1990 .

[10]  Chelsea C. White,et al.  Multiobjective A* , 1991, JACM.

[11]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[12]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[13]  David W. Scott,et al.  Multivariate Density Estimation: Theory, Practice, and Visualization , 1992, Wiley Series in Probability and Statistics.

[14]  D. W. Scott,et al.  Multivariate Density Estimation, Theory, Practice and Visualization , 1992 .

[15]  Ravi Shankar,et al.  A neuro-tabu search heuristic for the flow shop scheduling problem , 2004, Comput. Oper. Res..

[16]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[17]  Gupta J.N.D..  TWO-STAGE HYBRID FLOW SHOP SCHEDULING PROBLEM , 1988 .

[18]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..