检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华北科技学院信息与控制技术研究所,河北三河065201
出 处:《工矿自动化》2018年第4期104-108,共5页Journal Of Mine Automation
基 金:中央高校基本科研业务费资助项目(3142015013);河北省科技计划项目(15211830)
摘 要:针对露天矿运输问题,以露天矿开采能力和运输能力为约束条件,以运输费用最小为目标函数,建立了露天矿运输问题的数学模型。针对智能优化算法用于求解露天矿运输问题时容易陷入局部最优解的问题,提出了一种改进差分进化算法。该算法通过在差分进化算法中引入归一化操作,使得运输问题中的等式约束能自动成立,有利于跳出局部最优解。应用结果表明,该算法具有较好的可重复性,利用该算法对露天矿运输问题进行优化后,运输成本明显降低。Aiming at open-pit mine transportation problem,a mathematical model of the open-pit mine transportation problem was established which took production and transportation capacity of open-pit mine as constraint conditions and the minimum transportation cost as objective function.In view of problem that intelligent optimization algorithm for solving the open-pit mine transportation problem was easily getting trapped in local optimal solution, an improved differential evolution algorithm was proposed.Normalization is introduced into differential evolution algorithm which makes equality constraint in the transportation problem can be satisfied automatically and is advantageous to jump out of local optimal solution.The application results show that the algorithm has good repeatability,and transportation cost is significantly reduced by use of the algorithm to optimize the open-pit mine transportation problem.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43