The vehicle platooning problem: Computational complexity and heuristics
•Develops a framework for modeling platooning vehicles traveling in road networks.•Defines the vehicle platooning problem and proves finding its optimum is NP-hard.•Presents heuristics that can solve large instances of the platooning problem. We create a mathematical framework for modeling trucks tr...
Uloženo v:
| Vydáno v: | Transportation research. Part C, Emerging technologies Ročník 60; číslo C; s. 258 - 277 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
United States
Elsevier India Pvt Ltd
01.11.2015
Elsevier |
| Témata: | |
| ISSN: | 0968-090X, 1879-2359, 1879-2359 |
| 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 | •Develops a framework for modeling platooning vehicles traveling in road networks.•Defines the vehicle platooning problem and proves finding its optimum is NP-hard.•Presents heuristics that can solve large instances of the platooning problem.
We create a mathematical framework for modeling trucks traveling in road networks, and we define a routing problem called the platooning problem. We prove that this problem is NP-hard, even when the graph used to represent the road network is planar. We present integer linear programming formulations for instances of the platooning problem where deadlines are discarded, which we call the unlimited platooning problem. These allow us to calculate fuel-optimal solutions to the platooning problem for large-scale, real-world examples. The problems solved are orders of magnitude larger than problems previously solved exactly in the literature. We present several heuristics and compare their performance with the optimal solutions on the German Autobahn road network. The proposed heuristics find optimal or near-optimal solutions in most of the problem instances considered, especially when a final local search is applied. Assuming a fuel reduction factor of 10% from platooning, we find fuel savings from platooning of 1–2% for as few as 10 trucks in the road network; the percentage of savings increases with the number of trucks. If all trucks start at the same point, savings of up to 9% are obtained for only 200 trucks. |
|---|---|
| AbstractList | •Develops a framework for modeling platooning vehicles traveling in road networks.•Defines the vehicle platooning problem and proves finding its optimum is NP-hard.•Presents heuristics that can solve large instances of the platooning problem.
We create a mathematical framework for modeling trucks traveling in road networks, and we define a routing problem called the platooning problem. We prove that this problem is NP-hard, even when the graph used to represent the road network is planar. We present integer linear programming formulations for instances of the platooning problem where deadlines are discarded, which we call the unlimited platooning problem. These allow us to calculate fuel-optimal solutions to the platooning problem for large-scale, real-world examples. The problems solved are orders of magnitude larger than problems previously solved exactly in the literature. We present several heuristics and compare their performance with the optimal solutions on the German Autobahn road network. The proposed heuristics find optimal or near-optimal solutions in most of the problem instances considered, especially when a final local search is applied. Assuming a fuel reduction factor of 10% from platooning, we find fuel savings from platooning of 1–2% for as few as 10 trucks in the road network; the percentage of savings increases with the number of trucks. If all trucks start at the same point, savings of up to 9% are obtained for only 200 trucks. We create a mathematical framework for modeling trucks traveling in road networks, and we define a routing problem called the platooning problem. We prove that this problem is NP-hard, even when the graph used to represent the road network is planar. We present integer linear programming formulations for instances of the platooning problem where deadlines are discarded, which we call the unlimited platooning problem. These allow us to calculate fuel-optimal solutions to the platooning problem for large-scale, real-world examples. The problems solved are orders of magnitude larger than problems previously solved exactly in the literature. We present several heuristics and compare their performance with the optimal solutions on the German Autobahn road network. The proposed heuristics find optimal or near-optimal solutions in most of the problem instances considered, especially when a final local search is applied. Assuming a fuel reduction factor of 10% from platooning, we find fuel savings from platooning of 1-2% for as few as 10 trucks in the road network; the percentage of savings increases with the number of trucks. If all trucks start at the same point, savings of up to 9% are obtained for only 200 trucks. |
| Author | Larson, Jeffrey Sennton, Gustav Larsson, Erik |
| Author_xml | – sequence: 1 givenname: Erik surname: Larsson fullname: Larsson, Erik organization: KTH Royal Institute of Technology, Automatic Control Department, Stockholm, Sweden – sequence: 2 givenname: Gustav surname: Sennton fullname: Sennton, Gustav organization: KTH Royal Institute of Technology, Automatic Control Department, Stockholm, Sweden – sequence: 3 givenname: Jeffrey surname: Larson fullname: Larson, Jeffrey email: jmlarson@anl.gov organization: Argonne National Laboratory, Mathematics and Computer Science Division, Argonne, IL, USA |
| BackLink | https://www.osti.gov/biblio/1237849$$D View this record in Osti.gov https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179611$$DView record from Swedish Publication Index (Kungliga Tekniska Högskolan) |
| BookMark | eNp9kMFO3DAURS1EpQ6UD2AXsU9qx3EcwwoNLSAhdUMRO8t5eUM8ZOzI9kD5ezxM1UUXrJ6edM_V1Tkih847JOSU0YpR1n5fVylAVVMmKtpVlKkDsmCdVGXNhTokC6rarqSKPn4lRzGuKc0RIRfk-n7E4gVHCxMW82SS9866p2IOvp9wc14s_WbeJpOsd2YqIH8T_rHprTBuKEbcBhuThfiNfFmZKeLJ33tMfv_8cb-8Ke9-Xd8uL-9KaJRKJXApJW9UB5yvhIBG9KoGKnsUfaOgrVFwNRjGhVw1XInWdLylOAwKatbRmh-Tct8bX3He9noOdmPCm_bG6iv7cKl9eNLPadRMqpaxnD_b532eqSPYhDCCdw4haVZz2TUqh9g-BMHHGHD1r5ZRvdOr1zrr1Tu9mnY6u8uM_I_J3R-aUjB2-pS82JOYPb1YDLtZ6AAHG3arBm8_od8Bj7iXPA |
| CitedBy_id | crossref_primary_10_1287_ijoc_2020_0302 crossref_primary_10_1016_j_tre_2020_102200 crossref_primary_10_1016_j_cie_2022_108879 crossref_primary_10_1016_j_ejor_2022_04_013 crossref_primary_10_3390_su11195237 crossref_primary_10_1016_j_tre_2023_103138 crossref_primary_10_1016_j_trpro_2018_12_212 crossref_primary_10_1109_ACCESS_2025_3578815 crossref_primary_10_1016_j_ifacol_2017_08_822 crossref_primary_10_1016_j_trc_2024_104501 crossref_primary_10_1007_s00500_018_3518_x crossref_primary_10_1080_15472450_2023_2209911 crossref_primary_10_3390_s23135899 crossref_primary_10_1016_j_trc_2021_103373 crossref_primary_10_1016_j_cie_2024_110205 crossref_primary_10_1016_j_trc_2022_103667 crossref_primary_10_3390_pr11030654 crossref_primary_10_1016_j_trb_2021_06_009 crossref_primary_10_1016_j_tre_2020_102211 crossref_primary_10_1080_03081060_2025_2466094 crossref_primary_10_1016_j_tre_2024_103898 crossref_primary_10_3390_wevj16020105 crossref_primary_10_1109_TIV_2020_3041702 crossref_primary_10_1080_15472450_2021_2004410 crossref_primary_10_1109_TITS_2021_3115908 crossref_primary_10_1016_j_cie_2023_109046 crossref_primary_10_1016_j_trpro_2024_12_069 crossref_primary_10_3141_2547_07 crossref_primary_10_1016_j_trb_2020_09_009 crossref_primary_10_1016_j_trb_2019_12_009 crossref_primary_10_1016_j_trb_2022_08_007 crossref_primary_10_1557_mre_2020_18 crossref_primary_10_1016_j_trd_2020_102664 crossref_primary_10_1016_j_knosys_2021_106972 crossref_primary_10_3390_logistics5020027 crossref_primary_10_1016_j_tra_2024_103999 crossref_primary_10_1016_j_trc_2021_103550 crossref_primary_10_1111_itor_70073 crossref_primary_10_1287_opre_2021_2126 crossref_primary_10_3390_su14159351 crossref_primary_10_1016_j_ifacol_2016_07_008 crossref_primary_10_3390_electronics12244913 crossref_primary_10_3390_su132414073 crossref_primary_10_1080_03081060_2022_2162052 crossref_primary_10_1016_j_trc_2018_02_011 crossref_primary_10_1109_ACCESS_2020_2998015 crossref_primary_10_1109_TITS_2021_3077467 crossref_primary_10_1109_TITS_2025_3534717 crossref_primary_10_1016_j_ifacol_2020_12_2338 crossref_primary_10_3390_math11224627 crossref_primary_10_3389_ffutr_2022_913765 crossref_primary_10_1109_TITS_2024_3426615 crossref_primary_10_1016_j_trpro_2018_09_004 crossref_primary_10_1016_j_tre_2023_103297 crossref_primary_10_1016_j_ifacol_2020_12_2027 crossref_primary_10_1016_j_trc_2025_105072 crossref_primary_10_1016_j_conengprac_2025_106452 crossref_primary_10_1080_17477778_2019_1675480 crossref_primary_10_1016_j_physa_2016_12_027 crossref_primary_10_1109_TCNS_2025_3526678 crossref_primary_10_1109_TITS_2023_3332607 crossref_primary_10_1109_TITS_2017_2700021 crossref_primary_10_1177_03611981221101890 crossref_primary_10_1109_TITS_2024_3418430 crossref_primary_10_1080_01441647_2020_1747568 crossref_primary_10_1016_j_trc_2025_105188 crossref_primary_10_1109_MITS_2022_3219997 crossref_primary_10_1016_j_jechem_2023_11_016 crossref_primary_10_1139_cjfr_2022_0209 crossref_primary_10_1016_j_ifacol_2018_12_026 crossref_primary_10_1016_j_trc_2022_103912 crossref_primary_10_1016_j_tre_2016_11_008 crossref_primary_10_1016_j_trc_2015_11_001 crossref_primary_10_1080_03081060_2025_2505535 crossref_primary_10_1016_j_trb_2021_10_014 crossref_primary_10_1109_TITS_2022_3213549 crossref_primary_10_1111_mice_12899 crossref_primary_10_1080_23249935_2023_2266041 crossref_primary_10_1016_j_cor_2023_106439 crossref_primary_10_1155_2020_2604012 crossref_primary_10_1016_j_trc_2018_06_013 crossref_primary_10_1007_s10696_023_09527_5 crossref_primary_10_1016_j_tre_2024_103846 crossref_primary_10_1109_TITS_2022_3169390 crossref_primary_10_1016_j_trc_2018_12_017 crossref_primary_10_1155_2022_1005979 crossref_primary_10_1016_j_trb_2018_01_006 crossref_primary_10_1109_TITS_2023_3298564 crossref_primary_10_1016_j_ifacol_2020_12_094 crossref_primary_10_1016_j_tre_2019_05_005 crossref_primary_10_1016_j_ifacol_2020_12_093 crossref_primary_10_1016_j_tre_2025_104022 crossref_primary_10_1016_j_trc_2022_103809 crossref_primary_10_1109_TITS_2022_3178304 crossref_primary_10_1016_j_trb_2021_08_016 crossref_primary_10_1016_j_trb_2017_10_016 crossref_primary_10_1016_j_trc_2023_104191 crossref_primary_10_1016_j_trpro_2017_12_129 crossref_primary_10_1155_2023_6906655 |
| Cites_doi | 10.1109/TITS.2007.903052 10.1109/ITSC.2000.881102 10.1007/s10288-009-0097-9 10.1109/TVT.2010.2040639 10.1109/TITS.2014.2320133 10.1016/j.trc.2013.01.006 10.1137/0114025 10.1115/DETC2011-47861 10.1109/ITSC.2013.6728395 10.1007/BF01758762 10.1016/j.trb.2013.08.008 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier Ltd |
| Copyright_xml | – notice: 2015 Elsevier Ltd |
| CorporateAuthor | Argonne National Lab. (ANL), Argonne, IL (United States) |
| CorporateAuthor_xml | – name: Argonne National Lab. (ANL), Argonne, IL (United States) |
| DBID | AAYXX CITATION OTOTI ADTPV AOWAS D8V |
| DOI | 10.1016/j.trc.2015.08.019 |
| DatabaseName | CrossRef OSTI.GOV SwePub SwePub Articles SWEPUB Kungliga Tekniska Högskolan |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Economics Engineering |
| EISSN | 1879-2359 |
| EndPage | 277 |
| ExternalDocumentID | oai_DiVA_org_kth_179611 1237849 10_1016_j_trc_2015_08_019 S0968090X15003204 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN ABBOA ABLJU ABMAC ABMMH ABUCO ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEKER AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ASPBG AVARZ AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HAMUX HMY HVGLF HZ~ H~9 IHE J1W JJJVA KOM LY1 LY7 M3Y M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PRBVW Q38 R2- RIG ROL RPZ SDF SDG SDS SES SET SEW SPC SPCBC SSB SSD SSO SSS SST SSV SSZ T5K TN5 WUQ XPP ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ADNMO AEIPS AFJKZ AGQPQ AIIUN ANKPU APXCP CITATION EFKBS ~HD AALMO AAPBV ABPIF ABPTK OTOTI ADTPV AOWAS D8V |
| ID | FETCH-LOGICAL-c499t-c37773498c33f55c45b92c07be5b49c62e539da1357f43956a8360edd9c218023 |
| ISICitedReferencesCount | 127 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000365372900016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0968-090X 1879-2359 |
| IngestDate | Tue Nov 04 16:51:10 EST 2025 Thu May 18 18:29:26 EDT 2023 Sat Nov 29 03:00:58 EST 2025 Tue Nov 18 21:31:43 EST 2025 Fri Feb 23 02:16:17 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | C |
| Keywords | Vehicle routing Vehicle platooning Computational complexity |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c499t-c37773498c33f55c45b92c07be5b49c62e539da1357f43956a8360edd9c218023 |
| Notes | AC02-06CH11357 USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21) |
| OpenAccessLink | https://www.osti.gov/biblio/1250912 |
| PageCount | 20 |
| ParticipantIDs | swepub_primary_oai_DiVA_org_kth_179611 osti_scitechconnect_1237849 crossref_primary_10_1016_j_trc_2015_08_019 crossref_citationtrail_10_1016_j_trc_2015_08_019 elsevier_sciencedirect_doi_10_1016_j_trc_2015_08_019 |
| 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 | United States |
| PublicationPlace_xml | – name: United States |
| PublicationTitle | Transportation research. Part C, Emerging technologies |
| PublicationYear | 2015 |
| Publisher | Elsevier India Pvt Ltd Elsevier |
| Publisher_xml | – name: Elsevier India Pvt Ltd – name: Elsevier |
| References | Taleb, Benslimane, Letaief (b0095) 2010; 59 Karp (b0045) 1972 Robinson, T., Chan, E., Coelingh, E., 2010. Operating platoons on public motorways: an introduction to the SARTRE platooning programme. In: Proceedings of the 17th ITS World Congress. Kammer, C., 2013. Coordinated Heavy Truck Platoon Routing Using Global and Locally Distributed Approaches. Master’s Thesis. KTH – Royal Institute of Technology. Ahuja, Magnanti, Orlin (b0005) 1993 Baskar, De Schutter, Hellendoorn (b0010) 2013; 30 Hanan (b0035) 1966; 14 Kavathekar, P., Chen, Y., 2011. Vehicle platooning: a brief survey and categorization. In: Proceedings of the ASME International Design Engineering Technical Conferences & Computers and Information in Engineering Conference, pp. 829–845. Franceschetti, Honhon, Van Woensel, Bektas, Laporte (b0030) 2013; 56 . Rao, Sadayappan, Hwang, Shor (b0070) 1992; 7 Lecluyse, Woensel, Peremans (b0065) 2009; 7 Larson, J., Kammer, C., Liang, K.Y., Johansson, K.H., 2013. Coordinated route optimization for heavy duty vehicle platoons. In: Proceedings of the IEEE Intelligent Transportation Systems Conference, pp. 1196–1202. Shladover (b0090) 2007; 8 Tatchikou, R., Biswas, S., Dion, F., 2005. Cooperative vehicle collision avoidance using inter-vehicle packet forwarding. In: Proceedings of the IEEE Global Telecommunications Conference, pp. 2762–2766. Larson, Liang, Johansson (b0060) 2015; 16 Schittler, M., 2003. State-of-the-art and emerging truck engine technologies for optimized performance, emissions and life cycle costs. In: 9th Diesel Emissions Reduction Conference, Rhode Island. Bonnet, Fritz (b0015) 2000 Schroten, A., Warringa, G., Bles, M., 2012. Marginal Abatement Cost Curves for Heavy Duty Vehicles. Background Report. CE Delft, Delft. European Commission, 2011. Roadmap to a Single European Transport Area Towards a Competitive and Resource Efficient Transport System, in: Transport White Paper. COM(2011) 144 Final, Brussels. Tsugawa, S., Kato, S., Matsui, T., Naganawa, H., Fujii, H., 2000. An architecture for cooperative driving of automated vehicles. In: Proceedings of the IEEE Intelligent Transportation Systems Conference, pp. 422–427. Browand, F., McArthur, J., Radovich, C., 2004. Fuel Saving Achieved in the Field Test of Two Tandem Trucks. Final Report UCB-ITS-PRR-2004-20. California PATH. Baskar (10.1016/j.trc.2015.08.019_b0010) 2013; 30 Rao (10.1016/j.trc.2015.08.019_b0070) 1992; 7 Hanan (10.1016/j.trc.2015.08.019_b0035) 1966; 14 Larson (10.1016/j.trc.2015.08.019_b0060) 2015; 16 10.1016/j.trc.2015.08.019_b0025 Bonnet (10.1016/j.trc.2015.08.019_b0015) 2000 Lecluyse (10.1016/j.trc.2015.08.019_b0065) 2009; 7 10.1016/j.trc.2015.08.019_b0100 10.1016/j.trc.2015.08.019_b0055 Karp (10.1016/j.trc.2015.08.019_b0045) 1972 10.1016/j.trc.2015.08.019_b0105 Shladover (10.1016/j.trc.2015.08.019_b0090) 2007; 8 10.1016/j.trc.2015.08.019_b0050 Taleb (10.1016/j.trc.2015.08.019_b0095) 2010; 59 10.1016/j.trc.2015.08.019_b0080 Ahuja (10.1016/j.trc.2015.08.019_b0005) 1993 10.1016/j.trc.2015.08.019_b0020 10.1016/j.trc.2015.08.019_b0075 Franceschetti (10.1016/j.trc.2015.08.019_b0030) 2013; 56 10.1016/j.trc.2015.08.019_b0085 10.1016/j.trc.2015.08.019_b0040 |
| References_xml | – reference: Kavathekar, P., Chen, Y., 2011. Vehicle platooning: a brief survey and categorization. In: Proceedings of the ASME International Design Engineering Technical Conferences & Computers and Information in Engineering Conference, pp. 829–845. – volume: 59 start-page: 1474 year: 2010 end-page: 1486 ident: b0095 article-title: Toward an effective risk-conscious and collaborative vehicular collision avoidance system publication-title: IEEE Trans. Veh. Technol. – reference: Larson, J., Kammer, C., Liang, K.Y., Johansson, K.H., 2013. Coordinated route optimization for heavy duty vehicle platoons. In: Proceedings of the IEEE Intelligent Transportation Systems Conference, pp. 1196–1202. – start-page: 85 year: 1972 end-page: 103 ident: b0045 article-title: Reducibility among combinatorial problems publication-title: Complexity of Computer Computations – volume: 16 start-page: 419 year: 2015 end-page: 429 ident: b0060 article-title: A distributed framework for coordinated heavy-duty vehicle platooning publication-title: IEEE Trans. Intell. Transp. Syst. – volume: 56 start-page: 265 year: 2013 end-page: 293 ident: b0030 article-title: The time-dependent pollution-routing problem publication-title: Transp. Res. Part B: Methodol. – reference: Tsugawa, S., Kato, S., Matsui, T., Naganawa, H., Fujii, H., 2000. An architecture for cooperative driving of automated vehicles. In: Proceedings of the IEEE Intelligent Transportation Systems Conference, pp. 422–427. – reference: >. – volume: 30 start-page: 1 year: 2013 end-page: 22 ident: b0010 article-title: Optimal routing for automated highway systems publication-title: Transp. Res. Part C: Emerg. Technol. – reference: Robinson, T., Chan, E., Coelingh, E., 2010. Operating platoons on public motorways: an introduction to the SARTRE platooning programme. In: Proceedings of the 17th ITS World Congress. < – reference: . – year: 2000 ident: b0015 article-title: Fuel consumption reduction in a platoon: experimental results with two electronically coupled trucks at close spacing publication-title: Intell. Veh. Tec hnol. – reference: Browand, F., McArthur, J., Radovich, C., 2004. Fuel Saving Achieved in the Field Test of Two Tandem Trucks. Final Report UCB-ITS-PRR-2004-20. California PATH. < – volume: 14 start-page: 255 year: 1966 end-page: 265 ident: b0035 article-title: On Steiner’s problem with rectilinear distance publication-title: SIAM J. Appl. Math. – reference: Schittler, M., 2003. State-of-the-art and emerging truck engine technologies for optimized performance, emissions and life cycle costs. In: 9th Diesel Emissions Reduction Conference, Rhode Island. < – reference: Tatchikou, R., Biswas, S., Dion, F., 2005. Cooperative vehicle collision avoidance using inter-vehicle packet forwarding. In: Proceedings of the IEEE Global Telecommunications Conference, pp. 2762–2766. < – reference: Kammer, C., 2013. Coordinated Heavy Truck Platoon Routing Using Global and Locally Distributed Approaches. Master’s Thesis. KTH – Royal Institute of Technology. < – volume: 8 start-page: 584 year: 2007 end-page: 592 ident: b0090 article-title: PATH at 20 – history and major milestones publication-title: IEEE Trans. Intell. Transp. Syst. – year: 1993 ident: b0005 article-title: Network Flows: Theory, Algorithms, and Applications – volume: 7 start-page: 363 year: 2009 end-page: 377 ident: b0065 article-title: Vehicle routing with stochastic time-dependent travel times publication-title: 4OR – reference: European Commission, 2011. Roadmap to a Single European Transport Area Towards a Competitive and Resource Efficient Transport System, in: Transport White Paper. COM(2011) 144 Final, Brussels. < – reference: Schroten, A., Warringa, G., Bles, M., 2012. Marginal Abatement Cost Curves for Heavy Duty Vehicles. Background Report. CE Delft, Delft. < – volume: 7 start-page: 277 year: 1992 end-page: 288 ident: b0070 article-title: The rectilinear Steiner arborescence problem publication-title: Algorithmica – volume: 8 start-page: 584 year: 2007 ident: 10.1016/j.trc.2015.08.019_b0090 article-title: PATH at 20 – history and major milestones publication-title: IEEE Trans. Intell. Transp. Syst. doi: 10.1109/TITS.2007.903052 – year: 1993 ident: 10.1016/j.trc.2015.08.019_b0005 – ident: 10.1016/j.trc.2015.08.019_b0085 – ident: 10.1016/j.trc.2015.08.019_b0080 – ident: 10.1016/j.trc.2015.08.019_b0105 doi: 10.1109/ITSC.2000.881102 – volume: 7 start-page: 363 year: 2009 ident: 10.1016/j.trc.2015.08.019_b0065 article-title: Vehicle routing with stochastic time-dependent travel times publication-title: 4OR doi: 10.1007/s10288-009-0097-9 – volume: 59 start-page: 1474 year: 2010 ident: 10.1016/j.trc.2015.08.019_b0095 article-title: Toward an effective risk-conscious and collaborative vehicular collision avoidance system publication-title: IEEE Trans. Veh. Technol. doi: 10.1109/TVT.2010.2040639 – volume: 16 start-page: 419 year: 2015 ident: 10.1016/j.trc.2015.08.019_b0060 article-title: A distributed framework for coordinated heavy-duty vehicle platooning publication-title: IEEE Trans. Intell. Transp. Syst. doi: 10.1109/TITS.2014.2320133 – ident: 10.1016/j.trc.2015.08.019_b0040 – ident: 10.1016/j.trc.2015.08.019_b0075 – volume: 30 start-page: 1 year: 2013 ident: 10.1016/j.trc.2015.08.019_b0010 article-title: Optimal routing for automated highway systems publication-title: Transp. Res. Part C: Emerg. Technol. doi: 10.1016/j.trc.2013.01.006 – volume: 14 start-page: 255 year: 1966 ident: 10.1016/j.trc.2015.08.019_b0035 article-title: On Steiner’s problem with rectilinear distance publication-title: SIAM J. Appl. Math. doi: 10.1137/0114025 – year: 2000 ident: 10.1016/j.trc.2015.08.019_b0015 article-title: Fuel consumption reduction in a platoon: experimental results with two electronically coupled trucks at close spacing publication-title: Intell. Veh. Tec hnol. – start-page: 85 year: 1972 ident: 10.1016/j.trc.2015.08.019_b0045 article-title: Reducibility among combinatorial problems – ident: 10.1016/j.trc.2015.08.019_b0020 – ident: 10.1016/j.trc.2015.08.019_b0025 – ident: 10.1016/j.trc.2015.08.019_b0050 doi: 10.1115/DETC2011-47861 – ident: 10.1016/j.trc.2015.08.019_b0055 doi: 10.1109/ITSC.2013.6728395 – ident: 10.1016/j.trc.2015.08.019_b0100 – volume: 7 start-page: 277 year: 1992 ident: 10.1016/j.trc.2015.08.019_b0070 article-title: The rectilinear Steiner arborescence problem publication-title: Algorithmica doi: 10.1007/BF01758762 – volume: 56 start-page: 265 year: 2013 ident: 10.1016/j.trc.2015.08.019_b0030 article-title: The time-dependent pollution-routing problem publication-title: Transp. Res. Part B: Methodol. doi: 10.1016/j.trb.2013.08.008 |
| SSID | ssj0001957 |
| Score | 2.521967 |
| Snippet | •Develops a framework for modeling platooning vehicles traveling in road networks.•Defines the vehicle platooning problem and proves finding its optimum is... We create a mathematical framework for modeling trucks traveling in road networks, and we define a routing problem called the platooning problem. We prove that... |
| SourceID | swepub osti crossref elsevier |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 258 |
| SubjectTerms | Computational complexity Vehicle platooning Vehicle routing |
| Title | The vehicle platooning problem: Computational complexity and heuristics |
| URI | https://dx.doi.org/10.1016/j.trc.2015.08.019 https://www.osti.gov/biblio/1237849 https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179611 |
| Volume | 60 |
| WOSCitedRecordID | wos000365372900016&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: 1879-2359 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001957 issn: 0968-090X databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Rb9MwELZKhwQ8IBggygDlAfEAyhQncRzzVpUxQNOExEB9s1zHoRtTOnVZ1Z_PXXxJswkqeOAlqqw4rXKfz-frfd8x9io2kXFKxKHNyyxMU5uHJi0LWPGcl8YUsNYbSx_J4-N8OlVfBoOy5cKszmVV5eu1uvivpoYxMDZSZ__B3N1DYQA-g9HhCmaH618bfuXmOIw9ouuFT7hS5xjMAPhODm0WsCkqd2uMxjGJPndXJN7cj1s7DXSPF5IImu9DBLqs304aj4pEzoZ81Wbre_WJR3B-Jm4XeN6OHfQV3DzV7x8ik2vVv9-PE9Wsn53ggmh6XcqM9vd-3jHDeoto6jcg73VzqcI4IWlwcsu-zQDBb_Jbb-8TD2f79RLFKLloxFjJA18X0Yb9WeapusV2YikUeL-d8aeD6eduz-bKa8K2P679_7upBLzx-D9FMMMFGOeG4mwTpZw8YPfpeBGMPSwesoGrdtmdln1-ucvu9QQoH7FDAEtAYAk2YAkILO-Ca1AJNlAJACrBBiqP2bcPByeTjyG11ggtHHHr0CZSyiRVuU2SUgibipmKbSRnTsxSZbPYiUQVhidClhCyiswg2ccVhbJxoxn4hA2rReWesqAskK0cmdREBcTmXBUicVw4OCkXuUvMiEXt69KWdOex_cm5bgsMzzS8YY1vWGNLVK5G7E035cKLrmy7OW1toClq9NGgBphsm7aH9sIpuCwslpXBHALKiL32Zuy-H2XY359-H-vF8of-Wc817GQZ58-2PmaP3d0siudsWC-v3At2267q08vlSwLhL51qo9Y |
| 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=The+vehicle+platooning+problem%3A+Computational+complexity+and+heuristics&rft.jtitle=Transportation+research.+Part+C%2C+Emerging+technologies&rft.au=Larsson%2C+Erik&rft.au=Sennton%2C+Gustav&rft.au=Larson%2C+Jeffrey&rft.date=2015-11-01&rft.pub=Elsevier&rft.issn=0968-090X&rft.eissn=1879-2359&rft.volume=60&rft.issue=C&rft_id=info:doi/10.1016%2Fj.trc.2015.08.019&rft.externalDocID=1237849 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0968-090X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0968-090X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0968-090X&client=summon |