Bicriterion discrete equilibrium network design problem

摘要: The budget network design problem and fixed-charge imply different economic pursuits on travel cost construction structure these two components in ways. A more general version of classic formulations is the biobjective problem. This article discusses an exact solution strategy for discrete with equilibrium constraints, which eliminates inexactness incompleteness deficiencies pertaining to heuristics or metaheuristics presented previous research. In particular, we adapted justified a dichotomic framework problem, complete set can be exhausted by repeatedly solving parameterized scalar updating parameter set. generalized Benders decomposition method, widely used nonlinear mixed integer programming problems, further implemented framework, offers efficient algorithmic tool Numerical results obtained from example problems justify optimality, completeness, efficiency method. © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 634, 286-305