A novel discrete network design problem formulation and its global optimization solution algorithm
By David Z. W. Wang, Haoxiang Liu, Wai Yuen Szeto. 2015
126 citations recorded by the source corpus.
Conventional discrete transportation network design problem deals with the optimal decision on new link addition, assuming the capacity of each candidate link addition is predetermined and fixed. In this paper, we address a novel yet general discrete network design problem formulation that aims to determine the optimal new link addition and their optimal capacities simultaneously, which answers the questions on whether a new link should be added or not, and if added, what should be the optimal link capacity. A global optimization method employing linearization, outer approximation and range reduction techniques is developed to solve the formulated model.
Subfields: Control and Systems Engineering, Ocean Engineering, Transportation
View Paper: https://www.semanticscholar.org/paper/9112e2f84b2bb16738e9d5e34a844262fdba10f3
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Control and Systems Engineering
In Ocean Engineering
In Transportation
Citations in the corpus
- Identification of critical combination of vulnerable links in transportation networks – a global optimisation approach (2016, methodology): “Many global optimisation solution methods have been developed to solve the transportation NDPs (Wang and Lo 2010; Luathep et al. 2011a; Wang, Meng, and Yang 2013; Ekström, Rydergren, and Sumalee 2014; Liu et al. 2015; Liu and Wang 2015; Riemann, Wang, and Busch 2015; Wang, Liu, and Szeto 2015).”