64 search results - page 8 / 13 » A Branch-and-Cut Procedure for the Vehicle Routing Problem w... |
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...
IOR
2006
13 years 7 months ago
2006
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we present a multiagent model in which agents have a perception upon their shared environment, a measure is associated to the agents' perception field. We apply...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....