Multiple-Allocation Hub-and-Spoke Network Design With Maximizing Airline Profit Utility in Air Transportation Network

Airlines commonly need to take into consideration maximizing their profit while designing the hub-and-spoke network to obtain more market share and promote healthy development of aviation industry. Hence, in this article, we study the problem of multiple-allocation HUb and spoke network design for R...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on intelligent transportation systems Ročník 25; číslo 7; s. 7294 - 7310
Hlavní autoři:	Yu, Nan, Dong, Bin, Qu, Yuben, Zhang, Mingwei, Chen, Guihai, Tan, Qingqing, Wang, Yanyan, Dai, Haipeng
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.07.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Air transportation Airline industry Airline profit Airlines Airports Algorithms Approximation approximation algorithm Approximation algorithms Aviation cardinality Costs customer preference Flight greedy algorithm hub location problem Industrial development Maximization Network design Optimization Resource management Routing routing allocation mode submodular set function Transportation Transportation networks transportation profit utility
ISSN:	1524-9050, 1558-0016
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	Airlines commonly need to take into consideration maximizing their profit while designing the hub-and-spoke network to obtain more market share and promote healthy development of aviation industry. Hence, in this article, we study the problem of multiple-allocation HUb and spoke network design for ROuting flight flows to maximize airline profit utility (HURO). That is, given a set of airport nodes, a set of flight flows with known origin positions and destination positions, finding a limited number of hub edges to transfer flows and determining routing allocation mode considering customer preference such that the overall transportation profit utility is maximized. To address HURO problem, we first consider a relaxed version of HURO (HURO-R for short). We prove that HURO-R falls into the realm of maximizing a submodular set function subject to a cardinality constraint, and propose an algorithm with a constant approximation ratio. Next, we design a two-level algorithm framework with a constant approximation ratio to address HURO. Besides, we consider variants of HURO, HURO-C and HURO-RU, and design approximation algorithms to address them. We conduct simulation experiments on standard dataset and field experiments to verify our theoretical findings. The results shows that our proposed algorithm can outperform other comparison algorithms by 75.28 percent.
AbstractList	Airlines commonly need to take into consideration maximizing their profit while designing the hub-and-spoke network to obtain more market share and promote healthy development of aviation industry. Hence, in this article, we study the problem of multiple-allocation HUb and spoke network design for ROuting flight flows to maximize airline profit utility (HURO). That is, given a set of airport nodes, a set of flight flows with known origin positions and destination positions, finding a limited number of hub edges to transfer flows and determining routing allocation mode considering customer preference such that the overall transportation profit utility is maximized. To address HURO problem, we first consider a relaxed version of HURO (HURO-R for short). We prove that HURO-R falls into the realm of maximizing a submodular set function subject to a cardinality constraint, and propose an algorithm with a constant approximation ratio. Next, we design a two-level algorithm framework with a constant approximation ratio to address HURO. Besides, we consider variants of HURO, HURO-C and HURO-RU, and design approximation algorithms to address them. We conduct simulation experiments on standard dataset and field experiments to verify our theoretical findings. The results shows that our proposed algorithm can outperform other comparison algorithms by 75.28 percent.
Author	Dong, Bin Wang, Yanyan Tan, Qingqing Yu, Nan Chen, Guihai Dai, Haipeng Qu, Yuben Zhang, Mingwei
Author_xml	– sequence: 1 givenname: Nan orcidid: 0000-0002-8630-1319 surname: Yu fullname: Yu, Nan email: yunan1@cetc.com.cn organization: State Key Laboratory of Air Traffic Management System, Nanjing, China – sequence: 2 givenname: Bin surname: Dong fullname: Dong, Bin organization: State Key Laboratory of Air Traffic Management System, Nanjing, China – sequence: 3 givenname: Yuben orcidid: 0000-0002-8120-8369 surname: Qu fullname: Qu, Yuben email: quyuben@nuaa.edu.cn organization: Key Laboratory of Dynamic Cognitive System of Electromagnetic Spectrum Space, Ministry of Industry and Information Technology, and the College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China – sequence: 4 givenname: Mingwei surname: Zhang fullname: Zhang, Mingwei organization: State Key Laboratory of Air Traffic Management System, Nanjing, China – sequence: 5 givenname: Guihai surname: Chen fullname: Chen, Guihai organization: State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China – sequence: 6 givenname: Qingqing surname: Tan fullname: Tan, Qingqing organization: State Key Laboratory of Air Traffic Management System, Nanjing, China – sequence: 7 givenname: Yanyan orcidid: 0000-0003-2846-4790 surname: Wang fullname: Wang, Yanyan email: yanyan.wang@hhu.edu.cn organization: College of Computer and Information, Hohai University, Nanjing, China – sequence: 8 givenname: Haipeng orcidid: 0000-0003-0545-8187 surname: Dai fullname: Dai, Haipeng email: haipengdai@nju.edu.cn organization: State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China
BookMark	eNp9UEtLxDAQDqLg8wcIHgKeuyZp0sdx8bXCrgpWPJZsO9HRmtQ0Rddf75buQTx4mmHme_B9-2TbOguEHHM24ZzlZ8VN8TARTMSTOJaZTJItsseVyiLGeLI97EJGOVNsl-x33ev6KhXne6Rf9E3AtoFo2jSu0gGdpbN-GWlbRw-tewN6C-HT-Td6AR0-W_qE4YUu9Be-4zfaZzpF36AFeu-dwUAfAzYYVhTt8KGF17ZrnQ-j8kbrkOwY3XRwtJkHpLi6LM5n0fzu-uZ8Oo8qkcsQpUYYntVSAyyXhiuemdxoYyoDdW5MXaWSJ2Aq0OvMRuWylkbwZKlqIZXO4gNyOsq23n300IXy1fXerh3LmKVKilQlA4qPqMq7rvNgytbju_arkrNyKLccyi2HcstNuWtO-odT4RgxeI3Nv8yTkYkA8MtJijjLRfwDmQ2MwA
CODEN	ITISFG
CitedBy_id	crossref_primary_10_3390_app15147961 crossref_primary_10_1016_j_jairtraman_2025_102848
Cites_doi	10.1057/palgrave.jors.2602424 10.1145/1060590.1060650 10.1016/S0191-2615(98)00021-6 10.1057/palgrave.jors.2601473 10.1016/j.ejor.2017.03.066 10.1287/moor.4.3.233 10.1016/j.jpubeco.2008.01.007 10.1016/j.cie.2013.01.012 10.1016/j.ejor.2017.09.024 10.1287/trsc.2020.1003 10.1016/j.omega.2015.01.009 10.1287/opre.44.6.923 10.1016/j.trb.2019.03.007 10.1049/cje.2021.05.019 10.1016/j.cie.2018.12.058 10.1016/j.tcs.2020.01.020 10.1287/trsc.2018.0871 10.1287/opre.2014.1263 10.1111/1467-8454.12151 10.1016/S0377-2217(99)00274-X 10.1016/j.cor.2020.105136 10.1007/s10479-021-04299-3 10.1080/00207543.2021.1953179 10.1109/TMC.2019.2954306 10.1016/j.cor.2018.04.021 10.1016/j.trb.2022.01.002 10.1016/j.trb.2019.12.003 10.1016/j.cie.2021.107563 10.1002/nav.22035 10.1155/2021/2931734 10.1016/j.trc.2018.12.011 10.1007/s10640-018-0242-z 10.1177/03611981221105501 10.1287/trsc.2021.1094 10.1155/2017/9387302 10.1016/j.omega.2018.05.016 10.1109/TNET.2014.2301816 10.1016/j.jairtraman.2017.09.001 10.1007/s00453-001-0101-z 10.1142/S021926591940005X 10.1007/s00500-016-2398-1 10.1007/978-3-319-33461-5_26 10.1287/opre.2021.2185 10.1016/j.cor.2008.08.021 10.1016/j.cor.2022.105715 10.1049/cje.2021.02.009 10.1049/cje.2021.04.005 10.1287/trsc.2021.1064 10.1016/j.ejor.2020.09.039 10.1109/SAHCN.2008.28 10.1016/j.tre.2021.102602 10.1007/s11205-004-8393-4 10.1287/trsc.1120.0410 10.1016/j.engappai.2019.08.019 10.1016/j.jairtraman.2021.102022 10.1109/TITS.2021.3082781
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD FR3 JQ2 KR7 L7M L~C L~D
DOI	10.1109/TITS.2023.3348466
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005-present IEEE All-Society Periodicals Package (ASPP) 1998-Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Civil Engineering Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Civil Engineering Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications 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	Civil Engineering Abstracts
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1558-0016
EndPage	7310
ExternalDocumentID	10_1109_TITS_2023_3348466 10423892
Genre	orig-research
GrantInformation_xml	– fundername: Science and Technology Support Program of Jiangsu Province; Science and Technology Project of Jiangsu Province grantid: BZ2020001 funderid: 10.13039/501100004610 – fundername: National Key Research and Development Program of China grantid: 2022YFB2602402 funderid: 10.13039/501100012166 – fundername: National Natural Science Foundation of China grantid: 62102378; 62102079 funderid: 10.13039/501100001809 – fundername: Jiangsu Provincial Double-Innovation Doctor Program grantid: JSSCBS20211351; JSSCBS20211336 – fundername: National Science Foundation China grantid: 62072303
GroupedDBID	-~X 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AIBXA AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IFIPE IPLJI JAVBF LAI M43 O9- OCL P2P PQQKQ RIA RIE RNS ZY4 AAYXX CITATION 7SC 7SP 8FD FR3 JQ2 KR7 L7M L~C L~D
ID	FETCH-LOGICAL-c294t-7f2f18d4aeebbf1518f9faffcfed9ffdc7416efcea348f594d4f216b5d245a83
IEDL.DBID	RIE
ISICitedReferencesCount	4
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001173288200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1524-9050
IngestDate	Mon Jun 30 07:01:47 EDT 2025 Sat Nov 29 06:35:06 EST 2025 Tue Nov 18 22:30:38 EST 2025 Wed Aug 27 02:05:21 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	7
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c294t-7f2f18d4aeebbf1518f9faffcfed9ffdc7416efcea348f594d4f216b5d245a83
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-8120-8369 0000-0002-8630-1319 0000-0003-0545-8187 0000-0003-2846-4790
PQID	3075427568
PQPubID	75735
PageCount	17
ParticipantIDs	ieee_primary_10423892 proquest_journals_3075427568 crossref_citationtrail_10_1109_TITS_2023_3348466 crossref_primary_10_1109_TITS_2023_3348466
PublicationCentury	2000
PublicationDate	2024-07-01
PublicationDateYYYYMMDD	2024-07-01
PublicationDate_xml	– month: 07 year: 2024 text: 2024-07-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on intelligent transportation systems
PublicationTitleAbbrev	TITS
PublicationYear	2024
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref13 ref57 ref12 ref15 ref59 ref14 ref58 ref53 ref52 ref11 ref55 ref10 ref54 (ref6) 1970 ref17 ref16 ref19 ref18 ref51 ref50 ref45 ref48 ref47 ref42 ref41 ref44 ref43 ref49 ref8 ref7 ref9 ref4 ref3 (ref1) 2024 ref5 ref35 ref34 ref37 ref36 ref31 ref30 ref33 ref32 ref2 Johnson (ref56) ref38 Lawsky (ref46) 2010; 95 ref24 ref23 ref26 ref25 ref20 ref63 ref22 ref21 ref28 ref27 (ref60) 2024 ref29 Khosravian (ref40) 2019; 32 Seifbarghy (ref39) 2018; 11 ref62 ref61
References_xml	– volume-title: Data From International Air Transport Association year: 2024 ident: ref1 – ident: ref36 doi: 10.1057/palgrave.jors.2602424 – ident: ref57 doi: 10.1145/1060590.1060650 – volume-title: How Airlines Work year: 1970 ident: ref6 – ident: ref15 doi: 10.1016/S0191-2615(98)00021-6 – ident: ref34 doi: 10.1057/palgrave.jors.2601473 – ident: ref35 doi: 10.1016/j.ejor.2017.03.066 – ident: ref58 doi: 10.1287/moor.4.3.233 – start-page: 760 volume-title: Proc. 11th Annu. ACM-SIAM Symp. Discrete Algorithms ident: ref56 article-title: The prize collecting Steiner tree problem: Theory and practice – ident: ref45 doi: 10.1016/j.jpubeco.2008.01.007 – volume: 32 start-page: 964 year: 2019 ident: ref40 article-title: Mathematical model for bi-objective maximal hub covering problem with periodic variations of parameters publication-title: Int. J. Eng. – ident: ref3 doi: 10.1016/j.cie.2013.01.012 – ident: ref26 doi: 10.1016/j.ejor.2017.09.024 – ident: ref30 doi: 10.1287/trsc.2020.1003 – ident: ref37 doi: 10.1016/j.omega.2015.01.009 – ident: ref11 doi: 10.1287/opre.44.6.923 – ident: ref12 doi: 10.1016/j.trb.2019.03.007 – ident: ref62 doi: 10.1049/cje.2021.05.019 – ident: ref7 doi: 10.1016/j.cie.2018.12.058 – ident: ref55 doi: 10.1016/j.tcs.2020.01.020 – ident: ref20 doi: 10.1287/trsc.2018.0871 – ident: ref43 doi: 10.1287/opre.2014.1263 – ident: ref47 doi: 10.1111/1467-8454.12151 – ident: ref49 doi: 10.1016/S0377-2217(99)00274-X – ident: ref33 doi: 10.1016/j.cor.2020.105136 – ident: ref25 doi: 10.1007/s10479-021-04299-3 – ident: ref21 doi: 10.1080/00207543.2021.1953179 – ident: ref52 doi: 10.1109/TMC.2019.2954306 – ident: ref19 doi: 10.1016/j.cor.2018.04.021 – ident: ref42 doi: 10.1016/j.trb.2022.01.002 – ident: ref17 doi: 10.1016/j.trb.2019.12.003 – ident: ref10 doi: 10.1016/j.cie.2021.107563 – ident: ref27 doi: 10.1002/nav.22035 – ident: ref8 doi: 10.1155/2021/2931734 – ident: ref16 doi: 10.1016/j.trc.2018.12.011 – ident: ref48 doi: 10.1007/s10640-018-0242-z – ident: ref32 doi: 10.1177/03611981221105501 – ident: ref14 doi: 10.1287/trsc.2021.1094 – ident: ref13 doi: 10.1155/2017/9387302 – ident: ref29 doi: 10.1016/j.omega.2018.05.016 – ident: ref54 doi: 10.1109/TNET.2014.2301816 – ident: ref41 doi: 10.1016/j.jairtraman.2017.09.001 – ident: ref50 doi: 10.1007/s00453-001-0101-z – ident: ref2 doi: 10.1142/S021926591940005X – ident: ref38 doi: 10.1007/s00500-016-2398-1 – volume: 11 start-page: 143 year: 2018 ident: ref39 article-title: Hub covering location problem considering queuing and capacity constraints publication-title: J. Optim. Ind. Eng. – ident: ref59 doi: 10.1007/978-3-319-33461-5_26 – ident: ref18 doi: 10.1287/opre.2021.2185 – ident: ref51 doi: 10.1016/j.cor.2008.08.021 – ident: ref28 doi: 10.1016/j.cor.2022.105715 – ident: ref61 doi: 10.1049/cje.2021.02.009 – ident: ref63 doi: 10.1049/cje.2021.04.005 – ident: ref31 doi: 10.1287/trsc.2021.1064 – ident: ref5 doi: 10.1016/j.ejor.2020.09.039 – volume: 95 start-page: 904 year: 2010 ident: ref46 article-title: On the edge: Declining marginal utility and tax policy publication-title: Minn. L. Rev. – ident: ref53 doi: 10.1109/SAHCN.2008.28 – ident: ref24 doi: 10.1016/j.tre.2021.102602 – ident: ref44 doi: 10.1007/s11205-004-8393-4 – ident: ref4 doi: 10.1287/trsc.1120.0410 – ident: ref23 doi: 10.1016/j.engappai.2019.08.019 – volume-title: Data From Pre-flight Plan Management System year: 2024 ident: ref60 – ident: ref9 doi: 10.1016/j.jairtraman.2021.102022 – ident: ref22 doi: 10.1109/TITS.2021.3082781
SSID	ssj0014511
Score	2.4395733
Snippet	Airlines commonly need to take into consideration maximizing their profit while designing the hub-and-spoke network to obtain more market share and promote...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	7294
SubjectTerms	Air transportation Airline industry Airline profit Airlines Airports Algorithms Approximation approximation algorithm Approximation algorithms Aviation cardinality Costs customer preference Flight greedy algorithm hub location problem Industrial development Maximization Network design Optimization Resource management Routing routing allocation mode submodular set function Transportation Transportation networks transportation profit utility
Title	Multiple-Allocation Hub-and-Spoke Network Design With Maximizing Airline Profit Utility in Air Transportation Network
URI	https://ieeexplore.ieee.org/document/10423892 https://www.proquest.com/docview/3075427568
Volume	25
WOSCitedRecordID	wos001173288200001&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: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-0016 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014511 issn: 1524-9050 databaseCode: RIE dateStart: 20000101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF5UPOjBZ8X6Yg-ehNQ03TS7x6IWPVgEK3oLm90ZDGoqNhX117uzSasgCt4C2R1CvsxjMzPfMHaYRIjUouiOJTEGIgKnc0Y7QASgDrGjO6IaNpEMBvLuTl3Vzeq-FwYAfPEZtOjS5_LtyEzoV5nTcOf8pXIWdz5JkqpZa5YyIKItT44aiUCF8TSF2Q7V8fBieN2iOeEt6jsVnhHxywn5qSo_TLH3L_3Vfz7ZGlupA0neq5BfZ3NQbLDlb_SCm2xyWVcLBr1H8lmEAT-fZIEubHD9PHoAPqiqwPmpL-Tgt3l5zy_1W_6UfzgRvJcTGRbwK5rsXfKbkipp33le0B0-I0avJNeyGmzYPxuenAf1mIXAREqUQYIRtqUVGiDL0EUAEhVqRINgFaI1FLQBGnC4SYyVsAKjdjeLbSRiLTtbbKEYFbDNuOzaDliRWRsZ0QbMFB2YHARWyzhLZJOF09eempqCnCZhPKb-KBKqlJBKCam0RqrJjmZbniv-jb8WNwiabwsrVJpsbwpuWqvoOHXGLRZEfi93ftm2y5acdFEV5-6xhfJlAvts0byW-fjlwH99nw7q2h8
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwELYqqER74NGCWF71oadK2SZeh7WPKx5aVHaFRKpyixx7RkRAFkG2avn1eJzsgoRA4hYp9iTKF3tszzffMPa9LxApRdFvS1KMpAA_5qzxgEhAE2PP9GRTbKI_HquLC33WJquHXBgACOQz6NJliOW7iZ3SUZkf4d75K-1n3MVUSpE06VrzoAFJbQV5VCEjHaezIGYS65_ZSXbepUrhXco8lUET8ckNhboqLybj4GGOV975bqtsuV1K8kGD_Rr7ANUX9vmZwOBXNh21fMFocE1ei1Dgw2kRmcpF57eTK-DjhgfODwOVg_8p60s-Mv_Km_LBm-CDkuSwgJ9Rbe-a_66JS_uflxXd4XNp9MZya2udZcdH2cEwagstRFZoWUd9FJgoJw1AUaBfAyjUaBAtgtOIztKyDdCCR05hqqWTKJL9InVCpkb1NthCNalgk3G173rgZOGcsDIBLDRtmTwEzqi06KsOi2efPbetCDnVwrjOw2Yk1jkhlRNSeYtUh_2Yd7ltFDjearxO0Dxr2KDSYTszcPN2kN7nfnpLJcnfq61Xun1jS8NsdJqfnox_bbNP_kmyoerusIX6bgq77KP9W5f3d3vhT3wEitXdZg
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=Multiple-Allocation+Hub-and-Spoke+Network+Design+With+Maximizing+Airline+Profit+Utility+in+Air+Transportation+Network&rft.jtitle=IEEE+transactions+on+intelligent+transportation+systems&rft.au=Yu%2C+Nan&rft.au=Dong%2C+Bin&rft.au=Qu%2C+Yuben&rft.au=Zhang%2C+Mingwei&rft.date=2024-07-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1524-9050&rft.eissn=1558-0016&rft.volume=25&rft.issue=7&rft.spage=7294&rft_id=info:doi/10.1109%2FTITS.2023.3348466&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1524-9050&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1524-9050&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1524-9050&client=summon