65 search results - page 8 / 13 » Reachability cuts for the vehicle routing problem with time ... |
AAAI
2007
13 years 9 months ago
2007
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
CP
2010
Springer
13 years 6 months ago
2010
Springer
This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive d...
HM
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejec...
AOR
2010
13 years 4 months ago
2010
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The colum...