Theoretical Analysis of an Adaptive Closeness Centrality-Based Algorithm for Dynamic Optimization of Transportation Networks

Purpose: This paper presents a theoretical analysis of the DynaTrans algorithm, a novel approach for dynamic optimization of urban transportation networks. Design/methodology/approach: We introduce an Adaptive Closeness Centrality (ACC) metric and the DynaTrans algorithm, providing formal proofs of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2024 International Conference on Engineering Management of Communication and Technology (EMCTECH) S. 1 - 5
1. Verfasser: Mann, Michael
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 16.10.2024
Schlagworte:
ISSN:3064-9382
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Purpose: This paper presents a theoretical analysis of the DynaTrans algorithm, a novel approach for dynamic optimization of urban transportation networks. Design/methodology/approach: We introduce an Adaptive Closeness Centrality (ACC) metric and the DynaTrans algorithm, providing formal proofs of correctness, convergence, and efficiency. The analysis employs graph theory, algorithmic complexity theory, and competitive analysis techniques. Findings: We prove that DynaTrans converges to a local optimal state in O(|V|/ε) iterations, with each iteration has limited computational and memory requirements. The algorithm achieves solutions within a factor of O(log|V|) from the global optimum, outperforming simple greedy approaches. Practical implications: DynaTrans offers a theoretically sound foundation for real-time traffic management systems, potentially improving urban mobility and reducing congestion. Originality/value: This work introduces a new paradigm for dynamic transportation network optimization, combining adaptive centrality measures with efficient graph algorithms. The rigorous theoretical analysis provides a solid basis for practical implementation and future research in urban traffic management.
AbstractList Purpose: This paper presents a theoretical analysis of the DynaTrans algorithm, a novel approach for dynamic optimization of urban transportation networks. Design/methodology/approach: We introduce an Adaptive Closeness Centrality (ACC) metric and the DynaTrans algorithm, providing formal proofs of correctness, convergence, and efficiency. The analysis employs graph theory, algorithmic complexity theory, and competitive analysis techniques. Findings: We prove that DynaTrans converges to a local optimal state in O(|V|/ε) iterations, with each iteration has limited computational and memory requirements. The algorithm achieves solutions within a factor of O(log|V|) from the global optimum, outperforming simple greedy approaches. Practical implications: DynaTrans offers a theoretically sound foundation for real-time traffic management systems, potentially improving urban mobility and reducing congestion. Originality/value: This work introduces a new paradigm for dynamic transportation network optimization, combining adaptive centrality measures with efficient graph algorithms. The rigorous theoretical analysis provides a solid basis for practical implementation and future research in urban traffic management.
Author Mann, Michael
Author_xml – sequence: 1
  givenname: Michael
  surname: Mann
  fullname: Mann, Michael
  email: michaelma@afeka.ac.il
  organization: Afeka - the Academic College of Engineering,School of Software Engineering and Computer Science,Tel Aviv,Israel
BookMark eNo1kDFPwzAUhA0CiVL6Dxgs9hQ7tuO-MYRCkQpdsleviUMtEruyLVAQP54iYLmTTnffcJfkzHlnCLnhbM45g9vlc1Uvq1UhmIR5znI550xLXgA_ITPQsBCCK6aBwSmZCFbIDMQivyCzGO2OKS2ZVHkxIV_13vhgkm2wp6XDfow2Ut9RdLRs8ZDsu6FV76NxJkZaGZcC9jaN2R1G09Kyf_XBpv1AOx_o_ehwsA3dHHeD_cRkvfuB1QFdPPiQfpMXkz58eItX5LzDPprZn09J_bCsq1W23jw-VeU6s8BTBqpF0NgiAmtQdK0SDSw6eRQttGq47NCInWobOBZFoaAoWI6oNRdC805MyfUv1hpjtodgBwzj9v8v8Q2ax2Vt
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/EMCTECH63049.2024.10741691
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9798331507909
EISSN 3064-9382
EndPage 5
ExternalDocumentID 10741691
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i91t-95da97adaa90ca3fd53c98f4c987375c14fae3b5dc9da936596602aa7713371f3
IEDL.DBID RIE
IngestDate Wed Dec 10 09:44:29 EST 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i91t-95da97adaa90ca3fd53c98f4c987375c14fae3b5dc9da936596602aa7713371f3
PageCount 5
ParticipantIDs ieee_primary_10741691
PublicationCentury 2000
PublicationDate 2024-Oct.-16
PublicationDateYYYYMMDD 2024-10-16
PublicationDate_xml – month: 10
  year: 2024
  text: 2024-Oct.-16
  day: 16
