Sciweavers

79 search results - page 5 / 16
» An assignment-based heuristic for vehicle routing with time ...
Sort
View
TRANSCI
2002
57views more  TRANSCI 2002»
15 years 5 months ago
A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
Jonathan F. Bard, George Kontoravdis, Gang Yu
NETWORKS
2007
15 years 5 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...
HM
2007
Springer
180views Optimization» more  HM 2007»
15 years 10 months ago
Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems
We present two hybrid Metaheuristics, a hybrid Iterated Local Search and a hybrid Simulated Annealing, for solving real-world extensions of the Vehicle Routing Problem with Time Wi...
Tonci Caric, Juraj Fosin, Ante Galic, Hrvoje Gold,...
EMO
2009
Springer
235views Optimization» more  EMO 2009»
16 years 19 days ago
Bi-objective Optimization for the Vehicle Routing Problem with Time Windows: Using Route Similarity to Enhance Performance
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
Abel Garcia-Najera, John A. Bullinaria