基于时间满意的最大覆盖选址问题

中国管理科学 ›› 2006, Vol. ›› Issue (2): 45-51.

基于时间满意的最大覆盖选址问题

马云峰¹, 杨超², 张敏², 郝春艳²

1. 武汉科技大学管理学院, 武汉, 430081;
2. 华中科技大学管理学院, 武汉, 430074

收稿日期:2005-09-10 修回日期:2006-03-20 出版日期:2006-04-28 发布日期:2012-03-07
基金资助:
国家自然科学基金资助项目(70271027)

Time-Satisfaction-Based Maximal Covering Location Problem

MA Yun-feng¹, YANG Chao², ZHANG Min², HAO Chun-yan²

1. School of Management, Wuhan University of Science & Technology, Wuhan 430081, China;
2. School of Management, Huazhong University of Science & Technology, Wuhan 430074, China

Received:2005-09-10 Revised:2006-03-20 Online:2006-04-28 Published:2012-03-07

摘要/Abstract

摘要： 传统的选址问题过于简单地考量时间这一对企业竞争力影响重大的因素,结合这一特点,本文对时间满意度函数进行了定义并提出了基于时间满意的最大覆盖选址问题。给定的网络G(V,A)中,在总的顾客对服务站响应速度的满意程度最大的目标下建立了最大覆盖选址问题模型,我们在讨论了问题的特点之后给出了基于拉格朗日松驰的启发式算法,并通过MATLAB进行了编程计算实验,分析了实验结果。

关键词: 覆盖选址, 满意, 服务站, 时间

Abstract: The classical facility location problems think little of time,which is a critical issue for a company to gain its competitive advantage nowadays.In the light of this situation,this paper defined the time satisfaction function and presented the Time-Satisfaction-Based Maximal Covering Location Problem(TSBMCLP).Given a discrete network G(V,A),we formulated TSBMCLP as an integer programming under the goal of maximizing the total satisfaction of customers to the service facility's response time.After investigating the characteristics of TSBMCLP,we provided a heuristic algorithm based on Lagrangian relaxation and coded the algorithm in MATLAB to solve the range of problems considered,the computational result was analyzed after experiment.

Key words: covering location problems, satisfaction, service facility, time

中图分类号:

F270

马云峰, 杨超, 张敏, 郝春艳. 基于时间满意的最大覆盖选址问题[J]. 中国管理科学, 2006, (2): 45-51.

MA Yun-feng, YANG Chao, ZHANG Min, HAO Chun-yan. Time-Satisfaction-Based Maximal Covering Location Problem[J]. Chinese Journal of Management Science, 2006, (2): 45-51.

参考文献

[1] Vikas Mittal and Wagner A.Kamakura,Satisfaction,Repurchase Intent,and Repurchase Behavior:Investigation the Moderating Effect of Customer Characteristics[J].Journal of Marketing Research,2001,38:131-142.
[2] Brandeau ML,Chui SS.An overview of representative problems in location research[J].Management Science,1989,35(6):645-674.
[3] Marianov V,ReVelle C.Siting emergency services,ln:Drezner Z,editor.Facility location[M].Berlin:Springer,1995:199-223.
[4] Church RL,ReVelle C.The maximal covering location problem[J].Papers of Regional Science Association,1974,32:101-118.
[5] Church RL,Meadows ME.Location modeling utilizing maximum service distance criteria[J].Geographical Analysis,1979,11:358-373.
[6] Berman O.The p maximal cover-p partial center problem on networks[J].European Journal of Operation Research,1994,72:432-442.
[7] Kolen A,Tamir A.Covering problems.In:Mirchandani P,Francis RL,editors.Discrete location theory[M].New York,Wiley,1990:263-304.
[8] Hochbaum DS,Pathria A.Analysis of the greedy approach in the problems of maximum k-coverage[J].Naval Research Logistics,1998,45:615-627.
[9] Oded Berman,Dmitry Krass.The generalized maximal covering location problem[J].Computers & Operations Research,2002,29:563-581.
[10] Oded Berman,Dmitry Krass,Zvi Drezner.The gradual covering decay location problem on a network[J].European Journal of Operational Reseach,2003,151:474-480.
[11] Orhan Karasakal,Esra K.Karasakal.A maximal covering location model in the presence of partial coverage[J].Computers & Operations Research,2004,31:1515 -1526.
[12] 周伯生,樊东平.零时间:21世纪企业的概念构架[J].中国机械工程,2000,11(2):S9-92.
[13] 菲利普·科特勒.市场营销管理(亚洲版)[M].北京,中国人民大学出版社,1998.
[14] Saaty,T.L.Fundamentals of Decision Making and Priority Theory with the Analytic Hierarchy Process[M].RWS Publications,1994.
[15] Susan Hesse Owen,Mark S.Daskin.Strategic facility location:Areview[J].European Journal of Operation Research,1998,111:423-447.
[16] 杨波,梁樑,唐启鹤.物流配送中心选址的随机数学模型[J].中国管理科学,2002,10(5):57-61.
[17] 杨波.多品种随机数学模型的物流配送中心选址问题[J].中国管理科学,2003,11(2):45-49.
[18] Fisher ML.The Lagrangean relaxation method for solving integer programming problems[J].Management Science,1981,27(1):1-18.
[19] Sridharan RA.Lagrangean heuristic for the capacitated plant location problem with side constraints[J].Journal of Operational Research Society,1991,42 (7):579-585.
[20] Agar MC,Salhi S.Lagrangean heuristics applied to a variety of large capacitated plant location problems[J].Journal of Operational Research Society,1998,49:1072-1084.
[21] Galvao RD,Espejo LGA,Bo8ey B.A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem[J].European Journal of Operational Research,2000,124:377-389.
[22] Mark S.Daskin,Network and Disctete Location:Models,Algorithms,and Applications[M].New York,Wiley Interscience,1995.