01095588

Component

https://doi.org/10.3141/2089-01

http://scholar.google.com...ozzi&publication_year=2008

This paper studies approximations to the average length of vehicle routing problems (VRPs). The approximations are valuable for strategic and planning analysis of transportation and logistics problems. The focus is on VRPs with varying numbers of customers, demands, and locations. This modeling environment can be used in transport and logistics models that deal with a distribution center serving an area with daily variations in demand. The routes are calculated daily on the basis of what freight is available. New approximations and experimental settings are introduced. Average distance traveled is estimated as a function of the number of customers served and the number of routes needed. Approximations are tested in instances with different customer spatial distributions, demand levels, numbers of customers, and time windows. Regression results indicate that the proposed approximations can reasonably predict the average length of VRPs in randomly generated problems and real urban networks.

01121598

English

pp 1-8

2008

Transportation Research Record: Journal of the Transportation Research Board

9780309126014

Print

Figures (2) ; Maps (1) ; References (24) ; Tables (8)

Approximation (Mathematics); Customers; Demand; Logistics; Routing; Strategic planning; Time windows; Trip length; Trucking

Distribution centers; Urban networks

Freight Transportation; Highways; Planning and Forecasting; I72: Traffic and Transport Planning

TRIS, TRB

Jan 29 2008 4:18PM

• Combination of Multiple Ant Colony System and Simulated Annealing for the Multidepot Vehicle-Routing Problem with Time Windows
• Dynamic Shortest-Path Algorithm for Continuous Arc Travel Times: Implication for Traffic Incident Management
• Efficient Implementation of Improvement Procedures for Vehicle Routing with Time-Dependent Travel Times
• Equity and Efficiency Analysis of Pricing Strategies in a Bimodal Network with Heterogeneous User Groups
• Heuristic Framework for Optimizing Hurricane Evacuation Operations
• Incorporating Environmental Justice Measures into Equilibrium-Based Network Design
• Integrating Equity Objectives in a Road Network Design Model
• Location Routing Approach for the Humanitarian Prepositioning Problem
• Maximal Dynamic Expected Flows Problem for Emergency Evacuation Planning
• New Methodology for Optimizing Transit Priority at the Network Level
• Optimizing Distance-Based Fares and Headway of an Intercity Transportation System with Elastic Demand and Trip Length Differentiation
• Solution Algorithm for Long-Haul Freight Network Design Using Shipper–Carrier Freight Flow Prediction with Explicit Capacity Constraints