A novel discrete network design problem formulation and its global optimization solution algorithm |
| |
| Affiliation: | 1. Intelligent Transport Systems Lab, Swinburne University of Technology, Melbourne, Australia;2. Institute of Transport Studies, Monash University, Australia;3. The Hong Kong University of Science and Technology, Hong Kong;1. Department of Civil Engineering and Engineering Mechanics, Columbia University, United States;2. Department of Civil and Environmental Engineering, University of California, Davis, United States;3. Department of Civil and Environmental Engineering, University of Michigan, Ann Arbor, United States;4. University of Michigan Transportation Research Institute, University of Michigan, Ann Arbor, United States;5. Department of Civil and Environmental Engineering, University of Washington, Seattle, United States;6. College of Transport and Communications, Shanghai Maritime University, People’s Republic of China |
| |
| Abstract: | 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. |
| |
| Keywords: | Network design problem User equilibrium Mixed-integer linear programming Global optimization Range reduction |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
