Modification of the Bellman–Ford Algorithm for Finding the Optimal Route in Multilayer Network Structures

One of the actual tasks of the contemporary logistics business using the “just in time” supply planning concept, is to distribute manufactured goods among the objects of the distribution network in the most efficient manner at the lowest possible cost. The article is devoted to the problem of findin...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computation Ročník 11; číslo 4; s. 74
Hlavní autoři: Timofeeva, Olga, Sannikov, Alexey, Stepanenko, Maria, Balashova, Tatiana
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.04.2023
Témata:
Algorithms
Alliances
Bellman–Ford algorithm
Consumption
Data transmission
Distribution of goods
Electricity distribution
Graph representations
Just in time inventory systems
Logistics
Mathematical programming
Methods
modeling of shortest route search on a graph
multilayer data transmission network
Multilayers
Multimodal transportation systems
Networks
Optimization
optimization of logistics networks
Supply chain management
Visualization
Russia
ISSN:2079-3197, 2079-3197
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 One of the actual tasks of the contemporary logistics business using the “just in time” supply planning concept, is to distribute manufactured goods among the objects of the distribution network in the most efficient manner at the lowest possible cost. The article is devoted to the problem of finding the optimal path in network structures. The problem statement for multilayer data transmission networks (MDTN), which is one of the possible representations of multimodal transport networks, is considered. Thus, each MDTN layer can be represented as a separate type of transport. The problem is solved by modifying the Bellman–Ford mathematical programming algorithm. Load testing of the modified method was performed, and a comparative analysis was given, including an assessment of speed and performance, proving the effectiveness of the results of the study. Based on the results of comparative analysis, recommendations for using a modified version of the Bellman–Ford algorithm for application in practical problems in optimizing logistics networks are proposed. The results obtained can be used in practice not only in logistics networks but also in the construction of smart energy networks, as well as in other subject areas that require optimization of multilayer graph structures.
AbstractList One of the actual tasks of the contemporary logistics business using the "just in time" supply planning concept, is to distribute manufactured goods among the objects of the distribution network in the most efficient manner at the lowest possible cost. The article is devoted to the problem of finding the optimal path in network structures. The problem statement for multilayer data transmission networks (MDTN), which is one of the possible representations of multimodal transport networks, is considered. Thus, each MDTN layer can be represented as a separate type of transport. The problem is solved by modifying the Bellman-Ford mathematical programming algorithm. Load testing of the modified method was performed, and a comparative analysis was given, including an assessment of speed and performance, proving the effectiveness of the results of the study. Based on the results of comparative analysis, recommendations for using a modified version of the Bellman-Ford algorithm for application in practical problems in optimizing logistics networks are proposed. The results obtained can be used in practice not only in logistics networks but also in the construction of smart energy networks, as well as in other subject areas that require optimization of multilayer graph structures.
Audience Academic
Author Balashova, Tatiana
Timofeeva, Olga
Stepanenko, Maria
Sannikov, Alexey
Author_xml – sequence: 1
  givenname: Olga
  surname: Timofeeva
  fullname: Timofeeva, Olga
– sequence: 2
  givenname: Alexey
  surname: Sannikov
  fullname: Sannikov, Alexey
– sequence: 3
  givenname: Maria
  surname: Stepanenko
  fullname: Stepanenko, Maria
– sequence: 4
  givenname: Tatiana
  surname: Balashova
  fullname: Balashova, Tatiana
