Improved Floyd Route Mending Algorithm Based on Dynamic Travel Time Applied to the Estimation of Floating Car Origin-Destination Data

2013 ◽  
Vol 361-363 ◽  
pp. 2196-2200
Author(s):  
Hui Zhao

The floating car data (FCD) is widely used to estimate the time-varying OD demands in recent years. The one of the most important factors influencing the application performance of FCD is the completeness of FCD route data. This paper is intended to develop Floyd route mending algorithm based on dynamic travel time for FCD. In this framework, the raw FCD and the processed FCD are used to identify the problem of data missing based on topological structure of the road network. Then, an approach is developed to mend route based on improved Floyd route mending algorithm based on the GIS map. The approach is designed in a way that takes full advantage of the dynamic characteristics of travel time and quick routes scan. The paper applies the proposed methodology to mend routes and derive OD demands of FCD for the Western 3rd Ring-Road corridor network in Beijing, China. It is shown from the statistical analysis that the approach is accurate and the OD demands of FCD can reflect the characteristics of OD demands of all vehicles in the road network.

2018 ◽  
Vol 115 (50) ◽  
pp. 12654-12661 ◽  
Author(s):  
Luis E. Olmos ◽  
Serdar Çolak ◽  
Sajjad Shafiei ◽  
Meead Saberi ◽  
Marta C. González

Stories of mega-jams that last tens of hours or even days appear not only in fiction but also in reality. In this context, it is important to characterize the collapse of the network, defined as the transition from a characteristic travel time to orders of magnitude longer for the same distance traveled. In this multicity study, we unravel this complex phenomenon under various conditions of demand and translate it to the travel time of the individual drivers. First, we start with the current conditions, showing that there is a characteristic time τ that takes a representative group of commuters to arrive at their destinations once their maximum density has been reached. While this time differs from city to city, it can be explained by Γ, defined as the ratio of the vehicle miles traveled to the total vehicle distance the road network can support per hour. Modifying Γ can improve τ and directly inform planning and infrastructure interventions. In this study we focus on measuring the vulnerability of the system by increasing the volume of cars in the network, keeping the road capacity and the empirical spatial dynamics from origins to destinations unchanged. We identify three states of urban traffic, separated by two distinctive transitions. The first one describes the appearance of the first bottlenecks and the second one the collapse of the system. This collapse is marked by a given number of commuters in each city and it is formally characterized by a nonequilibrium phase transition.


2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Xinhua Mao ◽  
Jibiao Zhou ◽  
Changwei Yuan ◽  
Dan Liu

This work proposes a framework for the optimization of postdisaster road network restoration strategies from a perspective of resilience. The network performance is evaluated by the total system travel time (TSTT). After the implementation of a postdisaster restoration schedule, the network flows in a certain period of days are on a disequilibrium state; thus, a link-based day-to-day traffic assignment model is employed to compute TSTT and simulate the traffic evolution. Two indicators are developed to assess the road network resilience, i.e., the resilience of performance loss and the resilience of recovery rapidity. The former is calculated based on TSTT, and the latter is computed according to the restoration makespan. Then, we formulate the restoration optimization problem as a resilience-based bi-objective mixed integer programming model aiming to maximize the network resilience. Due to the NP-hardness of the model, a genetic algorithm is developed to solve the model. Finally, a case study is conducted to demonstrate the effectiveness of the proposed method. The effects of key parameters including the number of work crews, travelers’ sensitivity to travel time, availability of budget, and decision makers’ preference on the values of the two objectives are investigated as well.


2019 ◽  
Vol 18 (3) ◽  
pp. 558-582
Author(s):  
Anton Agafonov ◽  
Vladislav Myasnikov

An increase in the number of vehicles, especially in large cities, and inability of the existing road infrastructure to distribute transport flows, leads to a higher congestion level in transport networks. This problem makes the solution to navigational problems more and more important. Despite the popularity of these tasks, many existing commercial systems find a route in deterministic networks, not taking into account the time-dependent and stochastic properties of traffic flows, i.e. travel time of road links is considered as constant. This paper addresses the reliable routing problem in stochastic networks using actual information of the traffic flow parameters. We consider the following optimality criterion: maximization of the probability of arriving on time at a destination given a departure time and a time budget. The reliable shortest path takes into account the variance of the travel time of the road network segments, which makes it more applicable for solving routing problems in transport networks compared to standard shortest path search algorithms that take into account only the average travel time of network segments. To describe the travel time of the road network segments, it is proposed to use parametrically defined stable Levy probability distributions. The use of stable distributions allows replacing the operation of calculating convolution to determine the reliability of the path to recalculating the parameters of the distributions density, which significantly reduces the computational time of the algorithm. The proposed method gives a solution in the form of a decision, i.e. the route proposed in the solution is not fixed in advance, but adaptively changes depending on changes in the real state of the network. An experimental analysis of the algorithm carried out on a large-scale transport network of Samara, Russia, showed that the presented algorithm can significantly reduce the computational time of the reliable shortest path algorithm with a slight increase in travel time.


Sensors ◽  
2020 ◽  
Vol 20 (15) ◽  
pp. 4145
Author(s):  
Mariusz Kiec ◽  
Carmelo D’Agostino ◽  
Sylwia Pazdan

