Abstract
The aim of this paper is to show the influence of genetic operators such as crossover and mutation on the performance of a genetic algorithm (GA). The GA is applied to the multi-objective permutation flowshop problem. To achieve our goal an experimental study of a set of crossover and mutation operators is presented. A measure related to the dominance relations of different non-dominated sets, generated by different algorithms, is proposed so as to decide which algorithm is the best. The main conclusion is that there is a crossover operator having the best average performance on a very specific set of instances, and under a very specific criterion. Explaining the reason why a given operator is better than others remains an open problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Armentano, V. A., and Ronconi, D. P.: Tabu search for total tardiness minimization in flowshop scheduling problems. Computers & Operations Research, Vol. 26 (1999) 219–235
Bagchi, T. P.: Multiobjective Scheduling by Genetic Algorithm. Kluwer Academic Publishers (1999)
Basseur, M., Seynhaeve, F., Talbi E.: Design of multi-objective evolutionary algorithms: Application to the flow-shop scheduling problem. Congress on Evolutionary Computation (2002) 459–465
Bierwirth, C., Mattfeld, D. C., Kopfer, H.: On Permutation Representations for Scheduling Problems. In Proceedings of Parallel Problem Solving from Nature. Lecture Notes in Computer Science, Vol. 1141. Springer-Verlag, Berlin Heidelberg New York (1996) 310–318
C. Brizuela, Y. Zhao, N. Sannomiya.: Multi-Objective Flowshop: Preliminary Results. In Zitzler, E., Deb, K., Thiele, L., Coello Coello, C. A., Corne D., eds., Evolutionary Multi-Criterion Optimization, First International Conference, EMO 2001, vol. 1993 of LNCS, Berlin: Springer-Verlag (2001) 443–457
Coello Coello, C. A.: A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques. Knowledge and Information Systems, Vol. 1, No. 3 (1999) 269–308
Coello Coello, C. A., Van Veldhuizen, D. A., and Lamont, G. B.: Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic Publishers (2002)
Deb, K.: Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems. Evolutionary Computation, 7(3) (1999) 205–230
Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons (2001)
M. R. Garey, D. S. Johnson and Ravi Sethi.: The Complexity of Flowshop and Jobshop Scheduling. Mathematics of Operations Research, Vol. 1, No. 2 (1976) 117–129
Gen, M. and Cheng, R.: Genetic Algorithms & Engineering Design. John Wiley & Sons (1997)
Gen, M. and Cheng, R.: Genetic Algorithms & Engineering Optimization. John Wiley & Sons (1997)
Golberg, D.: Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley (1989)
Isibuchi, H. and Murata, T.: Multi-objective Genetic Local Search Algorithm. Proceedings of the 1996 International Conference on Evolutionary Computation (1996) 119–124
Isibuchi, H. and Murata, T.: Multi-objective Genetic Local Search Algorithm and its application to flowshop scheduling. IEEE Transactions on Systems, Man, and Cybernetics — Part C: Applications and Reviews, 28(3) (1998) 392–403
Knowles J. and Corne D.: On Metrics for Comparing Nondominated Sets. Proceedings of the 2002 Congress on Evolutionary Computation (2002) 711–716
Tamaki, H., and Nishino, E.: A Genetic Algorithm approach to multi-objective scheduling problems with regular and non-regular objective functions. Proceedings of IFAC LSS’98 (1998) 289–294
Srinivas, N. and Deb, K.: Multi-Objective function optimization using nondominated sorting genetic algorithms. Evolutionary Computation, 2(3) (1995) 221–248
Van Veldhuizen, D. and Lamont, G.: On measuring multiobjective evolutionary algorithm performance. Proceedings of the 2000 Congress on Evolutionary Computation (2000) 204–211
Zitzler E., Laumanns M., Thiele L., Fonseca C. M., Grunert da Fonseca V.: Why Quality Assesment of Multiobjective Optimizers Is Difficult. Proceedings of the 2002 Genetic and Evolutionary Computation Conference (GECCO2002) (2002) 666–673
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brizuela, C.A., Aceves, R. (2003). Experimental Genetic Operators Analysis for the Multi-objective Permutation Flowshop. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds) Evolutionary Multi-Criterion Optimization. EMO 2003. Lecture Notes in Computer Science, vol 2632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36970-8_41
Download citation
DOI: https://doi.org/10.1007/3-540-36970-8_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-01869-8
Online ISBN: 978-3-540-36970-7
eBook Packages: Springer Book Archive