The Vehicle Routing-Allocation Problem: A unifying framework |
| |
Authors: | J E Beasley E M Nascimento |
| |
Institution: | (1) The Management School, Imperial College, SW7 2AZ London, England |
| |
Abstract: | 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. |
| |
Keywords: | Vehicle Routing Location-Routing Allocation-Routing Location-Allocation-Routing |
本文献已被 SpringerLink 等数据库收录! |
|