01373031

Component

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

http://scholar.google.com...ller&publication_year=2012

The vehicle routing problem (VRP) is a classical problem in logistics that aims to design minimum-cost delivery routes from a centralized depot. A special case of the VRP arises in situations in which the network has a tree structure (TVRP). Such tree networks arise when the cost of road construction and maintenance is much more than the routing cost or when the transportation network consists of a main highway (e.g., Interstate system) and the customer locations are located off the highway. A heuristic for a constrained case of TVRP in which the vehicle fleet is capacitated and heterogeneous is proposed. The heuristic first determines the customers that will be served by each vehicle by use of bin-packing and Lagrangian-based generalized assignment algorithms. The individual vehicle routes are then determined by use of a depth-first search method. A procedure for further refinement of the heuristic solution quality is also described. The heuristic algorithm was implemented on two real-world networks and on randomly generated networks that varied in size from 20 to 120 nodes. The heuristic solution was found to be between 2% and 10% for almost all of the 200 instances tested and took a fraction of the time taken to find the optimal solution.

01450929

12-4088

English

pp 1–11

2012

Transportation Research Record: Journal of the Transportation Research Board

9780309223232

Print

Figures; Maps; References; Tables

Algorithms; Delivery vehicles; Heuristic methods; Logistics; Networks; Routing; Traffic assignment; Traveling salesman problem

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

TRIS, TRB, ATRI

Feb 8 2012 5:21PM

• Algorithm for Intermodal Optimal Multidestination Tour with Dynamic Travel Times
• Application of Principal Component Analysis to Predict Dynamic Origin–Destination Matrices
• Case Study–Based Evaluation of Stochastic Multicommodity Emergency Inventory Management Model
• Demand and Supply Calibration of Dynamic Traffic Assignment Models: Past Efforts and Future Challenges
• Distance-Based Dynamic Pricing Strategy for Managed Toll Lanes
• Dynamic Traveling Salesman Problem in Stochastic-State Network Setting for Search-and-Rescue Application
• Finding Minimum-Cost Dynamic Routing Policies in Stochastic-State Networks with Link Failures
• Model for Optimization of Locations of Schools and Student Transportation in Rural Areas
• Model to Locate Sensors for Estimation of Static Origin–Destination Volumes Given Prior Flow Information
• Path-Constrained Traffic Assignment: Model and Algorithm
• Stochastic Model for Estimation of Time-Varying Arterial Travel Time and Its Variability with Only Link Detector Data
• Update Strategies for Restricted Master Problems for User Equilibrium Traffic Assignment Problem: Computational Study
• Welfare Effects of Congestion Pricing and Transit Services in Multiclass Multimodal Networks