二进制中心引力优化算法及其在非线性0.pdf

优先出版 计 算 机 应 用 研 究 第33 卷 二进制中心引力优化算法及其在非线性0-1 规划中的应用* 刘 勇，马 良 (上海理工大学 管理学院，上海 200093) 摘 要：为求解非线性0-1 规划问题，提出了一种二进制中心引力优化算法。根据引力计算加速度，利用加速度更新位 置，采用转换函数实现连续的位置变量到离散的0-1 变量的变换。采用典型的非线性0-1 规划测试问题进行数值实验， 并将算法与二进制粒子群优化算法和二进制引力搜索算法进行比较。实验结果表明在解的稳定性和计算精度两个方面本 文给出的算法具有显著优势，为非线性0-1 规划问题的求解提供了新方法。 关键词：中心引力优化算法；转换函数；二进制；确定性 中图分类号：TP301.6 Binary central force optimization algorithm and its application in nonlinear 0-1 programming Liu Yong, Ma Liang (Business School, University of Shanghai for Science Technology, Shanghai 200093, China) Abstract: Central Force Optimization (CFO) algorithm is a novel metaheuristic optimization technique, which is based on the Law of Universal Gravitation. The most significant difference between CFO and other metaheuristics is that CFO is completely deterministic. There is no random factor in CFO. To solve nonlinear 0-1 programming problems, a binary CFO (BCFO) is proposed in this paper. The gravitational force is used to calculate the acceleration of the object. The acceleration is employed to update the position. To transform from the continuous position variables to discrete 0-1 variables, transfer functions are adopted. The benchmarks of nonlinear 0-1 programming problems are used to perform numerical experiments. Performance comparison of BCFO, binary particle swarm optimization algorithm, and binary gravitational search algorithm are implemented 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 metho