Abstract
The concept of portfolio management of algorithm is implemented in a new architecture based on ideas of cooperating multi-agents. Each agent is a simple genetic algorithm with identical structure but possibly different parameters. We introduce a ”resource allocation vector” to coordinate the computing resources allocated to each agent. We also encourage constructive collaboration among agents by the exchange of the individuals in the population of each genetic algorithm using an individual-migration matrix. The algorithm can be implemented in a serial computer and behaves statistically in a quasi-parallel manner. We have performed extensive statistical analysis using measures such as the mean and variance of the first passage time to solution. The existence of investment frontier in solving the Schaffer function problem is demonstrated and application to the solving of the traveling salesman problem is discussed. The results suggest a more effective way to utilize computing resources.
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
B.A. Huberman, R.M. Lukose, T. Hogg, “An economics approach to hard computational problems,” Science, Vol. 275, No. 3: 51 54, 1997
H. Markowitz, J. of Finance, Vol. 7, 77, (1952)
R. Jiang, K.Y. Szeto, Y.P. Luo, D.C. Hu, “A cooperating multi-agent approach to distrib-uted parallel genetic algorithms,” submitted to IEEE Transactions on System, Man and Cybernetics, 2001
R. Motwani, P. Raghavan, Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
J. H. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor, MI: University of Michigan Press, 1975.
D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989.
Z. J. Pan, L. S. Kan, Y. P. Chen, Evolutionary Computation. Beijing: Tsinghua University Press, and Guangxi Science and Technology Press, 1998 (In Chinese).
D. C. Hu, R. Jiang, Y. P. Luo, “An adaptive classifier system tree for extending genetics-based machine learning in dynamic environment,” Journal of Artificial Life and Robotics (Accepted as an invited paper), 2000.
S. P. Li, K. Y. Szeto, “Crytoarithmetic problem using parallel Genetic Algorithms,” Mendl’99, Brno, Czech, 1999.
K.Y. Szeto, K.H. Cheung, “Multiple time series prediction using genetic algorithms opti-mizer,” Proceedings of the International Symposium on Intelligent Data Engineering and Learning, Hong Kong, IDEAL’98, 127–133, 1998.
R. Jiang, K.Y. Szeto, Y.P. Luo, D.C. Hu, “Distributed parallel genetic algorithm with path splitting scheme for the large traveling salesman problems,” Proceedings of Conference on Intelligent Information Processing, 16th World Computer Congress 2000, Aug.21–25, 2000, Beijing, Ed. Z. Shi, B. Faltings, and M. Musen, Publishing House of Electronic Industry, 478–485, 2000.
K.Y. Szeto, K.H. Cheung, S.P. Li, “Effects of dimensionality on parallel genetic algo-rithms,” Proceedings of the 4th International Conference on Information System, Analysis and Synthesis, Orlando, Florida, USA, Vol. 2, 322 325, 1998.
K.Y. Szeto, L.Y. Fong, “How adaptive agents in stock market perform in the presence of random news: a genetic algorithm approach,” Lecture Notes in Computer Sciences Series, LNCS/LNAI, Vol. 1983, Ed. K. S. Leung, L. W. Chan, and H. Meng, Spriger-Verlag, Heidelberg, 2000, Proceeding of the Second International Conference on Intelligent Data Engineering and Automated Learning-IDEAL 2000, 505–510, 2000.
L.Y. Fong, K.Y. Szeto, “Rule extraction in rules extraction in short memory time series using genetic algorithms,” European Physics Journal B, 2000. (to appear)
R. Jiang, K.Y. Szeto, Y.P. Luo, D.C. Hu, “A genetic algorithm by coordinating exploration and exploitation: Convergence Properties and Performance Analyses,” accepted by the Chinese Journal of Computers, 2001.
R. Jiang, K.Y. Szeto, Y.P. Luo, D.C. Hu, “A entropy-estimating approach to genetic algo-rithms,” submitted to IEEE Transactions on Evolutionary Computation, 2001.
R. Tanese, “Distributed genetic algorithms,” Proceeding of 3rd International Conference on Genetic Algorithm, Lawrence Erlbaum Associates, Hillsdale, N.J, 434 439, 1989.
H. Muhlenbein, M. Schomish, J. Born, “The parallel genetic algorithm as function opti-mizer,” Parallel Computing, Vol. 17: 619 632, 1991.
J.D Schaffer, R.A. Garuana, L.J. Eshelman, et al., “A study of control parameters affecting online performance of genetic algorithms for function optimization,” Proceedings of the 3rd International Conference on Genetic Algorithms. Los Altos, 1989.
J. Beardwood, J. H. Halton, J.M. Hammersley, “The Shortest Path Through Many Points,” Proc.Cambridge Philos, Soc. 55: 299–327, 1959.
N. R. Jennings, K. Sycara, M. Wooldridge, “A roadmap of agent research and develop-ment,” Autonomous Agents and Multi-Agent Systems, Vol. 1: 7 38, 1998.
W.K.F. Lor and K.Y. Szeto, “Switching dynamics of multi-agent systems: soap froth paradigm,” IJCNN IEEE-INNS-ENNS International Joint Conference on Neural Net-works: Neural Computing: New Challenges and Perspectives for the New Millennium. Como, Italy, 24–27, 2000.
K.Y. Szeto, Xiujun Fu, and W.Y. Tam, “Universal Topological Properties of two-dimensional trivalent cellular pattern” accepted for publication in Phys. Rev. Lett. March 4, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szeto, K.Y., Jiang, R. (2002). A Quasi-Parallel Realization of the Investment Frontier in Computer Resource Allocation Using Simple Genetic Algorithm on a Single Computer. In: Fagerholm, J., Haataja, J., Järvinen, J., Lyly, M., Råback, P., Savolainen, V. (eds) Applied Parallel Computing. PARA 2002. Lecture Notes in Computer Science, vol 2367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48051-X_13
Download citation
DOI: https://doi.org/10.1007/3-540-48051-X_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43786-4
Online ISBN: 978-3-540-48051-8
eBook Packages: Springer Book Archive