Abstract
In this study, a new Genetic Algorithm (GA) using the Tabu · Local Search mechanism is proposed. The GA described in this paper is considered a Mega Process GA, which has an effective mechanism to use massive processors, i.e., Mega Processors, in large-scale computing systems. Our proposed method has a GA-specific database that possesses information of searched space and performs a local search for the space that is not searched. Such mechanisms enable us to comprehend the quantitative rate of a searched region during the search. Using this information, the searched space can be expanded linearly as the number of computing resources increases and the exhaustive search is guaranteed under infinite computations. The proposed GA was applied to numerical test functions and the energy minimization problems of protein tertiary structures. The latter problem was performed under a heterogeneous distributed computing environment, which was built up with Grid MP produced by United Devices Inc.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Goldberg, D.E.: Genetic Algorithms in Search Optimization and Machine Learnig. Addison-Wesley, Reading (1989)
Satoh, H., Yamamura, M., Kobayashi, S.: Minimal Generation Gap Model for GAs Considering Both Exploration and Exploitation. In: Proc. of IIZUKA, pp. 494–497 (1996)
Kargupta, H.: SEARCH, polynomial complexity, and the fast messy genetic algorithm. University of Illinois at Urbana-Champaign, Urbana, IL. IlliGAL Report No. 95008 (1995)
Harik, G.R.: Linkage learning in via probabilistic modeling in the ECGA. University of Illinois at Urbana-Champaign, Urbana, IL. IlliGAL Technical Report No. 99010 (1999)
Ono, I., Kobayashi, S.: A Real-coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distribution Crossover. In: Proc. of 7th Int. Conf. on Genetic Algorithms, pp. 246–253 (1997)
Pelikan, M., Goldberg, D.E., Lobo, F.: A Survey of Optimization by Building and Using Probabilistic Models. Technical Report 99018, IlliGAL (1999)
Larranaga, P., Lozano, J.A.: Estimation of Distribution Algorithms. In: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Dordrecht (2001)
Tanese, R.: Distributed Genetic Algorithms. In: Proc. 3rd International Conference on Genetic Algorithms, pp. 434–439 (1989)
Jansen, T.: On the Analysis of Dynamic Restart Strategies for Evolutionary Algorithms. In: Proc. Parallel Problem Solving from Nature - PPSN VII, 7th International Conference, pp. 33–43 (2002)
Fukunaga, A.S.: Restart Scheduling for Genetic Algorithms. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 357–369. Springer, Heidelberg (1998)
Luke, S.: When Short Runs Beat Long Runs. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 74–80 (2001)
Maresky, J., et al.: Selectively Destructive Restart. In: Proc. of Sixth International Conference on Genetic Algorithms, pp. 144–150 (1995)
Tanimura, Y.: Parallel and Distributed Genetic Algorithm on The Cluster System and The Computational Grid. University of Doshisha, in Japanese (2003)
Imade, H., et al.: A Grid-Oriented Genetic Algorithm for Estimating Genetic Networks by S-Systems. In: Proc. SICE Annual Conf., pp. 3317–3322 (2003)
Imade, H., et al.: A framework of grid-oriented genetic algorithms for large-scale optimization in bioinformatics. In: Proc. of The Congress on Evolutionary Computation in Canberra, vol. 1, pp. 623–630 (2003)
Nakata, H., et al.: Protain structure optimizaion using Genetic Algorithm on Jojo Journal of Information Processing Society of Japan. 2002-HPC-93, 155-160 (2003) (in Japanese)
United Devices. Grid MP 4.0 Application Developer’s Guide (2003)
Pelikan, M., et al.: BOA: The Bayesian Optimization Algorithm. IlliGAL Report No. 99003 (1999)
Sakae, Y., Okamoto, Y.: Optimization of protein force-field parameters with the Protein Data bank, http://arxiv.org/abs/cond-mat/0309110
Thierens, D., Goldberg, D.E.: Elitist Recombination: an integrated selection recombination GA. In: Proceedings of the 1st IEEE Conference on Evolutionary Computation, pp. 508–512 (1994)
Jorgensen, W.L., Maxwell, D.S., Tirado-Rives, J.: Development and Testing of the OPLS All-Atom Force Field on Conformational Energetics and Properties of Organic Liquids. J. Am. Chem. Soc. 117, 11225–11236 (1996)
Kaminsky, G.A., Friesner, R.A., Tirado-Rives, J., Jorgensen, W.L.: Evaluation and Reparametrization of the OPLS-AA Force Field for Proteins via Comparison with Accurate Quantum Chemical Calculations on Peptides. J. Phys. Chem. B 105, 6474–6487 (2001)
Ikeda, K., Kobayashi, S.: Deterministic Multi-step Crossover Fusion: A Handy Crossover for GAs. In: Proceedings of 7th International Conference on Parallel Problem Solving from Nature, pp. 162–171 (2002)
Ogura, M., Hiroyasu, T., Miki, M., Okamoto, Y.: Implementation Models for Distributed Memory Architecture of Parallel Simulated Annealing using Genetic Crossover. In: Proceedings of Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, pp. 121–126 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hanada, Y., Hiroyasu, T., Miki, M., Okamoto, Y. (2005). Mega Process Genetic Algorithm Using Grid MP. In: Konagaya, A., Satou, K. (eds) Grid Computing in Life Science. LSGRID 2004. Lecture Notes in Computer Science(), vol 3370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32251-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-32251-1_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25208-5
Online ISBN: 978-3-540-32251-1
eBook Packages: Computer ScienceComputer Science (R0)