| A hybrid parallel algorithm for complex decision problem optimization | |
| Luo, Yan1; Yu, Changrui2 | |
| 2007 | |
| DOI | 10.1109/SNPD.2007.437 |
| 页码 | 745-+ |
| 英文摘要 | In this paper, there is an attempt to develop a parallel version of the simulated annealing (SA) algorithm. Firstly, this paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of the algorithm. Secondly, the paper introduces the SA algorithm and incorporates the ideas of SA into two of the arithmetic operators of NP algorithm to form the combined NP/SA algorithm. Moreover, the paper presents the explicit optimization procedure of the hybrid parallel algorithm NP/SA. The NP/SA algorithm adopts the global optimization ability of NP algorithm and the local search ability of SA algorithm so that it improves the optimization efficiency and the convergence rate. This paper also illustrates the parallel NP/SA algorithm through an optimization example. |
| 会议录出版者 | IEEE COMPUTER SOC |
| 会议录出版地 | 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA |
| 语种 | 英语 |
| WOS研究方向 | Computer Science |
| WOS记录号 | WOS:000250429500141 |
| 内容类型 | 会议论文 |
| 源URL | [http://10.2.47.112/handle/2XS4QKH4/3247]  |
| 专题 | 上海财经大学 |
| 作者单位 | 1.Shanghai Jiao Tong Univ, Sch Management, Shanghai 200052, Peoples R China; 2.Shanghai Univ Finance & Econ, Sch Informat Management & Engn, Shanghai 200433, Peoples R China |
| 推荐引用方式 GB/T 7714 | Luo, Yan,Yu, Changrui. A hybrid parallel algorithm for complex decision problem optimization[C]. 见:. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论