检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:胡卉[1] 程菱[1] 宣登殿 胡大伟[1] 赵利苹[1]
机构地区:[1]长安大学汽车学院,陕西西安710064 [2]内蒙古自治区交通运输厅,内蒙古呼和浩特010020
出 处:《交通运输工程学报》2012年第4期59-66,共8页Journal of Traffic and Transportation Engineering
基 金:National Key Technology R&D in the 11th Five-year Plan of China(2009BAG13A04);Transportation Technology Project of Inner Mongolia(NJ2003-004);Special Fund for Basic Scientific Research of Central Colleges(CHD2011JC002)
摘 要:分析了传统的综合客运枢纽布局优化模型,同时增加运输模式与中转能力的约束条件,提出了改进后的综合客运枢纽布局优化模型,并设计了改进的遗传算法对其求解。应用LINGO软件进行有效性检验,分别计算了8节点与50节点Solomon标准测试数据,并将改进模型与经典算法进行比较。计算结果表明:当应用LINGO软件计算8节点Solomon标准测试数据时,平均运算时间为5 043s,最优成本为1 952 418元,应用遗传算法与MATLAB软件计算的平均运算时间为62s,最优成本为1 955 900元;当应用遗传算法与MATLAB软件计算50节点Solomon标准测试数据时,平均运算时间为574s,最优成本为8 500 600元;当计算25节点的AP数据且枢纽节点数量为3时,平均运算时间为612s,最优成本为155 148元,比经典算法降低了108元。可见,改进模型有效。The traditional optimization model of comprehensive passenger hub layout was analyzed, and the constraints of transportation mode and transfer capability were considered simultaneously. The improved optimization model of comprehensive passenger hub layout was proposed, and the improved genetic algorithm was introduced to solve the model. LINGO software was used to test the effectiveness, Solomon standard test data with 8 and 50 nodes were calculated respectively, and the improved model was compared with the classical algorithm. Calculation result shows that while calculating Solomon standard test data with 8 nodes, the average running time is 5 043 s and the optimal cost is 1 952 418 yuan by using LINGO software, the average running time is 62 s and the optimal cost is 1 955 900 yuan by using genetic algorithm and MATLAB software. While calculating Solomon standard test data with 50 nodes, the average running time is 574 s and the optimal cost is 8 500 600 yuan by using genetic algorithm and MATLAB software. While calculating AP data set with 25 nodes and hub node number is 3, the average running time is 612 s and the optimal cost is 155 148 yuan, the optimal cost decreases 108 yuancompared with the classical algorithm. So the improved model is effective. 6 tabs, 6 figs, 20 refs.
关 键 词:交通规划 客运枢纽 布局规划 二阶段优化模型 容量限制 运输模式
分 类 号:U491.12[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.90