Simulated parallel annealing within a neighborhood for optimization of biomechanical systems
Simulated parallel annealing within a neighborhood for optimization of biomechanical systems
复制标题
DOI：
10.1016/j.jbiomech.2004.08.010
复制
发表时间：
2005-09-01
影响因子：
2.4
通讯作者：
Anderson, FC
中科院分区：
文献类型：
--
作者：
Higginson, JS;Neptune, RR;Anderson, FC
生物力学系统的优化问题已经变得极其复杂。模拟退火（SA）算法在各种测试问题和生物力学应用中表现良好；然而，尽管计算机速度在进步，收敛到最优解的系统，甚至中等复杂性仍然是令人望而却步的。本研究的目的是开发一种便携式并行版本的SA算法，用于解决生物力学中的优化问题。邻域内模拟并行退火（SPAN）算法既能最大限度地减少处理器间通信时间，又能保持串行退火算法的启发式。对于简单的二次测试问题和较为复杂的人体踏踏板前向动态模拟问题，SPAN算法的计算速度与不同计算机平台上的处理器数量成线性关系。(C) 2004 Elsevier Ltd.版权所有。
Optimization problems for biomechanical systems have become extremely complex. Simulated annealing (SA) algorithms have performed well in a variety of test problems and biomechanical applications; however, despite advances in computer speed, convergence to optimal solutions for systems of even moderate complexity has remained prohibitive. The objective of this study was to develop a portable parallel version of a SA algorithm for solving optimization problems in biomechanics. The algorithm for simulated parallel annealing within a neighborhood (SPAN) was designed to minimize interprocessor communication time and closely retain the heuristics of the serial SA algorithm. The computational speed of the SPAN algorithm scaled linearly with the number of processors on different computer platforms for a simple quadratic test problem and for a more complex forward dynamic simulation of human pedaling. (C) 2004 Elsevier Ltd. All rights reserved.