非完美信息下京津冀区域物流设施选址研究  

Facility Location Design in Jing-Jin-Ji Logisitic Network under Imperfect Information

作　　者：董鹏 王喜富[1] 员丽芬[1] 

机构地区：[1]北京交通大学交通运输学院,北京100044

出　　处：《交通运输系统工程与信息》2017年第6期20-26,共7页Journal of Transportation Systems Engineering and Information Technology

基　　金：国家重点研发计划;国家自然科学基金;中央高校基本科研业务经费专项资金~~

摘　　要：针对大规模物流设施选址问题,本文构建了非完美信息下设施可靠性选址的连续逼近模型.该模型不仅考虑了设施存在损坏的可能性,而且考虑了由于信息缺失顾客无法获得设施状态且存在返回出发地的行为.由于该模型的结果无法直接确定设施选址点,因此采用Disk算法对该模型的结果进行离散化,获得物流设施选址方案.以京津冀区域物流设施选址为例,验证了该模型有效性并对设施布局特性进行了分析.最后,通过灵敏度分析探讨了不同参数对京津冀区域物流设施选址的影响.In order to deal with the large-scale facility location problems, we propose a continuum approximation（CA） model for reliable facility location with imperfect information and two trips. In this model, due to facility disruption and imperfect information, a customer cannot know the facility states before she reach them and she should return her start point after she obtains the service or gives up. Since the proposed model cannot obtain the facility layouts directly, we use Disk algorithm to discretize the results of CA model, in order to obtain the facility layouts. Taking the facility location in Jing-Jin-Ji area as example,we test the performance of the proposed model and discuss the features of facility layouts. We make sensitivity analysis to discuss the influence of different model parameters on the facility location design in Jing-Jin-Ji area.

关 键 词：物流工程 连续逼近模型 Disk算法 设施选址 非完美信息 

分 类 号：F252[经济管理—国民经济]