Optimization of Urban Single-line Metro Timetable for Total Passenger Travel Time under Dynamic Passenger Demand
This paper studies the optimization of an urban single-line metro timetable for total passenger travel time adapted to dynamic passenger demand, which arises in an urban metro service and is a common problem in major cities. After analyzing the components of the total passenger travel time, a model...
Uloženo v:
| Vydáno v: | Procedia engineering Ročník 137; s. 151 - 160 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
2016
|
| Témata: | |
| ISSN: | 1877-7058, 1877-7058 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | This paper studies the optimization of an urban single-line metro timetable for total passenger travel time adapted to dynamic passenger demand, which arises in an urban metro service and is a common problem in major cities. After analyzing the components of the total passenger travel time, a model is presented with the aim of minimizing total passenger travel time. An S-pattern function is proposed to represent the cumulative demand function for each pair of origin and destination in an urban single-line metro. Furthermore, a spatial branch and bound algorithm that is applicable to the model is presented. The advantages of designing a timetable that optimizes the total passenger travel time adapted to dynamic passenger demand are depicted through extensive computational experiments on several cases derived from a real urban single-line metro. An extensive computational comparison of a regular timetable, a timetable optimizing average waiting time, and a timetable optimizing total passenger travel time timetable are performed. |
|---|---|
| AbstractList | This paper studies the optimization of an urban single-line metro timetable for total passenger travel time adapted to dynamic passenger demand, which arises in an urban metro service and is a common problem in major cities. After analyzing the components of the total passenger travel time, a model is presented with the aim of minimizing total passenger travel time. An S-pattern function is proposed to represent the cumulative demand function for each pair of origin and destination in an urban single-line metro. Furthermore, a spatial branch and bound algorithm that is applicable to the model is presented. The advantages of designing a timetable that optimizes the total passenger travel time adapted to dynamic passenger demand are depicted through extensive computational experiments on several cases derived from a real urban single-line metro. An extensive computational comparison of a regular timetable, a timetable optimizing average waiting time, and a timetable optimizing total passenger travel time timetable are performed. |
| Author | Li, Ruimin Shang, Pan Yang, Liya |
| Author_xml | – sequence: 1 givenname: Pan surname: Shang fullname: Shang, Pan organization: Institute of Transportation Engineering, Tsinghua University, Beijing 100084, China – sequence: 2 givenname: Ruimin surname: Li fullname: Li, Ruimin email: lrmin@tsinghua.edu.cn organization: Institute of Transportation Engineering, Tsinghua University, Beijing 100084, China – sequence: 3 givenname: Liya surname: Yang fullname: Yang, Liya organization: School of Public Administration and Policy, Renmin University of China, Beijing 100872, China |
| BookMark | eNqFkE1LAzEQhoNUsNb-Aw_5A7smu5vNrgdBWr-gUsH2HNLspKTsJiUbhfrrTVsPxYPOZT6Y9x3muUQD6ywgdE1JSgktbzbp1juw6zSLXUpomhXsDA1pxXnCCasGJ_UFGvf9huyDk4zRIdrOt8F05ksG4yx2Gi_9Slr8buy6haQ1FvArBO_wwnQQ5KoFrJ3HCxdki99k38fLEHsvP6E9LOEP28TJdGdlZ9TJzhQ6aZsrdK5l28P4J4_Q8vFhMXlOZvOnl8n9LFE5y0LCuGa1BiV1Xhd1yVWd51wDVJUuFCdaM1bFF6Apa1aqSq1KlRVNzfKa04ZkPB-h4uirvOt7D1psvemk3wlKxB6c2IgjOLEHJwgVEVyU3f6SKRMOcIKXpv1PfHcUQ3zs04AXvTJgFTTGgwqiceZvg2_7hI92 |
| CitedBy_id | crossref_primary_10_1016_j_cie_2024_110217 crossref_primary_10_1109_TITS_2018_2789910 crossref_primary_10_1109_TITS_2024_3386728 crossref_primary_10_1080_21680566_2022_2048120 crossref_primary_10_1155_2022_7494127 crossref_primary_10_1109_ACCESS_2020_3004274 crossref_primary_10_1177_0020294019877480 crossref_primary_10_3390_land13071021 crossref_primary_10_48130_dts_0025_0001 crossref_primary_10_1016_j_cie_2021_107858 crossref_primary_10_1016_j_physa_2022_128419 crossref_primary_10_1109_ACCESS_2019_2953733 crossref_primary_10_1016_j_engappai_2023_107393 crossref_primary_10_1016_j_trc_2024_104761 crossref_primary_10_1049_iet_its_2017_0049 crossref_primary_10_1080_21680566_2022_2040064 crossref_primary_10_1007_s13369_019_04189_8 crossref_primary_10_1155_2018_4613468 crossref_primary_10_1371_journal_pone_0326170 crossref_primary_10_3390_electronics12163493 crossref_primary_10_1177_1687814019848920 crossref_primary_10_3390_su15129556 |
| Cites_doi | 10.1080/10556780903087124 10.1016/j.trc.2013.08.016 10.1287/trsc.7.2.109 10.1016/S0098-1354(98)00027-1 10.1016/S0098-1354(98)00286-5 10.1016/j.ejor.2011.11.003 10.1016/j.trb.2010.09.001 10.1137/0402049 10.1016/j.ejor.2004.12.013 10.1016/j.trb.2014.08.013 10.1287/opre.50.5.851.362 10.1016/j.cor.2013.11.003 10.1287/inte.1080.0409 10.1287/trsc.35.2.181.10132 10.1016/0191-2615(94)90033-7 |
| ContentType | Journal Article |
| Copyright | 2016 |
| Copyright_xml | – notice: 2016 |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.proeng.2016.01.245 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1877-7058 |
| EndPage | 160 |
| ExternalDocumentID | 10_1016_j_proeng_2016_01_245 S1877705816002587 |
| GroupedDBID | --K 0R~ 0SF 1B1 4.4 457 5VS 6I. 71M AACTN AAEDT AAEDW AAFTH AAFWJ AAIKJ AALRI AAQFI AAXUO ABMAC ACGFS ADBBV ADEZE ADMUD AEXQZ AFTJW AGHFR AITUG ALMA_UNASSIGNED_HOLDINGS AMRAJ E3Z EBS EJD EP3 FDB FEDTE FNPLU HVGLF HZ~ IXB KQ8 M41 M~E NCXOZ O-L O9- OK1 OZT P2P RIG ROL SES SSZ XH2 9DU AAYWO AAYXX ABWVN ACRPL ACVFH ADCNI ADNMO ADVLN AEUPX AFPUW AIGII AKBMS AKRWK AKYEP CITATION ~HD |
| ID | FETCH-LOGICAL-c352t-57f59fecaf394967c9337fee88f4c70ff558702ed6956c8cb6c24d953971d0273 |
| ISICitedReferencesCount | 29 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000370820100019&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1877-7058 |
| IngestDate | Sat Nov 29 02:10:41 EST 2025 Tue Nov 18 22:09:42 EST 2025 Fri Feb 23 02:33:53 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | train timetable dynamic demand regular timetable total passenger travel time spatial branch and bound algorithm |
| Language | English |
| License | http://creativecommons.org/licenses/by-nc-nd/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c352t-57f59fecaf394967c9337fee88f4c70ff558702ed6956c8cb6c24d953971d0273 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.proeng.2016.01.245 |
| PageCount | 10 |
| ParticipantIDs | crossref_primary_10_1016_j_proeng_2016_01_245 crossref_citationtrail_10_1016_j_proeng_2016_01_245 elsevier_sciencedirect_doi_10_1016_j_proeng_2016_01_245 |
| PublicationCentury | 2000 |
| PublicationDate | 2016 2016-00-00 |
| PublicationDateYYYYMMDD | 2016-01-01 |
| PublicationDate_xml | – year: 2016 text: 2016 |
| PublicationDecade | 2010 |
| PublicationTitle | Procedia engineering |
| PublicationYear | 2016 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Hurdle (bib0070) 1973; 7 Cordone, Redaelli (bib0035) 2011; 45 Epperly, T.G.W., 1995. Global optimization of nonconvex nonlinear programs using parallel branch and bound. University of Winsconsin-Madison. Horst (bib0060) 2000 Barrena, Canca, Coelho, Laporte (bib0010) 2014; 70 Kroon, Huisman, Abbink, Fioole, Fischetti, Maróti, Schrijver, Steenbeek, Ybema (bib0075) 2009; 39 Cacchiani, Toth (bib0020) 2012; 219 Niu, Zhou (bib0080) 2013; 36 Yano, Newman (bib0100) 2001; 35 Guihaire, Hao (bib0050) 2008; 42 Carey (bib0030) 1994; 28 Hänseler, F., Farooq, B., Bierlaire, M., 2012. Preliminary ideas for dynamic estimation of pedestrian origin-destination demand within train stations, Proceedings of the Swiss Transport Research Conference, Ascona, Switzerland. Barrena, Canca, Coelho, Laporte (bib0005) 2014; 44 Horst, Tuy (bib0065) 1993 Belottia, Lee, Liberti, Margot, Wächter (bib0015) 2009; 24 Caprara, Fischetti, Toth (bib0025) 2002; 50 Smith, Pantelides (bib0090) 1999; 23 Vansteenwegen, Oudheusden (bib0095) 2006; 173 Dallwig, Floudas, Neumaier (bib0040) 1998; 22 Serafini, Ukovich (bib0085) 1989; 2 Horst (10.1016/j.proeng.2016.01.245_bib0060) 2000 Cacchiani (10.1016/j.proeng.2016.01.245_bib0020) 2012; 219 Kroon (10.1016/j.proeng.2016.01.245_bib0075) 2009; 39 Caprara (10.1016/j.proeng.2016.01.245_bib0025) 2002; 50 Cordone (10.1016/j.proeng.2016.01.245_bib0035) 2011; 45 Serafini (10.1016/j.proeng.2016.01.245_bib0085) 1989; 2 Carey (10.1016/j.proeng.2016.01.245_bib0030) 1994; 28 Smith (10.1016/j.proeng.2016.01.245_bib0090) 1999; 23 Hurdle (10.1016/j.proeng.2016.01.245_bib0070) 1973; 7 Barrena (10.1016/j.proeng.2016.01.245_bib0005) 2014; 44 Dallwig (10.1016/j.proeng.2016.01.245_bib0040) 1998; 22 Horst (10.1016/j.proeng.2016.01.245_bib0065) 1993 Vansteenwegen (10.1016/j.proeng.2016.01.245_bib0095) 2006; 173 10.1016/j.proeng.2016.01.245_bib0055 10.1016/j.proeng.2016.01.245_bib0045 Yano (10.1016/j.proeng.2016.01.245_bib0100) 2001; 35 Belottia (10.1016/j.proeng.2016.01.245_bib0015) 2009; 24 Barrena (10.1016/j.proeng.2016.01.245_bib0010) 2014; 70 Niu (10.1016/j.proeng.2016.01.245_bib0080) 2013; 36 Guihaire (10.1016/j.proeng.2016.01.245_bib0050) 2008; 42 |
| References_xml | – reference: Epperly, T.G.W., 1995. Global optimization of nonconvex nonlinear programs using parallel branch and bound. University of Winsconsin-Madison. – volume: 22 start-page: 1137 year: 1998 end-page: 1158 ident: bib0040 article-title: A global optimization method αBB, for general twice-differentiable constrained NLPs—I. publication-title: Theoretical advances. Computers & Chemical Engineering – volume: 219 start-page: 727 year: 2012 end-page: 737 ident: bib0020 article-title: Nominal and robust train timetabling problems publication-title: European Journal of Operational Research – year: 1993 ident: bib0065 article-title: Global Optimization: Deterministic Approaches – volume: 42 start-page: 1251 year: 2008 end-page: 1273 ident: bib0050 article-title: Transit network design and scheduling: A global review publication-title: Transportation Research Part A: Policy and Practice – volume: 2 start-page: 550 year: 1989 end-page: 581 ident: bib0085 article-title: A mathematical model for periodic scheduling problems publication-title: SIAM Journal on Discrete Mathematics – volume: 50 start-page: 851 year: 2002 end-page: 861 ident: bib0025 article-title: Modeling and solving the train timetabling problem publication-title: Operations Research – volume: 44 start-page: 66 year: 2014 end-page: 74 ident: bib0005 article-title: Exact formulations and algorithm for the train timetabling problem with dynamic demand publication-title: Computers & Operations Research – volume: 7 start-page: 109 year: 1973 end-page: 137 ident: bib0070 article-title: Minimum cost schedules for a public transportation route publication-title: Transportation Science – volume: 70 start-page: 134 year: 2014 end-page: 150 ident: bib0010 article-title: Single-line rail rapid transit timetabling under dynamic passenger demand publication-title: Transportation Research Part B: Methodological – reference: Hänseler, F., Farooq, B., Bierlaire, M., 2012. Preliminary ideas for dynamic estimation of pedestrian origin-destination demand within train stations, Proceedings of the Swiss Transport Research Conference, Ascona, Switzerland. – volume: 35 start-page: 181 year: 2001 end-page: 191 ident: bib0100 article-title: Scheduling trains and containers with due dates and dynamic arrivals publication-title: Transportation Science – volume: 24 start-page: 597 year: 2009 end-page: 634 ident: bib0015 article-title: Branching and bounds tighteningtechniques for non-convex MINLP publication-title: Optimization Methods and Software – volume: 39 start-page: 6 year: 2009 end-page: 17 ident: bib0075 article-title: The new Dutch timetable: the OR revolution publication-title: Interfaces – volume: 23 start-page: 457 year: 1999 end-page: 478 ident: bib0090 article-title: A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs publication-title: Computers & Chemical Engineering – volume: 173 start-page: 337 year: 2006 end-page: 350 ident: bib0095 article-title: Developing railway timetables which guarantee a better service publication-title: European Journal of Operational Research – volume: 28 start-page: 333 year: 1994 end-page: 353 ident: bib0030 article-title: A model and strategy for train pathing with choice of lines, platforms, and routes publication-title: Transportation Research Part B: Methodological – volume: 45 start-page: 430 year: 2011 end-page: 446 ident: bib0035 article-title: Optimizing the demand captured by a railway system with a regular timetable publication-title: Transportation Research Part B: Methodological – volume: 36 start-page: 212 year: 2013 end-page: 230 ident: bib0080 article-title: Optimizing urban rail timetable under time-dependent demand and oversaturated conditions publication-title: Transportation Research Part C: Emerging Technologies – year: 2000 ident: bib0060 article-title: Introduction to Global Optimization – volume: 24 start-page: 597 year: 2009 ident: 10.1016/j.proeng.2016.01.245_bib0015 article-title: Branching and bounds tighteningtechniques for non-convex MINLP publication-title: Optimization Methods and Software doi: 10.1080/10556780903087124 – volume: 36 start-page: 212 year: 2013 ident: 10.1016/j.proeng.2016.01.245_bib0080 article-title: Optimizing urban rail timetable under time-dependent demand and oversaturated conditions publication-title: Transportation Research Part C: Emerging Technologies doi: 10.1016/j.trc.2013.08.016 – volume: 7 start-page: 109 year: 1973 ident: 10.1016/j.proeng.2016.01.245_bib0070 article-title: Minimum cost schedules for a public transportation route publication-title: Transportation Science doi: 10.1287/trsc.7.2.109 – volume: 22 start-page: 1137 year: 1998 ident: 10.1016/j.proeng.2016.01.245_bib0040 article-title: A global optimization method αBB, for general twice-differentiable constrained NLPs—I. publication-title: Theoretical advances. Computers & Chemical Engineering doi: 10.1016/S0098-1354(98)00027-1 – ident: 10.1016/j.proeng.2016.01.245_bib0055 – volume: 23 start-page: 457 year: 1999 ident: 10.1016/j.proeng.2016.01.245_bib0090 article-title: A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs publication-title: Computers & Chemical Engineering doi: 10.1016/S0098-1354(98)00286-5 – volume: 219 start-page: 727 year: 2012 ident: 10.1016/j.proeng.2016.01.245_bib0020 article-title: Nominal and robust train timetabling problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2011.11.003 – year: 2000 ident: 10.1016/j.proeng.2016.01.245_bib0060 – volume: 45 start-page: 430 year: 2011 ident: 10.1016/j.proeng.2016.01.245_bib0035 article-title: Optimizing the demand captured by a railway system with a regular timetable publication-title: Transportation Research Part B: Methodological doi: 10.1016/j.trb.2010.09.001 – volume: 2 start-page: 550 year: 1989 ident: 10.1016/j.proeng.2016.01.245_bib0085 article-title: A mathematical model for periodic scheduling problems publication-title: SIAM Journal on Discrete Mathematics doi: 10.1137/0402049 – volume: 173 start-page: 337 year: 2006 ident: 10.1016/j.proeng.2016.01.245_bib0095 article-title: Developing railway timetables which guarantee a better service publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.12.013 – volume: 42 start-page: 1251 year: 2008 ident: 10.1016/j.proeng.2016.01.245_bib0050 article-title: Transit network design and scheduling: A global review publication-title: Transportation Research Part A: Policy and Practice – volume: 70 start-page: 134 year: 2014 ident: 10.1016/j.proeng.2016.01.245_bib0010 article-title: Single-line rail rapid transit timetabling under dynamic passenger demand publication-title: Transportation Research Part B: Methodological doi: 10.1016/j.trb.2014.08.013 – ident: 10.1016/j.proeng.2016.01.245_bib0045 – volume: 50 start-page: 851 year: 2002 ident: 10.1016/j.proeng.2016.01.245_bib0025 article-title: Modeling and solving the train timetabling problem publication-title: Operations Research doi: 10.1287/opre.50.5.851.362 – year: 1993 ident: 10.1016/j.proeng.2016.01.245_bib0065 – volume: 44 start-page: 66 year: 2014 ident: 10.1016/j.proeng.2016.01.245_bib0005 article-title: Exact formulations and algorithm for the train timetabling problem with dynamic demand publication-title: Computers & Operations Research doi: 10.1016/j.cor.2013.11.003 – volume: 39 start-page: 6 year: 2009 ident: 10.1016/j.proeng.2016.01.245_bib0075 article-title: The new Dutch timetable: the OR revolution publication-title: Interfaces doi: 10.1287/inte.1080.0409 – volume: 35 start-page: 181 year: 2001 ident: 10.1016/j.proeng.2016.01.245_bib0100 article-title: Scheduling trains and containers with due dates and dynamic arrivals publication-title: Transportation Science doi: 10.1287/trsc.35.2.181.10132 – volume: 28 start-page: 333 year: 1994 ident: 10.1016/j.proeng.2016.01.245_bib0030 article-title: A model and strategy for train pathing with choice of lines, platforms, and routes publication-title: Transportation Research Part B: Methodological doi: 10.1016/0191-2615(94)90033-7 |
| SSID | ssj0000070251 |
| Score | 2.1862233 |
| Snippet | This paper studies the optimization of an urban single-line metro timetable for total passenger travel time adapted to dynamic passenger demand, which arises... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 151 |
| SubjectTerms | dynamic demand regular timetable spatial branch and bound algorithm total passenger travel time train timetable |
| Title | Optimization of Urban Single-line Metro Timetable for Total Passenger Travel Time under Dynamic Passenger Demand |
| URI | https://dx.doi.org/10.1016/j.proeng.2016.01.245 |
| Volume | 137 |
| WOSCitedRecordID | wos000370820100019&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: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1877-7058 dateEnd: 20181231 omitProxy: false ssIdentifier: ssj0000070251 issn: 1877-7058 databaseCode: M~E dateStart: 20090101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LbxMxELZC4QAHxFO0POQDt8pon34cEQVxoCWCVOpt5fXaUqt0Ey3bKlz625mxvZsVrXhJXFaJNRtvPF_G48nMN4S8dmWiU25rpmF3YnD-UkzltWa1tFpq2OILXfhmE-LoSJ6cqPlsthlqYS6Xom3lZqPW_1XVMAbKxtLZv1D3-KEwAK9B6XAFtcP1jxT_GYzAeayuRFfwuKvxNwxb1NIy71Qe2r4LDV96XziFmYaLFVZFzsGVtr4QeIFtiZZeyLfK7fYPQu_6icyBPQ_9P0b31pcdAOL27ZbmcIzhDKHp-SQNyOcSfLnA1mKj_Ylin06_62lMIhRLhhDZUCazzUlCqyqFYCIJHO1v7A1jgykOBDDRmKaRijbsy2noO3DN5IfowxluOPDdMFmPIxFrFlgqfyLT_orT4qwp_h9ZSnGL3M5EqTAZ8PBqG51DFqTM9-4cn3Oou_TJgdcnu9mvmfgqiwfkfjxk0LcBHA_JzLaPyL0J9eRjsp7ChK4c9TChE5hQDxM6woQCTKiHCR0hQANMvBD1MKERJhOZAJMn5PjD-8W7jyx232AGnPKelcKVylmjXa4KxYVReS6ctVK6wojEuRKWL8lsw-GIbaSpucmKRpXg4KYNsiQ9JTvtqrXPCBUlt6IpRKaTvKgzOKQLyzHlg3MnmoTvknxYu8pEanrskLKshhzEsyqseIUrXiVpBSu-S9h41zpQs_xGXgxqqaJ7GdzGCqD0yzv3_vnO5-Quvgsxuxdkp-8u7Etyx1z2p9-6Vx5zPwCMY6JA |
| linkProvider | ISSN International Centre |
| 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=Optimization+of+Urban+Single-line+Metro+Timetable+for+Total+Passenger+Travel+Time+under+Dynamic+Passenger+Demand&rft.jtitle=Procedia+engineering&rft.au=Shang%2C+Pan&rft.au=Li%2C+Ruimin&rft.au=Yang%2C+Liya&rft.date=2016&rft.pub=Elsevier+Ltd&rft.issn=1877-7058&rft.eissn=1877-7058&rft.volume=137&rft.spage=151&rft.epage=160&rft_id=info:doi/10.1016%2Fj.proeng.2016.01.245&rft.externalDocID=S1877705816002587 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1877-7058&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1877-7058&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1877-7058&client=summon |