Fuzzy Dependent-chance Programming Using Ant Colony Optimization Algorithm and Its Convergence
-
摘要: 模糊相关机会规划(Fuzzy dependent-chance programming, FDCP)因其非线性、非凸性及模糊性,对经典的优化理论提出了极大的挑战. 本文为解决复杂的模糊相关机会规划问题设计了一种基于模糊模拟的蚁群优化算法, 证明了该算法的收敛性,并通过估算期望收敛时间以分析蚁群优化算法的收敛速度. 数值案例研究验证了该算法的有效性、稳定性及准确性.Abstract: The mathematical problems of fuzzy dependent-chance programming (FDCP) pose significant computational challenges due to their non-linear, non-convex, and fuzzy nature. A fuzzy simulation based algorithm is designed for solving the random FDCP problem. The proof of convergence is developed. The convergence speed of the ant colony optimization (ACO) algorithm is analyzed by estimating the expected convergence time. A numerical example is presented to show the potential applications of the random programming as well as the efficiency, stability and accuracy of the proposed algorithm.
计量
- 文章访问数: 1710
- HTML全文浏览量: 23
- PDF下载量: 1233
- 被引次数: 0