废弃物处理站选址问题的和谐搜索算法  

Harmony Search Algorithm for End-of-Life Items Disposal Facilities' Location Problem

作　　者：韩毅[1] 蔡建湖[1] 周根贵[1] 李延来[2] 宋平[1] 

机构地区：[1]浙江工业大学经贸管理学院,杭州310023 [2]西南交通大学物流学院,成都610031

出　　处：《计算机科学》2011年第6期255-258,共4页Computer Science

基　　金：国家自然科学基金(70971017);浙江省自然科学基金(Y1100854);浙江省教育厅研究项目(Y201016979);教育部人文社会科学研究项目(10YJC630009);浙江省哲学社科规划课题(10CGGL21YBQ)资助

摘　　要：近年来,随着人们环保意识的增强和环保法规力度的加大,逆向物流逐渐受到人们的关注与重视。废弃物处理站的选址问题(end-of-life items disposal facilities’location problem,EIDFLP)是逆向物流研究领域的关键问题,该问题能否有效解决直接关系到人们的日常生活环境能否得到有效改善。针对文献中的具有多个目标的EIDFLP,首先将问题转化为单目标问题,之后采用一种新颖的和谐搜索优化算法(harmony search algorithm,HSA)对问题进行了求解。计算结果显示:1)本算法的最优解与文献中的最优解相同;2)本算法的计算时间明显少于文献中算法的计算时间;3)原文献中的一个解存在错误之处。In recent years,with the enforcement of people＇s environmental protection awareness and the improvement of environmental protection regulation,more and more focuses and importance are attached on reverse logistics.End-of-life items disposal facilities＇ location problem（EIDFLP） is a key research direction in reverse logistics research.Whether the EIDFLP can be effectively solved is directly related to the degree of improvement on people＇s daily life.In this paper,for solving a multi-objective EIDFLP from literature,the multi-objective EIDFLP was transformed into a single-objective problem and then a novel harmony search algorithm（HSA） was proposed.Through the computational results,we found that the best result of HSA is the same as that in literature,the computational time is much less than that of algorithm in literature and there are some errors in a reported solution.

关 键 词：逆向物流 选址问题 多目标 和谐搜索算法 

分 类 号：TP29[自动化与计算机技术—检测技术与自动化装置]