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

Abstract

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

CLC Number:

F270

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.

References

[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.

Time-Satisfaction-Based Maximal Covering Location Problem

PDF (PC)

Knowledge

Cited

Abstract

Cite this article

share this article

References

Related Articles 15

Metrics

Comments

Recommended 10

[1]	LIU Jian, XU Yong, YIN Rong-rong, LIU Si-feng, LIAO Wen-he. Service Strategy Based on Expected Waiting Time of Customers in Queuing System [J]. Chinese Journal of Management Science, 2021, 29(2): 1-8.
[2]	FENG Kun, YANG Qiang, CHANG Xin-yi, LI Yan-lai. Customer Satisfaction Evaluation Method for Fresh E-commerce Based on Online Reviewsand Stochastic Dominance Rules [J]. Chinese Journal of Management Science, 2021, 29(2): 205-216.
[3]	GUO Xiao-shu, ZHANG Yan, XU Jian. Impact on Customers' Secondary Satisfaction by Apology with Assurance Management Response Strategy: Under the Moderating Eeffect of Consumers' Diverse Emotions [J]. Chinese Journal of Management Science, 2021, 29(2): 217-227.
[4]	HE Chao-lin, TU Bei, WANG Peng. The Effectiveness of Dynamic Mean-variance Portfolio: An Aspect of Time-varying Risk Tolerance [J]. Chinese Journal of Management Science, 2021, 29(1): 1-11.
[5]	WANG Zhi-ying, LI Yong-jian, LIU Xiao-di. Decision-making Method in Response to Public Opinion Crisis Considering the Satisfaction of the Public under Multiple Inducing Information [J]. Chinese Journal of Management Science, 2021, 29(1): 207-216.
[6]	ZHANG Bo, HU Wen-xiu, YANG Xi-an. Research on the Formatting Mechanism of Investor Sentiment [J]. Chinese Journal of Management Science, 2021, 29(1): 185-195.
[7]	GUO Hai-hong, LIU Xin-min. Time-Space Evolution of China's Agricultural Green Total Factor Productivity [J]. Chinese Journal of Management Science, 2020, 28(9): 66-75.
[8]	LANG Xiao, SHAO Xiao-feng. Study on Consumer-oriented Types and E-tailer's Omnichannel Decision [J]. Chinese Journal of Management Science, 2020, 28(9): 164-175.
[9]	WANG An-ning, ZHANG Qiang, PENG Zhang-lin, LU Xiao-nong, FANG Zhao. Customer Preference Model Considering Feature Sentiment and Product Parameters [J]. Chinese Journal of Management Science, 2020, 28(9): 199-208.
[10]	QIU Han-guang, ZHOU Ji-xiang, LONG Yue. Research on the Dynamic Order Acceptance in Urban Delivery Considering Customer Choice of the Last-mile Delivery Modes and Time Slots [J]. Chinese Journal of Management Science, 2020, 28(8): 114-126.
[11]	TANG Zhen-peng, WU Jun-chuan, RAN Meng, ZHANG Ting-ting. Research on The Self-exciting Effect of Chinese Stock Market Considering Investor Sentiment [J]. Chinese Journal of Management Science, 2020, 28(7): 1-12.
[12]	GUO Dong-wei, DING Gen-hong, LIU Wei. Improved Multi-Strategy Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows [J]. Chinese Journal of Management Science, 2020, 28(7): 204-211.
[13]	GAN Liu, YANG Bo. Private Benefits of Control and Optimal Equity Structure under Time-inconsistent Preferences [J]. Chinese Journal of Management Science, 2020, 28(6): 51-62.
[14]	XIONG Tao, BAO Yu-kun. Soybean Future Prices Forecasting based on Dynamic Model Averaging [J]. Chinese Journal of Management Science, 2020, 28(5): 79-88.
[15]	OUYANG Hong-bing, HUANG Kang, YAN Hong-ju. Prediction of Financial Time Series Based on LSTM Neural Network [J]. Chinese Journal of Management Science, 2020, 28(4): 27-35.