BookMark eNptUctuFDEQtFCQCCFfwMUS5w1-jT0-LhELkRIi8ThbHj823sy4F49HKDf-gT_kS3B2I8SB7kO3WlWlUtdLdJIhB4ReU3LBuSZvHUz7pdqaIFNKBCFKPEOnjCi94lSrk3_2F-h8nneklaa8Z-QU3d-ATzG5Ax1DxPUu4HdhHCebf__8tYHi8XrcQkn1bsIRCt6k7FPeHoC3-5omO-LPsNSAU8Y3y1jTaB9CwZ9C_QHlHn-pZXF1KWF-hZ5HO87h_GmeoW-b918vP66ubz9cXa6vV44rVVeRe0udYjpST2QUvhuoZMEOinadd1owrwblfO-YYywySzsZO-45oVEz1vMzdHXU9WB3Zl-axfJgwCZzOEDZGltqcmMw0noliWRDbwfheDe4Xgpi-54proKnTevNUWtf4PsS5mp2sJTc7BvWE9m1pzLZUBdH1NY20ZQj1GJdax-m5FpcMbX7WgklBNNSNwI_ElyBeS4h_rVJiXlM1fwnVf4Hdn2bXA
Cites_doi 10.1016/j.asoc.2022.109674
10.3390/computation9060067
10.3390/computation8040099
10.1016/j.simpat.2018.11.007
10.1016/j.procir.2013.09.059
10.1007/978-3-662-53622-3
10.3390/computation9030037
10.1016/j.ijleo.2022.170405
10.1016/j.tranpol.2022.12.006
10.1016/j.rtbm.2020.100462
10.1016/j.ejor.2019.01.007
ContentType Journal Article
Copyright COPYRIGHT 2023 MDPI AG
2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: COPYRIGHT 2023 MDPI AG
– notice: 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
3V.
7SC
7XB
8AL
8FD
8FE
8FG
8FK
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L7M
L~C
L~D
M0N
P5Z
P62
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
DOA
DOI 10.3390/computation11040074
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ProQuest Central (purchase pre-March 2016)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
Technology Collection
ProQuest One
ProQuest Central Korea
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Collection
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
ProQuest Central (Alumni)
DatabaseTitleList
CrossRef
Publicly Available Content Database
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Sciences (General)
Mathematics
EISSN 2079-3197
ExternalDocumentID oai_doaj_org_article_6ad76062b8ab4c35bc8640a882737ed1
A747442969
10_3390_computation11040074
GeographicLocations Russia
GeographicLocations_xml – name: Russia
GroupedDBID 5VS
8FE
8FG
AADQD
AAFWJ
AAYXX
ABUWG
ADBBV
ADMLS
AFFHD
AFKRA
AFPKN
AFZYC
ALMA_UNASSIGNED_HOLDINGS
ARAPS
AZQEC
BCNDV
BENPR
BGLVJ
BPHCQ
CCPQU
CITATION
DWQXO
GNUQQ
GROUPED_DOAJ
HCIFZ
IAO
ICD
ITC
K6V
K7-
KQ8
MODMG
M~E
OK1
P62
PHGZM
PHGZT
PIMPY
PQGLB
PQQKQ
PROAC
3V.
7SC
7XB
8AL
8FD
8FK
JQ2
L7M
L~C
L~D
M0N
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c377t-f3da1c729f1d06f4d5b162eab7155dc942d7b7cd8c2c22f2a156f53d301f92283
IEDL.DBID DOA
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000977304100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2079-3197
IngestDate Tue Oct 14 19:06:03 EDT 2025
Fri Jul 25 03:12:26 EDT 2025
Tue Nov 04 17:57:05 EST 2025
Sat Nov 29 07:17:34 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c377t-f3da1c729f1d06f4d5b162eab7155dc942d7b7cd8c2c22f2a156f53d301f92283
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://doaj.org/article/6ad76062b8ab4c35bc8640a882737ed1
PQID 2806519726
PQPubID 2032414
ParticipantIDs doaj_primary_oai_doaj_org_article_6ad76062b8ab4c35bc8640a882737ed1
proquest_journals_2806519726
gale_infotracacademiconefile_A747442969
crossref_primary_10_3390_computation11040074
PublicationCentury 2000
PublicationDate 2023-04-01
PublicationDateYYYYMMDD 2023-04-01
PublicationDate_xml – month: 04
  year: 2023
  text: 2023-04-01
  day: 01
PublicationDecade 2020
PublicationPlace Basel
PublicationPlace_xml – name: Basel
PublicationTitle Computation
PublicationYear 2023
Publisher MDPI AG
Publisher_xml – name: MDPI AG
References ref_14
ref_13
Gdansky (ref_12) 2018; 31
Colebrook (ref_10) 2019; 276
ref_21
Maksimova (ref_15) 2018; 4
Elbert (ref_9) 2020; 35
Brent (ref_19) 1980; 20
Liu (ref_4) 2023; 273
ref_3
Martynyuk (ref_6) 2017; 12
ref_2
Feng (ref_8) 2023; 132
ref_18
Nasiboglu (ref_11) 2022; 130
ref_17
ref_16
Oliveira (ref_1) 2019; 92
Nesterenko (ref_20) 2010; 6
Confessore (ref_7) 2013; 12
ref_5
References_xml – volume: 130
  start-page: 109674
  year: 2022
  ident: ref_11
  article-title: Dijkstra solution algorithm considering fuzzy accessibility degree for patch optimization problem
  publication-title: Appl. Soft Comput.
  doi: 10.1016/j.asoc.2022.109674
