The Merits of a Parallel Genetic Algorithm in Solving Hard Optimization Problems
Author:
van Soest A. J. Knoek1, Casius L. J. R. Richard1
Affiliation:
1. Faculty of Human Movement Sciences Institute for Fundamental and Clinical Human Movement Sciences, Free University Amsterdam, van der Boechorststraat 9, NL 1081 Amsterdam, The Netherlands
Abstract
A parallel genetic algorithm for optimization is outlined, and its performance on both mathematical and biomechanical optimization problems is compared to a sequential quadratic programming algorithm, a downhill simplex algorithm and a simulated annealing algorithm. When high-dimensional non-smooth or discontinuous problems with numerous local optima are considered, only the simulated annealing and the genetic algorithm, which are both characterized by a weak search heuristic, are successful in finding the optimal region in parameter space. The key advantage of the genetic algorithm is that it can easily be parallelized at negligible overhead.
Publisher
ASME International
Subject
Physiology (medical),Biomedical Engineering
Reference18 articles.
1. Pandy, M. G., Anderson, F. C., and Hull, D. G., 1992, “A Parameter Optimization Approach for the Optimal Control of Large-scale Musculoskeletal Systems,” J. Biomech. Eng., 114(4), pp. 450–460. 2. Nelder, J. A., and Mead, R., 1965, “A Simplex Method for Function Minimization,” Comput. J. (Switzerland), 7, pp. 308–315. 3. Fletcher, R., 1987, “Practical Methods of Optimization,” 2nd Edition, John Wiley & Sons Ltd., Chichester. 4. Kirkpatrick, S., Gelatt, Jr., C. D. and Vecchi, M. P., 1983, “Optimization by Simulated Annealing,” Science, 220(4598), pp. 671–680. 5. Corana, A., Marchesi, M., Martini, C., and Ridella, S., 1987, “Minimizing Multimodal Functions of Continuous Variables with the “Simulated Annealing” Algorithm,” ACM Trans. Math. Softw., 13(3), pp. 262–280.
Cited by
53 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
|
|