Goal Programming Approach to Solve the Stochastic Multi-Objective Network Design Problem

Anthony Chen () and Xiangdong Xu ()
Additional contact information
Anthony Chen: Utah State University
Xiangdong Xu: Utah State University

Chapter Chapter 10 in Network Reliability in Practice, 2012, pp 151-170 from Springer

Abstract: Abstract The network design problem (NDP) is one of the optimizing improvements of a transportation network with respect to a set of system-wide objectives while considering the route choice behavior of network users. It involves making the optimal decisions at the strategic, tactical, and operational levels as to how to choose improvements for the network in such a way as to make efficient use of limited resources to achieve the stated objectives (e.g., minimizing total travel time, minimizing pollution, and minimizing inequity).

Keywords: Goal Programming; Network Design Problem; Traffic Assignment; Chance Constraint; Total Travel Time (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:trachp:978-1-4614-0947-2_10

Ordering information: This item can be ordered from
http://www.springer.com/9781461409472

DOI: 10.1007/978-1-4614-0947-2_10

Access Statistics for this chapter

More chapters in Transportation Research, Economics and Policy from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().