A branch and cut algorithm for the VRP with satellite facilities |
| |
| Authors: | Jonathan F Bard Liu Huang Moshe Dror Patrick Jaillet |
| |
| Affiliation: |
a Department of Mechanical Engineering, Graduate Program in Operations Research, The University of Texas at Austin, Austin, TX, USA
b DSC Communications, Austin, Texas, USA
c College of Business and Public Administration, University of Arizona, Tucson, AZ, USA
d Department of Management Science and Information Systems, The University of Texas at Austin, Austin, TX, USA
e Department of Mathematics, EN PC, Paris, France |
| |
| Abstract: | An important aspect of the vehicle routing problem (VRP) that has been largely overlooked is the use of satellite facilities to replenish vehicles during a route. When possible, satellite replenishment allows the drivers to continue making deliveries until the close of their shift without necessarily returning to the central depot. This situation arises primarily in the distribution of fuels and certain retail items. When demand is random, optimizing customer routes a priori may result in significant additional costs for a particular realization of demand. Satellite facilities are one way of safeguarding against unexpected demand. This paper presents a branch and cut methodology for solving the VRP with satellite facilities subject to capacity and route time constraints. We begin with a mixed-integer linear programming formulation and then describe a series of valid inequalities that can be used to cut off solutions to the linear programming relaxation. Several separation heuristics are then outlined that are used to generate the cuts. Embedded in the methodology is a VRP heuristic for finding good feasible solutions at each stage of the computations. Results are presented for a set of problems derived from our experience with a leading propane distributor. |
| |
| Keywords: | |
| 本文献已被 InformaWorld SpringerLink 等数据库收录！ |
|