– ident: ref_5
  doi: 10.3390/computation9060067
– ident: ref_3
  doi: 10.3390/computation8040099
– volume: 92
  start-page: 17
  year: 2019
  ident: ref_1
  article-title: The role of simulation and optimization methods in supply chain risk management: Performance and review standpoints
  publication-title: Simul. Model. Pract. Theory
  doi: 10.1016/j.simpat.2018.11.007
– volume: 12
  start-page: 342
  year: 2013
  ident: ref_7
  article-title: A Production and Logistics Network Model with Multimodal and Sustainability Considerations
  publication-title: Proce. CIRP
  doi: 10.1016/j.procir.2013.09.059
– ident: ref_16
  doi: 10.1007/978-3-662-53622-3
– ident: ref_2
  doi: 10.3390/computation9030037
– volume: 273
  start-page: 170405
  year: 2023
  ident: ref_4
  article-title: Design and optimization of logistics distribution route based on improved ant colony algorithm
  publication-title: Optik
  doi: 10.1016/j.ijleo.2022.170405
– volume: 132
  start-page: 128
  year: 2023
  ident: ref_8
  article-title: Multimodal transportation network with cargo containerization technology: Advantages and challenges
  publication-title: Transp. Policy
  doi: 10.1016/j.tranpol.2022.12.006
– volume: 31
  start-page: 260
  year: 2018
  ident: ref_12
  article-title: Exact solution of the problem of finding the minimum acyclic path in weighted graphs containing edges of negative weight
  publication-title: Softw. Prod. Syst.
– ident: ref_13
– ident: ref_14
– volume: 12
  start-page: 15066
  year: 2017
  ident: ref_6
  article-title: Matrix Method of Calculation for Simulation of Distribution Electric Networks of Medium Voltage
  publication-title: Int. J. Appl. Eng. Res. (IJAER)
– ident: ref_17
– volume: 4
  start-page: 117
  year: 2018
  ident: ref_15
  article-title: Comparison of the quality of the results of the “A star” algorithm and its modifications for the road network when choosing a route taking into account the direction of movement at the intersection
  publication-title: Bull. Sci. Sib.
– ident: ref_18
– volume: 6
  start-page: 109
  year: 2010
  ident: ref_20
  article-title: Algorithms for finding cycle lengths in sequences and their applications
  publication-title: Fundam. Appl. Math.
– ident: ref_21
– volume: 20
  start-page: 176
  year: 1980
  ident: ref_19
  article-title: An Improved Monte Carlo Factorization Algorithm
  publication-title: Nord. Tidskr. Inf. Sbehandling (BIT)
– volume: 35
  start-page: 100462
  year: 2020
  ident: ref_9
  article-title: Tactical network planning and design in multimodal transportation–A systematic literature review
  publication-title: Res. Transp. Bus. Manag.
  doi: 10.1016/j.rtbm.2020.100462
