01088410

Component

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

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

A new variation of the user equilibrium–discrete network design problem (UE-DNDP) is proposed for achieving environmental justice (EJ) or equity among population groups. This research is motivated by the federal requirement that transportation plans using federal money include an evaluation of EJ and that the planning agency mitigate, where feasible, any disproportionate impacts on protected populations (i.e., minority and low-income groups). Eight potential objective functions focused on maximizing equity of congestion and travel time are developed and discussed with regard to their applicability for the upper level of this bilevel problem. On the basis of assumed knowledge of the origin–destination travel matrices by population group, numerical analysis is conducted to assess the performance of each proposed formulation. The lower-level UE problem is solved by using the Frank–Wolfe method, and because of the hard combinatorial nature of EJ-UE-DNDP, a selectorecombinative genetic algorithm is implemented to search the solution space for feasible network improvement strategies efficiently. The results of numerical analysis suggest that Pareto-optimal approaches can be successfully applied and that the most effective formulations minimize the difference between the change in congestion or travel time across population groups due to the selected improvement projects.

01121598

English

pp 58-65

2008

Transportation Research Record: Journal of the Transportation Research Board

9780309126014

Print

Figures (4) ; References (25) ; Tables (2)

Environmental justice; Equity; Genetic algorithms; Improvements; Low income groups; Minorities; Traffic congestion; Travel time

Network design; User equilibrium

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

TRIS, TRB, ATRI

Jan 29 2008 3:27PM

• 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
• 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
• Planning Approximations to the Average Length of Vehicle Routing Problems with Varying Customer Demands and Routing Constraints
• Solution Algorithm for Long-Haul Freight Network Design Using Shipper–Carrier Freight Flow Prediction with Explicit Capacity Constraints