15 research outputs found
Minimizing the carbon emissions on road networks
The models and algorithms developed for transportation planning, vehicle routing, path finding and the software that utilize them are usually based on distance and constant travel times between the relevant locations and aim at minimizing total distance or travel time . However, constant travel time assumption is not realistic on road networks as the traffic conditions may vary from morning/evening rush hours to off-peak noon/night hours, from the weekends to business days, even from one season to another. Thus, distance/time based optimization does not exactly reflect the real fuel consumptions, hence the actual costs; neither can they be used to accurately account for the greenhouse gas (GHG) emissions. A distance/constant time based optimization model may even yield an infeasible solution when time-windows exist or the route length is time limited. In this study, we first analyze the peculiar characteristics of the Greenest Path Problem (GPP) where the objective is to find the least GHG generating path from an origin to a destination on the road network. We then propose a fast heuristic method for determining the greenest path, by incorporating fuel consumption and GHG emission objectives. Finally, we integrate the proposed algorithm into the Green Vehicle Routing Problem that minimizes the GHG emissions rather than the total distance or travel time. The developed heuristic is benchmarked against the existing algorithms by using synthetic traffic data on a real road network to illustrate potential savings and sustainability benefits
UniALT for regular language contrained shortest paths on a multi-modal transportation network
Shortest paths on road networks can be efficiently calculated using Dijkstra\u27s algorithm (D). In addition to roads, multi-modal transportation networks include public transportation, bicycle lanes, etc. For paths on this type of network, further constraints, e.g., preferences in using certain modes of transportation, may arise. The regular language constrained shortest path problem deals with this kind of problem. It uses a regular language to model the constraints. The problem can be solved efficiently by using a generalization of Dijkstra\u27s algorithm (D_RegLC). In this paper we propose an adaption of the speed-up technique uniALT, in order to accelerate D_RegLC. We call our algorithm SDALT. We provide experimental results on a realistic multi-modal public transportation network including time-dependent cost functions on arcs. The experiments show that our algorithm performs well, with speed-ups of a factor 2 to 20
Core Routing on Dynamic Time-Dependent Road Networks
Route planning in large scale time-dependent road networks is an important practical application of the shortest paths problem that greatly benefits from speedup techniques. In this paper we extend a two-level hierarchical approach for pointto-point shortest paths computations to the time-dependent case. This method, also known as core routing in the literature for static graphs, consists in the selection of a small subnetwork where most of the computations can be carried out, thus reducing the search space. We combine this approach with bidirectional goal-directed search in order to obtain an algorithm capable of finding shortest paths in a matter of milliseconds on continental sized networks. Moreover, we tackle the dynamic scenario where the piecewise linear functions that we use to model time-dependent arc costs are not fixed, but can have their coefficients updated requiring only a small computational effort
Application for Optimal Path Search in the City with Using Metainformation
Cílem této práce je prozkoumat možnosti využití rozšířených meta-informací pro zefektivnění vyhledávání cesty ve městě, vybrat nejvhodnější podklady pro popis mapy a metody pro hledání cesty. Následně tyto funkce implementovat a vytvořit tak funkční navigační systém, který je schopný využít dodatečné meta-informace obsažené ve vybraných mapových podkladech.The objective of this thesis is to explore metainformation usage in order to achieve higher effectivity in pathfinding in the city, to choose the most suitable maps and methods for path search. Afterwards these functions are implemented to make a functional navigation system, which can use expanded metainformation contained in the chosen maps.
Time dependent sharc routing
During the last years, many speed-up techniques for Dijkstra 's algorithm have been developed. As a result, computing a shortest path in a staticroad network is a matter of microseconds. However, only few of those techniques work in time-dependentnetworks. Unfortunately, such networks appear frequentely in reality: Roads are predictably congestured by traffic jams, and efficient timetable information systems rely on time-dependent networks. Hence, a fast technique for routing in such networks is needed. In this work, we present an exacttime-dependent speed-up technique based on our recent SHARC-algorithm. As a result, we are able to efficiently compute shortest paths in time-dependent continental-sized transportation networks, both of roads and of railways.
Document type: Part of book or chapter of boo
New approaches for determining greenest paths and efficient vehicle routes on transportation networks
Road transportation has hazardous and threatening impacts on the environment. However, the traditional logistics models and approaches used in transportation planning have mainly focused on minimizing the internal costs and lack the environmental aspect. Therefore, new planning techniques and approaches are needed in road transport by explicitly accounting for these negative impacts. In this thesis, we address these issues by first concentrating on solution methods for the Greenest Path Problem (GPP) where fuel consumption and GHG emission objectives are incorporated to find the least GHG generating path, namely the greenest path, and propose a fast and effective heuristic. Taking the strong relation between the speed and the GHG emission into account, we also address the speed embedded minimum cost path problem in the most general case where the speed is also a decision variable as well as the departure time Within this context, we develop a new networkconsistent (which implies spatially and temporally consistent speeds) time-dependent speed and travel time layer generation scheme since real data is difficult to acquire. In the second part, we mainly focus on Vehicle Routing Problems (VRP). First, we propose an Ant Colony Optimization (ACO) approach for solving the Vehicle Routing Problem with Time Windows (VRPTW). Then, we adapt this method to solve the environment friendly VRP, namely the Green VRP, where the greenest paths between all customer pairs are used as input. Finally, we extend the ACO algorithm to a parallel matheuristic approach for solving a class of VRP variants
Recommended from our members
Shortest path algorithms for dynamic transportation networks
Over the last decade, many interesting route planning problems can be solved by finding the shortest path in a weighted graph that represents a transportation network. Such networks are private transport networks or timetabled public transportation networks. In the shortest path problem, every network type requires different algorithms to compute one or more than one shortest path. However, routing in a public transportation network is completely different and is much more complex than routing in a private transport network, and therefore different algorithms are required.
For large networks, the standard shortest path algorithms - Dijkstra's algorithm (1959) and Bellman's algorithm (1958)- are too slow. Consequently, faster algorithms have been designed to speed up the search. However, these algorithms often consider only the simplest scenario of finding an optimal route on a graph with static real edge costs. But real map routing problems are often not that simple – it is often necessary to consider time-dependent edge costs. For example, in public transportation routing, consideration of the time-dependent model of these networks is mandatory.
However, there are a number of transportation applications that use informed search algorithms (where the algorithm uses heuristics that guide the search toward the destination), rather than one of the standard static shortest path algorithms. This is primarily due to shortest paths needing to be rapidly identified either because an immediate response is required. For example, the A* algorithm (Nilsson, 1971) is widely used in artificial intelligence. Heuristic information (in the form of estimated distance to the destination) is used to focus the search towards the destination node. This results in finding the shortest path faster than the standard static search algorithms.
Road traffic congestion has become an increasingly significant problem in a modern society. In a dynamic traffic environment, traffic conditions are time-dependent. For instance, when travelling from home to the work, although an optimal route can be planned prior to departure based on the traffic conditions at that time, it may be necessary to adjust the route while en route because traffic conditions change all the time. In some cases, it is necessary to modify the travelling route from time to time and re-plan a new route from the current location to the destination, based on the real-time traffic information. The challenge lies in the fact that any modification to the optimal route to adapt to the dynamic environment necessitates speeding up of the search efforts. Among the algorithms suggested for the dynamic shortest path problem is the algorithm of Lifelong Planning A* algorithm (LPA*) (Koenig, Likhachev and Furcy, 2004). This algorithm has been given this name because of its ability to reuse information from previous searches. It is used to adjust a shortest path to adapt to the dynamic transportation network.
Search space and fast shortest path queries can be used for finding fastest updated route on road and bus networks. Consequently, the efficient processing of both types of queries is of first-rate significance. However, most search methods focus only on one type of query and do not efficiently support the other. To address this challenge, this research presents the first novel approach; an Optimised Lifelong Planning A* (OLPA*) algorithm. The OLPA* used an appropriate data structure to improve the efficiency of the dynamic algorithms implementation making it capable of improving the search performance of the algorithm to solve the dynamic shortest path problem, which is where the traveller may have to re-compute the shortest path while travelling in a dynamic transportation environment.
This research has also proposed bi-directional LPA* (BLPA*) algorithm. The proposed algorithm BLPA* used bi-directional search strategy and the main idea in this strategy is to divide the search problem into two separate problems. One search proceeds forwards from the start node, while the other search proceeds backwards from the end node. The solution requires the two search problems to meet at one middle node. The BLPA* algorithm has the same overall structure as the LPA* algorithm search, with some differences that the BLPA* contains a priority queue for each direction.
This research presented another algorithm that designed to adaptively derive the shortest path to the desired destination by making use of previous search results and reducing the total execution time by using the benefits of a bi-directional search strategy . This novel algorithm has been called the bi-directional optimised Lifelong A* algorithm (BiOLPA*). It was originally proposed for road transport networks and later also applied to public transportation networks. For the road transport network, the experimental results demonstrate that the proposed incremental search approach considerably outperforms the original approach method, which recomputed the shortest path from scratch each time without utilization of the previous search results. However, for public transportation, the significant problem is that it is not possible to apply a bi-directional search backwards using estimated arrival time. This has been further investigated and a better understanding of why this technique fails has been documented. While the OLPA* algorithms give an impressive result when applied on bus network compared with original A* algorithms, and our experimental results demonstrate that the BiOLPA* algorithm on road network is significantly faster than the LPA*, OLPA* and the A* algorithms, not only in terms of number of expansion nodes but also in terms of computation time