Publications
Searching for:
- "Vehicle routing problem"
Vehicle routing problem (VRP) is a generic name given to a whole class of problems concerning the optimal design of routes to be used by a fleet of vehicles to serve a set of customers.
Paper
Published: 2022
Summary:
This paper explores the value of providing parking availability data in urban environments for commercial vehicle deliveries. The research investigated how historic cruising and parking delay data can be leveraged to improve the routes of carriers in urban environments to increase cost efficiency. To do so, the research developed a methodology consisting of a travel time prediction model and a routing model to account for parking delay estimates.
This paper explores the value of providing parking availability data in urban environments for commercial vehicle deliveries. The research investigated how historic cruising and parking delay data can be leveraged to improve the routes of carriers in urban environments to increase cost efficiency. To do so, the research developed a methodology consisting of a travel time prediction model and a routing model to account for parking delay estimates.
Keywords:
Parking cruising behaviorCommercial vehicle and truck movementsVehicle routing problemUrban freight distributionRouting
Parking cruising behaviorCommercial vehicle and truck movementsVehicle routing problemUrban freight distributionRouting
Article
Published: 2022
Journal/Book: arXiv
Summary:
In this research we consider an approach for improving the efficiency and tightness of column generation (CG) methods for solving vehicle routing problems. This work builds upon recent work on Local Area (LA) routes. LA routes rely on pre-computing (prior to any call to pricing during CG) the lowest cost elementary sub-route (called an LA arc) for each tuple consisting of the following: (1) a customer to begin the LA arc, (2) a customer to end the LA arc, which...
In this research we consider an approach for improving the efficiency and tightness of column generation (CG) methods for solving vehicle routing problems. This work builds upon recent work on Local Area (LA) routes. LA routes rely on pre-computing (prior to any call to pricing during CG) the lowest cost elementary sub-route (called an LA arc) for each tuple consisting of the following: (1) a customer to begin the LA arc, (2) a customer to end the LA arc, which...
Article
Published: 2022
Journal/Book: arXiv e-prints (2022): arXiv-2209
Summary:
In this research we consider an approach for improving the efficiency and tightness of column generation (CG) methods for solving vehicle routing problems. This work builds upon recent work on Local Area (LA) routes. LA routes rely on pre-computing (prior to any call to pricing during CG) the lowest cost elementary sub-route (called an LA arc) for each tuple consisting of the following: (1) a customer to begin the LA arc, (2) a customer to end the LA arc, which...
In this research we consider an approach for improving the efficiency and tightness of column generation (CG) methods for solving vehicle routing problems. This work builds upon recent work on Local Area (LA) routes. LA routes rely on pre-computing (prior to any call to pricing during CG) the lowest cost elementary sub-route (called an LA arc) for each tuple consisting of the following: (1) a customer to begin the LA arc, (2) a customer to end the LA arc, which...