Abstract
Let us consider the following extension of the Capacitated Vehicle Routing Problem (VRP). We are given a set of customers partitioned in two subsets: Linehaul and Backhaul customers. Each Linehaul customer requires the delivery of a given quantity of product from the depot, while a given quantity of product must be picked up from each Backhaul customer and transported to the depot. This problem is known as the Vehicle Routing Problem with Backhauls (VRPB), or as the Linehaul-Backhaul Problem. VRPB then calls for the determination of a set of vehicle routes visiting once all customers and such that: (i) each vehicle performs one route; (ii) for each route the total load associated with Linehaul and Backhaul customers does not exceed, separately, the vehicle capacity; (iii) in each route no Backhaul customer is visited before that all Linehaul customers have been serviced. The objective is to minimize.the total traveled distance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Bartholdy and L. Platzman, “An O(n log n) planar traveling salesman heuristic based on spacefilling curves”, Operations Research Letters, 1:121–125, 1982
G. Carpaneto, S. Martello, and P. Toth, “Algorithms and codes for the assignment problem”, in B. Simeone, P. Toth, G. Gallo, F. Maffioli, and S. Pallottino, editors, FORTRAN Codes for Network Optimization, volume 13 of Annals of Operations Research. Baltzer, Basel, 1988
D. Casco, B. Golden, and E. Wasil, “Vehicle routing with backhauls: Models, algorithms, and case studies”, in B. Golden and A. Assad, editors, Vehicle Routing: Methods and Studiespages 127–147. North Holland, Amsterdam, 1988
N. Christofides and S. Eilon, “An algorithm for the vehicle dispatching problem”, Operations Research Quarterly, 20: 309–3181969
G. Clarke and.T. Wright, “Scheduling of vehicles from a central depot to a number of delivery points”, Operations Research, 12(4):568–581, 1964
I. Deif and L. Bodin, “Extension of the clarke and wright algorithm for solving the vehicle routing problem with backhauling”, in A. Kidder, editor, Proceedings of the Babson Conference on Software Uses in Transportation and Logistic Management, pages 75–96, Babson Park, 1984
M. Fischetti and P. Toth, “An additive bounding procedure for the asymmetric travelling salesman problem”, Mathematical Programmig, 53:173–197,1992
M. Fischetti, P. Toth, and D. Vigo, “A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs” Operations Research, 42(5): 846–859, 1994
M. Fisher, “Optimal solution of vehicle rou ting problems using minimum k-trees”, Operations Research, 42 (4): 626- 642, 1994
M. Fisher and R. Jaikumar, “A generalized assignment heuristic for vehicle routing problem”, Networks, 11(4):109–124, 1981
M. Goetschalckx and C. Jacobs-Blecha, “The vehicle routing problem with backhauls” European Journal of Operational Research, 42:39–51, 1989
M. Goetschalckx and C. Jacobs-Blecha, “The vehicle routing problem with backhauls: Properties and solution algorithms”, Technical Report MHRC-TR-88-13, Georgia Institute of Technology, 1993
B. Golden, E. Baker, T. Alfaro, and T. Schaffer, “The vehicle routing problem with backhauling: Two approaches”, in R. Hammesfahr, editor, Proceedings of the XXI Annual Meeting of S.E. TIMS, pages 90–92, Myrtle Beach, 1985
S. Lin, “Computer solutions to the travelling salesman problem” Bell System Technical Journal, 44:2245–2269, 1965
S. Lin and B. Kernighan, “An effective heuristic algorithm for the travelling salesman problem” Operations Research, 21:498–516, 1973
S. Martello and P. Toth, “Knapsack Problems: Algorithms and Computer Implementations”, John Wiley & Sons, Chichester, 1990
S. Martello and P. Toth, “Lower bounds and reduction procedures for the bin packing problem”, Discrete Applied Mathematics, 28: 59–70, 1990
G. Reinelt, “TSPLIB - a traveling salesman problem library” ORSA Journal on Computing, 3:376–384, 1991
M. Savelsbergh, “Computer Aided Routing” Ph.D. thesis, Centrum voor Wiskunde en Informatica, Amsterdam, 1988
P. Toth and D. Vigo, “An exact algorithm for the vehicle Touting problem with backhauls”, in Netflow ’93, Pisa, 1993
D. Vigo, “A heuristic algorithm for the asymmetric capacitated vehicle routing problem”, European Journal of Operational Research, to appear
C. Yano, T. Chan, L. Richter, T. Cutler, K. Murty, and D. McGettigan, “Vehicle routing at quality stores” Interfaces, 17:52–63, 1987
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Toth, P., Vigo, D. (1996). A Heuristic Algorithm for the Vehicle Routing Problem with Backhauls. In: Bianco, L., Toth, P. (eds) Advanced Methods in Transportation Analysis. Transportation Analysis. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85256-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-85256-5_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85258-9
Online ISBN: 978-3-642-85256-5
eBook Packages: Springer Book Archive