A wave delay neural network for solving label-constrained shortest route query on time-varying communication networks
The focus of the research is on the label-constrained time-varying shortest route query problem on time-varying communication networks. To the best of our knowledge, research on this issue is still relatively limited, and similar studies have the drawbacks of low solution accuracy and slow computati...
Uložené v:
| Vydané v: | PeerJ. Computer science Ročník 10; s. e2116 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
United States
PeerJ. Ltd
12.06.2024
PeerJ Inc |
| Predmet: | |
| ISSN: | 2376-5992, 2376-5992 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | The focus of the research is on the label-constrained time-varying shortest route query problem on time-varying communication networks. To the best of our knowledge, research on this issue is still relatively limited, and similar studies have the drawbacks of low solution accuracy and slow computational speed. In this study, a wave delay neural network (WDNN) framework and corresponding algorithms is proposed to effectively solve the label-constrained time-varying shortest routing query problem. This framework accurately simulates the time-varying characteristics of the network without any training requirements. WDNN adopts a new type of wave neuron, which is independently designed and all neurons are parallelly computed on WDNN. This algorithm determines the shortest route based on the waves received by the destination neuron (node). Furthermore, the time complexity and correctness of the proposed algorithm were analyzed in detail in this study, and the performance of the algorithm was analyzed in depth by comparing it with existing algorithms on randomly generated and real networks. The research results indicate that the proposed algorithm outperforms current existing algorithms in terms of response speed and computational accuracy. |
|---|---|
| AbstractList | The focus of the research is on the label-constrained time-varying shortest route query problem on time-varying communication networks. To the best of our knowledge, research on this issue is still relatively limited, and similar studies have the drawbacks of low solution accuracy and slow computational speed. In this study, a wave delay neural network (WDNN) framework and corresponding algorithms is proposed to effectively solve the label-constrained time-varying shortest routing query problem. This framework accurately simulates the time-varying characteristics of the network without any training requirements. WDNN adopts a new type of wave neuron, which is independently designed and all neurons are parallelly computed on WDNN. This algorithm determines the shortest route based on the waves received by the destination neuron (node). Furthermore, the time complexity and correctness of the proposed algorithm were analyzed in detail in this study, and the performance of the algorithm was analyzed in depth by comparing it with existing algorithms on randomly generated and real networks. The research results indicate that the proposed algorithm outperforms current existing algorithms in terms of response speed and computational accuracy. The focus of the research is on the label-constrained time-varying shortest route query problem on time-varying communication networks. To the best of our knowledge, research on this issue is still relatively limited, and similar studies have the drawbacks of low solution accuracy and slow computational speed. In this study, a wave delay neural network (WDNN) framework and corresponding algorithms is proposed to effectively solve the label-constrained time-varying shortest routing query problem. This framework accurately simulates the time-varying characteristics of the network without any training requirements. WDNN adopts a new type of wave neuron, which is independently designed and all neurons are parallelly computed on WDNN. This algorithm determines the shortest route based on the waves received by the destination neuron (node). Furthermore, the time complexity and correctness of the proposed algorithm were analyzed in detail in this study, and the performance of the algorithm was analyzed in depth by comparing it with existing algorithms on randomly generated and real networks. The research results indicate that the proposed algorithm outperforms current existing algorithms in terms of response speed and computational accuracy.The focus of the research is on the label-constrained time-varying shortest route query problem on time-varying communication networks. To the best of our knowledge, research on this issue is still relatively limited, and similar studies have the drawbacks of low solution accuracy and slow computational speed. In this study, a wave delay neural network (WDNN) framework and corresponding algorithms is proposed to effectively solve the label-constrained time-varying shortest routing query problem. This framework accurately simulates the time-varying characteristics of the network without any training requirements. WDNN adopts a new type of wave neuron, which is independently designed and all neurons are parallelly computed on WDNN. This algorithm determines the shortest route based on the waves received by the destination neuron (node). Furthermore, the time complexity and correctness of the proposed algorithm were analyzed in detail in this study, and the performance of the algorithm was analyzed in depth by comparing it with existing algorithms on randomly generated and real networks. The research results indicate that the proposed algorithm outperforms current existing algorithms in terms of response speed and computational accuracy. |
| ArticleNumber | e2116 |
| Audience | Academic |
| Author | Fu, Qiang Zhang, Xinliang Han, Bing |
| Author_xml | – sequence: 1 givenname: Bing surname: Han fullname: Han, Bing organization: China National Institute of Standardization, Beijing, China – sequence: 2 givenname: Qiang surname: Fu fullname: Fu, Qiang organization: China National Institute of Standardization, Beijing, China – sequence: 3 givenname: Xinliang surname: Zhang fullname: Zhang, Xinliang organization: China National Institute of Standardization, Beijing, China |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/38983230$$D View this record in MEDLINE/PubMed |
| BookMark | eNptkstr3DAQh01JadI0x16LoJf04K0elmWfyhL6WAgU-jgLWR472trSVpI33f--cnYbYqh0GDHzzY-Z0bzMzqyzkGWvCV4JQcT7HYDf5jqsKCHls-yCMlHmvK7p2ZP3eXYVwhZjTDhJp36RnbOqrhhl-CKb1uhe7QG1MKgDsjB5NSQT753_hTrnUXDD3tgeDaqBIdfOhuiVsdCicOd8hBCRd1ME9HsCf0DOomhGyPfKH-Y07cZxskaraFLoJBxeZc87NQS4OtnL7Oenjz9uvuS3Xz9vbta3uU6lxrxluOJNBRVmnDHREFrysmFKMaZwWzStwh1pCBYkgQRa0oEoGC-JAt5gUOwy2xx1W6e2cufNmMqSThn54HC-l8pHoweQBNNaFzXlBFghaKc0q1rW8ZrrCpcVSVofjlq7qRmh1WDTIIaF6DJizZ3s3V4SQhlNH5EUrk8K3qVphShHEzQMg7LgpiAZFiJhBZ3Rt0e0V6k2YzuXJPWMy3WqReCCY5Go1X-odFsYTfoq6EzyLxLeLRISE-FP7NUUgtx8_7Zk3zzt97HRf7uTgPwIaO9C8NA9IgTLeT3lw3pKHeS8nuwv3zvYow |
| Cites_doi | 10.1016/j.cor.2019.01.007 10.1287/opre.2020.2089 10.1007/s00500-008-0313-0 10.1016/j.neunet.2017.03.002 10.1007/BF01386390 10.1145/3451159 10.1016/j.jclepro.2020.121130 10.1109/TNNLS.2019.2900544 10.1109/TITS.2016.2543262 10.3934/dcdss.2022136 10.1007/s11277-017-4897-5 10.1016/j.neunet.2022.06.029 10.1109/LCOMM.2013.052413.130811 10.1016/j.ejor.2019.11.046 10.14778/3342263.3342265 10.1002/(SICI)1097-0037(199705)29:3<141::AID-NET2>3.0.CO;2-H 10.1016/0022-247X(66)90009-6 10.1109/TKDE.2016.2594065 10.1016/j.amc.2006.06.094 10.1016/j.cor.2005.03.027 10.1109/LWC.2022.3149007 10.14778/3529337.3529348 10.1016/j.trb.2016.11.012 10.1080/16583655.2022.2119734 10.14778/3380750.3380753 10.14778/3494124.3494148 10.1016/j.engappai.2017.08.017 |
| ContentType | Journal Article |
| Copyright | 2024 Han et al. COPYRIGHT 2024 PeerJ. Ltd. 2024 Han et al. 2024 Han et al. |
| Copyright_xml | – notice: 2024 Han et al. – notice: COPYRIGHT 2024 PeerJ. Ltd. – notice: 2024 Han et al. 2024 Han et al. |
| DBID | AAYXX CITATION NPM ISR 7X8 5PM DOA |
| DOI | 10.7717/peerj-cs.2116 |
| DatabaseName | CrossRef PubMed Gale In Context: Science MEDLINE - Academic PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef PubMed MEDLINE - Academic |
| DatabaseTitleList | CrossRef PubMed MEDLINE - Academic |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 2376-5992 |
| ExternalDocumentID | oai_doaj_org_article_1029c49251e3472fac38d3f595c80681 PMC11232599 A813704507 38983230 10_7717_peerj_cs_2116 |
| Genre | Journal Article |
| GrantInformation_xml | – fundername: National Key R&D Plan Program grantid: 2022YFF0609602 – fundername: The State Administration for Market Regulation Science and Technology Plan Project grantid: 2022MK187 – fundername: The President Funding Project of China National Institute of Standardization grantid: 242023Y-10413 |
| GroupedDBID | 53G 5VS 8FE 8FG AAFWJ AAYXX ABUWG ADBBV AFFHD AFKRA AFPKN ALMA_UNASSIGNED_HOLDINGS ARAPS ARCSS AZQEC BCNDV BENPR BGLVJ BPHCQ CCPQU CITATION DWQXO FRP GNUQQ GROUPED_DOAJ HCIFZ IAO ICD IEA ISR ITC K6V K7- M~E OK1 P62 PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC RPM H13 NPM 7X8 PUEGO 5PM |
| ID | FETCH-LOGICAL-c511t-d3085b8e8035337b12656b3aa33a0d4bda0f1b10713081ed1fe743561ae5b0ea3 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001245110400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2376-5992 |
| IngestDate | Fri Oct 03 12:27:07 EDT 2025 Tue Nov 04 02:05:35 EST 2025 Fri Sep 05 07:01:27 EDT 2025 Tue Nov 11 10:54:12 EST 2025 Tue Nov 04 18:18:32 EST 2025 Thu Nov 13 16:11:40 EST 2025 Thu Apr 03 06:57:16 EDT 2025 Sat Nov 29 06:22:43 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Label-constrained time-varying shortest route query Time-varying network Artificial intelligence Auto-wave neuron Wave delay neural network |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 2024 Han et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Computer Science) and either DOI or URL of the article must be cited. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c511t-d3085b8e8035337b12656b3aa33a0d4bda0f1b10713081ed1fe743561ae5b0ea3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| OpenAccessLink | https://doaj.org/article/1029c49251e3472fac38d3f595c80681 |
| PMID | 38983230 |
| PQID | 3077993429 |
| PQPubID | 23479 |
| PageCount | e2116 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_1029c49251e3472fac38d3f595c80681 pubmedcentral_primary_oai_pubmedcentral_nih_gov_11232599 proquest_miscellaneous_3077993429 gale_infotracmisc_A813704507 gale_infotracacademiconefile_A813704507 gale_incontextgauss_ISR_A813704507 pubmed_primary_38983230 crossref_primary_10_7717_peerj_cs_2116 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-06-12 |
| PublicationDateYYYYMMDD | 2024-06-12 |
| PublicationDate_xml | – month: 06 year: 2024 text: 2024-06-12 day: 12 |
| PublicationDecade | 2020 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States – name: San Diego, USA |
| PublicationTitle | PeerJ. Computer science |
| PublicationTitleAlternate | PeerJ Comput Sci |
| PublicationYear | 2024 |
| Publisher | PeerJ. Ltd PeerJ Inc |
| Publisher_xml | – name: PeerJ. Ltd – name: PeerJ Inc |
| References | Huang (10.7717/peerj-cs.2116/ref-14) 2015 Chen (10.7717/peerj-cs.2116/ref-5) 2022; 15 Heni (10.7717/peerj-cs.2116/ref-13) 2019; 105 Cacchiani (10.7717/peerj-cs.2116/ref-3) 2020; 283 Ruß (10.7717/peerj-cs.2116/ref-25) 2021; 69 Gomathi (10.7717/peerj-cs.2116/ref-11) 2018; 98 Neumann (10.7717/peerj-cs.2116/ref-21) 2016 Gong (10.7717/peerj-cs.2116/ref-12) 2023 Zulqurnain (10.7717/peerj-cs.2116/ref-36) 2022; 16 Adnéne (10.7717/peerj-cs.2116/ref-1) 2022; 15 Nip (10.7717/peerj-cs.2116/ref-22) 2013; 29 Veneti (10.7717/peerj-cs.2116/ref-27) 2015 Wu (10.7717/peerj-cs.2116/ref-30) 2016; 28 Xu (10.7717/peerj-cs.2116/ref-31) 2007; 185 Likhyani (10.7717/peerj-cs.2116/ref-20) 2013 Chen (10.7717/peerj-cs.2116/ref-6) 2021; 46 Huang (10.7717/peerj-cs.2116/ref-17) 2022; 153 Peng (10.7717/peerj-cs.2116/ref-23) 2022; 11 Cooke (10.7717/peerj-cs.2116/ref-7) 1966; 14 Wang (10.7717/peerj-cs.2116/ref-28) 2009; 13 Peng (10.7717/peerj-cs.2116/ref-24) 2020; 13 Tu (10.7717/peerj-cs.2116/ref-26) 2020; 261 Wang (10.7717/peerj-cs.2116/ref-29) 2019; 12 Dijkstra (10.7717/peerj-cs.2116/ref-8) 1959; 1 Cai (10.7717/peerj-cs.2116/ref-4) 1997; 29 Zhang (10.7717/peerj-cs.2116/ref-34) 2009 Lacomme (10.7717/peerj-cs.2116/ref-19) 2017; 66 Feng (10.7717/peerj-cs.2116/ref-9) 2013; 17 Huang (10.7717/peerj-cs.2116/ref-18) 2017; 90 Yang (10.7717/peerj-cs.2116/ref-32) 2017; 96 Zhang (10.7717/peerj-cs.2116/ref-35) 2021; 15 Huang (10.7717/peerj-cs.2116/ref-16) 2016; 17 Fu (10.7717/peerj-cs.2116/ref-10) 2006; 33 Zhang (10.7717/peerj-cs.2116/ref-33) 2018 Barrett (10.7717/peerj-cs.2116/ref-2) 2008 Huang (10.7717/peerj-cs.2116/ref-15) 2020; 31 |
| References_xml | – start-page: 1177 year: 2013 ident: 10.7717/peerj-cs.2116/ref-20 article-title: Label constrained shortest path estimation – volume: 105 start-page: 102 year: 2019 ident: 10.7717/peerj-cs.2116/ref-13 article-title: Determining time-dependent minimum cost paths under several objectives publication-title: Computers & Operations Research doi: 10.1016/j.cor.2019.01.007 – volume: 69 start-page: 709 year: 2021 ident: 10.7717/peerj-cs.2116/ref-25 article-title: The constrained reliable shortest path problem in stochastic time-dependent networks publication-title: Operations Research doi: 10.1287/opre.2020.2089 – volume: 13 start-page: 551 issue: 6 year: 2009 ident: 10.7717/peerj-cs.2116/ref-28 article-title: A hill-jump algorithm of hopfield neural network for shortest path problem in communication network publication-title: Soft Computing doi: 10.1007/s00500-008-0313-0 – volume: 90 start-page: 21 year: 2017 ident: 10.7717/peerj-cs.2116/ref-18 article-title: A time-delay neural network for solving time-dependent shortest path problem publication-title: Neural Networks doi: 10.1016/j.neunet.2017.03.002 – start-page: 244 year: 2009 ident: 10.7717/peerj-cs.2116/ref-34 article-title: An algorithm of shortest path based on Dijkstra for huge data – start-page: 27 year: 2008 ident: 10.7717/peerj-cs.2116/ref-2 article-title: Engineering label-constrained shortest—path algorithms – volume: 1 start-page: 269 issue: 1 year: 1959 ident: 10.7717/peerj-cs.2116/ref-8 article-title: A note on two problems in connexion with graphs publication-title: Numerische Mathematik doi: 10.1007/BF01386390 – volume: 46 start-page: 1 issue: 2 year: 2021 ident: 10.7717/peerj-cs.2116/ref-6 article-title: Graph indexing for efficient evaluation of label-constrained reachability queries publication-title: ACM Transactions on Database System doi: 10.1145/3451159 – volume: 261 start-page: 121130 year: 2020 ident: 10.7717/peerj-cs.2116/ref-26 article-title: The constrained reliable shortest path problem for electric vehicles in the urban transportation network publication-title: Journal of Cleaner Production doi: 10.1016/j.jclepro.2020.121130 – volume: 31 start-page: 274 issue: 1 year: 2020 ident: 10.7717/peerj-cs.2116/ref-15 article-title: A time wave neural network framework for solving time-dependent project scheduling problems publication-title: IEEE Transactions on Neural Networks and Learning Systems doi: 10.1109/TNNLS.2019.2900544 – volume: 17 start-page: 3194 issue: 11 year: 2016 ident: 10.7717/peerj-cs.2116/ref-16 article-title: The shortest path problem on a time-dependent network with mixed uncertainty of randomness and fuzziness publication-title: IEEE Transactions on Intelligent Transportation Systems doi: 10.1109/TITS.2016.2543262 – volume: 15 start-page: 3097 issue: 11 year: 2022 ident: 10.7717/peerj-cs.2116/ref-1 article-title: Dynamics of delayed cellular neural networks in the Stepanov pseudo almost automorphic space publication-title: Discrete and Continuous Dynamical Systems doi: 10.3934/dcdss.2022136 – volume: 98 start-page: 843 issue: 1 year: 2018 ident: 10.7717/peerj-cs.2116/ref-11 article-title: Energy efficient shortest path routing protocol for underwater acoustic wireless sensor network publication-title: Wireless Personal Communications doi: 10.1007/s11277-017-4897-5 – year: 2023 ident: 10.7717/peerj-cs.2116/ref-12 article-title: Querying shortest path on large time-dependent road networks with shortcuts – start-page: 475 year: 2016 ident: 10.7717/peerj-cs.2116/ref-21 article-title: The shortest path problem with uncertain information in transport networks – start-page: 419 year: 2015 ident: 10.7717/peerj-cs.2116/ref-14 article-title: Minimum spanning trees in temporal graphs – start-page: 1 year: 2018 ident: 10.7717/peerj-cs.2116/ref-33 article-title: STAG-based dynamic two-commodity maximum flow algorithm for time-varying networks – volume: 153 start-page: 450 year: 2022 ident: 10.7717/peerj-cs.2116/ref-17 article-title: The minimum regret path problem on stochastic fuzzy time-varying networks publication-title: Neural Networks doi: 10.1016/j.neunet.2022.06.029 – volume: 17 start-page: 1471 issue: 7 year: 2013 ident: 10.7717/peerj-cs.2116/ref-9 article-title: A fast hybrid ɛ-approximation algorithm for computing constrained shortest paths publication-title: IEEE Communications Letters doi: 10.1109/LCOMM.2013.052413.130811 – volume: 283 start-page: 825 issue: 3 year: 2020 ident: 10.7717/peerj-cs.2116/ref-3 article-title: Models and algorithms for the traveling salesman problem with time-dependent service times publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2019.11.046 – volume: 12 start-page: 1249 issue: 11 year: 2019 ident: 10.7717/peerj-cs.2116/ref-29 article-title: Querying shortest paths on time dependent road networks publication-title: Proceedings of the VLDB Endowment doi: 10.14778/3342263.3342265 – volume: 29 start-page: 141 issue: 3 year: 1997 ident: 10.7717/peerj-cs.2116/ref-4 article-title: Time-varying shortest path problems with constraints publication-title: Networks doi: 10.1002/(SICI)1097-0037(199705)29:3<141::AID-NET2>3.0.CO;2-H – volume: 14 start-page: 493 issue: 3 year: 1966 ident: 10.7717/peerj-cs.2116/ref-7 article-title: The shortest route through a network with time-dependent internodal transit times publication-title: Journal of Mathematical Analysis and Applications doi: 10.1016/0022-247X(66)90009-6 – volume: 28 start-page: 2927 issue: 11 year: 2016 ident: 10.7717/peerj-cs.2116/ref-30 article-title: Efficient algorithms for temporal path computation publication-title: IEEE Transactions on Knowledge and Data Engineering doi: 10.1109/TKDE.2016.2594065 – volume: 185 start-page: 247 issue: 1 year: 2007 ident: 10.7717/peerj-cs.2116/ref-31 article-title: An improved Dijkstra’s shortest path algorithm for sparse network publication-title: Applied Mathematics and Computation doi: 10.1016/j.amc.2006.06.094 – volume: 33 start-page: 3324 issue: 11 year: 2006 ident: 10.7717/peerj-cs.2116/ref-10 article-title: Heuristic shortest path algorithms for transportation applications: state of the art publication-title: Computers & Operations Research doi: 10.1016/j.cor.2005.03.027 – start-page: 62 year: 2015 ident: 10.7717/peerj-cs.2116/ref-27 article-title: Continuous and discrete time label setting algorithms for the time dependent bi-Criteria shortest path problem – volume: 11 start-page: 861 year: 2022 ident: 10.7717/peerj-cs.2116/ref-23 article-title: Constrained multi-objective optimization for UAV-enabled mobile edge computing: offloading optimization and path planning publication-title: IEEE Wireless Communications Letters doi: 10.1109/LWC.2022.3149007 – volume: 15 start-page: 1645 issue: 8 year: 2022 ident: 10.7717/peerj-cs.2116/ref-5 article-title: DLCR: efficient indexing for label-constrained reachability queries on large dynamic graphs publication-title: Proceedings of the VLDB Endowment doi: 10.14778/3529337.3529348 – volume: 96 start-page: 68 year: 2017 ident: 10.7717/peerj-cs.2116/ref-32 article-title: Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: linear mixed integer programming reformulations publication-title: Transportation Research Part B: Methodological doi: 10.1016/j.trb.2016.11.012 – volume: 16 start-page: 874 issue: 1 year: 2022 ident: 10.7717/peerj-cs.2116/ref-36 article-title: Applications of artificial neural network to solve the nonlinear COVID-19 mathematical model based on the dynamics of SIQ publication-title: Journal of Taibah University for Science doi: 10.1080/16583655.2022.2119734 – volume: 29 start-page: 36 issue: 1 year: 2013 ident: 10.7717/peerj-cs.2116/ref-22 article-title: A combination of flow shop scheduling and the shortest path problem publication-title: A Combination of Flow Shop Scheduling and the Shortest Path Problem – volume: 13 start-page: 812 issue: 6 year: 2020 ident: 10.7717/peerj-cs.2116/ref-24 article-title: Answering billion-scale label-constrained reachability queries within microsecond publication-title: Proceedings of the VLDB Endowment doi: 10.14778/3380750.3380753 – volume: 15 start-page: 686 issue: 3 year: 2021 ident: 10.7717/peerj-cs.2116/ref-35 article-title: Efficient label-constrained shortest path queries on road networks: a tree decomposition approach publication-title: Proceedings of the VLDB Endowment doi: 10.14778/3494124.3494148 – volume: 66 start-page: 75 year: 2017 ident: 10.7717/peerj-cs.2116/ref-19 article-title: A new shortest path algorithm to solve the resource-constrained project scheduling problem with routing from a flow solution publication-title: Engineering Applications of Artificial Intelligence doi: 10.1016/j.engappai.2017.08.017 |
| SSID | ssj0001511119 |
| Score | 2.2587547 |
| Snippet | The focus of the research is on the label-constrained time-varying shortest route query problem on time-varying communication networks. To the best of our... |
| SourceID | doaj pubmedcentral proquest gale pubmed crossref |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database |
| StartPage | e2116 |
| SubjectTerms | Algorithms Analysis Artificial Intelligence Auto-wave neuron Computer Networks and Communications Data Mining and Machine Learning Label-constrained time-varying shortest route query Neural Networks Neurons Time-varying network Wave delay neural network |
| Title | A wave delay neural network for solving label-constrained shortest route query on time-varying communication networks |
| URI | https://www.ncbi.nlm.nih.gov/pubmed/38983230 https://www.proquest.com/docview/3077993429 https://pubmed.ncbi.nlm.nih.gov/PMC11232599 https://doaj.org/article/1029c49251e3472fac38d3f595c80681 |
| Volume | 10 |
| WOSCitedRecordID | wos001245110400001&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: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2376-5992 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001511119 issn: 2376-5992 databaseCode: DOA dateStart: 20150101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2376-5992 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001511119 issn: 2376-5992 databaseCode: M~E dateStart: 20150101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 2376-5992 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001511119 issn: 2376-5992 databaseCode: P5Z dateStart: 20150527 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 2376-5992 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001511119 issn: 2376-5992 databaseCode: K7- dateStart: 20150527 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 2376-5992 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001511119 issn: 2376-5992 databaseCode: BENPR dateStart: 20150527 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Publicly Available Content Database customDbUrl: eissn: 2376-5992 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001511119 issn: 2376-5992 databaseCode: PIMPY dateStart: 20150527 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwEB5B4cClvGmgrAxCcAokdhInxy3aigp1FRWQFi6W49i0CCVVsruoF347M0m2SsSBCxcf1t4onof9TTTzDcAra6MoclHi84RjgCLQFQuhuY9BHJeJE9ImfbMJuVymq1WWj1p9UU5YTw_cCw69mmeGGPRCKyLJnTYiLYWLs9ikQdIVXfNAZqNgqq8PpqMg60k1JYYs7y6tbX74pn2LEU8yuYQ6rv6_T-TRlTRNlxzdP8f3YH8Ajmzev_B9uGGrB3B315SBDT76EDZz9ktvLSP2xytGdJX4r6pP9maIUBkaG31EYKh--9M3hA-pTYQtWXtOmbftmjU1PpPh-zVXrK4Y9Z_3t7qhiihmxhUluwe3j-DL8eLz-w_-0FvBNyiatV8KxFpFatNAIOCTRcgR2KGWtBA6KKOi1IELi5BiWAQNtgydRayBYEvbuAisFo9hr6orewDMOu4KaTSCDx2VhcvCtHQ60lFCXPci8eD1TtjqsqfQUBh6kFZUpxVlWkVa8eCIVHG9iJivux_QHtRgD-pf9uDBS1KkIm6LipJnvutN26qTT2dqnoZCIoQNpAdvhkWuRhkbPdQi4IaIDmuy8nCyEp3PTKZf7OxF0RRlrFW23rQKz06J2A-vew-e9PZzvTEEiXiQisCDdGJZk51PZ6qL8477OyQIHGfZ0_8hq2dwhyNG87tWTIewt2429jncNtv1RdvM4KZcpTO4dbRY5mezzr9w_Ch9HE9_L3DM4284n5-c5l__AOvPLuU |
| linkProvider | Directory of Open Access Journals |
| 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=A+wave+delay+neural+network+for+solving+label-constrained+shortest+route+query+on+time-varying+communication+networks&rft.jtitle=PeerJ.+Computer+science&rft.au=Han%2C+Bing&rft.au=Fu%2C+Qiang&rft.au=Zhang%2C+Xinliang&rft.date=2024-06-12&rft.pub=PeerJ+Inc&rft.eissn=2376-5992&rft.volume=10&rft_id=info:doi/10.7717%2Fpeerj-cs.2116&rft_id=info%3Apmid%2F38983230&rft.externalDocID=PMC11232599 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2376-5992&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2376-5992&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2376-5992&client=summon |