Resource constrained shortest path problems in path planning for fleet management

Resource constrained shortest path problems in path planning for fleet management

0.00 Avg rating0 Votes
Article ID: iaor20043734
Country: Netherlands
Volume: 3
Issue: 1
Start Page Number: 1
End Page Number: 17
Publication Date: Jan 2004
Journal: Journal of Mathematical Modelling and Algorithms
Authors: , ,
Keywords: fleet management
Abstract:

In the management and control of a vehicle fleet on a road network, the problem arises of finding the best route in relation to the mission of the fleet and to the typology of freight or users. Sometimes the route has to be adapted not only to current traffic conditions, but also to the physical, geometric and functional attributes of the roads, related to their urban location and environmental characteristics. This problem is approached here through an extension of the classic Shortest Path problem, named Resource Constrained Shortest Path problem (RCSP), where the resources are related to the road link attributes, assumed as relevant to the specific planning problem. A classification scheme of these attributes is first proposed and RCSP is described and reviewed. Next, a General Resource Constrained Shortest Path problem is defined, which can be found in all cases where it is necessary to plan, statically or dynamically, the path of a vehicle and to respect a set of constraints expressed in terms of parameters and indices associated with the roads on the network. For this general problem a model has been formulated and a Branch and Cut solution approach is proposed. Computational results obtained on test and real networks during the experimentation of a fleet with low emission vehicles are also given.

Reviews

Required fields are marked *. Your email address will not be published.