An Improved Discrete Jaya Algorithm for Shortest Path Problems in Transportation-Related Processes
An Improved Discrete Jaya Algorithm for Shortest Path Problems in Transportation-Related Processes
About this item
Full title
Author / Creator
Publisher
Basel: MDPI AG
Journal title
Language
English
Formats
Publication information
Publisher
Basel: MDPI AG
Subjects
More information
Scope and Contents
Contents
Shortest path problems are encountered in many engineering applications, e.g., intelligent transportation, robot path planning, and smart logistics. The environmental changes as sensed and transmitted via the Internet of Things make the shortest path change frequently, thus posing ever-increasing difficulty for traditional methods to meet the real-...
Alternative Titles
Full title
An Improved Discrete Jaya Algorithm for Shortest Path Problems in Transportation-Related Processes
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2857449011
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2857449011
Other Identifiers
ISSN
2227-9717
E-ISSN
2227-9717
DOI
10.3390/pr11082447
