并行混沌优化算法在分包商选择中的应用  

Subcontract supplier selection based on parallel chaos optimization algorithm

作　　者：邹晓玫[1] 陆丽芬[2] 修春波[2] 

机构地区：[1]天津商业大学法学院,天津300134 [2]天津工业大学电气工程与自动化学院,天津300160

出　　处：《辽宁工程技术大学学报（自然科学版）》2010年第5期895-898,共4页Journal of Liaoning Technical University (Natural Science)

基　　金：国家自然科学基金资助项目(60808020);天津商业大学科研培育基金资助项目(091116)

摘　　要：为了提高工程优化问题的寻优效率,提出一种用于求解优化问题的改进并行混沌优化算法。根据当前解中精英个体的分布情况从优化变量的定义域中划分出精搜索空间。在优化过程中,精搜索空间不断缩小,搜索概率不断增加,这可保证算法具有较快的收敛速度。同时,算法始终以一定概率保持对原搜索空间进行混沌搜索,这可保证算法始终具有全局寻优能力。函数优化以及分包商选择等组合优化问题可利用该算法进行有效求解。仿真实验结果表明:对于相同的优化问题,改进的并行混沌优化算法可以求得更好的优化解,从而证明该方法具有良好的寻优性能。A new parallel chaos optimization algorithm is proposed to improve optimization performance for engineering optimization problems. An elaborate space is selected from the origin searching space based on the distribution of superior individuals. In the process of optimization,the elaborate space is reduced and its searching probability is increased continuously,which can warrant the algorithm to have fast convergence rate. The original searching space is also searched throughout the process of optimization,which can warrant the algorithm to have the capability of global optimization. With some engineering problems,for instance,subcontract supplier selection,the algorithm can be applied effectively. Simulation results show that the better optimization solutions can be obtained using the algorithm devloped,which also proves the algorithm validity and effectiveness.

关 键 词：混沌优化 分包商选择 概率搜索 并行优化 

分 类 号：C935[经济管理—管理学]