Optimization Of Time Dependent Routing Problems Considering Dynamic Paths And Fuel Consumption
DOWNLOAD
Download Optimization Of Time Dependent Routing Problems Considering Dynamic Paths And Fuel Consumption PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Optimization Of Time Dependent Routing Problems Considering Dynamic Paths And Fuel Consumption book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages. If the content not found or just blank you must refresh this page
Optimization Of Time Dependent Routing Problems Considering Dynamic Paths And Fuel Consumption
DOWNLOAD
Author : Hamza Heni
language : en
Publisher:
Release Date : 2018
Optimization Of Time Dependent Routing Problems Considering Dynamic Paths And Fuel Consumption written by Hamza Heni and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2018 with categories.
In recent years, freight transportation has evolved into a multi-faceted logistics challenge. The immense volume of freight has considerably increased the flow of commodities in all transport modes. Despite the vital role of freight transportation in the economic development, it also negatively impacts both the environment and human health. At the local and regional areas, a significant portion of goods delivery is transported by trucks, which emit a large amount of pollutants. Road freight transportation is a major contributor to greenhouse gas (GHG) emissions and to fuel consumption. To reduce the significant impact of freight transportation emissions on environment, new alternative planning and coordination strategies directly related to routing and scheduling operations are required at the operational, environmental and temporal dimensions. In large urban areas, trucks must travel at the speed imposed by traffic, and congestion events have major adverse consequences on speed level, travel time and GHG emissions particularly at certain periods of day. This variability in speed over time has a significant impact on routing and scheduling. From a broader perspective, our research addresses Time-Dependent Distribution Problems (TDDPs) considering dynamic paths and GHG emissions. Considering that vehicle speeds vary according to time-dependent congestion, the goal is to minimize the total travel cost function incorporating driver and GHG emissions costs while respecting capacity constraints and service time restrictions. Further, geographical and traffic information can be used to construct a multigraph modeling path flexibility on large road networks, as an extension to the classical customers network. The underlying physical sub-network between each pair of customers for each shipment is explicitly considered to find connecting road paths. Path selection decisions complement routing ones, impacting the overall cost, GHG emissions, the travel time between nodes, and thus the set of a feasible time-dependent least cost paths. While the search space increases, solving TDDPs considering dynamic paths and time-varying speeds may provide a new scope for enhancing the effectiveness of route plans. One way to reduce emissions is to consider congestion and being able to route traffic around it. Accounting for and avoiding congested paths is possible as the required traffic data is available and, at the same time, has a great potential for both energy and cost savings. Hence, we perform a large empirical analysis of historical traffic and shipping data. Therefore, we introduce the Time-dependent Quickest Path Problem with Emission Minimization, in which the objective function comprises GHG emissions, driver and congestion costs. Travel costs are impacted by traffic due to changing congestion levels depending on the time of the day, vehicle types and carried load. We also develop time-dependent lower and upper bounds, which are both accurate and fast to compute. Computational experiments are performed on real-life instances that incorporate the variation of traffic throughout the day. We then study the quality of obtained paths considering time-varying speeds over the one based only on fixed speeds... Keywords : Time-dependent routing; time-dependent quickest paths; traffic congestion; road network; heuristic; greenhouse gas emissions; emission models; supervised learning.
Time Dependent Vehicle Routing Problem With Emission And Cost Minimization Considering Dynamic Paths
DOWNLOAD
Author : Hamza Heni
language : en
Publisher:
Release Date : 2018
Time Dependent Vehicle Routing Problem With Emission And Cost Minimization Considering Dynamic Paths written by Hamza Heni and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2018 with categories.
Time Dependent Routing
DOWNLOAD
Author : Rabie Jaballah
language : en
Publisher:
Release Date : 2022
Time Dependent Routing written by Rabie Jaballah and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2022 with Business logistics categories.
The vehicle routing problem (VRP), introduced more than 60 years ago, is at the core of transportation systems. With decades of development, the VRP is one of the most studied problems in the literature, with a very rich set of variants. Yet, primarily due to the lack of data, two critical assumptions make the VRP fail to adapt effectively to traffic and congestion. The first assumption considers that the travel speed is constant over time ; the second, that each pair of customers is connected by an arc, ignoring the underlying street network. Traffic congestion is one of the biggest challenges in transportation systems. As traffic directly affects transportation activities, the whole supply chain needs to adjust to this factor. The continuous growth of freight in recent years worsens the situation, and a renewed focus on mobility, environment, and city logistics has shed light on these issues. Recently, advances in communications and real-time data acquisition technologies have made it possible to collect vehicle data such as their location, acceleration, driving speed, deceleration, etc. With the availability of this data, one can question the way we define, model, and solve transportation problems. This allows us to overcome the two issues indicated before and integrate congestion information and the whole underlying street network. We start by considering the whole underlying street network, which means we have customer nodes and intermediate nodes that constitute the street network. Then, we model the travel time of each street during the day. By dividing the day into small intervals, up to a precision of a second, we consider precise traffic information. This results in a new problem called the time-dependent shortest path vehicle routing problem (TD-SPVRP), in which we combine the time-dependent shortest path problem (TD-SPP) and the time-dependent VRP (TD-VRP), creating a more general and very challenging problem. The TD-SPVRP is closer to what can be found in real-world conditions, and it constitutes the topic of Chapter 2, where we formulate it as a mixed-integer linear programming model and design a fast and efficient heuristic algorithm to solve this problem. We test it on instances generated from actual traffic data from the road network in Québec City, Canada. Results show that the heuristic provides high-quality solutions with an average gap of only 5.66%, while the mathematical model fails to find a solution for any real instance. To solve the challenging problem, we emphasize the importance of a high-performance implementation to improve the speed and the execution time of the algorithms. Still, the problem is huge especially when we work on a large area of the underlying street network alongside very precise traffic data. To this end, we use different techniques to optimize the computational effort to solve the problem while assessing the impact on the precision to avoid the loss of valuable information. Two types of data aggregation are developed, covering two different levels of information. First, we manipulated the structure of the network by reducing its size, and second by controlling the time aggregation level to generate the traffic data, thus the data used to determine the speed of a vehicle at any time. For the network structure, we used different reduction techniques of the road graph to reduce its size. We studied the value and the trade-off of spatial information. Solutions generated using the reduced graph are analyzed in Chapter 3 to evaluate the quality and the loss of information from the reduction. We show that the transformation of the TD-SPVRP into an equivalent TD-VRP results in a large graph that requires significant preprocessing time, which impacts the solution quality. Our development shows that solving the TD-SPVRP is about 40 times faster than solving the related TD-VRP. Keeping a high level of precision and successfully reducing the size of the graph is possible. In particular, we develop two reduction procedures, node reduction and parallel arc reduction. Both techniques reduce the size of the graph, with different results. While the node reduction leads to improved reduction in the gap of 1.11%, the parallel arc reduction gives a gap of 2.57% indicating a distortion in the reduced graph. We analyzed the compromises regarding the traffic information, between a massive amount of very precise data or a smaller volume of aggregated data with some potential information loss. This is done while analyzing the precision of the aggregated data under different travel time models, and these developments appear in Chapter 4. Our analysis indicates that a full coverage of the street network at any time of the day is required to achieve a high level of coverage. Using high aggregation will result in a smaller problem with better data coverage but at the cost of a loss of information. We analyzed two travel time estimation models, the link travel model (LTM) and the flow speed model (FSM). They both shared the same performance when working with large intervals of time (120, 300, and 600 seconds), thus a higher level of aggregation, with an absolute average gap of 5.5% to the observed route travel time. With short periods (1, 10, 30, and 60 seconds), FSM performs better than LTM. For 1 second interval, FSM gives an average absolute gap of 6.70%, while LTM provides a gap of 11.17%. This thesis is structured as follows. After a general introduction in which we present the conceptual framework of the thesis and its organization, Chapter 1 presents the literature review for the two main problems of our development, the shortest path problem (SPP) and the VRP, and their time-dependent variants developed over the years. Chapter 2 introduces a new VRP variant, the TD-SPVRP. Chapter 3 presents the different techniques developed to reduce the size of the network by manipulating spatial information of the road network. The impact of these reductions is evaluated and analyzed on real data instances using multiple heuristics. Chapter 4 covers the impact of time aggregation data and travel time models when computing travel times on the precision of their estimations against observed travel times. The conclusion follows in the last chapter and presents some research perspectives for our works.
Vessels And Voyages A Book For Boys
DOWNLOAD
Author : George (Uncle.)
language : en
Publisher:
Release Date : 1873
Vessels And Voyages A Book For Boys written by George (Uncle.) and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 1873 with Adventure and adventurers categories.
A Vehicle Routing Problem Considering Load Dependent Fuel Consumption
DOWNLOAD
Author : 費安妮
language : en
Publisher:
Release Date : 2016
A Vehicle Routing Problem Considering Load Dependent Fuel Consumption written by 費安妮 and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2016 with categories.
The Evolution Of The Vehicle Routing Problem
DOWNLOAD
Author : Bruce Golden
language : en
Publisher: Springer
Release Date : 2024-01-16
The Evolution Of The Vehicle Routing Problem written by Bruce Golden and has been published by Springer this book supported file pdf, txt, epub, kindle and other format this book has been release on 2024-01-16 with Mathematics categories.
This book presents state-of-the-art research and practice in optimization routing, specifically the vehicle routing problem (VRP). Since its introduction in the late 1950s, the VRP has been a very significant area of research and practice in operations research. Vehicles are used to make deliveries and for pick-ups every day and everywhere. Companies such as Amazon, UPS, FedEx, and DHL use route optimization to reduce mileage, fuel use, number of trucks on the road, and carbon dioxide emissions. The authors compile and analyze 135 survey and review articles on vehicle routing topics published between 2005 and 2022 in an effort to make key observations about publication and trend history, summarize the overall contributions in the field, and identify trends in VRP research and practice. The authors have compiled published research on models, algorithms, and applications for specific areas, including: alternative and multiple objectives; arc routing and general routing; drones, last-mile delivery, and urban distribution; dynamic and stochastic routing; green routing; inventory routing; loading constraints; location-routing; multiple depots; pickup and delivery and dial-a-ride problems; rich and multi-attribute routing; routing over time; shipping; two-echelon, collaborative, and inter-terminal problems; specific variants, benchmark datasets, and software; and exact algorithms and heuristics. In addition, the book discusses how vehicle routing problems are among the most widely studied problems in combinatorial optimization due to the mathematical complexity and practical significance.
Adaptive Routing Optimization In Continuous Time Stochastic Dynamic Networks
DOWNLOAD
Author : Mostafa Kamali Ardakani
language : en
Publisher:
Release Date : 2014
Adaptive Routing Optimization In Continuous Time Stochastic Dynamic Networks written by Mostafa Kamali Ardakani and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2014 with Advanced traveler information systems categories.
Routing in a stochastic and dynamic (time-dependent) network is a crucial transportation problem, particularly as the advanced traveler information system emerges within navigator systems. A new variant of adaptive routing, which assumes perfect online information of continuous real-time link travel time, is proposed. This variant can deal with a dynamic network, which has the most general real-time link travel times with frequent, instantaneous, and sometimes unpredictable changes. The driver's speed profile is also taken into consideration to realistically estimate travel times, which correspondingly involves the stochasticity of links in a dynamic network. An optimization methodology is developed to tackle the dynamic shortest path problem with continuous-time. A decremental approach based on network topology is consequently developed to reduce the network size. The impact of the proposed adaptive routing and the performance of the decremental approach are evaluated in static and dynamic networks under different traffic conditions. The proposed approach can be incorporated within an intelligent vehicle navigation system. In addition, A* algorithm is applied in the decremental approach to speed up the shortest paths optimization process. In order to convert link cost functions to distances to define the potential function in A* algorithm, the weighted metric multidimensional scaling technique is utilized. Moreover, Dijkstra's and the A* algorithms are compared in different networks.
The Time Dependent Shortest Path And Vehicle Routing Problem
DOWNLOAD
Author : Veenstra Marjolein
language : en
Publisher:
Release Date : 2017
The Time Dependent Shortest Path And Vehicle Routing Problem written by Veenstra Marjolein and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2017 with categories.
Routing Problems In Stochastic Time Dependent Networks With Applications In Dynamic Traffic Assignment
DOWNLOAD
Author : Song Gao
language : en
Publisher:
Release Date : 2002
Routing Problems In Stochastic Time Dependent Networks With Applications In Dynamic Traffic Assignment written by Song Gao and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2002 with categories.
Green Transportation And New Advances In Vehicle Routing Problems
DOWNLOAD
Author : Houda Derbel
language : en
Publisher: Springer Nature
Release Date : 2020-12-08
Green Transportation And New Advances In Vehicle Routing Problems written by Houda Derbel and has been published by Springer Nature this book supported file pdf, txt, epub, kindle and other format this book has been release on 2020-12-08 with Computers categories.
This book presents recent work that analyzes general issues of green transportation. The contributed chapters consider environmental objectives in transportation, including topics such as battery swap stations for electric vehicles, efficient home healthcare routing, waste collection, and various vehicle routing problems. The content will be valuable for researchers and postgraduate students in computer science, operations research, and urban planning.