Summary
In this paper the Vehicle Routing-Allocation Problem (VRAP) is presented. In VRAP not all customers need be visited by the vehicles. However customers not visited either have to be allocated to some customer on one of the vehicle tours or left isolated.
We concentrate our discussion on the Single Vehicle Routing-Allocation Problem (SVRAP). An integer linear programming formulation of SVRAP is presented and we show how SVRAP provides a unifying framework for understanding a number of the papers and problems presented in the literature.
Specifically the covering tour problem, the covering salesman problem, the median tour problem, the maximal covering tour problem, the travelling salesman problem, the generalised travelling salesman problem, the selective travelling salesman problem, the prize collecting travelling salesman problem, the maximum covering/shortest path problem, the maximum population/shortest path problem, the shortest covering path problem, the median shortest path problem, the minimum covering/shortest path problem and the hierarchical network design problem are special cases/variants of SVRAP.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arkin, E.M. and R. Hassin (1994). Approximation algorithms for the geometric covering salesman problem.Discrete Applied Mathematics,55, 197–218.
Balas, E. (1989). The prize collecting travelling salesman problem.Networks,19, 621–636.
Bienstock, D., M.X. Goemans, D. Simchi-Levi and D. Williamson (1993). A note on the prize collecting traveling salesman problem.Mathematical Programming,59, 413–420.
Current, J.R. (1981). Multiobjective design of transportation networks. PhD thesis, Department of Geography and Environmental Engineering, The John Hopkins University, Baltimore, MD.
Current, J.R. (1988). The design of a hierarchical transportation network with transshipment facilities.Transportation Science,22, 270–277.
Current, J. and H. Pirkul (1991). The hierarchical network design problem with transshipment facilities.European Journal of Operational Research,52, 338–347.
Current, J., H. Pirkul and E. Rolland (1994). Efficient algorithms for solving the shortest covering path problem.Transportation Science,28, 317–327.
Current, J., C. ReVelle and J. Cohon (1984). The shortest covering path problem: an application of locational constraints to network design.Journal of Regional Science,24, 161–183.
Current, J.R., C.S. ReVelle and J.L. Cohon (1985). The maximum covering/shortest path problem: a multiobjective network design and routing formulation.European Journal of Operational Research,21, 189–199.
Current, J.R., C.S. ReVelle and J.L. Cohon, (1986). The hierarchical network design problem.European Journal of Operational Research,27, 57–66.
Current, J.R., C. S. ReVell and J.L. Cohon (1987). The medial shortest path problem: a multiobjective approach to analyze cost vs. accessibility in the design of transportation networks.Transportation Sciences,21, 188–197.
Current, J., C. ReVelle and J. Cohon (1988). The minimum-covering/shortest-path problem.Decision Sciences,19, 490–503.
Current, J.R. and D.A. Schilling (1989). The covering salesman problem.Transportation Science,23, 208–213.
Current, J.R. and D.A. Schilling (1994). The median tour and maximal covering tour problems: formulations and heuristics.European Journal of Operational Research,73, 114–126.
Duin, C. and A. Volgenant (1989). Reducing the hierarchical network design problem.European Journal of Operational Research,39, 332–344.
Fischetti, M. and P. Toth (1988). An additive approach for the optimal solution of the prize-collecting travelling salesman problem. InVehicle Routing: Method and Studies, 319–344, B.L. Golden and A.A. Assad (eds), North-Holland, Amsterdam.
Galvão, R.D., H.A. Reinoso and E.M., Nascimento (1985). The single server set covering transportation problem: formulation, relaxations and relationship to TSP-based problem,Presented at the School on Combinatorial Optimization, Rio de Janeiro, Brazil.
Gendreau, M., G. Laporte and F. Semet (1995). The covering tour problem. Working Paper No. CRT-95-08, Centre de recherche sur les transports Université de Montreal, Case postale 6128, succursale centre-ville, Montreal, Canada H3C 3J7.
Labbe, M., and G. Laporte (1986) Maximizing user convenience and postal service efficiency in post box location.Belgian Journal of Operations Research, Statistics and Computer Science,26, 21–35.
Laporte, G. (1988). Location-routing problems. InVehicle Routing: Methods and Studies, Ch. III, 163–197, B.L. Golden and A.A. Assad, (eds.), North-Holland, Amsterdam.
Laporte, G. and S. Martello (1990). The selective travelling salesman problem.Discrete Applied Mathematics,26, 193–207.
Laporte, G. and Y. Nobert (1983) Generalized travelling salesman problem throughn sets of nodes: an integer programming approach.INFOR,21, 61–75.
Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (1989). The travelling salesman problem, John Wiley.
Nascimento, E.M. and G.B. Queiroz (1987). An user friendly manmachine interface for a class of the routing-location problems.Presented at the X Taller de Ingeniería de Sistemas, Santiago, Chile.
Pirkul, H., J. Current and V. Nagarajan (1991). The hierarchical network design problem: a new formulation and solution procedures.Transportation Science,25, 175–182.
Queiroz, G.B., E.M. Nascimento and L.A. Hess (1987). A graphic tool for the single server set covering transportation problem.Presented at the XX SBPO, Salvador, Brazil.
ReVelle, C. and G. Laporte (1993). New directions in plant location.Studies in Locational Analysis,5, 31–58.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Beasley, J.E., Nascimento, E.M. The Vehicle Routing-Allocation Problem: A unifying framework. Top 4, 65–86 (1996). https://doi.org/10.1007/BF02568604
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02568604