01592815

Component

https://doi.org/10.3141/2567-08

The hazardous materials (hazmat) network design problem (HNDP) is used to reduce the risk of transporting hazmat in the network by enforcing regulation policies. The goal of reducing risk can increase costs for hazmat carriers. Because the HNDP involves multiple parties, the cost increase for all carriers must be considered for implementation of regulations. Although upper bounds can be placed on the total increase, the actual cost increase for various origin–destination pairs can differ, resulting in unfairness among carriers. Thus, also considering cost equity in the HNDP is proposed. Additionally, because there are multiple solutions in current HNDP models and because of the possibility of unnecessarily closing road segments, a new objective considering the length of all the closed links is introduced. Computational experience is based on a real network, and results are shown for various cost consideration cases.

01618747

16-4734

English

pp 67–77

2016

Transportation Research Record: Journal of the Transportation Research Board

9780309441261

Print

Figures (5) ; References (20) ; Tables (4)

Design; Freight transportation; Hazardous materials; Networks; Regulation; Risk management

Data and Information Technology; Environment; Finance; Freight Transportation; Planning and Forecasting

TRIS, TRB, ATRI

Jan 12 2016 6:05PM

• Analysis of Advanced Management of Curbside Parking
• Data-Driven Prediction Methodology of Origin–Destination Demand in Large Network for Real-Time Service
• Deployment and Calibration Considerations for Large-Scale Regional Dynamic Traffic Assignment: Case Study for Sydney, Australia
• Dynamic Optimal Vehicle Relocation in Carshare Systems
• Genetic Algorithm–Based Routing Problem Considering the Travel Reliability Under Asymmetrical Travel Time Distributions
• Impact of Autonomous Vehicles on Traffic Management: Case of Dynamic Lane Reversal
• Modeling Freeway Work Zones with Mesoscopic Dynamic Traffic Simulator: Validation, Gaps, and Guidance
• Optimal Heterogeneous Sensor Deployment Strategy for Dynamic Origin–Destination Demand Estimation
• Parallel All-Pairs Shortest Path Algorithm: Network Decomposition Approach
• Path Finding in Stochastic Time Varying Networks with Spatial and Temporal Correlations for Heterogeneous Travelers
• Planning of Resource Replenishment Location for Service Trucks Under Network Congestion and Routing Constraints
• Pricing and Segmentation of Stochastic Demand in Less-Than-Truckload Combinatorial Bids
• Solving Continuous Network Design Problem with Generalized Geometric Programming Approach
• Use of Concepts of Regret and Disappointment to Model Dynamic Route Choice Behavior Under Uncertainty