– volume: 276
  start-page: 106
  year: 2019
  ident: ref_10
  article-title: A biobjective Dijkstra algorithm
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2019.01.007
SSID ssj0000913820
Score 2.221877
Snippet One of the actual tasks of the contemporary logistics business using the “just in time” supply planning concept, is to distribute manufactured goods among the...
One of the actual tasks of the contemporary logistics business using the "just in time" supply planning concept, is to distribute manufactured goods among the...
SourceID doaj
proquest
gale
crossref
SourceType Open Website
Aggregation Database
Index Database
StartPage 74
SubjectTerms Algorithms
Alliances
Bellman–Ford algorithm
Consumption
Data transmission
Distribution of goods
Electricity distribution
Graph representations
Just in time inventory systems
Logistics
Mathematical programming
Methods
modeling of shortest route search on a graph
multilayer data transmission network
Multilayers
Multimodal transportation systems
Networks
Optimization
optimization of logistics networks
Supply chain management
Visualization
SummonAdditionalLinks – databaseName: Advanced Technologies & Aerospace Database
  dbid: P5Z
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3LbtQwFLWgsIAFpQXEQEFeIAESUSe2E8crNK0YselQCZAqNpaf7YhO0k6mrPkH_rBfwr2OZxASsGGbOLKdE9-Hc30OIS_GzkkrnSqMY64QnKmiUTEWnvHal86AZbRJbELOZs3JiTrOG259Lqtc28RkqH3ncI98P_0BRI2s-u3FZYGqUfh3NUto3CS3kCUBpRuOqy-bPRbkvAQPN5ANccju912SSkhzBr-HmuDiN4eUePv_Zp2Ty5lu_-9g75N7Odikk-Hr2CE3QrtL7h5tmFr7XbKTF3dPX2UG6tcPyNejzmMJUZoB7SKFByie5FmY9vr7jykkrHRyfgo9rs4WFMJeOp2n0zGp4QewQgvoFouNAp23NB3yPTcQ3NPZUHVOPyba2ivI9R-Sz9N3nw7fF1mVoXBcylURuTelg5g8ln5cR-ErW9YsGCshNPFOCeYRfd8A-IxFZiBDjBX3YEmiQrKdR2Sr7drwmFBpbAhCKC6kEVLGRlV2DAGb4MEHx9mIvFlDoy8G8g0NSQsiqf-A5IgcIHybpsicnS50y1OdF6KujZeQtDHbGCscr6xrajE2kGhILoMvR-Qlgq9xfa-Wxpl8TAFGjExZegL5lwAnXqsR2VuDr_PC7_Uv5J_8-_ZTcgeV64cioD2yBa89PCO33bfVvF8-T9_xT7Az_8Y
  priority: 102
  providerName: ProQuest
