Abstract
Genetic Algorithms(GAs) are effective approximation algorithms which focus on “hopeful area” in searching process. However, in harder problems, it is often very difficult to maintain a favorable trade-off between exploitation and exploration. All individuals leave the big-valley including the global optimum, and concentrate on another big-valley including a local optimum often. In this paper, we define such a situation on conventional GAs as the “UV-phenomenon”, and suggest UV-structures as hard landscape structures that will cause the UV-phenomenon. We propose Innately Split Model(ISM) as a new GA model which can avoid the UV-phenomenon. We apply ISM to Job-shop Scheduling Problem (JSP), which is considered as one of globally multi-modal and UV-structural problems. It is shown that ISM surpasses all famous approximation algorithms applied to JSP.
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
K. Boese, “Cost versus Distance in the Traveling Salesman Problem,” Tech.Rep. TR-950018, UCLA CS Department, 1995 K.D. Boese and S. Muddu, “A New Adaptive Multi-Start Technique for Combinatorial Global Optimizations,” Operations Research Letters 16, pp. 101–113, 1994
Takahashi, O. “A Distance Dependent Alternation Model on Real-coded Genetic Algorithms” IEEE International Conference on Systems, Man, and Cybernetics, pp. 619–624, 1999
Ono, I. “A Real-coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distribution Crossover”, Proc. of 7th Intr. Conf. on Genetic Algorithms, pp 246–253, 1997
H. Kita: A Functional Specialization Hypothesis for Designing Genetic Algorithm, IEEE International Conference on Systems, Man, and Cybernetics (1999)
J. Sakuma, S. Kobayashi: Extrapolation-Directed Crossover for Job-shop Scheduling Problems; complementary combination with Job-based Order Crossover, GECCO 2000, to appear
Aarts, E., van Laarhoven, P., Lenstra, J and Ulder, N.: A Computational Study of Local Search Algorithms for Job-shop Scheduling, ORSA J. on Comput, Vol. 6, No. 2, pp. 118–125 (1994)
Appleegate, D. and Cook, W.: A Computational Study of the Job-shop Scheduling Problem, ORSA J. on Comput., Vol. 3, No. 2, pp. 149–156 (1991)
Giffler, B. and Thompson, G.: Algorithms for Solving Production Schedulng Problems, Oper. Res., Vol. 8, pp. 487–503 (1960)
Mattfeld, D. C., Kopfer, H. and Bierwirth, C.: Control of Parallel Population Dynamics by Social-like Behavior of Ga-individuals, 3rd PPSN (1994)
Nowicki, E. and Smutnicki, C.: A Fast Taboo Search Algorithm for the Job Shop Problem, Institute of Engineering Cybernetics, Technical University of Wroclaw, Poland., Vol. Preprinty nr 8/93 (1993)
Ono, I., Yamamura, M. and Kobayashi, S.: A Genetic Algorithm for Job-shop Scheduling Problems Using Job-based Order Crossover, Proceedings of 1996 IEEE International Conference on Evolutionary Computation, pp. 547–552 (1996)
Ono, I. and Kobayashi, S.: A Genetic Algorithm Taking Account of Characteristics Preservation for Job-shop Scheduling Problems, Proceedings of the 5th conference on Intelligent Autonomous Systems, pp. 711–718 (1998)
Ulder, N., Pesch, E., van Laarhoven, P., Bandelt, H.J. and Aarts, E.: Genetic Local Search Algorithm for the Traveling Salesman Problem, 1st PPSN, pp.109–116
Yamada, T. and Ryohei, N.: Job-shop Scheduling by Simulated Annealing Combined with Deterministic Local Search, Kluwer Academic Publishers, MA, USA (1995); Transactions of Information Processing Society of Japan Vol.37 No.4, pp.597–604(1996)
Yamada, T. and Ryohei, N.: Scheduling by Generic Local Search with Multi-Step Crossover, Proceedings of the 4th conference on 4th PPSN, pp. 960–969 (1996); Transactions of Information Processing Society of Japan Vol 38 No.6, pp.1126–1138(1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ikeda, K., Kobayashi, S. (2000). GA Based on the UV-Structure Hypothesis and Its Application to JSP. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_27
Download citation
DOI: https://doi.org/10.1007/3-540-45356-3_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41056-0
Online ISBN: 978-3-540-45356-7
eBook Packages: Springer Book Archive