| 有害废弃物处理站选址近似帕累托集合的有效产生 |
| |
| 引用本文： | 黄铮.有害废弃物处理站选址近似帕累托集合的有效产生[J].运筹与管理,2009,18(6):70-74. |
| |
| 作者姓名： | 黄铮 |
| |
| 作者单位： | 西安交通大学管理学院,陕西,西安,710049 |
| |
| 基金项目： | 教育部博士点基金资助项目 |
| |
| 摘 要： | 本文研究有害废弃物处理站选址问题。在Ravi等研究的MAX—MIN问题的基础上，考虑了处理站点容量的因素，建立了双目标优化问题，并给出了一个多项式时间算法，该算法能够产生一个（1，ε）一近似帕累托解集合。所得结论对实际的有害废弃物处理站选址决策具有理论意义，同时也完善了已有相关研究结果。
|
| 关 键 词： | 运筹学 选址 算法 废弃物 帕累托 |
Efficient Generating of the Approximation Pareto Set for Hazard Materials Treatment Center Location Problem |
| |
| HUANG Zheng.Efficient Generating of the Approximation Pareto Set for Hazard Materials Treatment Center Location Problem[J].Operations Research and Management Science,2009,18(6):70-74. |
| |
| Authors: | HUANG Zheng |
| |
| Abstract: | This paper mainly focuses on the hazard materials treatment center location problem. Based on the MAX-MIN model analyzed by Ravi et.al, this paper considers the factor of treating capability in treatment center. It constructs a bi-objective optimization problem, and presents a polynomial-time algorithm. which generates a (1,ε)-approximation Pareto solution set. The obtained results are not only of theoretical significance for the practical hazard material treatment center location, but also improve the existing results. |
| |
| Keywords: | operational research facility location algorithm hazard material Pareto |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
