Performance consequences of introducing an internal penalty function to a genetic algorithm for scheduling
Pages 12 - 15
Abstract
In this paper, we describe the effects of adding an internal penalty function of variable severity in a genetic algorithm used to design a schedule as opposed to using no penalty function. The use of the penalty function was found to decrease the average number of generations needed to find an optimal solution when used in moderation and to cause premature convergence when used in excess.
References
[1]
Akhshabi, M. 2010. A Genetic Algorithm for Solving a New Mathematical Model of Single Machine Scheduling with Three Criteria. Australian Journal Of Basic & Applied Sciences. 4, 11 (2010) 5564--5570.
[2]
Back, T., Fogel, D. B., Michalewicz, Z. 1997 Handbook of Evolutionary Algorithms. IOP Publishing Ltd., Bristol, UK.
[3]
Bagchi, S., Uckun, S., Miyabe, Y., & Kawamura, K. 1991. Exploring Problem-Specic Recombination Operators for Job-Shop Scheduling. Proc. of the Fourth Intl. Conf. on Genetic Algorithms, (1991) 10--17.
[4]
Bierwirth, C., Kropfer, H., Mattfeld, D. & Rixen, I. 1995. Genetic Algorithm Based Scheduling in a Dynamic Manufacturing Environment. IEEE Conf. on Evolutionary Computation, (1995), 439--443.
[5]
Burke, E. K., Newall, J. P., and Weare, R. F. 1998. Initialization strategies and diversity in evolutionary timetabling. Evolutionary Computing. 6, 1 (March 1998), 81--103. DOI=http://dx.doi.org/10.1162/evco.1998.6.1.81
[6]
Gonzalez, C., & Wainwright, R. 1994. Dynamic Scheduling of Computer Tasks Using Genetic Algorithms. Proc. of the First Intl. Conf. on Evolutionary Computation, (1994) 829--833.
[7]
Gunawan, A., Ng, K. M., and Ong, H. L. 2008. A genetic algorithm for the teacher assignment problem for a university in Indonesia. Information and Management Sciences, 19, 1 (Mar 2008), 1--16.
[8]
Hentsch, K., & Kööchel, P. 2011. Job scheduling with forbidden setups and two objectives using genetic algorithms and penalties. Central European Journal Of Operations Research, 19, 3 (2011) 285--298.
[9]
Montana, D., Brinn, M., Moore, S., Bidwell, G. 1998 "Genetic algorithms for complex, real-time scheduling," 1998 IEEE International Conference on Systems, Man, and Cybernetic, 3 (Oct 1998), 2213--2218.
[10]
Ochoa, G., Mädler-Kron, C., Rodriguez, R., and Jaffe, K. 2005. Assortative mating in genetic algorithms for dynamic problems. In Proceedings of the 3rd European conference on Applications of Evolutionary Computing (2005), Rothlauf, F., Branke, J., Cagnoni, S., Corne, D. W., and Drechsler, R. (Eds.). Springer-Verlag, Berlin, Heidelberg, 617--622. DOI=http://dx.doi.org/10.1007/978-3-540-32003-6_65
[11]
Stejić, Z., Yasufumi, T., and Hirota, K. 2003. Genetic algorithms for a family of image similarity models incorporated in the relevance feedback mechanism. Applied Soft Computing, 2, 4 (Feb. 2003), 306--327. DOI=http://dx.doi.org/10.1016/S1568-4946(02)00070-4.
Index Terms
- Performance consequences of introducing an internal penalty function to a genetic algorithm for scheduling
Recommendations
Comparative study of diversity based parallel dual population genetic algorithm for unconstrained function optimisations
The genetic algorithms GAs metaheuristic deals with large scale combinatorial optimisation problems. It is biologically inspired by the method, based on the principle of survival of the fittest. In GAs, the concept of multiple populations offers an ...
Implicit elitism in genetic search
ICONIP'06: Proceedings of the 13th international conference on Neural information processing - Volume Part IIIWe introduce a notion of implicit elitism derived from the mutation operator in genetic algorithms. Probability of mutation less than 1/l (l being the chromosome size) along with probability of crossover less than one induces implicit elitism in genetic ...
A Novel Ecological Competitive Genetic Algorithm
ISISE '08: Proceedings of the 2008 International Symposium on Information Science and Engieering - Volume 02Premature convergence is a well known problem that occurs with Genetic Algorithm (GA). Inspired by ecological competitive which can decrease survival and reproduction as the similar individuals approaches the carrying capacity, a novel Competitive ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
October 2013
529 pages
ISBN:9781450323482
DOI:10.1145/2513228
- Conference Chairs:
- Ching Y. Suen,
- Amir Aghdam,
- Minyi Guo,
- Program Chairs:
- Jiman Hong,
- Esmaeil Nadimi
Copyright © 2013 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
- SIGAPP: ACM Special Interest Group on Applied Computing
- ACCT: Association of Convergent Computing Technology
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 October 2013
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
RACS'13
Sponsor:
- SIGAPP
- ACCT
Acceptance Rates
RACS '13 Paper Acceptance Rate 73 of 317 submissions, 23%;
Overall Acceptance Rate 393 of 1,581 submissions, 25%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 41Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in