Sciweavers

13 search results - page 1 / 3
» Formulations and Valid Inequalities for the Heterogeneous Ve...
Sort
View
MP
2006
116views more  MP 2006»
13 years 5 months ago
Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem
We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first...
Hande Yaman
ENDM
2010
118views more  ENDM 2010»
13 years 9 days ago
On the Vehicle Routing Problem with lower bound capacities
In this paper we show and discuss a family of inequalities for solving a variant of the classical vehicle routing problem where also a lower bound is considered. The inequalities ...
Luís Gouveia, Juan José Salazar Gonz...
IOR
2006
173views more  IOR 2006»
13 years 5 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
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...
Jean-François Cordeau
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...
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...