The Travel Time Information System (TTIS) is an Intelligent Traffic Control System installed in Poland. As is common, travel time is the only factor in the decision about rerouting traffic, while a route recommendation may consider multiple criteria, including road safety. The aim of the paper is to analyze the safety level of the entire road network when traffic is rerouted on paths with different road categories, intersection types, road environments, and densities of access points. Furthermore, a comparison between traffic operation and road safety performance was carried out, considering travel time and delay, and we predicted the number of crashes for each possible route. The results of the present study allow for maximizing safety or traffic operation characteristics, providing an effective tool in the management of the rural road system. The paper provides a methodology that can be transferred to other TTISs for real-time management of the road network.


2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Qinyang Bai ◽  
Xaioqin Yin ◽  
Ming K. Lim ◽  
Chenchen Dong

PurposeThis paper studies low-carbon vehicle routing problem (VRP) for cold chain logistics with the consideration of the complexity of the road network and the time-varying traffic conditions, and then a low-carbon cold chain logistics routing optimization model was proposed. The purpose of this paper is to minimize the carbon emission and distribution cost, which includes vehicle operation cost, product freshness cost, quality loss cost, penalty cost and transportation cost.Design/methodology/approachThis study proposed a mathematical optimization model, considering the distribution cost and carbon emission. The improved Nondominated Sorting Genetic Algorithm II algorithm was used to solve the model to obtain the Pareto frontal solution set.FindingsThe result of this study showed that this model can more accurately assess distribution costs and carbon emissions than those do not take real-time traffic conditions in the actual road network into account and provided guidance for cold chain logistics companies to choose a distribution strategy and for the government to develop a carbon tax.Research limitations/implicationsThere are some limitations in the proposed model. This study assumes that there are only one distribution and a single type of vehicle.Originality/valueExisting research on low-carbon VRP for cold chain logistics ignores the complexity of the road network and the time-varying traffic conditions, resulting in nonmeaningful planned distribution routes and furthermore low carbon cannot be discussed. This study takes the complexity of the road network and the time-varying traffic conditions into account, describing the distribution costs and carbon emissions accurately and providing the necessary prerequisites for achieving low carbon.


2021 ◽  
Author(s):  
Carlos Otávio Freitas ◽  
Felipe de F. Silva ◽  
Mateus C. R. Neves

In this paper, we estimate a stochastic production function for Bolivia, Ecuador, Colombia, and Peru to investigate whether road infrastructure affects farm technical inefficiency. We use agricultural censuses of Colombia and Bolivia in 2013 and 2014, respectively; national agricultural surveys in 2017 of both Ecuador and Peru; and data on the road network and travel time to the nearest town with 50,000 inhabitants or more. Our main findings are that irrigation increases the value of production and road network decreases farm technical inefficiency, that is, road density (travel time) increases (decreases) farm technical efficiency.


2004 ◽  
Vol 36 (4) ◽  
pp. 1816 ◽  
Author(s):  
Δ. Ρόζος ◽  
E. Αποστολίδης

In the present paper, the serious landslide phenomena that make difficult the residential development of Kanalia village are studied. Kanalia village is located on a slope of the eastern bank of Roustianitis torrent, the main hydrographie axis of the broader area, which is one of the main branches of Sperchios River. The geological structure of the area (sandstones and siltstones of the Pindos zone flysch) as well as the hydro meteorological and climatological conditions favoring the formation of locally very thick weathering mantle and also the development of seasonal aquifers, were at first studied. As it was confirmed, the main causes of landslide phenomena manifestation are related to the above conditions, to the erosional activity of water in the slopes of the hydrographie axes and finally to the human interventions.These phenomena are observed in five (5) main sites with most important the one affected the South - Southwest part of the village covering the area from KanaliaGardiki provincial road until Roustianitis torrent downwards. In that case, the periodic re-activations of the sliding phenomena during the last forty years have caused full destruction and abandonment of this part of the village, since no relevant measures have been taken so far. The remaining sites are restricted in some parts of the village road network, without affecting residential zones.For the protection and development of the residential area of Kanalia village, the following measures were recommended for the improvement of the ground conditions in the slope affected areas: (a) drainage both of the surficial and ground waters in the vulnerable zones, (b) slope supporting works with gabion walls (flexible structures), (c) protection of the stream slopes from erosion and undermining with gabion walls and gully dams, (d) tree plantations, and (e) suitable and appropriate foundation of the new constructions on the stable basement or foundation using specific types, if necessary. It is suggested the application of these measures for the safety of the road network, the good operation of which constitutes a prerequisite for a safe residential development.


2004 ◽  
Vol 3 (4) ◽  
Author(s):  
David Boyce ◽  
Qian Xiong

Solutions to the route choice problem for assumptions of user-optimality and system-optimality are presented for the road network of the Chicago region. Regionwide results show a 5% decrease in total travel time would be achieved during the morning peak period, if a system-optimal solution based on travel times were implemented. Among the costs of this solution is a 1.5% increase in vehicle-miles traveled. Findings for differences in link flows and individual origin-destination pairs complete the paper.


Author(s):  
Ol'ga Lebedeva

Managing urban networks during traffic congestion requires the use of a dynamic model that allows you to simulate real situations with traffic flows with long queues and responses. To conduct experimental research in this area, it is possible to use a mesoscopic system for simulating traffic with calibration and taking into account the characteristics of the road. All supply and demand parameters (use of detectors, travel time) must be calibrated at the same time. In this study, calibration was performed using the route selection model, given overlapping routes


Sign in / Sign up

Export Citation Format

Share Document