摘要
针对空铁联运网络具体联运路径的设计问题,借鉴枢纽航线网络p-枢纽中位问题的研究思想,将非枢纽城市间可以直航考虑进去,以联运网络总成本最低为目标函数,构建了允许直航的空铁联运网络混合整数规划模型,并设计了基于遍历搜索的最短路算法来求解模型.最后选取样本城市对模型和算法进行算例分析,给出了不同参数组合下的最优目标值和具体联运路径,设计了中国14个城市的空铁联运网络.算例结果表明联运总成本大小和联运路径的数目与枢纽数目m、折扣系数ρ紧密相关:m越大,ρ越小,联运总成本越小,联运路径数目越多;反之亦然.
In order to solve the problem of designing the specific paths for the air-rail network,according to the research method for the p-hub median problem of hub and spoke network,a mixed integer programming model is established,direct flight is permitted in this model,with the minimum total transportation cost as the objective function.The model is solved using the shortest path algorithm which is based on traversal and search method.Finally,sample cities are selected to be applied to the model and its algorithm.The optimized objective value and specific paths are calculated with different variable parameters,and the air-rail network of China＇s fourteen cities is constructed.The result shows the close relationship among the minimum total transportation cost,the number of specific paths,number of hubs-m and the discount factor-p.The bigger the value of mand the smaller the value of p,then the smaller total transportation cost and the more specific paths;vice versa.
作者
徐凤
朱金福
苗建军
杨文东
XU Feng ZHU Jin-fu MIAO Jian-jun YANG Wen-dong(Department of Transportation Management, NanJing Communications Institute of Technology, Nanjing, 211188, China Department of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China Department of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China)
出处
《数学的实践与认识》
北大核心
2016年第19期117-124,共8页
Mathematics in Practice and Theory
基金
国家自然科学基金(71171111
71201081)
教育部人文社会科学研究规划基金项目(15YJA790046)
江苏高校哲学社会科学研究项目(2015SJB269)
关键词
综合交通运输
网络设计
遍历搜索
空铁联运网络
算法设计
integrated transportation
network design
traversal and search
air-rail network
algorithm design
