| 一种有效求解厌恶设施选址问题的混合启发式算法 |
| |
| 引用本文： | 袁文燕,闫白鹭,吴军,李健. 一种有效求解厌恶设施选址问题的混合启发式算法[J]. 北京化工大学学报(自然科学版), 2017, 44(6): 101-105. DOI: 10.13543/j.bhxbzr.2017.06.016 |
| |
| 作者姓名： | 袁文燕 闫白鹭 吴军 李健 |
| |
| 作者单位： | 北京化工大学理学院,北京,100029;北京化工大学经济管理学院,北京,100029 |
| |
| 基金项目： | 国家自然科学基金（71571010/71372195）;北京化工大学学科建设项目（XK1522） |
| |
| 摘 要： | 由于1-maximin模型的目标函数在每条边上是分段线性的凹函数,基于1-maximin模型的这一特点,将粒子群算法和黄金分割法有机结合起来,提出了一种求解1-maximin模型的混合粒子群-黄金分割（PSO-GS）算法。数值实验表明,PSO-GS算法求解1-maximin模型和1-maxisum模型较UnCenter和Newalgorithm算法效率高。
|
| 关 键 词： | 厌恶设施选址 启发式算法 混合粒子群-黄金分割(PSO-GS)算法 |
| 收稿时间： | 2017-01-04 |
An effective hybrid heuristic algorithm for solving undesirable facility location problems |
| |
| YUAN WenYan,YAN BaiLu,WU Jun,LI Jian. An effective hybrid heuristic algorithm for solving undesirable facility location problems[J]. Journal of Beijing University of Chemical Technology, 2017, 44(6): 101-105. DOI: 10.13543/j.bhxbzr.2017.06.016 |
| |
| Authors: | YUAN WenYan YAN BaiLu WU Jun LI Jian |
| |
| Affiliation: | 1. Faculty of Science, Beijing University of Chemical Technology, Beijing 100029, China;2. School of Economics and Management, Beijing University of Chemical Technology, Beijing 100029, China |
| |
| Abstract: | The objective function of the 1-maximin model is piecewise linear and concave. Based on the characteristics of the 1-maximin model, this paper proposes a hybrid particle swarm optimization-golden section (PSO-GS) algorithm to solve the 1-maximin model effectively. Numerical experiments show that the PSO-GS algorithm solves the 1-maximin model and the 1-maxisum model more efficiently than either the UnCenter or Newalgorithm algorithms. |
| |
| Keywords: | undesirable facility location heuristic algorithm particle swarm optimization-golden section (PSO-GS) algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《北京化工大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《北京化工大学学报(自然科学版)》下载全文 |