PublicationDecade 2020
PublicationTitle 2024 International Conference on Engineering Management of Communication and Technology (EMCTECH)
PublicationTitleAbbrev EMCTECH
PublicationYear 2024
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssib057404526
ssib061540130
ssib057298476
Score 1.886159
Snippet Purpose: This paper presents a theoretical analysis of the DynaTrans algorithm, a novel approach for dynamic optimization of urban transportation networks....
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Adaptive systems
algorithmic complexity
closeness centrality
Convergence
dynamic networks
graph theory
Heuristic algorithms
Measurement
Memory management
Network topology
Optimization
Real-time systems
Solids
Traffic optimization
Transportation
urban transportation
Title Theoretical Analysis of an Adaptive Closeness Centrality-Based Algorithm for Dynamic Optimization of Transportation Networks
URI https://ieeexplore.ieee.org/document/10741691
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV05T8MwGLWgYmACRBG3PLCmjesrHkto1YXSIUO3yvEBldoEtSkTPx7bSVoxMLBYtuUjcqzvsP3eB8BTYlEuYo0jLaRzUPKcRpK7xDXnlCqrmMhDsAk-nSbzuZg1YPWAhTHGhMdnpuez4S5fl2rnj8r6KNgPHqt-zDmrwVrt5qHOSnSSlh3KxLOF78tOc3tXoiUeRbHoj17TbJROmL9pcp7igPTaCX6FWgmaZnz2z288B90DZg_O9troAhyZ4hJ8ZwecImz5R2BpoSzgUMtPL-tguiq3QeLB5qjXGebRs9NuGg5X7-VmWX2sobNt4UsdvR6-uX7rBr_pB9sTpNc10_pl-bYLsvEoSydRE28hWgpURYJqKbjUUopYSWw1xUoklriEY04VIlYanFOthGuIGfXEngMpufdzObL4CnSKsjDXAGLBEkYMMrHrxX2MSqUNSiTRVBKh0A3o-pVbfNaMGot20W7_qL8Dp_7_eJ2B2D3oVJudeQAn6qtabjePYR_8AIM-s7A
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT8MgGCZmmuhJjTN-y8FrtzKglOOsW2bc5g497LZQoLpka5et8-SPF2i7xYMHLwQIHw0l7wfwPC8AT2GKEu4r7CkujIOSJNQTzCSmOaNUpjLgiQs2wcbjcDrlkwqs7rAwWmv3-Ey3bNbd5atcbu1RWRs5-8Fi1Q8pIR2_hGvV24caO9HI2mBfJpYvfFc2uts6EzX1KPJ5uzeK4l40COxdk_EVO6RVT_Er2IrTNf3Tf37lGWjuUXtwstNH5-BAZxfgO94jFWHNQALzFIoMdpVYWWkHo0W-cTIPVoe9xjT3no1-U7C7-MjX8-JzCY11C1_K-PXw3fRbVghOO9iOIr2sGZdvyzdNEPd7cTTwqogL3pyjwuNUCc6EEoL7UuBUUSx5mBKTMMyoRCQVGidUSW4a4oBaas-OEMx6ugyl-BI0sjzTVwBiHoQB0Uj7phezUSql0igURFFBuETXoGlXbrYqOTVm9aLd_FH_CI4H8Wg4G76O327Bif1XVoOg4A40ivVW34Mj-VXMN-sHtyd-AAj6tvc
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%3Abook&rft.genre=proceeding&rft.title=2024+International+Conference+on+Engineering+Management+of+Communication+and+Technology+%28EMCTECH%29&rft.atitle=Theoretical+Analysis+of+an+Adaptive+Closeness+Centrality-Based+Algorithm+for+Dynamic+Optimization+of+Transportation+Networks&rft.au=Mann%2C+Michael&rft.date=2024-10-16&rft.pub=IEEE&rft.eissn=3064-9382&rft.spage=1&rft.epage=5&rft_id=info:doi/10.1109%2FEMCTECH63049.2024.10741691&rft.externalDocID=10741691