A competitive neural network model and a genetic algorithm are used to improve the initialization and construction phase of a parallel insertion heuristic for the vehicle routing problem with time windows. The neural network identifies seed customers that are distributed over the entire geographic a
β¦ LIBER β¦
Dynamic vehicle routing using genetic algorithms
β Scribed by Franklin T. Hanshar; Beatrice M. Ombuki-Berman
- Book ID
- 106347629
- Publisher
- Springer US
- Year
- 2007
- Tongue
- English
- Weight
- 545 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0924-669X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A hybrid approach to vehicle routing usi
β
Jean-Yves Potvin; Danny DubΓ©; Christian Robillard
π
Article
π
1996
π
Springer US
π
English
β 924 KB
Algorithms for Capacitated Vehicle Routi
β
Charikar, Moses; Khuller, Samir; Raghavachari, Balaji
π
Article
π
2001
π
Society for Industrial and Applied Mathematics
π
English
β 218 KB
Multi-Objective Genetic Algorithms for V
β
Beatrice Ombuki; Brian J. Ross; Franklin Hanshar
π
Article
π
2006
π
Springer US
π
English
β 971 KB
A genetic algorithm for vehicle routing
β
Jean-Yves Potvin; Christophe Duhamel; FranΓ§ois Guertin
π
Article
π
1996
π
Springer US
π
English
β 930 KB
In this paper, a greedy route construction heuristic for a vehicle routing problem with backhauling is described. This heuristic inserts customers one by one into the routes using a fixed a priori ordering of customers. Then, a genetic algorithm is used to identify an ordering that produces good rou
Optimised crossover genetic algorithm fo
β
Habibeh Nazif; Lai Soon Lee
π
Article
π
2012
π
Elsevier Science
π
English
β 324 KB
Approximation algorithms for a vehicle r
β
Sven O. Krumke; Sleman Saliba; Tjark Vredeveld; Stephan Westphal
π
Article
π
2008
π
Springer
π
English
β 403 KB