运筹与管理 ›› 2022, Vol. 31 ›› Issue (7): 93-99.DOI: 10.12005/orms.2022.0221

• 理论分析与方法探讨 • 上一篇    下一篇

考虑顾客便利半径和质量阈值的竞争设施选址问题

俞武扬, 简悦   

  1. 杭州电子科技大学 管理学院,浙江 杭州 310018
  • 收稿日期:2020-07-21 发布日期:2022-08-17
  • 作者简介:俞武扬(1974-),男,博士,教授,研究方向:物流建模与优化、应急决策;简悦(1996-),女,硕士,研究方向:设施选址。
  • 基金资助:
    国家社科基金资助项目(17BGL182)

Competitive Facility Location Problem Considering Customer Convenience Radius and Quality Threshold

YU Wu-yang, JIAN Yue   

  1. School of Management, Hangzhou Dianzi University, Hangzhou 310018, China
  • Received:2020-07-21 Published:2022-08-17

摘要: 在竞争设施选址问题中,顾客选择行为是决定设施占领市场份额的重要因素,其描述了需求在设施之间的分配方式。为了贴近顾客真实的光顾行为,本文提出了一种考虑顾客便利半径和质量阈值的顾客选择规则,并研究了在该规则下市场中新进入公司的竞争设施选址问题。提出了一种基于排名的遗传算法(RGA)求解该问题,并将该算法与经典遗传算法(GA)和基于排名的离散优化算法(RDOA)进行了比较,结果说明了算法的有效性以及模型中质量阈值的重要性。

关键词: 竞争设施选址, 便利半径, 质量阈值, 改进遗传算法

Abstract: In competitive facility location problems, customer’s behavior rules play a key role in determining the market share captured by different facilities. They describe how demand is allocated between different facilities. In order to be close to the customer’s patronizing behavior, this paper proposes a customer behavior rule considering the distance limitation with a quality threshold to reflect this kind of customer patronage behavior. With the proposed customer behavior rule, we study the competitive facility location problem for a new entering firm in a market. To solve the problem, we propose a ranking-based genetic algorithm (RGA). The proposed algorithm is compared with the classical genetic algorithm(GA)and the ranking-based discrete optimization algorithm (RDOA). The results illustrate the effectiveness of the proposed algorithm and the importance of the quality threshold in the model.

Key words: competitive facility location, convenience radius, quality threshold, improved genetic algorithm

中图分类号: