基于多旅行商问题的应急设施服务区划分模型  

A Service Area Division Model for Emergency Facilities Based on Multiple Traveling Salesman Problem

作　　者：赵星[1] 吉康 申珂 ZHAO Xing;JI Kang;SHEN Ke(College of Civil and Transportation Engineering,Hohai University,Nanjing 210098,China)

机构地区：[1]河海大学土木与交通学院,南京210098

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

基　　金：中央高校基本科研业务费专项资金(B200202072)。

摘　　要：基于多旅行商问题,增设集散中心需求及应急服务设施资源容量约束条件,以最小化遍历区域内全部集散中心的综合旅行时间成本为优化目标,构建一种应急设施服务区划分模型,确定各应急设施的服务区范围.设计一种复合算法求解模型,首先基于P-中值选址模型的优化理念,形成初始方案;继而加入禁忌搜索算法,结合LKH求解器对模型进行迭代优化求得最优解.基于宁波市北仑区实际拓扑网络进行案例分析,验证了模型和求解方法的有效性.This paper develops a service area division model for emergency facilities based on the multiple traveling salesman problem. The model aims at minimizing the overall time cost of traversing all distribution centers. With constraints on the demand of distribution centers and the capacity of emergency facilities, the service area of each emergency facility can be determined. A hybrid algorithm is designed to obtain the optimal solution.Based on the P-median location model, an initial feasible solution is generated. The Tabu Search algorithm is then applied to search for the optimal solution combining with the LKH solver. A case study based on the realistic network topology of Beilun District, Ningbo, is carried out to verify the effectiveness of the proposed model and solution method.

关 键 词：交通工程 应急物资调度 多旅行商问题 服务区划分 突发事件 

分 类 号：U491.1[交通运输工程—交通运输规划与管理]