Article2015

Surrogate-Based Optimization for Solving a Mixed Integer Network Design Problem

Xiqun Michael Chen · Zheng Zhu · Xiang He · Lei Zhang

44 citations0/0 files storedTransportation Research Record Journal of the Transportation Research Board

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Traffic control and management Advanced Multi-Objective Optimization Algorithms

Abstract

This paper considers the bilevel mixed network design problem (MNDP) used in dynamic traffic assignment (DTA) and the simulation-based optimization solution. The upper level of the bilevel MNDP minimizes the network cost in terms of average travel time by the expansion of existing links and the addition of new candidate links. The lower level is a dynamic user-optimal condition that can be formulated as a variational inequality problem. The MNDP simultaneously finds optimal capacity expansions of existing links and new link additions. A surrogate-based optimization (SBO) framework is proposed for solving the MNDP that is characterized by expensive-to-evaluate objective functions. Because simulation was applied to evaluate those objective functions, additional complexity arose from the fine-grained representation of traffic dynamics in large-scale networks, which were not fully considered by the traditional static user equilibrium. SBO methods enjoy both the advantages of simulation in time-varying network performance evaluation and the efficiency of mathematical optimization. To be more specific, SBO produces computational time savings by exploring the input–output mapping surface in a more systematic and efficient way. For demonstrative purposes, a case study was conducted on the large-scale Montgomery County network in Maryland. In this example, a mesoscopic simulation-based DTA model, DTALite, was used to evaluate the system performance in response to various network design strategies. Results showed that the optimal investment with a moderate budget could reduce 17.73% of the network average travel time in the morning peak. The proposed framework is a general approach, which is ready for application to either continuous or discrete network design problems.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 44 citations exist upstream.

References

2013A review of urban transportation network design problems 2001Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future 1998Models and algorithms for road network design: a review and some new developments 2011Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach 2009Global optimum of the linearized network design problem with equilibrium flows 2013Global optimization methods for the discrete network design problem 1998A model and an algorithm for the dynamic user-optimal route choice problem 2013Dynamic origin–destination demand flow estimation under congested traffic conditions

Cited by

2016A simulation-based optimisation approach for identifying key determinants for sustainable transportation planning 2022Simulation-based optimization of large-scale dedicated bus lanes allocation: Using efficient machine learning models as surrogates 2018Informed Urban Transport Systems: Classic and Emerging Mobility Methods toward Smart Cities 2017A bi-level distributed approach for optimizing time-dependent congestion pricing in large networks: A simulation-based case study in the Greater Toronto Area

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.