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

Competitive Facility Location Problem Considering Customer Convenience Radius and Quality Threshold

作　　者：俞武扬[1] 简悦 YU Wu-yang;JIAN Yue(School of Management,Hangzhou Dianzi University,Hangzhou 310018,China)

机构地区：[1]杭州电子科技大学管理学院,浙江杭州310018

出　　处：《运筹与管理》2022年第7期93-99,共7页Operations Research and Management Science

基　　金：国家社科基金资助项目(17BGL182)。

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

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

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