Open AccessProceedings Article
Vehicle Routing and Time Deadlines Using Genetic and Local Algorithms
Sam R. Thangiah,Rajini Vinayagamoorty,Ananda V. Gubbi +2 more
- pp 506-515
Reads0
Chats0
About:
This article is published in international conference on Genetic algorithms.The article was published on 1993-06-01 and is currently open access. It has received 56 citations till now. The article focuses on the topics: Static routing & Dynamic Source Routing.read more
Citations
More filters
Journal ArticleDOI
A genetic algorithm for the vehicle routing problem
Barrie M. Baker,M. A. Ayechew +1 more
TL;DR: In this paper, the authors considered the application of a genetic algorithm (GA) to the basic vehicle routing problem (VRP), in which customers of known demand are supplied from a single depot.
Journal ArticleDOI
Genetic algorithms for the traveling salesman problem
TL;DR: A simple genetic algorithm is introduced, and various extensions are presented to solve the traveling salesman problem, using randomized search techniques that simulate some of the processes observed in natural evolution.
Book ChapterDOI
A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows
TL;DR: This paper presents a new hybrid genetic algorithm for VRPTW that investigates the impact of using explicitly domain knowledge and a priori knowledge/characteristics about expected solutions during the recombination and mutation phases of the algorithm.
Journal ArticleDOI
Heuristic approaches to vehicle routing with backhauls and time windows
TL;DR: A route construction heuristic for the VRPBTW, as well as different local search heuristics to improve the initial solutions are described, which are within 2.5% of the known optimal solutions on average.
Book ChapterDOI
A Hybrid Genetic Algorithm, Simulated Annealing and Tabu Search Heuristic for Vehicle Routing Problems with Time Windows
TL;DR: A λ-interchange mechanism that moves customers between routes to generate neighborhood solutions for the VRPTW and the average performance of GenSAT is significantly better than known competing heuristics.