A Genetic Algorithm For The Vehicle Routing Problem With Time Dependent Travel Times
DOWNLOAD
Download A Genetic Algorithm For The Vehicle Routing Problem With Time Dependent Travel Times PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get A Genetic Algorithm For The Vehicle Routing Problem With Time Dependent Travel Times 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
A Genetic Algorithm For The Vehicle Routing Problem With Time Dependent Travel Times
DOWNLOAD
Author : Soojung Jung
language : en
Publisher:
Release Date : 2000
A Genetic Algorithm For The Vehicle Routing Problem With Time Dependent Travel Times written by Soojung Jung and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2000 with Genetic algorithms categories.
Neutrosophic Genetic Algorithm For Solving The Vehicle Routing Problem With Uncertain Travel Times
DOWNLOAD
Author : Rafael Rojas-Gualdron
language : en
Publisher: Infinite Study
Release Date : 2022-12-01
Neutrosophic Genetic Algorithm For Solving The Vehicle Routing Problem With Uncertain Travel Times written by Rafael Rojas-Gualdron and has been published by Infinite Study this book supported file pdf, txt, epub, kindle and other format this book has been release on 2022-12-01 with Mathematics categories.
The Vehicle Routing Problem (VRP) has been extensively studied by different researchers from all over the world in recent years. Multiple solutions have been proposed for different variations of the problem, such as Capacitive Vehicle Routing Problem (CVRP), Vehicle Routing Problem with Time Windows (VRP-TW), Vehicle Routing Problem with Pickup and Delivery (VRPPD), among others, all of them with deterministic times. In the last years, researchers have been interested in including in their different models the variations that travel times may experience when exposed to all kind of phenomena, mainly vehicle traffic. This article addresses the VRP from this perspective, proposing the design and implementation of a genetic algorithm based on neutrosophic theory for calculating the fitness function of each route, considering the variability and uncertainty present in travel times. A deterministic genetic algorithm is also implemented with the average travel times to compare it with the neutrosophic algorithm using simulation. As conclusion, a deterministic algorithm does not necessarily generate the best solution in the real world, full of uncertainty. Also, the quantification of uncertainty using neutrosophic theory can be used in route planning, opening a broad and interesting field of research for future investigations.
The Vehicle Routing Problem With Time Windows And Time Dependent Travel Times
DOWNLOAD
Author : Ana Osvald (t.d.-)
language : en
Publisher:
Release Date : 2005
The Vehicle Routing Problem With Time Windows And Time Dependent Travel Times written by Ana Osvald (t.d.-) and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2005 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.
A Genetic Algorithm For The Vehicle Routing Problem With Time Windows
DOWNLOAD
Author : Lin Cheng
language : en
Publisher:
Release Date : 2005
A Genetic Algorithm For The Vehicle Routing Problem With Time Windows written by Lin Cheng and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2005 with Electronic dissertations categories.
Vehicle Routing
DOWNLOAD
Author : Bruce L. Golden
language : en
Publisher: North Holland
Release Date : 1988
Vehicle Routing written by Bruce L. Golden and has been published by North Holland this book supported file pdf, txt, epub, kindle and other format this book has been release on 1988 with Business & Economics categories.
Hardbound. This collection of original research papers is dedicated to the analysis and solution of vehicle routing problems. Vehicle routing is a branch of operations research that has attracted a great deal of research attention over the years. The accumulated body of knowledge has resulted in algorithms and insights that have enabled companies and organizations in both the public and private sectors to save from 5% to 10% on distribution related costs. The volume brings together, in a comprehensive way, the theory and practice of vehicle routing in book form for the first time.
The Vehicle Routing Problem
DOWNLOAD
Author : Paolo Toth
language : en
Publisher:
Release Date : 2002
The Vehicle Routing Problem written by Paolo Toth and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2002 with Transportation problems (Programming) categories.
A New Algorithm For The Vehicle Routing Problem With Time Windows Based On The Hybridization Of A Genetic Algorithm And Route Construction Heuristics
DOWNLOAD
Author : Olli Bräysy
language : en
Publisher:
Release Date : 1999
A New Algorithm For The Vehicle Routing Problem With Time Windows Based On The Hybridization Of A Genetic Algorithm And Route Construction Heuristics written by Olli Bräysy and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 1999 with Algorithms categories.
DOWNLOAD
Author :
language : en
Publisher: IOS Press
Release Date :
written by and has been published by IOS Press this book supported file pdf, txt, epub, kindle and other format this book has been release on with categories.
A Genetic Algorithm For The Vehicle Routing Problem
DOWNLOAD
Author : Vickie Dawn Wester
language : en
Publisher:
Release Date : 1993
A Genetic Algorithm For The Vehicle Routing Problem written by Vickie Dawn Wester and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 1993 with Genetic algorithms categories.