高速公路养护工区布局方案研究  

Research of Highway Maintenance Work Area Locations

作　　者：张争奇[1] 郭寒萍 王佳蓉[1] 

机构地区：[1]长安大学特殊地区公路工程教育部重点实验室,西安710064

出　　处：《北京工业大学学报》2015年第7期1043-1048,共6页Journal of Beijing University of Technology

基　　金：西部交通建设科技资助项目(2006-318-812-21)

摘　　要：为了有效解决高速公路养护工区布局的问题,在分析我国目前的养护管理模式弊端的基础上,提出了一些养护工区布局原则;应用图论对路网进行简化,分析养护工区选址的限制条件,建立基于集合覆盖理论的选址模型,并选用Floyd算法求解出最短线路;最后,应用贪婪启发式算法得出了陕西省高速公路养护工区布局规划图.研究结果表明:在养护工区布局时,应用集合覆盖模型和贪婪启发式算法可以得出更优的养护工区布设方案.In order to solve the problem of the highway maintenance work area layout effectively, this paper puts forward principles of maintenance work area layout on the basis of analysis of the shortcomings of the current management model in China. The graph theory is applied to simplify road network, then to analyze the restrictions of location of curing work area and establish siting model based on set covering theory, and Floyd algorithm is selected to solve the shortest path problem. Finally, the highway maintenance work area layout plans of Shaanxi province were obtained by applying greedy heuristics. Research shows that the set covering model and greed heuristic algorithm can achieve better solutions to work area layout planing.

关 键 词：高速公路 养护管理 工区选址 FLOYD算法 贪婪启发式算法 最短路问题 

分 类 号：U416[交通运输工程—道路与铁道工程]