Sciweavers

58 search results - page 1 / 12
» Approximation algorithms for deadline-TSP and vehicle routin...
Sort
View
STOC
2004
ACM
87views Algorithms» more  STOC 2004»
14 years 11 months ago
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
EOR
2010
159views more  EOR 2010»
13 years 5 months ago
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
Nabila Azi, Michel Gendreau, Jean-Yves Potvin
APIN
2006
207views more  APIN 2006»
13 years 11 months ago
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows
The Vehicle Routing Problem with Time windows (VRPTW) is an extension of the capacity constrained Vehicle Routing Problem (VRP). The VRPTW is NP-Complete and instances with 100 cus...
Beatrice M. Ombuki, Brian Ross, Franklin Hanshar
COR
2011
13 years 5 months ago
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
Abel Garcia-Najera, John A. Bullinaria
AI
1998
Springer
14 years 3 months ago
A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...
Jean Berger, Martin Salois, Regent Begin