{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T09:04:25Z","timestamp":1776071065362,"version":"3.50.1"},"reference-count":58,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["INFORMS Journal on Computing"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:p>The continuous network design problem (CNDP) has been recognized as one of the most challenging issues in the field of transportation. Existing approaches to solving the CNDP are primarily heuristic without convergence guarantee or suitable for handling small networks because of the inherent nonconvexity arising from its bilevel hierarchical structure. An efficient and convergent approach for solving the CNDP on large networks has been fervently sought. In this paper, we present a novel convergent approach centered around exploiting the inherent convexity-related structure within the CNDP. We first demonstrate that the CNDP can be equivalently formulated as a difference of convex (DC) program with all involved functions being either convex functions or DC functions. Then, by exploiting the DC structure, we give a convex programming approximation for the CNDP and subsequently propose a penalized sequential convex programming approach. Finally, we show that the proposed method can yield an approximately stationary point under commonly used conditions. A numerical study is conducted on some real networks from a reputable network repository for transportation research. The numerical results demonstrate that the proposed method achieves better solutions with faster computational speed, particularly on larger networks, as compared with two heuristic approaches and two convergent approaches.<\/jats:p>\n                  <jats:p>History: Accepted by Russell Bent, Area Editor for Network Optimization: Algorithms &amp; Applications.<\/jats:p>\n                  <jats:p>Funding: This research was supported by the National Science Foundation of China [Grants 72131007, 72140006, 12271161, 12222106, and 12326605], the Natural Science Foundation of Shanghai [Grant 22ZR1415900], and Guangdong Basic and Applied Basic Research Foundation [Grant 2022B1515020082].<\/jats:p>\n                  <jats:p>Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https:\/\/pubsonline.informs.org\/doi\/suppl\/10.1287\/ijoc.2024.0737 ) as well as from the IJOC GitHub software repository ( https:\/\/github.com\/INFORMSJoC\/2024.0737 ). The complete IJOC Software and Data Repository is available at https:\/\/informsjoc.github.io\/ .<\/jats:p>","DOI":"10.1287\/ijoc.2024.0737","type":"journal-article","created":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T10:18:01Z","timestamp":1744625881000},"page":"490-506","source":"Crossref","is-referenced-by-count":0,"title":["A Penalized Sequential Convex Programming Approach for Continuous Network Design Problems"],"prefix":"10.1287","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-2881-390X","authenticated-orcid":false,"given":"Lei","family":"Guo","sequence":"first","affiliation":[{"name":"School of Business, East China University of Science and Technology, Shanghai 200237, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haian","family":"Yin","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Southern University of Science and Technology, Shenzhen 518055, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Southern University of Science and Technology, Shenzhen 518055, China; and National Center for Applied Mathematics Shenzhen, Shenzhen 518000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"109","reference":[{"key":"B1","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(79)90004-3"},{"key":"B2","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2005.11.001"},{"key":"B3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.38.3.556"},{"key":"B4","volume-title":"Nonlinear Programming","author":"Bertsekas D","year":"1999","edition":"2"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"B6","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2021.1128"},{"key":"B7","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(04)00085-2"},{"key":"B8","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2008.01.020"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0176-2"},{"key":"B10","doi-asserted-by":"publisher","DOI":"10.1080\/02331939208843831"},{"key":"B11","doi-asserted-by":"publisher","DOI":"10.1080\/0233193031000149894"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52119-6_20"},{"key":"B13","unstructured":"Dempe S, Mehlitz P (2024) Duality-based single-level reformulations of bilevel optimization problems. Preprint, submitted May 13, https:\/\/arxiv.org\/abs\/2405.07672."},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9668-6"},{"key":"B15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580677"},{"key":"B16","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2021.1977810"},{"key":"B17","volume-title":"Deterministic Global Optimization: Theory, Methods and Applications","author":"Floudas CA","year":"2013"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582259"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.26.1.18"},{"key":"B20","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(84)90029-8"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.1137\/15M1016461"},{"key":"B22","unstructured":"Gao LL, Ye J, Yin H, Zeng S, Zhang J (2022) Value function based difference-of-convex algorithm for bilevel hyperparameter selection problems. Chaudhuri K, Jegelka S, Song L, Szepesvari C, Niu G, Sabato S, eds.\n                      Proc. 39th Internat. Conf. Machine Learn.\n                      (JMLR.org, Baltimore), 7164\u20137182."},{"key":"B23","doi-asserted-by":"crossref","unstructured":"Guo L, Yin H, Zhang J (2025) A penalized sequential convex programming approach for continuous network design problems. http:\/\/dx.doi.org\/10.1287\/ijoc.2024.0737.cd, https:\/\/github.com\/INFORMSJoC\/2024.0737.","DOI":"10.1287\/ijoc.2024.0737.cd"},{"key":"B24","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2019.0945"},{"key":"B25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64018-7_9"},{"key":"B26","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1235-y"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06569-4_2"},{"key":"B28","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2012.05.003"},{"key":"B29","unstructured":"Li J, Yu J, Liu B, Nie Y, Wang Z (2023) Achieving hierarchy-free approximation for bilevel programs with equilibrium constraints. Krause A, Brunskill E, Cho K, Engelhardt B, Sabato S, Scarlett J, eds.\n                      Proc. 40th Internat. Conf. Machine Learn\n                      . (JMLR.org, Honolulu, HI), 20312\u201320335."},{"key":"B30","volume-title":"Transportation Network Design Problems: An MPEC Approach","author":"Lim AC","year":"2002"},{"key":"B31","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0633-4"},{"key":"B32","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2014.10.009"},{"key":"B33","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.17.2.181"},{"key":"B34","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580580"},{"key":"B35","doi-asserted-by":"publisher","DOI":"10.1007\/BF02098178"},{"key":"B36","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(00)00016-3"},{"key":"B37","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2009.06.005"},{"key":"B38","doi-asserted-by":"publisher","DOI":"10.1007\/b98874"},{"key":"B39","first-page":"255","volume":"34","author":"Outrata JV","year":"1990","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"key":"B40","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2021.0110"},{"key":"B41","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-009-9514-z"},{"key":"B42","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.21.4.254"},{"key":"B43","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-022-09736-1"},{"key":"B44","unstructured":"Transportation Networks for Research Core Team (2023) Transportation networks for research. Accessed May 16, https:\/\/github.com\/bstabler\/TransportationNetworks."},{"key":"B45","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499359828"},{"key":"B46","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0307-7_10"},{"key":"B47","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-006-9093-1"},{"key":"B48","volume-title":"Marktform Und Gleichgewicht","author":"von Stackelberg H","year":"1934"},{"key":"B49","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2009.10.003"},{"key":"B50","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2022.07.004"},{"key":"B51","doi-asserted-by":"crossref","unstructured":"Wardrop JG (1952) Some theoretical aspects of road traffic research. Glanville W, Adams W, Bennett G, Green S, Bellamy D, Smeed R, Clayton A, Duff J, eds.\n                      Proc. Inst. Civil Engineers\n                      (Thomas Telford Ltd, London), 325\u2013362.","DOI":"10.1680\/ipeds.1952.11260"},{"key":"B52","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2021.1113"},{"key":"B53","doi-asserted-by":"publisher","DOI":"10.1080\/01441649808717016"},{"key":"B54","doi-asserted-by":"publisher","DOI":"10.1108\/9780080456713"},{"key":"B55","doi-asserted-by":"publisher","DOI":"10.1016\/0965-8564(94)E0007-V"},{"key":"B56","doi-asserted-by":"publisher","DOI":"10.1080\/02331939508844060"},{"key":"B57","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01888-3"},{"key":"B58","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-947X(2000)126:2(115)"}],"container-title":["INFORMS Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/ijoc.2024.0737","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T08:21:23Z","timestamp":1776068483000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/ijoc.2024.0737"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10.1287\/ijoc.2024.0737"],"URL":"https:\/\/doi.org\/10.1287\/ijoc.2024.0737","relation":{},"ISSN":["1091-9856","1526-5528"],"issn-type":[{"value":"1091-9856","type":"print"},{"value":"1526-5528","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]}}}