The capacitated vehicle routing problem with reloads
Open Access
- 1 October 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1513-1518
Abstract
In this paper, we consider a variant of the transportation problem where any demand may be dropped off elsewhere than at its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We present two mixed integer linear programming formulations based on a space-time graph. We also develop a branch-and-cut algorithm for the problem and present some computational resultsKeywords
This publication has 10 references indexed in Scilit:
- Planning models for long-haul operations of postal and express shipment companiesEuropean Journal of Operational Research, 2000
- Exact solution of multicommodity network optimization problems with general step cost functionsOperations Research Letters, 1999
- Minimum cost capacity installation for multicommodity network flowsMathematical Programming, 1998
- Network Design Using Cut InequalitiesSIAM Journal on Optimization, 1996
- Arc Routing Problems, Part I: The Chinese Postman ProblemOperations Research, 1995
- Modeling and Solving the Two-Facility Capacitated Network Loading ProblemOperations Research, 1995
- The General Pickup and Delivery ProblemTransportation Science, 1995
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsSIAM Review, 1991
- On feasibility conditions of multicommodity flows in networksIEEE Transactions on Circuit Theory, 1971
- The Truck Dispatching ProblemManagement Science, 1959