A solution to compute the optimal path based on a single-line-single-directional（SLSD）road network model is proposed.Unlike the traditional road network model,in the SLSD conceptual model,being single-directional an...A solution to compute the optimal path based on a single-line-single-directional（SLSD）road network model is proposed.Unlike the traditional road network model,in the SLSD conceptual model,being single-directional and single-line style,a road is no longer a linkage of road nodes but abstracted as a network node.Similarly,a road node is abstracted as the linkage of two ordered single-directional roads.This model can describe turn restrictions,circular roads,and other real scenarios usually described using a super-graph.Then a computing framework for optimal path finding（OPF）is presented.It is proved that classical Dijkstra and A algorithms can be directly used for OPF computing of any real-world road networks by transferring a super-graph to an SLSD network.Finally,using Singapore road network data,the proposed conceptual model and its corresponding optimal path finding algorithms are validated using a two-step optimal path finding algorithm with a pre-computing strategy based on the SLSD road network.展开更多
This is the first of a three-part series of pape rs which introduces a general background of building trajectory-oriented road net work data models, including motivation, related works, and basic concepts. The p urpos...This is the first of a three-part series of pape rs which introduces a general background of building trajectory-oriented road net work data models, including motivation, related works, and basic concepts. The p urpose of the series is to develop a trajectory-oriented road network data mode l, namely carriageway-based road network data model (CRNM). Part 1 deals with t he modeling background. Part 2 proposes the principle and architecture of the CR NM. Part 3 investigates the implementation of the CRNM in a case study. In the p resent paper, the challenges of managing trajectory data are discussed. Then, de veloping trajectory-oriented road network data models is proposed as a solution and existing road network data models are reviewed. Basic representation approa ches of a road network are introduced as well as its constitution.展开更多
This is the second of a three-part series of papers which presents the principle and architecture of the CRNM, a trajectory-oriented, carriageway-based road network data model. The first part of the series has introdu...This is the second of a three-part series of papers which presents the principle and architecture of the CRNM, a trajectory-oriented, carriageway-based road network data model. The first part of the series has introduced a general background of building trajectory-oriented road network data models, including motivation, related works, and basic concepts. Based on it, this paper describs the CRNM in detail. At first, the notion of basic roadway entity is proposed and discussed. Secondly, carriageway is selected as the basic roadway entity after compared with other kinds of roadway, and approaches to representing other roadways with carriageways are introduced. At last, an overall architecture of the CRNM is proposed.展开更多
This is the final of a three-part series of papers which mainly discusses the implementation issues of the CRNM. The first two papers in the series have introduced the modeling background and methodology, respectively...This is the final of a three-part series of papers which mainly discusses the implementation issues of the CRNM. The first two papers in the series have introduced the modeling background and methodology, respectively. An overall architecture of the CRNM has been proposed in the last paper. On the basis of the above discusses, a linear reference method (LRM) for providing spatial references for location points of a trajectory is developed. A case study is introduced to illustrate the application of the CRNM for modeling a road network in the real world is given. A comprehensive conclusion is given for the series of papers.展开更多
This paper proposes an adaptive agent model with a hybrid routing selection strategy for studying the road-network congestion problem. We focus on improving those severely congested links. Firstly,a multi-agent system...This paper proposes an adaptive agent model with a hybrid routing selection strategy for studying the road-network congestion problem. We focus on improving those severely congested links. Firstly,a multi-agent system is built,where each agent stands for a vehicle,and it makes its routing selection by considering the shortest path and the minimum congested degree of the target link simultaneously. The agent-based model captures the nonlinear feedback between vehicle routing behaviors and road-network congestion status.Secondly,a hybrid routing selection strategy is provided,which guides the vehicle routes adapting to the realtime road-network congestion status. On this basis, we execute simulation experiments and compare the simulation results of network congestion distribution,by Floyd agent with shortest path strategy and our proposed adaptive agent with hybrid strategy. The simulation results show that our proposed model has reduced the congestion degree of those seriously congested links of road-network. Finally,we execute our model on a real road map. The results finds that those seriously congested roads have some common features such as located at the road junction or near the unique road connecting two areas. And,the results also show an effectiveness of our model on reduction of those seriously congested links in this actual road network. Such a bottom-up congestion control approach with a hybrid congestion optimization perspective will have its significance for actual traffic congestion control.展开更多
Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two point...Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two points also affects people’s daily travel.Taking Heze Railway Station to Heze College for example,with remote sensing image data as the base map,we conduct vectorization and topological analysis on roads in the target area.With Dijkstra as theoretical basis of shortest path algorithm,we use ArcG IS network analysis method to build road network,and calculate the planning program of the shortest distance path,the shortest path by driving and the shortest path by walking.展开更多
基金The National Key Technology R&D Program of China during the 11th Five Year Plan Period(No.2008BAJ11B01)
文摘A solution to compute the optimal path based on a single-line-single-directional（SLSD）road network model is proposed.Unlike the traditional road network model,in the SLSD conceptual model,being single-directional and single-line style,a road is no longer a linkage of road nodes but abstracted as a network node.Similarly,a road node is abstracted as the linkage of two ordered single-directional roads.This model can describe turn restrictions,circular roads,and other real scenarios usually described using a super-graph.Then a computing framework for optimal path finding（OPF）is presented.It is proved that classical Dijkstra and A algorithms can be directly used for OPF computing of any real-world road networks by transferring a super-graph to an SLSD network.Finally,using Singapore road network data,the proposed conceptual model and its corresponding optimal path finding algorithms are validated using a two-step optimal path finding algorithm with a pre-computing strategy based on the SLSD road network.
文摘This is the first of a three-part series of pape rs which introduces a general background of building trajectory-oriented road net work data models, including motivation, related works, and basic concepts. The p urpose of the series is to develop a trajectory-oriented road network data mode l, namely carriageway-based road network data model (CRNM). Part 1 deals with t he modeling background. Part 2 proposes the principle and architecture of the CR NM. Part 3 investigates the implementation of the CRNM in a case study. In the p resent paper, the challenges of managing trajectory data are discussed. Then, de veloping trajectory-oriented road network data models is proposed as a solution and existing road network data models are reviewed. Basic representation approa ches of a road network are introduced as well as its constitution.
文摘This is the second of a three-part series of papers which presents the principle and architecture of the CRNM, a trajectory-oriented, carriageway-based road network data model. The first part of the series has introduced a general background of building trajectory-oriented road network data models, including motivation, related works, and basic concepts. Based on it, this paper describs the CRNM in detail. At first, the notion of basic roadway entity is proposed and discussed. Secondly, carriageway is selected as the basic roadway entity after compared with other kinds of roadway, and approaches to representing other roadways with carriageways are introduced. At last, an overall architecture of the CRNM is proposed.
文摘This is the final of a three-part series of papers which mainly discusses the implementation issues of the CRNM. The first two papers in the series have introduced the modeling background and methodology, respectively. An overall architecture of the CRNM has been proposed in the last paper. On the basis of the above discusses, a linear reference method (LRM) for providing spatial references for location points of a trajectory is developed. A case study is introduced to illustrate the application of the CRNM for modeling a road network in the real world is given. A comprehensive conclusion is given for the series of papers.
基金Sponsored by the Natural Science Foundation of Hunan ProvinceChina(Grant No.13JJ3049)the Fundamental Research Funds for the Central Universities(Grant No.2012AA01A301-1)
文摘This paper proposes an adaptive agent model with a hybrid routing selection strategy for studying the road-network congestion problem. We focus on improving those severely congested links. Firstly,a multi-agent system is built,where each agent stands for a vehicle,and it makes its routing selection by considering the shortest path and the minimum congested degree of the target link simultaneously. The agent-based model captures the nonlinear feedback between vehicle routing behaviors and road-network congestion status.Secondly,a hybrid routing selection strategy is provided,which guides the vehicle routes adapting to the realtime road-network congestion status. On this basis, we execute simulation experiments and compare the simulation results of network congestion distribution,by Floyd agent with shortest path strategy and our proposed adaptive agent with hybrid strategy. The simulation results show that our proposed model has reduced the congestion degree of those seriously congested links of road-network. Finally,we execute our model on a real road map. The results finds that those seriously congested roads have some common features such as located at the road junction or near the unique road connecting two areas. And,the results also show an effectiveness of our model on reduction of those seriously congested links in this actual road network. Such a bottom-up congestion control approach with a hybrid congestion optimization perspective will have its significance for actual traffic congestion control.
基金Supported by Science Foundation of Heze University(XY14SK14)
文摘Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two points also affects people’s daily travel.Taking Heze Railway Station to Heze College for example,with remote sensing image data as the base map,we conduct vectorization and topological analysis on roads in the target area.With Dijkstra as theoretical basis of shortest path algorithm,we use ArcG IS network analysis method to build road network,and calculate the planning program of the shortest distance path,the shortest path by driving and the shortest path by walking.
