Uncapacitated Facility Location Problem with Multi-Type Clients

摘要：

This paper proposes a new model of facility location problem referred to as k-product uncapacitated facility location problem with multi-type clients. Under the assumption that the setting costs is zero and the shipping costs are in facilities centered metric space, it is shown that the problem with two kinds of clients is NP-complete. Furthermore a heuristic algorithm with worst case performance ratio not more than 2-1/k is presented.

关键词： heuristic algorithm complezity facility location

作者: Lisheng Wang Rongheng Li Jingui Huang

作者单位: Department of Mathematics, Hunan Normal University, Changsha 410081, China Department of Computer Education, Hunan Normal University, Changsha 410081, China

会议类型: 国际会议

会议名称: The First World Congress on Global Optimization in Engineering & Science(第一届工程与科学全局优化国际会议 WCGO2009)

会议地点: 长沙

会议语种:英文

页码: 522-528

在线出版日期: 2009-06-01（万方平台首次上网日期，不代表论文的发表时间）