求解无容量设施选址问题的拉格朗日蝙蝠算法
    点此下载全文
引用本文:王婷婷1,张惠珍1 ,赵玉苹2.求解无容量设施选址问题的拉格朗日蝙蝠算法[J].经济数学,2018,(3):105-110
摘要点击次数: 825
全文下载次数: 0
作者单位
王婷婷1,张惠珍1 ,赵玉苹2 (1.上海理工大学 管理学院上海 2000932.国网上海市电力公司物资公司上海 200093) 
中文摘要:无容量设施选址问题(Uncapacitated Facility Location Problem, UFLP)是一类经典的组合优化问题,被证明是一种NP-hard问题,易于描述却难于求解.首先根据UFLP的数学模型及其具体特征,重新设计了蝙蝠算法的操作算子,给出了求解UFLP的蝙蝠算法.其次构建出三种可行化方法,并将其与求解UFLP的蝙蝠算法和拉格朗日松弛算法相结合,设计了求解该问题的拉格朗日蝙蝠算法.最后通过仿真实例和与其他算法进行比较的方式,验证了该混合算法用来求解UFLP的可行性,是解决离散型问题的一种有效方式.
中文关键词:管理科学与工程  无容量设施选址问题  拉格朗日蝙蝠算法  拉格朗日松弛算法  蝙蝠算法
 
Lagrangian Bat Algorithm for Solving The Uncapacitated Facility Location Problem
Abstract:The uncapacitated facility location problem is a classical combinatorial optimization problem and has been proved an NP-hard problem, easy to describe but difficult to solve. Based on the mathematical model and specific features of UFLP, the operators of bat algorithm and proposed a bat algorithm for solving it has been redesigned. Secondly, three feasible methods were designed and lagrangian bat algorithm was presented by combining these three methods, the bat algorithm for UFLP and lagrangian relaxation algorithm. Lastly, the experimental results showed that the hybrid algorithm can feasibly solve UFLP through simulation examples and comparisons with other algorithms and it is an effective algorithm in solving the discrete problem.
keywords:management science and engineering  uncapacitated facility location problem  lagrangian bat algorithm  lagrangian relaxation algorithm  bat algorithm
查看全文   查看/发表评论   下载pdf阅读器