Goal programming approach to solving network design problem with multiple objectives and demand uncertainty

Authors:
Anthony Chen;Xiangdong Xu
Affiliations:
Department of Civil and Environmental Engineering, Utah State University, USA;Department of Civil and Environmental Engineering, Utah State University, USA and School of Transportation, Southeast University, China
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 4
Cited 2

Study on continuous network design problem using simulated annealing and genetic algorithm

Expert Systems with Applications: An International Journal
Theory and Practice of Uncertain Programming

Theory and Practice of Uncertain Programming
Stochastic multi-objective models for network design problem

Expert Systems with Applications: An International Journal
Activity assigning of fourth party logistics by particle swarm optimization-based preemptive fuzzy integer goal programming

Expert Systems with Applications: An International Journal

A fuzzy multi-objective approach for sustainable investments

Expert Systems with Applications: An International Journal
Network infrastructure design with a multilevel algorithm

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

Visualization

Abstract

The transportation network design problem (NDP) with multiple objectives and demand uncertainty was originally formulated as a spectrum of stochastic multi-objective programming models in a bi-level programming framework. Solving these stochastic multi-objective NDP (SMONDP) models directly requires generating a family of optimal solutions known as the Pareto-optimal set. For practical implementation, only a good solution that meets the goals of different stakeholders is required. In view of this, we adopt a goal programming (GP) approach to solve the SMONDP models. The GP approach explicitly considers the user-defined goals and priority structure among the multiple objectives in the NDP decision process. Considering different modeling purposes, we provide three stochastic GP models with different philosophies to model planners' NDP decision under demand uncertainty, i.e., the expected value GP model, chance-constrained GP model, and dependent-chance GP model. Meanwhile, a unified simulation-based genetic algorithm (SGA) solution procedure is developed to solve all three stochastic GP models. Numerical examples are also presented to illustrate the practicability of the GP approach in solving the SMONDP models as well as the robustness of the SGA solution procedure.