Integration of selecting and scheduling urban road construction projects as a time-dependent discrete network design problem

•Three different bi-level programming models based on DNDP are developed.•A general framework and an evolutionary approach are proposed to solve the model.•A procedure is proposed to reduce significantly the model solution time.•Computational tests show acceptable performance of the proposed approac...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 246; no. 3; pp. 762 - 771
Main Authors:	Hosseininasab, Seyyed-Mohammadreza, Shetab-Boushehri, Seyyed-Nader
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.11.2015 Elsevier Sequoia S.A
Subjects:	Assignment problem Decision making models Genetic algorithm Genetic algorithms Highway construction Mathematical programming Network design problem Project management Project selection Scheduling of transportation projects Studies Taguchi methods Traffic assignment Transportation Project selection Genetic algorithm Transportation Scheduling of transportation projects Network design problem
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	•Three different bi-level programming models based on DNDP are developed.•A general framework and an evolutionary approach are proposed to solve the model.•A procedure is proposed to reduce significantly the model solution time.•Computational tests show acceptable performance of the proposed approach. Decision making on the selection of transportation infrastructure projects is an interesting subject to both transportation authorities and researchers. Due to resource limitations, the selected projects should then be scheduled during the planning horizon. Integration of selecting and scheduling projects into a single model increases the accuracy of results; however it leads to more complexity. In this paper, first, three different mathematical programming models are presented to integrate selecting and scheduling of urban road construction projects as a time-dependent discrete network design problem. Then, the model that seems more flexible and realistic is selected and an evolutionary approach is proposed to solve it. The proposed approach is a combination of three well-known techniques: the phase-I of the two-phase simplex method, Frank-Wolfe algorithm, and genetic algorithm. Taguchi method is used to optimize the genetic algorithm parameters. The main difficulty in solving the model is due to the large number of subsequent network traffic assignment problems that should be solved which makes the solution process very time-consuming. Therefore, a procedure is proposed to overcome this difficulty by significantly reducing the traffic assignment problem solution time. In order to verify the performance of the proposed approach, 27 randomly generated test problems of different scales are applied to Sioux Falls urban transportation network. The proposed approach and full enumeration method are used to solve the problems. Numerical results show that the proposed approach has an acceptable performance in terms of both solution quality and solution time.
AbstractList	Decision making on the selection of transportation infrastructure projects is an interesting subject to both transportation authorities and researchers. Due to resource limitations, the selected projects should then be scheduled during the planning horizon. Integration of selecting and scheduling projects into a single model increases the accuracy of results; however it leads to more complexity. In this paper, first, three different mathematical programming models are presented to integrate selecting and scheduling of urban road construction projects as a time-dependent discrete network design problem. Then, the model that seems more flexible and realistic is selected and an evolutionary approach is proposed to solve it. The proposed approach is a combination of three well-known techniques: the phase-I of the two-phase simplex method, Frank-Wolfe algorithm, and genetic algorithm. Taguchi method is used to optimize the genetic algorithm parameters. The main difficulty in solving the model is due to the large number of subsequent network traffic assignment problems that should be solved which makes the solution process very time-consuming. Therefore, a procedure is proposed to overcome this difficulty by significantly reducing the traffic assignment problem solution time. In order to verify the performance of the proposed approach, 27 randomly generated test problems of different scales are applied to Sioux Falls urban transportation network. The proposed approach and full enumeration method are used to solve the problems. Numerical results show that the proposed approach has an acceptable performance in terms of both solution quality and solution time. •Three different bi-level programming models based on DNDP are developed.•A general framework and an evolutionary approach are proposed to solve the model.•A procedure is proposed to reduce significantly the model solution time.•Computational tests show acceptable performance of the proposed approach. Decision making on the selection of transportation infrastructure projects is an interesting subject to both transportation authorities and researchers. Due to resource limitations, the selected projects should then be scheduled during the planning horizon. Integration of selecting and scheduling projects into a single model increases the accuracy of results; however it leads to more complexity. In this paper, first, three different mathematical programming models are presented to integrate selecting and scheduling of urban road construction projects as a time-dependent discrete network design problem. Then, the model that seems more flexible and realistic is selected and an evolutionary approach is proposed to solve it. The proposed approach is a combination of three well-known techniques: the phase-I of the two-phase simplex method, Frank-Wolfe algorithm, and genetic algorithm. Taguchi method is used to optimize the genetic algorithm parameters. The main difficulty in solving the model is due to the large number of subsequent network traffic assignment problems that should be solved which makes the solution process very time-consuming. Therefore, a procedure is proposed to overcome this difficulty by significantly reducing the traffic assignment problem solution time. In order to verify the performance of the proposed approach, 27 randomly generated test problems of different scales are applied to Sioux Falls urban transportation network. The proposed approach and full enumeration method are used to solve the problems. Numerical results show that the proposed approach has an acceptable performance in terms of both solution quality and solution time.
Author	Hosseininasab, Seyyed-Mohammadreza Shetab-Boushehri, Seyyed-Nader
Author_xml	– sequence: 1 givenname: Seyyed-Mohammadreza surname: Hosseininasab fullname: Hosseininasab, Seyyed-Mohammadreza email: m.hosseininasab@in.iut.ac.ir – sequence: 2 givenname: Seyyed-Nader surname: Shetab-Boushehri fullname: Shetab-Boushehri, Seyyed-Nader email: shetab@cc.iut.ac.ir
BookMark	eNp9kE1LAzEURYMo2Fb_gKuA6xmTzEc64EaKH4WCC92HTPKmZpwmNckogj_etHXlonAhPLjnPXKm6NQ6CwhdUZJTQuubPofe-ZwRWuUkpWhO0ITOOcvqeU1O0YQUnGeMUX6OpiH0hKQmrSboZ2kjrL2MxlnsOhxgABWNXWNpNQ7qDfQ47MbRt9Ji76TGytkQ_aj2zNa7PhEByxQczQYyDVuwGmzE2gTlIQK2EL-cf8caglnvoXaAzQU66-QQ4PLvnaGXh_vXxVO2en5cLu5WmSp5GTNJSs61kgR4UVZl27VadkWjmkbrrqGyZUQWjJddU9dcUdVSWisOtKrrgrNihq4PW9PVjxFCFL0bvU0HBeWkokkKK1Nrfmgp70Lw0All4l5L9NIMghKxMy16sTMtdqYFSSmahLJ_6NabjfTfx6HbAwTp458GvAjKgFWgjU8-hXbmGP4L1wWc2g
CODEN	EJORDT
CitedBy_id	crossref_primary_10_1111_mice_13365 crossref_primary_10_1155_2022_5780549 crossref_primary_10_1080_15568318_2021_1963507 crossref_primary_10_1080_15732479_2021_1996399 crossref_primary_10_1016_j_cor_2021_105600 crossref_primary_10_1016_j_ejor_2024_08_012 crossref_primary_10_1371_journal_pone_0192454 crossref_primary_10_3233_JIFS_179760 crossref_primary_10_1016_j_trc_2024_104967 crossref_primary_10_1155_2022_4302175 crossref_primary_10_1016_j_autcon_2022_104336 crossref_primary_10_1049_itr2_12257 crossref_primary_10_1155_2022_4173243 crossref_primary_10_1155_2022_8264462 crossref_primary_10_1155_2022_3808895 crossref_primary_10_1016_j_ejor_2020_03_051 crossref_primary_10_1016_j_scs_2019_101981 crossref_primary_10_1155_2022_5747647 crossref_primary_10_1155_2022_9013770 crossref_primary_10_3390_app12105268 crossref_primary_10_1016_j_ejor_2018_04_051 crossref_primary_10_3389_fbuil_2020_560116 crossref_primary_10_3390_app15094614 crossref_primary_10_1016_j_tre_2019_08_008 crossref_primary_10_1016_j_ejor_2018_05_069 crossref_primary_10_1080_21680566_2024_2352494 crossref_primary_10_1155_2022_9135117 crossref_primary_10_1109_TNNLS_2019_2900544 crossref_primary_10_1016_j_ejor_2021_02_018 crossref_primary_10_1155_2018_2738930 crossref_primary_10_1155_2022_7559523 crossref_primary_10_1016_j_trb_2018_02_013 crossref_primary_10_1080_01605682_2025_2495766 crossref_primary_10_1155_2022_3828478 crossref_primary_10_1111_mice_12740 crossref_primary_10_1155_2022_1487746 crossref_primary_10_1155_2022_4359383 crossref_primary_10_1016_j_cie_2019_106075 crossref_primary_10_3390_su17010001 crossref_primary_10_1109_TITS_2019_2939544 crossref_primary_10_1155_2022_1270700 crossref_primary_10_1287_trsc_2016_0698 crossref_primary_10_1007_s12351_023_00756_y crossref_primary_10_1155_2018_4539324 crossref_primary_10_3390_su8111170 crossref_primary_10_1016_j_eswa_2018_03_034
Cites_doi	10.1016/j.ejor.2009.02.026 10.1111/mice.12033 10.1016/j.trb.2009.01.004 10.1080/01441649808717016 10.1016/S0191-2615(00)00016-3 10.1111/j.1467-8667.2010.00654.x 10.1057/jors.2014.55 10.1287/trsc.18.1.1 10.1080/18128600508685642 10.1016/j.ejor.2006.07.038 10.1080/1023697X.2007.10668097 10.1287/trsc.1050.0127 10.1287/opre.38.3.556 10.1016/j.ejor.2013.01.001 10.1016/j.trb.2004.06.004 10.1108/03684920910944146 10.1007/s00168-007-0170-2 10.1016/j.trb.2008.06.005 10.1287/trsc.9.3.183 10.1080/23249935.2014.927938 10.1007/s11116-004-8246-7 10.1007/s11067-012-9173-3
ContentType	Journal Article
Copyright	2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS) Copyright Elsevier Sequoia S.A. Nov 1, 2015
Copyright_xml	– notice: 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS) – notice: Copyright Elsevier Sequoia S.A. Nov 1, 2015
DBID	AAYXX CITATION 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D
DOI	10.1016/j.ejor.2015.05.039
DatabaseName	CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Business
EISSN	1872-6860
EndPage	771
ExternalDocumentID	3781686381 10_1016_j_ejor_2015_05_039 S0377221715004294
Genre	Feature
GroupedDBID	--K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AALRI AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c474t-a0477dca0e73454bfbdaf39c99ddf91ab20a3274f9667c1cb116c7e15663723
ISICitedReferencesCount	48
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000357754500009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0377-2217
IngestDate	Sun Nov 09 07:44:55 EST 2025 Sat Nov 29 01:41:13 EST 2025 Tue Nov 18 22:28:46 EST 2025 Fri Feb 23 02:27:38 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	Project selection Genetic algorithm Transportation Scheduling of transportation projects Network design problem
Language	English
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c474t-a0477dca0e73454bfbdaf39c99ddf91ab20a3274f9667c1cb116c7e15663723
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14
PQID	1705121724
PQPubID	45678
PageCount	10
ParticipantIDs	proquest_journals_1705121724 crossref_citationtrail_10_1016_j_ejor_2015_05_039 crossref_primary_10_1016_j_ejor_2015_05_039 elsevier_sciencedirect_doi_10_1016_j_ejor_2015_05_039
PublicationCentury	2000
PublicationDate	2015-11-01
PublicationDateYYYYMMDD	2015-11-01
PublicationDate_xml	– month: 11 year: 2015 text: 2015-11-01 day: 01
PublicationDecade	2010
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationTitle	European journal of operational research
PublicationYear	2015
Publisher	Elsevier B.V Elsevier Sequoia S.A
Publisher_xml	– name: Elsevier B.V – name: Elsevier Sequoia S.A
References	Farahani, Miandoabchi, Szeto, Rashidi (bib0004) 2013; 229 Szeto, Lo (bib0026) 2006; 40 LeBlanc (bib0011) 1975; 9 Goldberg (bib0008) 1989 Sheffi (bib0022) 1985 Ben-Ayed, Blair (bib0002) 1990; 38 Gallo, D'Acierno, Montella (bib0006) 2010; 201 Lo, Szeto (bib0012) 2003; 5 Kim, Kim, Song (bib0010) 2008; 42 Mitchell (bib0017) 1996 Szeto, Lo (bib0027) 2008; 42 Poorzahedy, Rouhani (bib0021) 2007; 182 Szeto, Jaber, O'Mahony (bib0023) 2010; 25 Jiang, Szeto (bib0009) 2015; 11 Weng, Qu (bib0030) 2009; 38 Yang, Bell (bib0031) 1998; 18 Farvaresh, Sepehri (bib0005) 2013; 13 O'brien, Szeto (bib0018) 2007; 14 Ukkusuri, Patil (bib0029) 2009; 43 Szeto, Wang, Wong (bib0028) 2014; 29 Szeto, Jiang, Wang, Sumalee (bib0024) 2013 Szeto, Lo (bib0025) 2005; 1 Magnanti, Wong (bib0014) 1984; 18 Meng, Yang, Bell (bib0015) 2001; 35 Miandoabchi, Daneshzand, Farahani, Szeto (bib0016) 2015 Lo, Szeto (bib0013) 2009; 43 Phadke (bib0019) 1989 Braess, Nagurney, Wakolbinger (bib0003) 2005; 39 Gao, Wu, Sun (bib0007) 2005; 39 Bazaraa, John, Sherali (bib0001) 2011 Poorzahedy, Abulghasemi (bib0020) 2005; 32 Szeto (10.1016/j.ejor.2015.05.039_bib0025) 2005; 1 Yang (10.1016/j.ejor.2015.05.039_bib0031) 1998; 18 Ben-Ayed (10.1016/j.ejor.2015.05.039_bib0002) 1990; 38 Miandoabchi (10.1016/j.ejor.2015.05.039_bib0016) 2015 Poorzahedy (10.1016/j.ejor.2015.05.039_bib0021) 2007; 182 Sheffi (10.1016/j.ejor.2015.05.039_bib0022) 1985 Ukkusuri (10.1016/j.ejor.2015.05.039_bib0029) 2009; 43 Gallo (10.1016/j.ejor.2015.05.039_bib0006) 2010; 201 Mitchell (10.1016/j.ejor.2015.05.039_bib0017) 1996 Szeto (10.1016/j.ejor.2015.05.039_bib0028) 2014; 29 Braess (10.1016/j.ejor.2015.05.039_bib0003) 2005; 39 Poorzahedy (10.1016/j.ejor.2015.05.039_bib0020) 2005; 32 Szeto (10.1016/j.ejor.2015.05.039_bib0023) 2010; 25 Szeto (10.1016/j.ejor.2015.05.039_bib0026) 2006; 40 Lo (10.1016/j.ejor.2015.05.039_bib0012) 2003; 5 O'brien (10.1016/j.ejor.2015.05.039_bib0018) 2007; 14 Szeto (10.1016/j.ejor.2015.05.039_bib0027) 2008; 42 Jiang (10.1016/j.ejor.2015.05.039_bib0009) 2015; 11 Kim (10.1016/j.ejor.2015.05.039_bib0010) 2008; 42 Goldberg (10.1016/j.ejor.2015.05.039_bib0008) 1989 Gao (10.1016/j.ejor.2015.05.039_bib0007) 2005; 39 Meng (10.1016/j.ejor.2015.05.039_bib0015) 2001; 35 Weng (10.1016/j.ejor.2015.05.039_bib0030) 2009; 38 Farvaresh (10.1016/j.ejor.2015.05.039_bib0005) 2013; 13 Szeto (10.1016/j.ejor.2015.05.039_bib0024) 2013 Farahani (10.1016/j.ejor.2015.05.039_bib0004) 2013; 229 Magnanti (10.1016/j.ejor.2015.05.039_bib0014) 1984; 18 Bazaraa (10.1016/j.ejor.2015.05.039_bib0001) 2011 Lo (10.1016/j.ejor.2015.05.039_bib0013) 2009; 43 Phadke (10.1016/j.ejor.2015.05.039_bib0019) 1989 LeBlanc (10.1016/j.ejor.2015.05.039_bib0011) 1975; 9
References_xml	– year: 2011 ident: bib0001 article-title: Linear programming and network flows – volume: 35 start-page: 83 year: 2001 end-page: 105 ident: bib0015 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: 39 start-page: 446 year: 2005 end-page: 450 ident: bib0003 article-title: On a paradox of traffic planning publication-title: Transportation Science – volume: 1 start-page: 47 year: 2005 end-page: 63 ident: bib0025 article-title: Strategies for road network design over time: Robustness under uncertainty publication-title: Transportmetrica – volume: 39 start-page: 479 year: 2005 end-page: 495 ident: bib0007 article-title: Solution algorithm for the bi-level discrete network design problem publication-title: Transportation Research Part B – year: 1989 ident: bib0008 article-title: Genetic algorithms in search, optimization and machine learning – volume: 11 start-page: 74 year: 2015 end-page: 101 ident: bib0009 article-title: Time-dependent transportation network design that considers health cost publication-title: Transportmetrica A: Transport Science – volume: 42 start-page: 376 year: 2008 end-page: 391 ident: bib0027 article-title: Time-dependent transport network improvement and tolling strategies publication-title: Transportation Research Part A – volume: 43 start-page: 142 year: 2009 end-page: 158 ident: bib0013 article-title: Time-dependent transport network design under cost-recovery publication-title: Transportation Research Part B – volume: 5 start-page: 1124 year: 2003 end-page: 1139 ident: bib0012 article-title: Time-dependent transport network design: A study on budget sensitivity publication-title: Journal of the Eastern Asia Society for Transportation Studies – year: 1989 ident: bib0019 article-title: Quality engineering using robust design – volume: 40 start-page: 227 year: 2006 end-page: 243 ident: bib0026 article-title: Transportation network improvement and tolling strategies: The issue of intergeneration equity publication-title: Transportation Research Part A – volume: 9 start-page: 183 year: 1975 end-page: 199 ident: bib0011 article-title: An algorithm for discrete network design problem publication-title: Transportation Science – volume: 18 start-page: 1 year: 1984 end-page: 55 ident: bib0014 article-title: Network design and transportation planning: models and algorithms publication-title: Transportation Science – year: 1996 ident: bib0017 article-title: An introduction to genetic algorithm – volume: 43 start-page: 625 year: 2009 end-page: 642 ident: bib0029 article-title: Multi-period transportation network design under demand uncertainty publication-title: Transportation Research Part B – start-page: 1 year: 2013 end-page: 32 ident: bib0024 article-title: A sustainable road network design problem with land use transportation interaction over time publication-title: Networks and Spatial Economics – volume: 13 start-page: 67 year: 2013 end-page: 106 ident: bib0005 article-title: A branch and bound algorithm for bi-level discrete network design problem publication-title: Networks and Spatial Economics – volume: 25 start-page: 411 year: 2010 end-page: 426 ident: bib0023 article-title: Time-dependent discrete network design frameworks considering land use publication-title: Computer-Aided Civil and Infrastructure Engineering – volume: 29 start-page: 140 year: 2014 end-page: 158 ident: bib0028 article-title: The chemical reaction optimization approach to solving the environmentally sustainable network design problem publication-title: Computer-Aided Civil and Infrastructure Engineering – volume: 42 start-page: 621 year: 2008 end-page: 642 ident: bib0010 article-title: Sequencing and scheduling highway network expansion using a discrete network design model publication-title: The Annals of Regional Science – volume: 14 start-page: 47 year: 2007 end-page: 55 ident: bib0018 article-title: The discrete network design problem over time publication-title: HKIE Transactions – volume: 182 start-page: 578 year: 2007 end-page: 596 ident: bib0021 article-title: Hybrid meta-heuristic algorithms for solving network design problem publication-title: European Journal of Operational Research – volume: 38 start-page: 556 year: 1990 end-page: 560 ident: bib0002 article-title: Computational difficulties of bilevel linear programming publication-title: Operations Research – volume: 18 start-page: 257 year: 1998 end-page: 278 ident: bib0031 article-title: Models and algorithms for road network design: a review and some new developments publication-title: Transport Reviews – year: 2015 ident: bib0016 article-title: Time-dependent discrete road network design with both tactical and strategic decisions publication-title: Journal of the Operational Research Society – volume: 229 start-page: 281 year: 2013 end-page: 302 ident: bib0004 article-title: A review of urban transportation network design problems publication-title: European Journal of Operational Research – volume: 201 start-page: 144 year: 2010 end-page: 157 ident: bib0006 article-title: A meta-heuristic approach for solving the urban network design problem publication-title: European Journal of Operational Research – year: 1985 ident: bib0022 article-title: Urban transportation network: Equilibrium analysis with mathematical programming methods – volume: 38 start-page: 441 year: 2009 end-page: 447 ident: bib0030 article-title: The optimization of road building schedule based on budget restriction publication-title: Kybernetes – volume: 32 start-page: 251 year: 2005 end-page: 273 ident: bib0020 article-title: Application of ant system to network design problem publication-title: Transportation – volume: 201 start-page: 144 year: 2010 ident: 10.1016/j.ejor.2015.05.039_bib0006 article-title: A meta-heuristic approach for solving the urban network design problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2009.02.026 – volume: 29 start-page: 140 issue: 2 year: 2014 ident: 10.1016/j.ejor.2015.05.039_bib0028 article-title: The chemical reaction optimization approach to solving the environmentally sustainable network design problem publication-title: Computer-Aided Civil and Infrastructure Engineering doi: 10.1111/mice.12033 – volume: 43 start-page: 625 issue: 6 year: 2009 ident: 10.1016/j.ejor.2015.05.039_bib0029 article-title: Multi-period transportation network design under demand uncertainty publication-title: Transportation Research Part B doi: 10.1016/j.trb.2009.01.004 – year: 1989 ident: 10.1016/j.ejor.2015.05.039_bib0008 – volume: 18 start-page: 257 issue: 3 year: 1998 ident: 10.1016/j.ejor.2015.05.039_bib0031 article-title: Models and algorithms for road network design: a review and some new developments publication-title: Transport Reviews doi: 10.1080/01441649808717016 – volume: 40 start-page: 227 issue: 3 year: 2006 ident: 10.1016/j.ejor.2015.05.039_bib0026 article-title: Transportation network improvement and tolling strategies: The issue of intergeneration equity publication-title: Transportation Research Part A – volume: 35 start-page: 83 year: 2001 ident: 10.1016/j.ejor.2015.05.039_bib0015 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: 25 start-page: 411 issue: 6 year: 2010 ident: 10.1016/j.ejor.2015.05.039_bib0023 article-title: Time-dependent discrete network design frameworks considering land use publication-title: Computer-Aided Civil and Infrastructure Engineering doi: 10.1111/j.1467-8667.2010.00654.x – year: 2015 ident: 10.1016/j.ejor.2015.05.039_bib0016 article-title: Time-dependent discrete road network design with both tactical and strategic decisions publication-title: Journal of the Operational Research Society doi: 10.1057/jors.2014.55 – volume: 18 start-page: 1 year: 1984 ident: 10.1016/j.ejor.2015.05.039_bib0014 article-title: Network design and transportation planning: models and algorithms publication-title: Transportation Science doi: 10.1287/trsc.18.1.1 – volume: 1 start-page: 47 issue: 1 year: 2005 ident: 10.1016/j.ejor.2015.05.039_bib0025 article-title: Strategies for road network design over time: Robustness under uncertainty publication-title: Transportmetrica doi: 10.1080/18128600508685642 – volume: 182 start-page: 578 issue: 2 year: 2007 ident: 10.1016/j.ejor.2015.05.039_bib0021 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 – year: 1985 ident: 10.1016/j.ejor.2015.05.039_bib0022 – volume: 14 start-page: 47 issue: 4 year: 2007 ident: 10.1016/j.ejor.2015.05.039_bib0018 article-title: The discrete network design problem over time publication-title: HKIE Transactions doi: 10.1080/1023697X.2007.10668097 – volume: 39 start-page: 446 issue: 4 year: 2005 ident: 10.1016/j.ejor.2015.05.039_bib0003 article-title: On a paradox of traffic planning publication-title: Transportation Science doi: 10.1287/trsc.1050.0127 – volume: 38 start-page: 556 issue: 3 year: 1990 ident: 10.1016/j.ejor.2015.05.039_bib0002 article-title: Computational difficulties of bilevel linear programming publication-title: Operations Research doi: 10.1287/opre.38.3.556 – volume: 229 start-page: 281 year: 2013 ident: 10.1016/j.ejor.2015.05.039_bib0004 article-title: A review of urban transportation network design problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.01.001 – start-page: 1 year: 2013 ident: 10.1016/j.ejor.2015.05.039_bib0024 article-title: A sustainable road network design problem with land use transportation interaction over time publication-title: Networks and Spatial Economics – volume: 39 start-page: 479 year: 2005 ident: 10.1016/j.ejor.2015.05.039_bib0007 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: 42 start-page: 376 issue: 2 year: 2008 ident: 10.1016/j.ejor.2015.05.039_bib0027 article-title: Time-dependent transport network improvement and tolling strategies publication-title: Transportation Research Part A – volume: 38 start-page: 441 issue: 3 year: 2009 ident: 10.1016/j.ejor.2015.05.039_bib0030 article-title: The optimization of road building schedule based on budget restriction publication-title: Kybernetes doi: 10.1108/03684920910944146 – volume: 42 start-page: 621 year: 2008 ident: 10.1016/j.ejor.2015.05.039_bib0010 article-title: Sequencing and scheduling highway network expansion using a discrete network design model publication-title: The Annals of Regional Science doi: 10.1007/s00168-007-0170-2 – volume: 43 start-page: 142 issue: 1 year: 2009 ident: 10.1016/j.ejor.2015.05.039_bib0013 article-title: Time-dependent transport network design under cost-recovery publication-title: Transportation Research Part B doi: 10.1016/j.trb.2008.06.005 – year: 2011 ident: 10.1016/j.ejor.2015.05.039_bib0001 – year: 1989 ident: 10.1016/j.ejor.2015.05.039_bib0019 – volume: 9 start-page: 183 year: 1975 ident: 10.1016/j.ejor.2015.05.039_bib0011 article-title: An algorithm for discrete network design problem publication-title: Transportation Science doi: 10.1287/trsc.9.3.183 – year: 1996 ident: 10.1016/j.ejor.2015.05.039_bib0017 – volume: 5 start-page: 1124 year: 2003 ident: 10.1016/j.ejor.2015.05.039_bib0012 article-title: Time-dependent transport network design: A study on budget sensitivity publication-title: Journal of the Eastern Asia Society for Transportation Studies – volume: 11 start-page: 74 issue: 1 year: 2015 ident: 10.1016/j.ejor.2015.05.039_bib0009 article-title: Time-dependent transportation network design that considers health cost publication-title: Transportmetrica A: Transport Science doi: 10.1080/23249935.2014.927938 – volume: 32 start-page: 251 year: 2005 ident: 10.1016/j.ejor.2015.05.039_bib0020 article-title: Application of ant system to network design problem publication-title: Transportation doi: 10.1007/s11116-004-8246-7 – volume: 13 start-page: 67 year: 2013 ident: 10.1016/j.ejor.2015.05.039_bib0005 article-title: A branch and bound algorithm for bi-level discrete network design problem publication-title: Networks and Spatial Economics doi: 10.1007/s11067-012-9173-3
SSID	ssj0001515
Score	2.386595
Snippet	•Three different bi-level programming models based on DNDP are developed.•A general framework and an evolutionary approach are proposed to solve the model.•A... Decision making on the selection of transportation infrastructure projects is an interesting subject to both transportation authorities and researchers. Due to...
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	762
SubjectTerms	Assignment problem Decision making models Genetic algorithm Genetic algorithms Highway construction Mathematical programming Network design problem Project management Project selection Scheduling of transportation projects Studies Taguchi methods Traffic assignment Transportation
Title	Integration of selecting and scheduling urban road construction projects as a time-dependent discrete network design problem
URI	https://dx.doi.org/10.1016/j.ejor.2015.05.039 https://www.proquest.com/docview/1705121724
Volume	246
WOSCitedRecordID	wos000357754500009&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: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELfKhhA88FGGGAzkB8RL5SrOx5w8FtRpQ6UgtaC-RY7jqK22pGvaaUP8ufwhnGM7TYdWwQNSFFXOh9rez3fn8939EHonfeokPEtgbcIi4ieUkoR7GYmyNKJZQFNR0XR-H7DhMJxMoq-t1i9bC3N1zvI8vL6OFv9V1DAGwlals_8g7vqlMACfQehwBrHD-a8Ef2YaQBhPsKyIbmwpIqxlwbZUJejrZQJze1lwVde26SPbMbGZUjHQ8Ip7nlim3JXazwE3cyU7uU4f76RVBkjH8NLcGec3Pi8MLG300bQZqsPRp2CupaKr4CWvNolG8uZGpuRzMeUXFzxdyh-1CRlN5Yon5EOxLqdyqovlze1DlZrdjGXQwBT11QE2W2QzkpfrYsY7o26voQ89xojr6lLPrtT6OmQuOQ41JYFV6K4Jas6aC_5KPRvN_4fZ0BGMeVfOC9UjlgZVN1fdZWm7R_fwS3zybTCIx_3JePuq9gmY4jEBnUbfLy6J4jZTOQCG6OUe2ndZEIHu3e-d9Sefao9BOZXVbpf5gaa4S-ch3v5OdzlQt1yJyj8aP0WPzcIG9zQgn6GWzNvoga2raKMnlj8EG3PSRo8azTCfo58N4OIiwzVwMQAXb4CLK-BiBVzcBC62wMUcDrwNXGyBiw1wsQYuNsA9QKOT_vjjKTHcIET4zF8R7viMpYI7knl-4CdZkvLMi0QUpWkWUZ64Dvdc5mewnGeCClBCx4JJFa3wmOu9QHt5kcuXCDOHC49nMhRC-oEEo-sEiQjUdnkaJsw5RNT-3bEwbfMVe8t5bPMj57ESUaxEFDtweNEh6tTPLHTTmJ13B1aKsXF7tTsbAzx3PndkRR6bmVzGqjsWVaRz_qvdl1-jh5sZeIT2QFjyDbovrlazcvnWIPQ3LE_faA
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=Integration+of+selecting+and+scheduling+urban+road+construction+projects+as+a+time-dependent+discrete+network+design+problem&rft.jtitle=European+journal+of+operational+research&rft.au=Hosseininasab%2C+Seyyed-Mohammadreza&rft.au=Shetab-Boushehri%2C+Seyyed-Nader&rft.date=2015-11-01&rft.pub=Elsevier+Sequoia+S.A&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=246&rft.issue=3&rft.spage=762&rft_id=info:doi/10.1016%2Fj.ejor.2015.05.039&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=3781686381
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon