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

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Expert systems with applications Ročník 39; číslo 4; s. 4160 - 4170
Hlavní autoři: Chen, Anthony, Xu, Xiangdong
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.03.2012
Témata:
Chance-constrained model
Demand
Dependent-chance model
Expected value model
Goal programming
Marketing
Mathematical models
Multi-objective
Multiple objective
Network design
Programming
Stochasticity
Uncertainty
Chance-constrained model
Dependent-chance model
Network design
Multi-objective
Expected value model
Goal programming
ISSN:0957-4174, 1873-6793
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2011.09.118