An efficient all-pairs approach for multi-objective dynamic shortest path problems
The Shortest Path problem is fundamental for determining optimal routes in various applications. The Dynamic Shortest Path problem extends this concept to evolving graph structures. However, existing algorithms often fail to address decision-making complexities involving multiple objectives. In our...
Uložené v:
| Vydané v: | Neural computing & applications Ročník 37; číslo 30; s. 24823 - 24851 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
London
Springer London
01.10.2025
Springer Nature B.V |
| Predmet: | |
| ISSN: | 0941-0643, 1433-3058 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | The Shortest Path problem is fundamental for determining optimal routes in various applications. The Dynamic Shortest Path problem extends this concept to evolving graph structures. However, existing algorithms often fail to address decision-making complexities involving multiple objectives. In our previous work, we introduced the Multi-Objective Dynamic Shortest Path problem to address this gap. This paper presents the All-pairs Multi-objective Dynamic Shortest Path algorithm, offering a novel approach that combines a labeling-correcting method with the Optimistic Linear Support algorithm. This hybrid methodology enhances efficiency by minimizing redundant calculations during graph updates. Extensive testing demonstrates that our algorithm is over 3.22 times faster than baseline algorithms in producing Pareto solutions. This work advances techniques for multi-objective dynamic shortest paths and tackles challenges in evolving graph structures, paving the way for future research in this dynamic field. |
|---|---|
| AbstractList | The Shortest Path problem is fundamental for determining optimal routes in various applications. The Dynamic Shortest Path problem extends this concept to evolving graph structures. However, existing algorithms often fail to address decision-making complexities involving multiple objectives. In our previous work, we introduced the Multi-Objective Dynamic Shortest Path problem to address this gap. This paper presents the All-pairs Multi-objective Dynamic Shortest Path algorithm, offering a novel approach that combines a labeling-correcting method with the Optimistic Linear Support algorithm. This hybrid methodology enhances efficiency by minimizing redundant calculations during graph updates. Extensive testing demonstrates that our algorithm is over 3.22 times faster than baseline algorithms in producing Pareto solutions. This work advances techniques for multi-objective dynamic shortest paths and tackles challenges in evolving graph structures, paving the way for future research in this dynamic field. |
| Author | da Silva, Juarez Machado Ramos, Gabriel de Oliveira Barbosa, Jorge Luis Victória |
| Author_xml | – sequence: 1 givenname: Juarez Machado orcidid: 0000-0002-5702-990X surname: da Silva fullname: da Silva, Juarez Machado organization: Graduate Program in Applied Computing, Universidade do Vale do Rio dos Sinos - UNISINOS – sequence: 2 givenname: Gabriel de Oliveira orcidid: 0000-0002-6488-7654 surname: Ramos fullname: Ramos, Gabriel de Oliveira email: gdoramos@unisinos.br organization: Graduate Program in Applied Computing, Universidade do Vale do Rio dos Sinos - UNISINOS – sequence: 3 givenname: Jorge Luis Victória orcidid: 0000-0002-0358-2056 surname: Barbosa fullname: Barbosa, Jorge Luis Victória organization: Graduate Program in Applied Computing, Universidade do Vale do Rio dos Sinos - UNISINOS |
| BookMark | eNp9kM1LxDAQxYMouLv6D3gKeI5OmjZNj8viFywIoueQpBO3S79MusL-90YrePM0A_N-7w1vSU77oUdCrjjccIDyNgIUGWeQFYzzXJRMnpBFWgQTUKhTsoAqT2eZi3OyjHEPALlUxYK8rHuK3jeuwX6ipm3ZaJoQqRnHMBi3o34ItDu0U8MGu0c3NZ9I62NvusbRuBvChHGio5l2NAG2xS5ekDNv2oiXv3NF3u7vXjePbPv88LRZb5njqpRMSgQUJSprnXFQeaWMV6bKVSaNLNHaWjovFfc5QgG5rYxAK2vOrShq4cWKXM--KfjjkN7Q--EQ-hSpRVZUuch4mSVVNqtcGGIM6PUYms6Eo-agv7vTc3c6dad_utMyQWKGYhL37xj-rP-hvgCfFnRn |
| Cites_doi | 10.1016/S0191-2615(98)00016-2 10.1137/1.9781611975994.156 10.1137/1.9781611974782.28 10.1299/jsmeicam.2010.5.67 10.1109/FOCS.2019.00035 10.1007/s00500-015-1825-z 10.1016/j.ejor.2014.11.003 10.1016/j.ejor.2020.07.005 10.1145/1353343.1353371 10.1007/978-3-540-27810-8_33 10.1016/j.cor.2013.06.014 10.1016/j.cor.2012.03.006 10.1007/s10898-021-01096-x 10.1613/jair.3987 10.1016/j.eswa.2016.10.045 10.1007/978-3-319-53925-6_15 10.1007/3-540-44676-1_3 10.1007/s00500-012-0964-8 10.1007/978-3-319-49487-6_2 10.1145/1039488.1039492 10.1137/1.9781611977554.ch4 10.1007/s10458-022-09552-y 10.1016/0196-6774(91)90036-X 10.1016/S0305-0548(99)00037-4 10.1007/s10957-005-5494-4 10.1016/0377-2217(92)90248-8 10.1145/1060590.1060607 10.3390/a14020043 10.3390/a16030162 10.1109/ICICTA.2010.300 10.2991/iske.2007.217 10.1137/090776573 10.1016/j.ifacol.2016.07.774 10.1016/j.ejor.2015.02.008 10.1007/978-3-031-01576-2 10.1016/j.cor.2015.05.007 10.1016/j.cor.2014.11.010 10.1145/1754399.1754400 10.1007/s41019-019-00105-0 10.1109/CEC55065.2022.9870278 10.1007/978-94-007-4722-7_46 |
| ContentType | Journal Article |
| Copyright | The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025 Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025. |
| Copyright_xml | – notice: The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025 Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. – notice: The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025. |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s00521-025-11437-6 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1433-3058 |
| EndPage | 24851 |
| ExternalDocumentID | 10_1007_s00521_025_11437_6 |
| GrantInformation_xml | – fundername: Conselho Nacional de Desenvolvimento Científico e Tecnológico funderid: http://dx.doi.org/10.13039/501100003593 – fundername: Coordenação de Aperfeiçoamento de Pessoal de Nível Superior funderid: http://dx.doi.org/10.13039/501100002322 |
| GroupedDBID | -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 123 1N0 1SB 2.D 203 28- 29N 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 53G 5QI 5VS 67Z 6NX 8FE 8FG 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBRH ABBXA ABDBE ABDBF ABDZT ABECU ABFSG ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACSTC ACUHS ACZOJ ADHHG ADHIR ADHKG ADIMF ADKFA ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFEXP AFGCZ AFHIU AFKRA AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN B-. B0M BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EAD EAP EBLON EBS ECS EDO EIOEI EJD EMI EMK EPL ESBYG EST ESX F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ7 GQ8 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF0 PHGZM PHGZT PQGLB PT4 PT5 QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 ZMTXR ~8M ~EX AAYXX AFFHD CITATION |
| ID | FETCH-LOGICAL-c1876-66e0e37e8bbcac09f88af8a94826a67ebbd6cf681f4e0504b9a3eb6d11b35d3f3 |
| IEDL.DBID | RSV |
| ISSN | 0941-0643 |
| IngestDate | Wed Nov 05 08:34:51 EST 2025 Sat Nov 29 07:09:38 EST 2025 Fri Oct 10 01:12:04 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 30 |
| Keywords | Decision-making Shortest path Dynamic shortest paths Multi-objective Multi-objective shortest paths |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c1876-66e0e37e8bbcac09f88af8a94826a67ebbd6cf681f4e0504b9a3eb6d11b35d3f3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-5702-990X 0000-0002-0358-2056 0000-0002-6488-7654 |
| PQID | 3259432172 |
| PQPubID | 2043988 |
| PageCount | 29 |
| ParticipantIDs | proquest_journals_3259432172 crossref_primary_10_1007_s00521_025_11437_6 springer_journals_10_1007_s00521_025_11437_6 |
| PublicationCentury | 2000 |
| PublicationDate | 20251000 2025-10-00 20251001 |
| PublicationDateYYYYMMDD | 2025-10-01 |
| PublicationDate_xml | – month: 10 year: 2025 text: 20251000 |
| PublicationDecade | 2020 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: Heidelberg |
| PublicationTitle | Neural computing & applications |
| PublicationTitleAbbrev | Neural Comput & Applic |
| PublicationYear | 2025 |
| Publisher | Springer London Springer Nature B.V |
| Publisher_xml | – name: Springer London – name: Springer Nature B.V |
| References | L Mandow (11437_CR7) 2022; 82 11437_CR34 11437_CR32 JM Silva (11437_CR42) 2023 11437_CR31 11437_CR30 L Fu (11437_CR37) 1998; 32 C Tung Tung (11437_CR22) 1992; 62 11437_CR19 D Duque (11437_CR13) 2015; 242 D Sever (11437_CR35) 2013; 40 11437_CR16 11437_CR15 11437_CR6 DM Roijers (11437_CR38) 2013; 48 B Han (11437_CR40) 2016; 49 MK Ardakani (11437_CR36) 2012; 39 V Chankong (11437_CR2) 2008 M Thorup (11437_CR28) 2004 G Ausiello (11437_CR4) 1991; 12 S Ruzika (11437_CR8) 2005; 126 F Ahmed (11437_CR14) 2013; 17 L Roditty (11437_CR33) 2012; 41 B Han (11437_CR39) 2015; 244 Y Wang (11437_CR25) 2019; 4 11437_CR41 U Zwick (11437_CR27) 2001 P Casas (11437_CR26) 2021 11437_CR29 A Hidalgo-Paniagua (11437_CR9) 2017; 21 F Bökler (11437_CR23) 2017 11437_CR5 CF Hayes (11437_CR1) 2022; 36 11437_CR24 C Demetrescu (11437_CR3) 2004; 51 B Tozer (11437_CR10) 2017; 72 A Sedeño-Noda (11437_CR12) 2015; 57 S Zajac (11437_CR18) 2021; 290 F-J Pulido (11437_CR11) 2015; 64 H Bast (11437_CR17) 2016 AJV Skriver (11437_CR21) 2000; 27 L Mandow (11437_CR20) 2008 |
| References_xml | – volume: 32 start-page: 499 issue: 7 year: 1998 ident: 11437_CR37 publication-title: Transp Res Part B: Methodol doi: 10.1016/S0191-2615(98)00016-2 – ident: 11437_CR31 doi: 10.1137/1.9781611975994.156 – ident: 11437_CR30 doi: 10.1137/1.9781611974782.28 – ident: 11437_CR6 doi: 10.1299/jsmeicam.2010.5.67 – ident: 11437_CR34 doi: 10.1109/FOCS.2019.00035 – volume: 21 start-page: 949 issue: 4 year: 2017 ident: 11437_CR9 publication-title: Soft Comput doi: 10.1007/s00500-015-1825-z – volume: 242 start-page: 788 issue: 3 year: 2015 ident: 11437_CR13 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2014.11.003 – volume: 290 start-page: 1 issue: 1 year: 2021 ident: 11437_CR18 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2020.07.005 – ident: 11437_CR24 doi: 10.1145/1353343.1353371 – start-page: 384 volume-title: Algorithm Theory—SWAT 2004 year: 2004 ident: 11437_CR28 doi: 10.1007/978-3-540-27810-8_33 – volume: 40 start-page: 2852 issue: 12 year: 2013 ident: 11437_CR35 publication-title: Comput Oper Res doi: 10.1016/j.cor.2013.06.014 – volume: 39 start-page: 3012 issue: 12 year: 2012 ident: 11437_CR36 publication-title: Comput Oper Res doi: 10.1016/j.cor.2012.03.006 – volume: 82 start-page: 595 issue: 3 year: 2022 ident: 11437_CR7 publication-title: J Glob Optim doi: 10.1007/s10898-021-01096-x – volume: 48 start-page: 67 year: 2013 ident: 11437_CR38 publication-title: J Artif Intell Res doi: 10.1613/jair.3987 – volume: 72 start-page: 371 year: 2017 ident: 11437_CR10 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2016.10.045 – start-page: 190 volume-title: WALCOM: algorithms and computation year: 2017 ident: 11437_CR23 doi: 10.1007/978-3-319-53925-6_15 – start-page: 33 volume-title: Algorithms—ESA 2001 year: 2001 ident: 11437_CR27 doi: 10.1007/3-540-44676-1_3 – volume: 17 start-page: 1283 issue: 7 year: 2013 ident: 11437_CR14 publication-title: Soft Comput doi: 10.1007/s00500-012-0964-8 – start-page: 19 volume-title: Route planning in transportation networks year: 2016 ident: 11437_CR17 doi: 10.1007/978-3-319-49487-6_2 – volume: 51 start-page: 968 issue: 6 year: 2004 ident: 11437_CR3 publication-title: J ACM doi: 10.1145/1039488.1039492 – ident: 11437_CR32 doi: 10.1137/1.9781611977554.ch4 – volume: 36 start-page: 26 issue: 1 year: 2022 ident: 11437_CR1 publication-title: Auton Agent Multi-Agent Syst doi: 10.1007/s10458-022-09552-y – volume: 12 start-page: 615 issue: 4 year: 1991 ident: 11437_CR4 publication-title: J Algorithms doi: 10.1016/0196-6774(91)90036-X – volume: 27 start-page: 507 issue: 6 year: 2000 ident: 11437_CR21 publication-title: Comput Oper Res doi: 10.1016/S0305-0548(99)00037-4 – volume: 126 start-page: 473 issue: 3 year: 2005 ident: 11437_CR8 publication-title: J Optim Theory Appl doi: 10.1007/s10957-005-5494-4 – volume: 62 start-page: 203 issue: 2 year: 1992 ident: 11437_CR22 publication-title: Eur J Oper Res doi: 10.1016/0377-2217(92)90248-8 – ident: 11437_CR29 doi: 10.1145/1060590.1060607 – year: 2021 ident: 11437_CR26 publication-title: Algorithms doi: 10.3390/a14020043 – year: 2023 ident: 11437_CR42 publication-title: Algorithms doi: 10.3390/a16030162 – ident: 11437_CR15 doi: 10.1109/ICICTA.2010.300 – ident: 11437_CR16 doi: 10.2991/iske.2007.217 – volume: 41 start-page: 670 issue: 3 year: 2012 ident: 11437_CR33 publication-title: SIAM J Comput doi: 10.1137/090776573 – volume: 49 start-page: 1442 issue: 12 year: 2016 ident: 11437_CR40 publication-title: IFAC-PapersOnLine doi: 10.1016/j.ifacol.2016.07.774 – volume: 244 start-page: 704 issue: 3 year: 2015 ident: 11437_CR39 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2015.02.008 – ident: 11437_CR41 doi: 10.1007/978-3-031-01576-2 – volume: 64 start-page: 60 year: 2015 ident: 11437_CR11 publication-title: Comput Oper Res doi: 10.1016/j.cor.2015.05.007 – volume: 57 start-page: 83 year: 2015 ident: 11437_CR12 publication-title: Comput Oper Res doi: 10.1016/j.cor.2014.11.010 – year: 2008 ident: 11437_CR20 publication-title: J ACM doi: 10.1145/1754399.1754400 – volume: 4 start-page: 352 issue: 4 year: 2019 ident: 11437_CR25 publication-title: Data Sci Eng doi: 10.1007/s41019-019-00105-0 – ident: 11437_CR5 doi: 10.1109/CEC55065.2022.9870278 – ident: 11437_CR19 doi: 10.1007/978-94-007-4722-7_46 – volume-title: Multiobjective decision making: theory and methodology year: 2008 ident: 11437_CR2 |
| SSID | ssj0004685 |
| Score | 2.3926928 |
| Snippet | The Shortest Path problem is fundamental for determining optimal routes in various applications. The Dynamic Shortest Path problem extends this concept to... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 24823 |
| SubjectTerms | Algorithms Artificial Intelligence Computational Biology/Bioinformatics Computational Science and Engineering Computer Science Data Mining and Knowledge Discovery Decision making Energy consumption Image Processing and Computer Vision Labeling Multiple objective analysis Objectives Probability and Statistics in Computer Science S.I.: Multi-Objective Decision Making 2023 Shortest-path problems Special Issue on Multi-Objective Decision Making 2023 |
| Title | An efficient all-pairs approach for multi-objective dynamic shortest path problems |
| URI | https://link.springer.com/article/10.1007/s00521-025-11437-6 https://www.proquest.com/docview/3259432172 |
| Volume | 37 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1433-3058 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004685 issn: 0941-0643 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED5BYWChPEWhIA9sYCmpH7XHClExVYiXukVxYgtQlVZN4fdzdpIWEAwwJzpFd77HF9_dB3AeOZ5qIyKqXJ4jQEGfM0JzamSO2cBhjjcV2UR_NFLjsb6th8LKptu9uZIMkXo57Ob_YCL07QmKNbwfbluHDeG3zXiMfv_0aRoyEHEibvE9PZzVozI_y_iajlY15rdr0ZBthu3_fecObNfVJRlUx2EX1myxB-2GuYHUjrwPd4OC2LA8AnMOSScTOvP3OqTZME6wlCWh15BOzWsVE0lekdeT8tk36JYL4tmMSc1IUx7A4_D64eqG1uwKNIsxBFIpbWRZ3ypjsjSLtFMqdSrVHAFHKvvWmFxmTqrYcRuJiBudMosmjGPDRM4cO4RWMS3sERCENUJpbhFKKU9pZhBvS9fjykgptOEduGiUnMyqJRrJcl1yUFeC6kqCuhLZgW5jh6R2qDJhKJszz6bVgctG76vHv0s7_tvrJ7DVC6bz7XpdaC3mb_YUNrP3xUs5PwsH7QN73swQ |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED90Cvri_MTp1Dz4poF2SbP0cYhDcQ7RKXsrTZugMrqxTv9-L2m7qeiDPrcc5S738Wvu7gdw6hkehyrwqDRpigAFfU4FIadKpJgNDOZ4VZBNtPt9ORyGd-VQWF51u1dXki5Sz4fd7B9MhL6tgGINb4fblmGFW5odi9Efnj5NQzoiTsQttqeHs3JU5mcZX9PRosb8di3qsk23_r_v3ISNsrokneI4bMGSzrahXjE3kNKRd-C-kxHtlkdgziHxaEQn9l6HVBvGCZayxPUa0rF6LWIiSQvyepI_2wbdfEYsmzEpGWnyXXjsXg4urmjJrkATH0MgFUJ7mrW1VCqJEy80UsZGxiFHwBGLtlYqFYkR0jdce4HHVRgzjSb0fcWClBm2B7VsnOl9IAhrAhlyjVBKWkozhXhbmBaXSoggVLwBZ5WSo0mxRCOar0t26opQXZFTVyQa0KzsEJUOlUcMZXNm2bQacF7pffH4d2kHf3v9BNauBre9qHfdvzmE9ZYzo23da0JtNn3TR7CavM9e8umxO3QfFq_O9A |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60inixPrFadQ_eNJg0m-3usahFUUqpD3oL2WQXlZKWJvr7nd0kbRU9iOeEIczs7MyXeXwAp66mkZCB63CdJAhQ0OdkIKgjWYLRQGOMlwXZRLvX48Oh6C9M8dtu96okWcw0mC1NaX4xSfTFbPDN_M1EGNwKHMznzaDbMqxQRDKmqWvw8LwwGWlJORHDmP4e6pdjMz_L-Bqa5vnmtxKpjTzd-v-_eRM2yqyTdIpjsgVLKt2GesXoQEoH34FBJyXKLpVAuSQajZyJqfeQavM4wRSX2B5EZyzfiruSJAWpPcleTONulhPDckxKpppsF56614-XN07JuuDEHl6NDmPKVX5bcSnjKHaF5jzSPBIUgUjE2krKhMWacU9T5QYulSLyFZrW86QfJL7296CWjlO1DwThTsAFVQixuKE6k4jDmW5RLhkLhKQNOKsUHk6K5RrhbI2yVVeI6gqtukLWgGZlk7B0tCz0UTb1DctWA84rG8wf_y7t4G-vn8Ba_6ob3t_27g5hvWWtaDr6mlDLp-_qCFbjj_w1mx7b8_cJvZvX2A |
| 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=An+efficient+all-pairs+approach+for+multi-objective+dynamic+shortest+path+problems&rft.jtitle=Neural+computing+%26+applications&rft.au=da+Silva%2C+Juarez+Machado&rft.au=Ramos%2C+Gabriel+de+Oliveira&rft.au=Barbosa%2C+Jorge+Luis+Vict%C3%B3ria&rft.date=2025-10-01&rft.issn=0941-0643&rft.eissn=1433-3058&rft.volume=37&rft.issue=30&rft.spage=24823&rft.epage=24851&rft_id=info:doi/10.1007%2Fs00521-025-11437-6&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00521_025_11437_6 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0941-0643&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0941-0643&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0941-0643&client=summon |