Incorporating Environmental Justice Measures into Equilibrium-Based Network Design
- 1 January 2008
- journal article
- research article
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2089 (1) , 58-65
Abstract
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.Keywords
This publication has 16 references indexed in Scilit:
- Robust Transportation Network Design Under Demand UncertaintyComputer-Aided Civil and Infrastructure Engineering, 2006
- Selectorecombinative Genetic Algorithm to Relax Computational Complexity of Discrete Network Design ProblemTransportation Research Record: Journal of the Transportation Research Board, 2006
- Solution algorithm for the bi-level discrete network design problemTransportation Research Part B: Methodological, 2005
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Benefit distribution and equity in road network designTransportation Research Part B: Methodological, 2002
- Environmental Justice in Transportation PlanningJournal of the American Planning Association, 1999
- Approximate algorithms for the discrete network design problemTransportation Research Part B: Methodological, 1982
- A discrete transportation network design problem with combined trip distribution and assignmentTransportation Research Part B: Methodological, 1980
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956
- ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH.Proceedings of the Institution of Civil Engineers, 1952