Sciweavers

18 search results - page 2 / 4
» SR-1: A simulation-based algorithm for the Capacitated Vehic...
Sort
View
EUROCAST
2007
Springer
126views Hardware» more  EUROCAST 2007»
13 years 11 months ago
Parallel Tabu Search and the Multiobjective Capacitated Vehicle Routing Problem with Soft Time Windows
Abstract. In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with soft Time Windows...
Andreas Beham
MP
2002
86views more  MP 2002»
13 years 5 months ago
Multistars, partial multistars and the capacitated vehicle routing problem
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among th...
Adam N. Letchford, Richard W. Eglese, Jens Lysgaar...
SODA
2010
ACM
172views Algorithms» more  SODA 2010»
14 years 2 months ago
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
Aparna Das, Claire Mathieu
HEURISTICS
2008
124views more  HEURISTICS 2008»
13 years 5 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
NETWORKS
2007
13 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...