陈应显, 韩明峰. 改进粒子群算法的露天矿路径优化研究[J]. 微电子学与计算机, 2011, 28(11): 61-64,68.
引用本文: 陈应显, 韩明峰. 改进粒子群算法的露天矿路径优化研究[J]. 微电子学与计算机, 2011, 28(11): 61-64,68.
CHEN Ying-xian, HAN Ming-feng. Improved Particle Swarm Optimization on Open-pit Vehicle Routing Problem[J]. Microelectronics & Computer, 2011, 28(11): 61-64,68.
Citation: CHEN Ying-xian, HAN Ming-feng. Improved Particle Swarm Optimization on Open-pit Vehicle Routing Problem[J]. Microelectronics & Computer, 2011, 28(11): 61-64,68.

改进粒子群算法的露天矿路径优化研究

Improved Particle Swarm Optimization on Open-pit Vehicle Routing Problem

  • 摘要: 为将面向连续优化的粒子群优化算法应用于露天矿路径优化问题的求解,提出了露天矿路径优化问题的权重编码方案.该方案将属于组合优化的露天矿路径问题转化为连续优化问题,同时保留了粒子群算法的易操作性和高效性.针对粒子群算法易陷入局部最优的问题,提出了适合露天矿路径优化问题的基于k-中心点法的改进措施,在此基础上采用k-中心点法对粒子群进行聚类分析,实现了粒子之间的信息交换,扩大了粒子的搜索空间,避免算法陷入局部最优.最后,用露天矿的实际路径节点数据验证了权重编码方案和改进粒子群算法的有效性.

     

    Abstract: To apply Particle Swarm Optimization (PSO) algorithm oriented to continuous optimization problems in solving Open-pit Vehicle Routing Problem (OVRP),A new coding method based on the priority was put forward to transform the OVRP from combinatorial optimization to continuous optimization.And the easy operation and high efficiency of the PSO were reserved.Then an innovative approach based on k-medoids algorithm was proposed with purpose of preventing PSO algorithm from local optimum.Based on this,the k-medoids algorithm was used to execute cluster analysis on the particle swarm,which made particles exchange information with each other and search the best solution in a larger solution space than ever,so as to prevent the algorithm from local optimum.Finally,the actual open-pit roulting points data were used to verify the effectiveness of the improved PSO in the OVRP.

     

/

返回文章
返回