Title Modification of the Bellman–Ford Algorithm for Finding the Optimal Route in Multilayer Network Structures
URI https://www.proquest.com/docview/2806519726
https://doaj.org/article/6ad76062b8ab4c35bc8640a882737ed1
Volume 11
WOSCitedRecordID wos000977304100001&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: 2079-3197
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913820
  issn: 2079-3197
  databaseCode: DOA
  dateStart: 20130101
  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: 2079-3197
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913820
  issn: 2079-3197
  databaseCode: M~E
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 2079-3197
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913820
  issn: 2079-3197
  databaseCode: K7-
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest advanced technologies & aerospace journals
  customDbUrl:
  eissn: 2079-3197
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913820
  issn: 2079-3197
  databaseCode: P5Z
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2079-3197
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913820
  issn: 2079-3197
  databaseCode: BENPR
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 2079-3197
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913820
  issn: 2079-3197
  databaseCode: PIMPY
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NbtQwEB6hlgMcqraA2FIqH5AAiahZ24nj47baVatql4gfqXCx_AurdrPV7tJjxTvwhjxJx05aFYmKCxcfEkdxPOOZ-ZSZbwBe5dYKI6zMtKU244zKrJIhZI6y0vWtRstoUrMJMZlUp6eyvtPqK-aEtfTA7cbtl9oJDLKpqbThlhXGViXPNQaGggnvEvDJhbwDppINlpFbL29phhji-n2bmiSkr0WPF7uB8z9cUWLsv88uJ2cz2oSNLkokg3Z1W_DAN9vweHxLsbrchq3uVC7Jm446-u0TOBvPXcz9SQsg80DwARJLcGa6-f3z1wiRJhmcf5svpqvvM4LxKhlNU1lLmvgezccMXxuzhDyZNiRV555rjMrJpE0XJx8T3-wPBOlP4fNo-OnwKOvaKWSWCbHKAnO6bzGYDn2Xl4G7wvRL6rURGFM4Kzl1UWyuQqlRGqhGaBcK5tAEBBlZcp7BWjNv_HMgQhvvOZeMC82FCJUsTI6RFmfeectoD97d7Ky6aFkzFKKNKAj1F0H04CDu_u3USHmdLqAiqE4R1L8UoQevo-xUPJirhba6qy_AFUeKKzVA4MTR-5ayB7s34lXdiV2q9Ic59mArd_7Hal7Ao9iYvs3x2YU1FI5_CQ_t5Wq6XOzB-sFwUn_YS0qL44nIcBxfDXGsi694vz4e11-uAfo795k
linkProvider Directory of Open Access Journals
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LbhMxFL0qBQlYAC0gAgW8AAFSR52xnfF4gVB4RK3SBCSK1J3x-FEimkzJBBA7_oH_4KP4Eq49M0FIwK4LtvP04_g-7HvPBbiXGiNKYWSiDTUJZ1QmhfQ-sZTlNjMaJWMZi02IyaQ4PJSv1uB7lwsTwio7mRgFta1M2CPfiSeAoUZW_uTkQxKqRoXT1a6ERgOLkfvyGV22-vHec5zf-5QOXxw8203aqgKJYUIsE8-szgzalD6zae657ZdZTp0uBapWaySnNrTeFth4Sj3V6OH4PrO4ErwMZDH43TNwlrNChHU1EslqTydwbKJGbciNGJPpjomlGeIYo54NNcj5bwow1gn4mzaIKm54-X8bnCtwqTWmyaBB_wasufkmXByvmGjrTdhohVdNHrYM24-uwvtxZUOIVBwxUnmCL5CQqTTT8x9fvw2xA2RwfIQ9XL6bETTryXAas3_igy9Rys7wtyGYypHpnMQk5mONzguZNFH15HWk5f24cPU1eHMqQ3Ad1ufV3N0AInTpHOeScaG5EL6Q_TJFg5QzZ51htAfbHRTUSUMuotApC8hRf0BOD54GuKweDczg8UK1OFKtoFG5tgKdUloWuuSG9UtT5DzV6EgJJpzNevAggE0F-bVcaKPbNAxscWACUwP0LzkaKbnswVYHNtUKtlr9QtrNf9--C-d3D8b7an9vMroFFyjahk3A0xas4xS423DOfFpO68WduIYIvD1tXP4EdpBclg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NbtQwEB6VghAcgBYQCwV8AAES0Sa2EycHhBZKRFW6rARIVS_G8U9Z0c2WzQLixjvwNjwOT8LYSRYhAbceuCbOj-3P82PPfANwJ9ZaVEIXkdJUR5zRIsoL5yJDWWYSrVAyVqHYhBiP8_39YrIG3_tcGB9W2cvEIKjNXPs98mE4AfQ1srKh68IiJtvl4-MPka8g5U9a-3IaLUR27ZfP6L41j3a2ca7vUlo-e_30edRVGIg0E2IZOWZUotG-dImJM8dNWiUZtaoSqGaNLjg1vicmx45Q6qhCb8elzOCqcIUnjsH3noLTAn1MH044SQ9W-zuebxO1a0t0xFgRD3Uo0xDGG3Wur0fOf1OGoWbA3zRDUHflxf95oC7Bhc7IJqN2VWzAmq034fzeiqG22YSNTqg15H7HvP3gMrzfmxsfOhVGj8wdwQeIz2CaqfrH128ldoCMjg6xh8t3M4LmPimnISsoNHyJ0neGn_VBVpZMaxKSm48UOjVk3Ebbk1eBrvfjwjZX4M2JDMFVWK_ntb0GRKjKWs4LxoXiQri8SKsYDVXOrLGa0QE87GEhj1vSEYnOmkeR_AOKBvDEQ2fV1DOGhwvzxaHsBJDMlBHorNIqVxXXLK10nvFYoYMlmLAmGcA9Dzzp5dpyobTq0jPwjz1DmByh38nReMmKAWz1wJOdwGvkL9Rd__ft23AW4Shf7Ix3b8A5iiZjGwe1Bes4A_YmnNGfltNmcSssJwJvTxqWPwEDm2W6
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=Modification+of+the+Bellman%E2%80%93Ford+Algorithm+for+Finding+the+Optimal+Route+in+Multilayer+Network+Structures&rft.jtitle=Computation&rft.au=Timofeeva%2C+Olga&rft.au=Sannikov%2C+Alexey&rft.au=Stepanenko%2C+Maria&rft.au=Balashova%2C+Tatiana&rft.date=2023-04-01&rft.issn=2079-3197&rft.eissn=2079-3197&rft.volume=11&rft.issue=4&rft.spage=74&rft_id=info:doi/10.3390%2Fcomputation11040074&rft.externalDBID=n%2Fa&rft.externalDocID=10_3390_computation11040074
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2079-3197&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2079-3197&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2079-3197&client=summon