摘要
本文研究有害废弃物处理站选址问题。在Ravi等研究的MAX-MIN问题的基础上,考虑了处理站点容量的因素,建立了双目标优化问题,并给出了一个多项式时间算法,该算法能够产生一个(1,ε)-近似帕累托解集合。所得结论对实际的有害废弃物处理站选址决策具有理论意义,同时也完善了已有相关研究结果。
This paper mainly focuses on the hazard materials treatment center location problem. Based on the MAX-MIN model analyzed hy 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.
出处
《运筹与管理》
CSCD
北大核心
2009年第6期70-74,共5页
Operations Research and Management Science
基金
教育部博士点基金资助项目(200806141084)
关键词
运筹学
选址
算法
废弃物
帕累托
operational research
facility location
algorithm
hazard material
Pareto
