计算机应用研究2017，Vol.34Issue(8)：2372-2375,4.DOI:10.3969/j.issn.1001-3695.2017.08.031
二进制中心引力优化算法及其在非线性0-1规划中的应用
Binary central force optimization algorithm and its application innonlinear 0-1 programming
摘要
Abstract
To solve nonlinear 0-1 programming problems, this paper proposed a binary CFO (BCFO).It used the gravitational force to calculate the acceleration of the object, and employed the acceleration to update the position.To transform from the continuous position variables to discrete 0-1 variables, it adopted transfer functions,and used the benchmarks of nonlinear 0-1 programming problems to perform numerical experiments.It implemented performance comparison of BCFO, binary particle swarm optimization algorithm, and binary gravitational search algorithm using the set of benchmark test problems.The experimental results demonstrate that the proposed algorithm has significant advantages in the stability of solutions and computational accuracy.This paper provides a new method to solve the nonlinear 0-1 programming problems.关键词
中心引力优化算法/转换函数/二进制/确定性Key words
central force optimization algorithm/transfer functions/binary/deterministicness分类
信息技术与安全科学引用本文复制引用
刘勇,马良..二进制中心引力优化算法及其在非线性0-1规划中的应用[J].计算机应用研究,2017,34(8):2372-2375,4.基金项目
国家自然科学基金资助项目(71401106) （71401106）
国家教育部人文社会科学规划项目(16YJA630037) （16YJA630037）
上海市高原学科建设项目 （）
上海高校青年教师培养计划资助项目(ZZSL15018) （ZZSL15018）
上海理工大学国家级培育青年基金资助项目(16HJPY-QN15) （16HJPY-QN15）
上海理工大学博士科研启动经费项目(1D-15-303-005) （1D-15-303-005）
