Let's Connect
Follow Us
Watch Us
(+385) 1 2380 262
journal.prometfpz.unizg.hr
Promet - Traffic&Transportation journal

Accelerating Discoveries in Traffic Science

Accelerating Discoveries in Traffic Science

PUBLISHED
-
LICENSE
Copyright (c) 2024 Qun Chen, Haibo Chen

Solution Algorithm for a New Bi-Level Discrete Network Design Problem

Authors:

Qun Chen

Haibo Chen

Keywords:discrete network design problem, integer programming, branch-and-bound algorithm

Abstract

A new discrete network design problem (DNDP) was pro-posed in this paper, where the variables can be a series of integers rather than just 0-1. The new DNDP can determine both capacity improvement grades of reconstruction roads and locations and capacity grades of newly added roads, and thus complies with the practical projects where road capacity can only be some discrete levels corresponding to the number of lanes of roads. This paper designed a solution algorithm combining branch-and-bound with Hooke-Jeeves algorithm, where feasible integer solutions are recorded in searching the process of Hooke-Jeeves algorithm, lend -ing itself to determine the upper bound of the upper-level problem. The thresholds for branch cutting and ending were set for earlier convergence. Numerical examples are given to demonstrate the efficiency of the proposed algorithm.

References

  1. Yang, H., Bell, M.G.H. : Models and algorithms for road network design: a review and some new developments, Transport Reviews, Vol. 18, No. 3, 1998, pp. 257-278

    Chen, M.Y., Alfa, A.S. : A network design algorithm using a stochastic incremental traffic assignment approach, Transportation Science, Vol. 25, No. 3, 1991, pp. 214-224

    Davis, G.A.: Exact local solution of the continuous network design problem via stochastic user equilibrium assignment, Transportation Research Part B, Vol. 28, No. 1, 1994, pp. 61-75

    Patriksson, M.: On the applicability and solution of bilevel optimization models in transportation science: a study on the existence, stability and computation of optimal solutions to stochastic mathematical programs with equilibrium constraints. Transportation Research Part B, Vol. 42, No. 10, 2008, pp. 843–860

    Chiou, S.W.: Bilevel programming for the continuous transport network design problem , Transportation Research Part B, Vol. 39, No.4, 2005, pp. 361–383

    Meng, Q

Show more
How to Cite
Chen, Q. (et al.) 1900. Solution Algorithm for a New Bi-Level Discrete Network Design Problem. Traffic&Transportation Journal. 25, 6 (Jan. 1900), 513-524. DOI: https://doi.org/10.7307/ptt.v25i6.1424.

SPECIAL ISSUE IS OUT

Guest Editor: Eleonora Papadimitriou, PhD

Editors: Marko Matulin, PhD, Dario Babić, PhD, Marko Ševrović, PhD


Accelerating Discoveries in Traffic Science |
2024 © Promet - Traffic&Transportation journal