A single-level mixed integer linear formulation for a bi-level discrete network design problem
► An approximately equivalent single-level formulation for a bi-level discrete network design problem. ► An MILP formulation for discrete network design problem, handling side constraints. ► An efficient unimodular linear approximation scheme for nonlinear travel time function. Discrete network desi...
Gespeichert in:
| Veröffentlicht in: | Transportation research. Part E, Logistics and transportation review Jg. 47; H. 5; S. 623 - 640 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Exeter
Elsevier India Pvt Ltd
01.09.2011
Elsevier Elsevier Sequoia S.A |
| Schriftenreihe: | Transportation Research Part E: Logistics and Transportation Review |
| Schlagworte: | |
| ISSN: | 1366-5545, 1878-5794 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | ► An approximately equivalent single-level formulation for a bi-level discrete network design problem. ► An MILP formulation for discrete network design problem, handling side constraints. ► An efficient unimodular linear approximation scheme for nonlinear travel time function.
Discrete network design problem (DNDP) is generally formulated as a bi-level programming. In this paper, a single-level mixed integer linear programming (SL-MILP) formulation for bi-level DNDP is presented. To cope with the dependency of node-link adjacency matrix on new links, travel time function is appropriately modified. The nonlinearity of the travel time function is also removed by means of a convex-combination based linear approximation which takes advantage of a unimodular structure. Two valid inequalities is developed which shorten computation time significantly. The validity of the proposed formulation is examined by two test problems. SL-MILP is able to provide optimal solution. |
|---|---|
| AbstractList | Research highlights ao An approximately equivalent single-level formulation for a bi-level discrete network design problem. ao An MILP formulation for discrete network design problem, handling side constraints. ao An efficient unimodular linear approximation scheme for nonlinear travel time function. Discrete network design problem (DNDP) is generally formulated as a bi-level programming. In this paper, a single-level mixed integer linear programming (SL-MILP) formulation for bi-level DNDP is presented. To cope with the dependency of node-link adjacency matrix on new links, travel time function is appropriately modified. The nonlinearity of the travel time function is also removed by means of a convex-combination based linear approximation which takes advantage of a unimodular structure. Two valid inequalities is developed which shorten computation time significantly. The validity of the proposed formulation is examined by two test problems. SL-MILP is able to provide optimal solution. Discrete network design problem (DNDP) is generally formulated as a bi-level programming. In this paper, a single-level mixed integer linear programming (SL-MILP) formulation for bi-level DNDP is presented. To cope with the dependency of node-link adjacency matrix on new links, travel time function is appropriately modified. The nonlinearity of the travel time function is also removed by means of a convex-combination based linear approximation which takes advantage of a unimodular structure. Two valid inequalities is developed which shorten computation time significantly. The validity of the proposed formulation is examined by two test problems. SL-MILP is able to provide optimal solution. Discrete network design problem (DNDP) is generally formulated as a bi-level programming. In this paper, a single-level mixed integer linear programming (SL-MILP) formulation for bi-level DNDP is presented. To cope with the dependency of node-link adjacency matrix on new links, travel time function is appropriately modified. The nonlinearity of the travel time function is also removed by means of a convex-combination based linear approximation which takes advantage of a unimodular structure. Two valid inequalities is developed which shorten computation time significantly. The validity of the proposed formulation is examined by two test problems. SL-MILP is able to provide optimal solution. [PUBLICATION ABSTRACT] ► An approximately equivalent single-level formulation for a bi-level discrete network design problem. ► An MILP formulation for discrete network design problem, handling side constraints. ► An efficient unimodular linear approximation scheme for nonlinear travel time function. Discrete network design problem (DNDP) is generally formulated as a bi-level programming. In this paper, a single-level mixed integer linear programming (SL-MILP) formulation for bi-level DNDP is presented. To cope with the dependency of node-link adjacency matrix on new links, travel time function is appropriately modified. The nonlinearity of the travel time function is also removed by means of a convex-combination based linear approximation which takes advantage of a unimodular structure. Two valid inequalities is developed which shorten computation time significantly. The validity of the proposed formulation is examined by two test problems. SL-MILP is able to provide optimal solution. |
| Author | Sepehri, Mohammad Mehdi Farvaresh, Hamid |
| Author_xml | – sequence: 1 givenname: Hamid surname: Farvaresh fullname: Farvaresh, Hamid – sequence: 2 givenname: Mohammad Mehdi surname: Sepehri fullname: Sepehri, Mohammad Mehdi email: mehdi.sepehri@modares.ac.ir |
| BackLink | http://www.econis.eu/PPNSET?PPN=663469694$$DView this record in ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften http://econpapers.repec.org/article/eeetranse/v_3a47_3ay_3a2011_3ai_3a5_3ap_3a623-640.htm$$DView record in RePEc |
| BookMark | eNp9UT1vFDEQXaEgkQR-ABUWDdUu_ljP7ooqikICikQDLZbjHR8-vPZh-w7y7_HlDooUKZ49xfsYzTtrTkIM2DSvGe0YZfB-3ZWEHaeMdZR3lLJnzSkbh7GVw9Sf1FkAtFL28kVzlvOaVgZIftp8vyDZhZXH1uMOPVncH5yJCwVXmIh3AXUiNqZl63VxMexnosmdO_Jnl03CgiRg-R3TTzJjdqtANineeVxeNs-t9hlfHf_z5tvHq6-XN-3tl-tPlxe3rZGMlnbWQlgDnI8MZ8DBWsvBWqFhAAaAWstpACmQCs2nXiPgiL2tImmpsVKcN-8OvjX31xZzUUtdDL3XAeM2q3GkMDDKeWW-fcRcx20KdTk1DnyUUkJfSZ8PpIQbNGqT3KLTvULEknTIqHZK6H6oz33F_ur1cxWyYlMBXCjoqfpRlmr25mCGJgaX_7sBiB4mmPZxw4FhUsw5oVXGlYdz1zjnFaNqX7Jaq1qyeoijXNUKq5I9Uv5zf0rz4bhPLWTnMKlsHAaDs0toipqje0L9F864wJc |
| CODEN | TRERFW |
| CitedBy_id | crossref_primary_10_1016_j_retrec_2021_101109 crossref_primary_10_1177_0037549717733063 crossref_primary_10_1016_j_rtbm_2023_101037 crossref_primary_10_1287_ijoc_2024_0574 crossref_primary_10_1155_2019_6052931 crossref_primary_10_4028_www_scientific_net_AMM_505_506_613 crossref_primary_10_1016_j_tre_2017_09_005 crossref_primary_10_1631_FITEE_1601403 crossref_primary_10_1007_s11116_015_9674_2 crossref_primary_10_1016_j_tre_2023_103291 crossref_primary_10_1016_j_trb_2014_09_007 crossref_primary_10_1007_s10479_016_2223_3 crossref_primary_10_1080_01446193_2019_1682174 crossref_primary_10_1016_j_trb_2013_01_006 crossref_primary_10_1016_j_trb_2024_103056 crossref_primary_10_1016_j_trc_2016_05_020 crossref_primary_10_1002_atr_1402 crossref_primary_10_1016_j_tre_2016_03_016 crossref_primary_10_1109_TITS_2022_3227888 crossref_primary_10_1155_2012_686272 crossref_primary_10_1016_j_ssci_2023_106265 crossref_primary_10_1016_j_tranpol_2013_04_003 crossref_primary_10_3846_16484142_2015_1021835 crossref_primary_10_1155_2017_5839192 crossref_primary_10_1007_s11067_012_9173_3 crossref_primary_10_1016_j_trb_2025_103289 crossref_primary_10_1016_j_trpro_2018_12_163 crossref_primary_10_1016_j_ejor_2023_09_037 crossref_primary_10_1007_s00500_025_10407_3 crossref_primary_10_1016_j_trb_2019_05_011 crossref_primary_10_1016_j_trpro_2014_10_070 crossref_primary_10_1371_journal_pone_0192454 crossref_primary_10_1111_mice_12854 crossref_primary_10_1016_S1570_6672_13_60126_9 crossref_primary_10_1007_s10479_016_2171_y crossref_primary_10_1016_j_trb_2012_05_003 crossref_primary_10_1016_j_trb_2016_07_015 crossref_primary_10_1016_j_tre_2015_04_005 crossref_primary_10_1155_2013_549735 crossref_primary_10_1108_IJPDLM_07_2021_0288 crossref_primary_10_1155_2022_5023518 crossref_primary_10_3390_app112110143 crossref_primary_10_1109_TITS_2022_3142196 crossref_primary_10_1016_j_ejor_2018_05_069 crossref_primary_10_1016_j_trc_2018_03_014 crossref_primary_10_3141_2467_10 crossref_primary_10_1007_s11067_016_9332_z crossref_primary_10_1016_j_trb_2022_09_005 crossref_primary_10_3390_su15129556 crossref_primary_10_1002_atr_1266 crossref_primary_10_1016_j_trpro_2020_03_067 crossref_primary_10_1016_j_trb_2018_02_013 crossref_primary_10_1016_j_ijdrr_2019_101353 crossref_primary_10_1016_j_trc_2018_08_011 crossref_primary_10_1016_j_cor_2022_105959 crossref_primary_10_1111_mice_12224 crossref_primary_10_1111_mice_13435 crossref_primary_10_1016_j_trb_2014_02_003 crossref_primary_10_1088_1742_6596_1827_1_012196 crossref_primary_10_1016_j_trd_2017_07_008 crossref_primary_10_1061__ASCE_TE_1943_5436_0000591 |
| Cites_doi | 10.1007/s00168-005-0053-3 10.1016/S0927-0507(06)14010-4 10.1016/j.trb.2004.06.004 10.1287/trsc.9.3.183 10.1016/0191-2615(86)90021-4 10.1287/trsc.18.1.1 10.1287/trsc.26.1.18 10.1016/0191-2615(94)90031-0 10.1016/0191-2615(79)90003-1 10.1016/j.ejor.2006.07.038 10.1068/a050519 10.1016/S0167-6377(01)00063-3 10.1016/0191-2615(91)90033-F 10.1068/a161445 10.1016/j.trb.2009.06.005 10.1016/j.trb.2008.05.001 10.1016/0191-2607(85)90041-X 10.1080/10556789908805733 10.3141/1964-12 10.1002/nav.10026 10.1007/s11116-004-8246-7 10.1016/0191-2615(79)90004-3 10.1016/S0191-2615(00)00016-3 10.1287/trsc.36.4.398.549 10.1287/opre.46.2.247 10.1016/0191-2615(82)90040-6 10.1080/01441649808717016 10.1007/s11424-009-9177-3 10.1016/j.eswa.2007.11.023 10.1016/j.trb.2009.10.003 10.1016/S1570-6672(08)60068-9 10.1111/j.1435-5597.1994.tb00606.x |
| ContentType | Journal Article |
| Copyright | 2011 Elsevier Ltd Copyright Elsevier Sequoia S.A. Sep 2011 |
| Copyright_xml | – notice: 2011 Elsevier Ltd – notice: Copyright Elsevier Sequoia S.A. Sep 2011 |
| DBID | AAYXX CITATION OQ6 DKI X2L 8FD FR3 KR7 |
| DOI | 10.1016/j.tre.2011.02.001 |
| DatabaseName | CrossRef ECONIS RePEc IDEAS RePEc Technology Research Database Engineering Research Database Civil Engineering Abstracts |
| DatabaseTitle | CrossRef Technology Research Database Civil Engineering Abstracts Engineering Research Database |
| DatabaseTitleList | Technology Research Database Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Military & Naval Science Engineering |
| EISSN | 1878-5794 |
| EndPage | 640 |
| ExternalDocumentID | 2379814801 eeetranse_v_3a47_3ay_3a2011_3ai_3a5_3ap_3a623_640_htm 663469694 10_1016_j_tre_2011_02_001 S1366554511000184 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .~1 0R~ 123 13V 1B1 1~. 1~5 29Q 4.4 457 4G. 5VS 7-5 71M 8P~ AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABFNM ABJNI ABKBG ABMAC ABMMH ABMVD ABUCO ABXDB ABYKQ ACDAQ ACHRH ACIWK ACNTT ACRLP ADBBV ADEZE ADMUD AEBSH AEKER AFKWA AFTJW AGHFR AGJBL AGUBO AGUMN AGYEJ AIEXJ AIKHN AITUG AJBFU AJOXV AKYCK ALEQD ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK APLSM ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC BNSAS CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA HAMUX HVGLF HZ~ H~9 IHE J1W KOM M41 MO0 N9A O-L O9- OAUVE OHT OZT P-8 P-9 P2P PC. PQQKQ PRBVW PZZ Q38 R2- RIG ROL RPZ RWL RXW SCC SDF SDG SDP SES SEW SPCBC SSB SSD SSL SSO SSZ T5K TAE TN5 ZCA ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ADNMO AEIPS AFJKZ AGQPQ AIIUN ANKPU APXCP CITATION EFKBS ~HD OQ6 AALMO ABFLS ABPIF ADALY DKI IPNFZ PQEST X2L 8FD AGCQF FR3 KR7 |
| ID | FETCH-LOGICAL-c510t-da33fc62281ed6e7fff26ff3a676166eaa597653e03a294ae6e8e4f33f5f0cf53 |
| ISICitedReferencesCount | 59 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000291286600004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1366-5545 |
| IngestDate | Sat Sep 27 18:41:39 EDT 2025 Wed Aug 13 04:04:11 EDT 2025 Tue Nov 15 02:04:51 EST 2022 Sat Mar 08 16:08:37 EST 2025 Sat Nov 29 04:00:09 EST 2025 Tue Nov 18 20:52:15 EST 2025 Fri Feb 23 02:21:54 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | Multi-commodity flows Bi-level programming Discrete network design problem Transportation network |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c510t-da33fc62281ed6e7fff26ff3a676166eaa597653e03a294ae6e8e4f33f5f0cf53 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 872855564 |
| PQPubID | 17110 |
| PageCount | 18 |
| ParticipantIDs | proquest_miscellaneous_880671022 proquest_journals_872855564 repec_primary_eeetranse_v_3a47_3ay_3a2011_3ai_3a5_3ap_3a623_640_htm econis_primary_663469694 crossref_citationtrail_10_1016_j_tre_2011_02_001 crossref_primary_10_1016_j_tre_2011_02_001 elsevier_sciencedirect_doi_10_1016_j_tre_2011_02_001 |
| PublicationCentury | 2000 |
| PublicationDate | 2011-09-01 |
| PublicationDateYYYYMMDD | 2011-09-01 |
| PublicationDate_xml | – month: 09 year: 2011 text: 2011-09-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Exeter |
| PublicationPlace_xml | – name: Exeter |
| PublicationSeriesTitle | Transportation Research Part E: Logistics and Transportation Review |
| PublicationTitle | Transportation research. Part E, Logistics and transportation review |
| PublicationYear | 2011 |
| Publisher | Elsevier India Pvt Ltd Elsevier Elsevier Sequoia S.A |
| Publisher_xml | – name: Elsevier India Pvt Ltd – name: Elsevier – name: Elsevier Sequoia S.A |
| References | Abdulaal, Leblanc (b0005) 1979; 13 Sherali (b0165) 2001; 28 Bazaraa, Sherali, Shetty (b0020) 2006 Marcotte, P., Patriksson, M. 2007. Traffic equilibrium. In: Barnhart, C., Laporte, G. (Eds.), Handbook in Operations Research and Management Science. Boyce, Farhi, Weischedel (b0030) 1973; 5 Bar-Gera (b0015) 2002; 36 Lee, Yang (b0110) 1994; 32 Xiong, Y., Schneider, J.B., 1995. Transportation network design using a cumulative genetic algorithm and neural network. Transportation Research Record, 1364. Poorzahedy, Abulghasemi (b0145) 2005; 32 Sheffi (b0160) 1985 Karoonsoontawong, Waller (b0090) 2006; 1964 Freisz (b0065) 1985; 19 Nie (b0130) 2010; 44 Yang, Bell (b0200) 1998; 18 Poorzahedy, Rouhani (b0150) 2007; 182 Friesz, Cho, Mehta, Tobin, Anadalingam (b0070) 1992; 26 Zhang, Gao (b0205) 2009; 22 Chen, Alfa (b0035) 1991; 25 Kim, Kim (b0095) 2006; 40 Meng, Yang, Bell (b0125) 2001; 35 Magnanti, Wong (b0115) 1984; 18 Sun, Song, He, Chen (b0180) 2009; 9 Poorzahedy, Turnquist (b0155) 1982; 16 Leblanc (b0100) 1975; 9 Boyce (b0025) 1984; 16 Drezner, Salhi (b0050) 2002; 49 Haghani, Daskin (b0080) 1983; 944 Gao, Wu, Sun (b0075) 2005; 39 Wang, Lo (b0185) 2010; 44 Patriksson, M. 1994. The Traffic Assignment Problems: Models and Methods, Utercht, The Netherlands, VSP. Patriksson (b0140) 2008; 42 Steenbrink (b0170) 1974 Floudas (b0060) 1995 Holmberg, Hellstrand (b0085) 1998; 46 Asakura, Y., Sasaki, T., 1990. Formulation and feasibility test of optimal road network design model with endogenously determined travel demand. In: Proceedings of the 5th World Congress on Transport Research, Japan. Ferris, Meeraus, Rutherford (b0055) 1999; 10 Steenbrink (b0175) 1974; 8 Leblanc, Boyce (b0105) 1986; 20 Xu, Wei, Hu (b0195) 2009; 36 Dantzig, Harvey, Lansdowne, Robinson, Maier (b0040) 1979; 13 Davis (b0045) 1994; 28 Davis (10.1016/j.tre.2011.02.001_b0045) 1994; 28 Floudas (10.1016/j.tre.2011.02.001_b0060) 1995 Kim (10.1016/j.tre.2011.02.001_b0095) 2006; 40 Boyce (10.1016/j.tre.2011.02.001_b0025) 1984; 16 Drezner (10.1016/j.tre.2011.02.001_b0050) 2002; 49 Lee (10.1016/j.tre.2011.02.001_b0110) 1994; 32 Karoonsoontawong (10.1016/j.tre.2011.02.001_b0090) 2006; 1964 Poorzahedy (10.1016/j.tre.2011.02.001_b0150) 2007; 182 Dantzig (10.1016/j.tre.2011.02.001_b0040) 1979; 13 Zhang (10.1016/j.tre.2011.02.001_b0205) 2009; 22 Bar-Gera (10.1016/j.tre.2011.02.001_b0015) 2002; 36 10.1016/j.tre.2011.02.001_b0120 Sun (10.1016/j.tre.2011.02.001_b0180) 2009; 9 Poorzahedy (10.1016/j.tre.2011.02.001_b0145) 2005; 32 Nie (10.1016/j.tre.2011.02.001_b0130) 2010; 44 Bazaraa (10.1016/j.tre.2011.02.001_b0020) 2006 Leblanc (10.1016/j.tre.2011.02.001_b0105) 1986; 20 Yang (10.1016/j.tre.2011.02.001_b0200) 1998; 18 Freisz (10.1016/j.tre.2011.02.001_b0065) 1985; 19 Chen (10.1016/j.tre.2011.02.001_b0035) 1991; 25 Abdulaal (10.1016/j.tre.2011.02.001_b0005) 1979; 13 Boyce (10.1016/j.tre.2011.02.001_b0030) 1973; 5 Gao (10.1016/j.tre.2011.02.001_b0075) 2005; 39 Ferris (10.1016/j.tre.2011.02.001_b0055) 1999; 10 Friesz (10.1016/j.tre.2011.02.001_b0070) 1992; 26 Magnanti (10.1016/j.tre.2011.02.001_b0115) 1984; 18 10.1016/j.tre.2011.02.001_b0010 Steenbrink (10.1016/j.tre.2011.02.001_b0170) 1974 10.1016/j.tre.2011.02.001_b0135 Sheffi (10.1016/j.tre.2011.02.001_b0160) 1985 Haghani (10.1016/j.tre.2011.02.001_b0080) 1983; 944 10.1016/j.tre.2011.02.001_b0190 Patriksson (10.1016/j.tre.2011.02.001_b0140) 2008; 42 Meng (10.1016/j.tre.2011.02.001_b0125) 2001; 35 Poorzahedy (10.1016/j.tre.2011.02.001_b0155) 1982; 16 Steenbrink (10.1016/j.tre.2011.02.001_b0175) 1974; 8 Wang (10.1016/j.tre.2011.02.001_b0185) 2010; 44 Holmberg (10.1016/j.tre.2011.02.001_b0085) 1998; 46 Sherali (10.1016/j.tre.2011.02.001_b0165) 2001; 28 Leblanc (10.1016/j.tre.2011.02.001_b0100) 1975; 9 Xu (10.1016/j.tre.2011.02.001_b0195) 2009; 36 |
| References_xml | – volume: 13 start-page: 19 year: 1979 end-page: 32 ident: b0005 article-title: Continuous equilibrium network design models publication-title: Transportation Research Part B – year: 2006 ident: b0020 article-title: Nonlinear Programming – Theory and Algorithms – volume: 49 start-page: 449 year: 2002 end-page: 463 ident: b0050 article-title: Using hybrid metaheuristics for the one-way and two-way network design problem publication-title: Naval Research Logistics – volume: 46 start-page: 247 year: 1998 end-page: 259 ident: b0085 article-title: Solving the uncapacitated network design problem by a lagrangian heuristic and branch-and-bound publication-title: Operations Research – volume: 36 start-page: 1322 year: 2009 end-page: 1328 ident: b0195 article-title: Study on continuous network design problem using simulated annealing and genetic algorithm publication-title: Expert Systems with Applications – volume: 10 start-page: 669 year: 1999 end-page: 685 ident: b0055 article-title: Computing Wardropian equilibrium in a complementarity framework publication-title: Optimization Methods and Software – volume: 32 start-page: 119 year: 1994 end-page: 134 ident: b0110 article-title: Network design of one-way streets with simulated annealing publication-title: Papers in Regional Science – volume: 44 start-page: 482 year: 2010 end-page: 492 ident: b0185 article-title: Global optimum of the linearized network design problem with equilibrium flows publication-title: Transportation Research Part B – volume: 9 start-page: 103 year: 2009 end-page: 108 ident: b0180 article-title: Mixed transportation network design based on immune clone annealing algorithm publication-title: Journal of Transportation Systems Engineering and Information Technology – volume: 36 start-page: 398 year: 2002 end-page: 417 ident: b0015 article-title: Origin-based algorithm for the transportation assignment problem publication-title: Transportation Science – year: 1974 ident: b0170 article-title: Optimization of Transport Networks – volume: 40 start-page: 473 year: 2006 end-page: 491 ident: b0095 article-title: An equilibrium network design model with a social cost function for multimodal networks publication-title: The Annals of Regional Science – volume: 18 start-page: 1 year: 1984 end-page: 55 ident: b0115 article-title: Network design and transportation planning: models and algorithms publication-title: Transportation Science – reference: Asakura, Y., Sasaki, T., 1990. Formulation and feasibility test of optimal road network design model with endogenously determined travel demand. In: Proceedings of the 5th World Congress on Transport Research, Japan. – year: 1995 ident: b0060 article-title: Nonlinear and Mixed-integer Optimization – Fundamentals and Applications – volume: 9 start-page: 183 year: 1975 end-page: 199 ident: b0100 article-title: An algorithm for the discrete network design problem publication-title: Transportation Science – volume: 13 start-page: 5 year: 1979 end-page: 17 ident: b0040 article-title: Formulating and solving the network design problem by decomposition publication-title: Transportation Research Part B – volume: 1964 start-page: 104 year: 2006 end-page: 117 ident: b0090 article-title: Dynamic continuous network design problem: linear bilevel programming and metaheuristic approaches publication-title: Transportation Research Record – year: 1985 ident: b0160 article-title: Urban Transportation Network: Equilibrium Analysis with Mathematical Programming Methods – volume: 18 start-page: 257 year: 1998 end-page: 278 ident: b0200 article-title: Models and algorithms for road network design: a review and some new developments publication-title: Transport Review – volume: 26 start-page: 18 year: 1992 end-page: 26 ident: b0070 article-title: A simulated annealing approach to the network design problem with variational inequality constraints publication-title: Transportation Science – volume: 25 start-page: 405 year: 1991 end-page: 412 ident: b0035 article-title: Algorithm for solving fisk’s stochastic traffic assignment model publication-title: Transportation Research Part B – volume: 28 start-page: 155 year: 2001 end-page: 160 ident: b0165 article-title: On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions publication-title: Operations Research Letters – volume: 35 start-page: 83 year: 2001 end-page: 105 ident: b0125 article-title: An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem publication-title: Transportation Research Part B – volume: 32 start-page: 251 year: 2005 end-page: 273 ident: b0145 article-title: Application of ant system to network design problem publication-title: Transportation – volume: 182 start-page: 578 year: 2007 end-page: 596 ident: b0150 article-title: Hybrid meta-heuristic algorithms for solving network design problem publication-title: European Journal of Operational Research – volume: 20 start-page: 259 year: 1986 end-page: 265 ident: b0105 article-title: A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows publication-title: Transportation Research Part B – volume: 944 start-page: 37 year: 1983 end-page: 46 ident: b0080 article-title: Network design application of an extraction algorithm for network aggregation publication-title: Transportation Research Record – volume: 22 start-page: 446 year: 2009 end-page: 459 ident: b0205 article-title: Bilevel programming model and solution method for mixed transportation network design problem publication-title: Journal of Systems Science and Complexity – reference: Patriksson, M. 1994. The Traffic Assignment Problems: Models and Methods, Utercht, The Netherlands, VSP. – reference: Marcotte, P., Patriksson, M. 2007. Traffic equilibrium. In: Barnhart, C., Laporte, G. (Eds.), Handbook in Operations Research and Management Science. – volume: 28 start-page: 61 year: 1994 end-page: 75 ident: b0045 article-title: Exact local solution of the continuous network design problem via stochastic user equilibrium assignment publication-title: Transportation Research Part B – volume: 16 start-page: 45 year: 1982 end-page: 55 ident: b0155 article-title: Approximate algorithms for the discrete network design problem publication-title: Transportation Research Part B – volume: 42 start-page: 843 year: 2008 end-page: 860 ident: b0140 article-title: 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 publication-title: Transportation Research Part B – volume: 8 start-page: 11 year: 1974 end-page: 27 ident: b0175 article-title: Transport network optimization in the dutch integral transportation study publication-title: Transportation Research Part B – volume: 44 start-page: 73 year: 2010 end-page: 89 ident: b0130 article-title: A class of bush-based algorithms for the traffic assignment problem publication-title: Transportation Research Part B – volume: 16 start-page: 1445 year: 1984 end-page: 1474 ident: b0025 article-title: Urban transportation network equilibrium and design models: recent achievements and future prospectives publication-title: Environment and Planning, A – volume: 5 start-page: 519 year: 1973 end-page: 533 ident: b0030 article-title: Optimal network problem: a branch-and-bound algorithm publication-title: Environment and Planning – volume: 39 start-page: 479 year: 2005 end-page: 495 ident: b0075 article-title: Solution algorithm for the bi-level discrete network design problem publication-title: Transportation Research Part B – volume: 19 start-page: 413 year: 1985 end-page: 427 ident: b0065 article-title: Transportation network equilibrium, design and aggregation: key developments and research opportunities publication-title: Transportation Research Part A – reference: Xiong, Y., Schneider, J.B., 1995. Transportation network design using a cumulative genetic algorithm and neural network. Transportation Research Record, 1364. – volume: 40 start-page: 473 year: 2006 ident: 10.1016/j.tre.2011.02.001_b0095 article-title: An equilibrium network design model with a social cost function for multimodal networks publication-title: The Annals of Regional Science doi: 10.1007/s00168-005-0053-3 – ident: 10.1016/j.tre.2011.02.001_b0120 doi: 10.1016/S0927-0507(06)14010-4 – year: 1974 ident: 10.1016/j.tre.2011.02.001_b0170 – volume: 39 start-page: 479 year: 2005 ident: 10.1016/j.tre.2011.02.001_b0075 article-title: Solution algorithm for the bi-level discrete network design problem publication-title: Transportation Research Part B doi: 10.1016/j.trb.2004.06.004 – volume: 9 start-page: 183 year: 1975 ident: 10.1016/j.tre.2011.02.001_b0100 article-title: An algorithm for the discrete network design problem publication-title: Transportation Science doi: 10.1287/trsc.9.3.183 – volume: 20 start-page: 259 year: 1986 ident: 10.1016/j.tre.2011.02.001_b0105 article-title: A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows publication-title: Transportation Research Part B doi: 10.1016/0191-2615(86)90021-4 – volume: 18 start-page: 1 year: 1984 ident: 10.1016/j.tre.2011.02.001_b0115 article-title: Network design and transportation planning: models and algorithms publication-title: Transportation Science doi: 10.1287/trsc.18.1.1 – volume: 26 start-page: 18 year: 1992 ident: 10.1016/j.tre.2011.02.001_b0070 article-title: A simulated annealing approach to the network design problem with variational inequality constraints publication-title: Transportation Science doi: 10.1287/trsc.26.1.18 – volume: 28 start-page: 61 year: 1994 ident: 10.1016/j.tre.2011.02.001_b0045 article-title: Exact local solution of the continuous network design problem via stochastic user equilibrium assignment publication-title: Transportation Research Part B doi: 10.1016/0191-2615(94)90031-0 – volume: 13 start-page: 5 year: 1979 ident: 10.1016/j.tre.2011.02.001_b0040 article-title: Formulating and solving the network design problem by decomposition publication-title: Transportation Research Part B doi: 10.1016/0191-2615(79)90003-1 – volume: 8 start-page: 11 year: 1974 ident: 10.1016/j.tre.2011.02.001_b0175 article-title: Transport network optimization in the dutch integral transportation study publication-title: Transportation Research Part B – volume: 182 start-page: 578 year: 2007 ident: 10.1016/j.tre.2011.02.001_b0150 article-title: Hybrid meta-heuristic algorithms for solving network design problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.07.038 – volume: 5 start-page: 519 year: 1973 ident: 10.1016/j.tre.2011.02.001_b0030 article-title: Optimal network problem: a branch-and-bound algorithm publication-title: Environment and Planning doi: 10.1068/a050519 – volume: 28 start-page: 155 year: 2001 ident: 10.1016/j.tre.2011.02.001_b0165 article-title: On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions publication-title: Operations Research Letters doi: 10.1016/S0167-6377(01)00063-3 – volume: 25 start-page: 405 year: 1991 ident: 10.1016/j.tre.2011.02.001_b0035 article-title: Algorithm for solving fisk’s stochastic traffic assignment model publication-title: Transportation Research Part B doi: 10.1016/0191-2615(91)90033-F – ident: 10.1016/j.tre.2011.02.001_b0010 – volume: 16 start-page: 1445 year: 1984 ident: 10.1016/j.tre.2011.02.001_b0025 article-title: Urban transportation network equilibrium and design models: recent achievements and future prospectives publication-title: Environment and Planning, A doi: 10.1068/a161445 – volume: 44 start-page: 73 year: 2010 ident: 10.1016/j.tre.2011.02.001_b0130 article-title: A class of bush-based algorithms for the traffic assignment problem publication-title: Transportation Research Part B doi: 10.1016/j.trb.2009.06.005 – volume: 42 start-page: 843 year: 2008 ident: 10.1016/j.tre.2011.02.001_b0140 article-title: 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 publication-title: Transportation Research Part B doi: 10.1016/j.trb.2008.05.001 – volume: 19 start-page: 413 year: 1985 ident: 10.1016/j.tre.2011.02.001_b0065 article-title: Transportation network equilibrium, design and aggregation: key developments and research opportunities publication-title: Transportation Research Part A doi: 10.1016/0191-2607(85)90041-X – volume: 10 start-page: 669 year: 1999 ident: 10.1016/j.tre.2011.02.001_b0055 article-title: Computing Wardropian equilibrium in a complementarity framework publication-title: Optimization Methods and Software doi: 10.1080/10556789908805733 – volume: 1964 start-page: 104 year: 2006 ident: 10.1016/j.tre.2011.02.001_b0090 article-title: Dynamic continuous network design problem: linear bilevel programming and metaheuristic approaches publication-title: Transportation Research Record doi: 10.3141/1964-12 – volume: 49 start-page: 449 year: 2002 ident: 10.1016/j.tre.2011.02.001_b0050 article-title: Using hybrid metaheuristics for the one-way and two-way network design problem publication-title: Naval Research Logistics doi: 10.1002/nav.10026 – volume: 32 start-page: 251 year: 2005 ident: 10.1016/j.tre.2011.02.001_b0145 article-title: Application of ant system to network design problem publication-title: Transportation doi: 10.1007/s11116-004-8246-7 – year: 1985 ident: 10.1016/j.tre.2011.02.001_b0160 – ident: 10.1016/j.tre.2011.02.001_b0190 – volume: 13 start-page: 19 year: 1979 ident: 10.1016/j.tre.2011.02.001_b0005 article-title: Continuous equilibrium network design models publication-title: Transportation Research Part B doi: 10.1016/0191-2615(79)90004-3 – volume: 944 start-page: 37 year: 1983 ident: 10.1016/j.tre.2011.02.001_b0080 article-title: Network design application of an extraction algorithm for network aggregation publication-title: Transportation Research Record – volume: 35 start-page: 83 year: 2001 ident: 10.1016/j.tre.2011.02.001_b0125 article-title: An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem publication-title: Transportation Research Part B doi: 10.1016/S0191-2615(00)00016-3 – volume: 36 start-page: 398 year: 2002 ident: 10.1016/j.tre.2011.02.001_b0015 article-title: Origin-based algorithm for the transportation assignment problem publication-title: Transportation Science doi: 10.1287/trsc.36.4.398.549 – volume: 46 start-page: 247 year: 1998 ident: 10.1016/j.tre.2011.02.001_b0085 article-title: Solving the uncapacitated network design problem by a lagrangian heuristic and branch-and-bound publication-title: Operations Research doi: 10.1287/opre.46.2.247 – volume: 16 start-page: 45 year: 1982 ident: 10.1016/j.tre.2011.02.001_b0155 article-title: Approximate algorithms for the discrete network design problem publication-title: Transportation Research Part B doi: 10.1016/0191-2615(82)90040-6 – volume: 18 start-page: 257 year: 1998 ident: 10.1016/j.tre.2011.02.001_b0200 article-title: Models and algorithms for road network design: a review and some new developments publication-title: Transport Review doi: 10.1080/01441649808717016 – year: 2006 ident: 10.1016/j.tre.2011.02.001_b0020 – ident: 10.1016/j.tre.2011.02.001_b0135 – volume: 22 start-page: 446 year: 2009 ident: 10.1016/j.tre.2011.02.001_b0205 article-title: Bilevel programming model and solution method for mixed transportation network design problem publication-title: Journal of Systems Science and Complexity doi: 10.1007/s11424-009-9177-3 – year: 1995 ident: 10.1016/j.tre.2011.02.001_b0060 – volume: 36 start-page: 1322 year: 2009 ident: 10.1016/j.tre.2011.02.001_b0195 article-title: Study on continuous network design problem using simulated annealing and genetic algorithm publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2007.11.023 – volume: 44 start-page: 482 year: 2010 ident: 10.1016/j.tre.2011.02.001_b0185 article-title: Global optimum of the linearized network design problem with equilibrium flows publication-title: Transportation Research Part B doi: 10.1016/j.trb.2009.10.003 – volume: 9 start-page: 103 year: 2009 ident: 10.1016/j.tre.2011.02.001_b0180 article-title: Mixed transportation network design based on immune clone annealing algorithm publication-title: Journal of Transportation Systems Engineering and Information Technology doi: 10.1016/S1570-6672(08)60068-9 – volume: 32 start-page: 119 year: 1994 ident: 10.1016/j.tre.2011.02.001_b0110 article-title: Network design of one-way streets with simulated annealing publication-title: Papers in Regional Science doi: 10.1111/j.1435-5597.1994.tb00606.x |
| SSID | ssj0001652 |
| Score | 2.2401576 |
| Snippet | ► An approximately equivalent single-level formulation for a bi-level discrete network design problem. ► An MILP formulation for discrete network design... Discrete network design problem (DNDP) is generally formulated as a bi-level programming. In this paper, a single-level mixed integer linear programming... Research highlights ao An approximately equivalent single-level formulation for a bi-level discrete network design problem. ao An MILP formulation for discrete... |
| SourceID | proquest repec econis crossref elsevier |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 623 |
| SubjectTerms | Approximation Bi-level programming Discrete network design problem Discrete network design problem Bi-level programming Transportation network Multi-commodity flows Formulations Ganzzahlige Optimierung Güterverkehr Integer programming Linear programming Mathematical analysis Mathematical functions Mathematical problems Mixed integer Multi-commodity flows Networks Nonlinearity Time functions Transportation Transportation network Validation studies Verkehrsinfrastruktur Verkehrsplanung |
| Title | A single-level mixed integer linear formulation for a bi-level discrete network design problem |
| URI | https://dx.doi.org/10.1016/j.tre.2011.02.001 http://www.econis.eu/PPNSET?PPN=663469694 http://econpapers.repec.org/article/eeetranse/v_3a47_3ay_3a2011_3ai_3a5_3ap_3a623-640.htm https://www.proquest.com/docview/872855564 https://www.proquest.com/docview/880671022 |
| Volume | 47 |
| WOSCitedRecordID | wos000291286600004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1878-5794 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001652 issn: 1366-5545 databaseCode: AIEXJ dateStart: 19970301 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLf2dYADgsHUMkA-IA5EmZoPO86xmjYNtE0cBtqJyEle1E5tWqXZtP33PH9lWSdNgODgNEptx8n75fln-71nQj6mEbAoj0ufy7DwY5aO_JxVIyRyMi8qKFKmwzH8OE3Oz8XlZfptY3PP-cLczJK6Fre36fK_ihqvobCV6-wfiLurFC_gOQodjyh2PP6W4MeeGv7PwJ8peyBvPr2F0kSFgMZTpFI22mXR7ttlzCi9fGrzKzfdBpm0VxsDca_UNh6e3XmmT2a7wOimIhs3aHKAtLRpPW1meaodjFwk6Ha9QH9d4ljvUgQrPc9zIufO1F7ZIi9hYjzizxYTOZ_L0juDSTk1KlGFal6tN8ZZFLq2ROO1tjzK37WlvJ_UTftzIM45p6fHI859ZEpmwRzMNYEDZpaYPZWd8jfhPi3IWU-Tc-MGbUkBNzGlHvU3Zurj6qBtwIaDVfFfg_vOtTN5BAD9kiG7ySIZJ3i4w6QK4c8UE8O0xIR3zvB-2aSdb5LtMGEp6u_t8Zejy68dxwi43kuqe0y3Xq8tF9ca84Bx7ahplunqAfXqDa22G5Ro0WNYFy_JCzs0omMD6VdkA-pd8rwXMHOXDM50UPnmjn6i5xK_Gmr7ptfk55j2cU817qnFPTW4pz3cq3MqqcM9dbinFvfU4J5a3L8h34-PLg5PfLt5iF9gN9P6pYyiquBhKAIoOSRVVYW8qvD1JjzgHKTEoTRnEYxQCGksgYOAuMJCqKqKikV7ZKte1DAgVBSyCgRwAQXybRA59oKjIM8DXrIizMWQjNwLzgobWV9t8DLLnAnlVYYyybSsR6EyIx2Sz12RpQkr81TmgZFalxWHCTFPeRoPSezkmFnKbKhwhgh9qsZ9J_PMqq5VJpJQMMY4Vkq7f7GzUSuIsobFNWYRSG7VHNGQHGqkdC36K3i__Se17JNn9zrhHdlqm2t4T3aKm3a6aj7YL-cXYzwerg |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+single-level+mixed+integer+linear+formulation+for+a+bi-level+discrete+network+design+problem&rft.jtitle=Transportation+research.+Part+E%2C+Logistics+and+transportation+review&rft.au=Farvaresh%2C+Hamid&rft.au=Sepehri%2C+Mohammad+Mehdi&rft.series=Transportation+Research+Part+E%3A+Logistics+and+Transportation+Review&rft.date=2011-09-01&rft.pub=Elsevier&rft.issn=1366-5545&rft.eissn=1878-5794&rft.volume=47&rft.issue=5&rft.spage=623&rft.epage=640&rft_id=info:doi/10.1016%2Fj.tre.2011.02.001&rft.externalDocID=eeetranse_v_3a47_3ay_3a2011_3ai_3a5_3ap_3a623_640_htm |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1366-5545&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1366-5545&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1366-5545&client=summon |