Computational Economics

, Volume 8, Issue 3, pp 159–179 | Cite as

A distributed parallel genetic algorithm for solving optimal growth models

  • Paul M. Beaumont
  • Patrick T. Bradshaw
Article

Abstract

We use a distributed parallel genetic algorithm (DPGA) to fund numerical solutions to a single state deterministic optimal growth model for both the infinite and finite horizon cases. To evaluate the DPGA we consider a version of the Taylor-Uhlig problem for which the analytical solutions are known. The first-order conditions for the infinite horizon case lead to a nonlinear integral equation whose solution we approximate using a Chebyshev polynomial series expansion. The DPGA is used to search the parameter space for the optimal fit for this function. For the finite horizon case the DPGA searches the state space for a sequence of states which maximize the agent's discounted utility over the finite horizon. The DPGA runs on a cluster of up to fifty workstations linked via PVM. The topology of the function to be optimized is mapped onto each node on the cluster and the nodes essentially complete with one another for the optimal solution. We demonstrate that the DPGA has several useful features. For instance, the DPGA solves the exact Euler equation over the full range of the state variable and it does not require an accurate initial guess. The DPGA is easily generalized to multiple state problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beaumont, P. and R. Walker, 1994. Land Degradation and Property Regimes, Florida State University, Supercomputer Computations Research Institute, mimeo.Google Scholar
  2. Beaumont, Paul M. and Lili Yuan, 1993, Function Optimization Using a Distributed Parallel Genetic Algorithm, Florida State University, Supercomputer Computations Research Institute Technical Report FSU-SCRI-93T-36.Google Scholar
  3. Beguelin, A., Dongarra, J., Geist, A., Manchek, B., and V. Sunderam, 1991, A User's Guide to PVM: Parallel Virtual Machine, Technical Report ORNL/TM-11826, Oak Ridge National Laboratory, Engineering Physics and Mathematics Division, Mathematical Sciences Section.Google Scholar
  4. Booker, L., 1987, Improving Search in Genetic Algorithms, In:Genetic Algorithms and Simulated Annealing, ed. L. Davis. Morgan Kaufmann: 61–73.Google Scholar
  5. Christiano, L.J. and J.D.M. Fisher, 1994, Algorithms for Solving Dynamic Models with Occasionally Binding Constraints, Paper presented at the IFAC Meeting on Computational Methods in Economics and Finance, Amsterdam, June 8–10.Google Scholar
  6. De Jong and A. Kenneth, 1975, An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD. thesis, Dept. of Computer and Comm. Sciences, Univ. of Michigan, Ann Arbor, MI, Univ. Microfilms No. 76-9381.Google Scholar
  7. Forrest, Stephanie, 1993, Genetic Algorithms: Principles of Natural Selection Applied to Computation,Science 261: 872–878.Google Scholar
  8. Goldberg, D.E., 1989,Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley.Google Scholar
  9. Gorges-Schleuter, M., 1991, Explicit Parallelism of Genetic Algorithms through Population Structures,Parallel Problem Solving from Nature, Springer Verlag: 150–159.Google Scholar
  10. Holland, J.H., 1975,Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI.Google Scholar
  11. Holland, J.H., 1992, Genetic Algorithms,Scientific American: 66–72.Google Scholar
  12. Judd, Kenneth L., 1991, Numberical Methods in Economics, Unpublished manuscript, Hoover Institution.Google Scholar
  13. Judd, Kenneth L., 1992, Projection Methods for Solving Aggregate Growth Models,Journal of Economic Theory 58: 410–452.Google Scholar
  14. Koza, J.R., 1992, Genetic Programming, MIT Press, Cambridge, MA.Google Scholar
  15. Manderick, B., and P. Spiessens, 1989, Fine-Grained Parallel Genetic Algorithms, In:Proceedings of the Third International Conference on Genetic Algorithms, ed. J.D. Schaffer, Morgan Kaufmann Publishers, Inc: 428–433.Google Scholar
  16. Marcet, A., 1988, Solving Nonlinear Stochastic Growth Models by Parameterizing Expectations, Carnegie-Mellon University, mimeo.Google Scholar
  17. Mercenier Jean and Philippe Michel, 1994, Discrete-Time Finite Horizon Approximation of Infinite Horizon Optimization Problems with Steady-State Invariance,Econometrica 62, 3: 635–656.Google Scholar
  18. Mühlenbein, H., Schomisch, M., and J. Born, 1991, The Parallel Genetic Algorithm as Function Optimizer,Parallel Computing 17: 619–632.Google Scholar
  19. Radcliffe, Nicholas, 1991, Equivalence Class Analysis of Genetic Algorithms,Complex Systems 5: 183–205.Google Scholar
  20. Schraudolph, N.N. and Richard K. Belew, 1992, Dynamic Parameter Encoding for Genetic Algorithms,Machine Learning 9: 9–21.Google Scholar
  21. Schraudolph, N.N. and J.J. Grefenstette, 1992, A User's Guide to GAUCSD 1.4., Technical Report CS92-249, CSE Department, UC San Diego.Google Scholar
  22. Starkweather, T., Whitley, D. and K. Mathias, 1991, Optimization Using Distributed Genetic Algorithms,Parallel Problem Solving from Nature, Springer Verlag.Google Scholar
  23. Tanese, R., 1989, Distributed Genetic Algorithms. In:Proceedings of the Third International Conference on Genetic Algorithms, ed. J.D. Schaffer, Morgan Kaufmann Publishers, Inc: 434–440.Google Scholar
  24. Taylor, John B. and Harald Uhlig, 1990, Solving Nonlinear Stochastic Growth Models: A Comparison of Alternative Methods,Journal of Business and Economic Statistics 8: 1–17.Google Scholar
  25. Whitley, D. and T. Starkweather, 1990, Genitor II: a Distributed Genetic Algorithm,Journal Expt. Theor. Artif. Intell. 2: 189–214.Google Scholar

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • Paul M. Beaumont
    • 1
  • Patrick T. Bradshaw
    • 1
  1. 1.Supercomputer Computations Research Institute and Department of EconomicsFlorida State UniversityTallahasseeUSA

Personalised recommendations