An Improved Discrete Jaya Algorithm for Shortest Path Problems in Transportation-Related Processes Article Swipe

PDF

Ren Wang , MengChu Zhou , Jinglin Wang , Kaizhou Gao ·

YOU? · · 2023 · Open Access · · DOI: https://doi.org/10.3390/pr11082447

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-time requirements of many applications. Therefore, developing more efficient solutions has become particularly important. This paper presents an improved discrete Jaya algorithm (IDJaya) to solve the shortest path problem. A local search operation is applied to expand the scope of solution exploration and improve solution quality. The time complexity of IDJaya is analyzed. Experiments are carried out on seven real road networks and dense graphs in transportation-related processes. IDJaya is compared with the Dijkstra and ant colony optimization (ACO) algorithms. The results verify the superiority of the IDJaya over its peers. It can thus be well utilized to meet real-time application requirements.

Related Topics

Dijkstra's Algorithm

Computer Science

Ant Colony Optimization Algorithms

Algorithm

Robot

Artificial Intelligence

Mathematics

Theoretical Computer Science

Programming Language

Concepts

Shortest path problem Dijkstra's algorithm Computer science Ant colony optimization algorithms Path (computing) K shortest path routing Constrained Shortest Path First Scope (computer science) Motion planning Mathematical optimization Yen's algorithm Algorithm A* search algorithm Robot Artificial intelligence Mathematics Graph Theoretical computer science Computer network Programming language

Metadata

Type: article
Language: en
Landing Page: https://doi.org/10.3390/pr11082447
PDF: https://www.mdpi.com/2227-9717/11/8/2447/pdf?version=1692012730
OA Status: gold
Cited By: 12
References: 94
Related Works: 10
OpenAlex ID: https://openalex.org/W4385805395

All OpenAlex metadata

Raw OpenAlex JSON

OpenAlex ID: https://openalex.org/W4385805395

Canonical identifier for this work in OpenAlex
DOI: https://doi.org/10.3390/pr11082447

Digital Object Identifier
Title: An Improved Discrete Jaya Algorithm for Shortest Path Problems in Transportation-Related Processes

Work title
Type: article

OpenAlex work type
Language: en

Primary language
Publication year: 2023

Year of publication
Publication date: 2023-08-14

Full publication date if available
Authors: Ren Wang, MengChu Zhou, Jinglin Wang, Kaizhou Gao

List of authors in order
Landing page: https://doi.org/10.3390/pr11082447

Publisher landing page
PDF URL: https://www.mdpi.com/2227-9717/11/8/2447/pdf?version=1692012730

Direct link to full text PDF
Open access: Yes

Whether a free full text is available
OA status: gold

Open access status per OpenAlex
OA URL: https://www.mdpi.com/2227-9717/11/8/2447/pdf?version=1692012730

Direct OA link when available
Concepts: Shortest path problem, Dijkstra's algorithm, Computer science, Ant colony optimization algorithms, Path (computing), K shortest path routing, Constrained Shortest Path First, Scope (computer science), Motion planning, Mathematical optimization, Yen's algorithm, Algorithm, A* search algorithm, Robot, Artificial intelligence, Mathematics, Graph, Theoretical computer science, Computer network, Programming language

Top concepts (fields/topics) attached by OpenAlex
Cited by: 12

Total citation count in OpenAlex
Citations by year (recent): 2025: 7, 2024: 5

Per-year citation counts (last 5 years)
References (count): 94

Number of works referenced by this work
Related works (count): 10

Other works algorithmically related by OpenAlex

Full payload

id	https://openalex.org/W4385805395
doi	https://doi.org/10.3390/pr11082447
ids.doi	https://doi.org/10.3390/pr11082447
ids.openalex	https://openalex.org/W4385805395
fwci	3.22121994
type	article
title	An Improved Discrete Jaya Algorithm for Shortest Path Problems in Transportation-Related Processes
biblio.issue	8
biblio.volume	11
biblio.last_page	2447
biblio.first_page	2447
topics[0].id	https://openalex.org/T11106
topics[0].field.id	https://openalex.org/fields/17
topics[0].field.display_name	Computer Science
topics[0].score	0.9944999814033508
topics[0].domain.id	https://openalex.org/domains/3
topics[0].domain.display_name	Physical Sciences
topics[0].subfield.id	https://openalex.org/subfields/1711
topics[0].subfield.display_name	Signal Processing
topics[0].display_name	Data Management and Algorithms
topics[1].id	https://openalex.org/T11344
topics[1].field.id	https://openalex.org/fields/22
topics[1].field.display_name	Engineering
topics[1].score	0.9825999736785889
topics[1].domain.id	https://openalex.org/domains/3
topics[1].domain.display_name	Physical Sciences
topics[1].subfield.id	https://openalex.org/subfields/2215
topics[1].subfield.display_name	Building and Construction
topics[1].display_name	Traffic Prediction and Management Techniques
topics[2].id	https://openalex.org/T12546
topics[2].field.id	https://openalex.org/fields/22
topics[2].field.display_name	Engineering
topics[2].score	0.9761000275611877
topics[2].domain.id	https://openalex.org/domains/3
topics[2].domain.display_name	Physical Sciences
topics[2].subfield.id	https://openalex.org/subfields/2215
topics[2].subfield.display_name	Building and Construction
topics[2].display_name	Smart Parking Systems Research
is_xpac	False
apc_list.value	2000
apc_list.currency	CHF
apc_list.value_usd	2165
apc_paid.value	2000
apc_paid.currency	CHF
apc_paid.value_usd	2165
concepts[0].id	https://openalex.org/C22590252
concepts[0].level	3
concepts[0].score	0.7929694652557373
concepts[0].wikidata	https://www.wikidata.org/wiki/Q1058754
concepts[0].display_name	Shortest path problem
concepts[1].id	https://openalex.org/C173870130
concepts[1].level	4
concepts[1].score	0.700925350189209
concepts[1].wikidata	https://www.wikidata.org/wiki/Q8548
concepts[1].display_name	Dijkstra's algorithm
concepts[2].id	https://openalex.org/C41008148
concepts[2].level	0
concepts[2].score	0.6530361175537109
concepts[2].wikidata	https://www.wikidata.org/wiki/Q21198
concepts[2].display_name	Computer science
concepts[3].id	https://openalex.org/C40128228
concepts[3].level	2
concepts[3].score	0.6103357672691345
concepts[3].wikidata	https://www.wikidata.org/wiki/Q460851
concepts[3].display_name	Ant colony optimization algorithms
concepts[4].id	https://openalex.org/C2777735758
concepts[4].level	2
concepts[4].score	0.56731116771698
concepts[4].wikidata	https://www.wikidata.org/wiki/Q817765
concepts[4].display_name	Path (computing)
concepts[5].id	https://openalex.org/C70266271
concepts[5].level	4
concepts[5].score	0.5627927780151367
concepts[5].wikidata	https://www.wikidata.org/wiki/Q6343044
concepts[5].display_name	K shortest path routing
concepts[6].id	https://openalex.org/C178067994
concepts[6].level	5
concepts[6].score	0.528185248374939
concepts[6].wikidata	https://www.wikidata.org/wiki/Q1128278
concepts[6].display_name	Constrained Shortest Path First
concepts[7].id	https://openalex.org/C2778012447
concepts[7].level	2
concepts[7].score	0.5239943265914917
concepts[7].wikidata	https://www.wikidata.org/wiki/Q1034415
concepts[7].display_name	Scope (computer science)
concepts[8].id	https://openalex.org/C81074085
concepts[8].level	3
concepts[8].score	0.46017518639564514
concepts[8].wikidata	https://www.wikidata.org/wiki/Q366872
concepts[8].display_name	Motion planning
concepts[9].id	https://openalex.org/C126255220
concepts[9].level	1
concepts[9].score	0.45694100856781006
concepts[9].wikidata	https://www.wikidata.org/wiki/Q141495
concepts[9].display_name	Mathematical optimization
concepts[10].id	https://openalex.org/C119971455
concepts[10].level	5
concepts[10].score	0.4537612795829773
concepts[10].wikidata	https://www.wikidata.org/wiki/Q8052172
concepts[10].display_name	Yen's algorithm
concepts[11].id	https://openalex.org/C11413529
concepts[11].level	1
concepts[11].score	0.448543518781662
concepts[11].wikidata	https://www.wikidata.org/wiki/Q8366
concepts[11].display_name	Algorithm
concepts[12].id	https://openalex.org/C103578098
concepts[12].level	2
concepts[12].score	0.4252033531665802
concepts[12].wikidata	https://www.wikidata.org/wiki/Q277680
concepts[12].display_name	A* search algorithm
concepts[13].id	https://openalex.org/C90509273
concepts[13].level	2
concepts[13].score	0.2967243194580078
concepts[13].wikidata	https://www.wikidata.org/wiki/Q11012
concepts[13].display_name	Robot
concepts[14].id	https://openalex.org/C154945302
concepts[14].level	1
concepts[14].score	0.19198942184448242
concepts[14].wikidata	https://www.wikidata.org/wiki/Q11660
concepts[14].display_name	Artificial intelligence
concepts[15].id	https://openalex.org/C33923547
concepts[15].level	0
concepts[15].score	0.18058976531028748
concepts[15].wikidata	https://www.wikidata.org/wiki/Q395
concepts[15].display_name	Mathematics
concepts[16].id	https://openalex.org/C132525143
concepts[16].level	2
concepts[16].score	0.14000612497329712
concepts[16].wikidata	https://www.wikidata.org/wiki/Q141488
concepts[16].display_name	Graph
concepts[17].id	https://openalex.org/C80444323
concepts[17].level	1
concepts[17].score	0.11863783001899719
concepts[17].wikidata	https://www.wikidata.org/wiki/Q2878974
concepts[17].display_name	Theoretical computer science
concepts[18].id	https://openalex.org/C31258907
concepts[18].level	1
concepts[18].score	0.1166970431804657
concepts[18].wikidata	https://www.wikidata.org/wiki/Q1301371
concepts[18].display_name	Computer network
concepts[19].id	https://openalex.org/C199360897
concepts[19].level	1
concepts[19].score	0.0
concepts[19].wikidata	https://www.wikidata.org/wiki/Q9143
concepts[19].display_name	Programming language
keywords[0].id	https://openalex.org/keywords/shortest-path-problem
keywords[0].score	0.7929694652557373
keywords[0].display_name	Shortest path problem
keywords[1].id	https://openalex.org/keywords/dijkstras-algorithm
keywords[1].score	0.700925350189209
keywords[1].display_name	Dijkstra's algorithm
keywords[2].id	https://openalex.org/keywords/computer-science
keywords[2].score	0.6530361175537109
keywords[2].display_name	Computer science
keywords[3].id	https://openalex.org/keywords/ant-colony-optimization-algorithms
keywords[3].score	0.6103357672691345
keywords[3].display_name	Ant colony optimization algorithms
keywords[4].id	https://openalex.org/keywords/path
keywords[4].score	0.56731116771698
keywords[4].display_name	Path (computing)
keywords[5].id	https://openalex.org/keywords/k-shortest-path-routing
keywords[5].score	0.5627927780151367
keywords[5].display_name	K shortest path routing
keywords[6].id	https://openalex.org/keywords/constrained-shortest-path-first
keywords[6].score	0.528185248374939
keywords[6].display_name	Constrained Shortest Path First
keywords[7].id	https://openalex.org/keywords/scope
keywords[7].score	0.5239943265914917
keywords[7].display_name	Scope (computer science)
keywords[8].id	https://openalex.org/keywords/motion-planning
keywords[8].score	0.46017518639564514
keywords[8].display_name	Motion planning
keywords[9].id	https://openalex.org/keywords/mathematical-optimization
keywords[9].score	0.45694100856781006
keywords[9].display_name	Mathematical optimization
keywords[10].id	https://openalex.org/keywords/yens-algorithm
keywords[10].score	0.4537612795829773
keywords[10].display_name	Yen's algorithm
keywords[11].id	https://openalex.org/keywords/algorithm
keywords[11].score	0.448543518781662
keywords[11].display_name	Algorithm
keywords[12].id	https://openalex.org/keywords/a*-search-algorithm
keywords[12].score	0.4252033531665802
keywords[12].display_name	A* search algorithm
keywords[13].id	https://openalex.org/keywords/robot
keywords[13].score	0.2967243194580078
keywords[13].display_name	Robot
keywords[14].id	https://openalex.org/keywords/artificial-intelligence
keywords[14].score	0.19198942184448242
keywords[14].display_name	Artificial intelligence
keywords[15].id	https://openalex.org/keywords/mathematics
keywords[15].score	0.18058976531028748
keywords[15].display_name	Mathematics
keywords[16].id	https://openalex.org/keywords/graph
keywords[16].score	0.14000612497329712
keywords[16].display_name	Graph
keywords[17].id	https://openalex.org/keywords/theoretical-computer-science
keywords[17].score	0.11863783001899719
keywords[17].display_name	Theoretical computer science
keywords[18].id	https://openalex.org/keywords/computer-network
keywords[18].score	0.1166970431804657
keywords[18].display_name	Computer network
language	en
locations[0].id	doi:10.3390/pr11082447
locations[0].is_oa	True
locations[0].source.id	https://openalex.org/S4210201879
locations[0].source.issn	2227-9717
locations[0].source.type	journal
locations[0].source.is_oa	True
locations[0].source.issn_l	2227-9717
locations[0].source.is_core	True
locations[0].source.is_in_doaj	False
locations[0].source.display_name	Processes
locations[0].source.host_organization	https://openalex.org/P4310310987
locations[0].source.host_organization_name	Multidisciplinary Digital Publishing Institute
locations[0].source.host_organization_lineage	https://openalex.org/P4310310987
locations[0].source.host_organization_lineage_names	Multidisciplinary Digital Publishing Institute
locations[0].license	cc-by
locations[0].pdf_url	https://www.mdpi.com/2227-9717/11/8/2447/pdf?version=1692012730
locations[0].version	publishedVersion
locations[0].raw_type	journal-article
locations[0].license_id	https://openalex.org/licenses/cc-by
locations[0].is_accepted	True
locations[0].is_published	True
locations[0].raw_source_name	Processes
locations[0].landing_page_url	https://doi.org/10.3390/pr11082447
locations[1].id	pmh:oai:mdpi.com:/2227-9717/11/8/2447/
locations[1].is_oa	True
locations[1].source.id	https://openalex.org/S4306400947
locations[1].source.issn
locations[1].source.type	repository
locations[1].source.is_oa	True
locations[1].source.issn_l
locations[1].source.is_core	False
locations[1].source.is_in_doaj	False
locations[1].source.display_name	MDPI (MDPI AG)
locations[1].source.host_organization	https://openalex.org/I4210097602
locations[1].source.host_organization_name	Multidisciplinary Digital Publishing Institute (Switzerland)
locations[1].source.host_organization_lineage	https://openalex.org/I4210097602
locations[1].license	cc-by
locations[1].pdf_url
locations[1].version	submittedVersion
locations[1].raw_type	Text
locations[1].license_id	https://openalex.org/licenses/cc-by
locations[1].is_accepted	False
locations[1].is_published	False
locations[1].raw_source_name	Processes; Volume 11; Issue 8; Pages: 2447
locations[1].landing_page_url	https://dx.doi.org/10.3390/pr11082447
indexed_in	crossref
authorships[0].author.id	https://openalex.org/A5100339138
authorships[0].author.orcid	https://orcid.org/0000-0002-6366-8898
authorships[0].author.display_name	Ren Wang
authorships[0].countries	MO
authorships[0].affiliations[0].institution_ids	https://openalex.org/I111950717
authorships[0].affiliations[0].raw_affiliation_string	The Institute of Systems Engineering, Macau University of Science and Technology, Macau 999078, China
authorships[0].institutions[0].id	https://openalex.org/I111950717
authorships[0].institutions[0].ror	https://ror.org/03jqs2n27
authorships[0].institutions[0].type	education
authorships[0].institutions[0].lineage	https://openalex.org/I111950717, https://openalex.org/I4391767947
authorships[0].institutions[0].country_code	MO
authorships[0].institutions[0].display_name	Macau University of Science and Technology
authorships[0].author_position	first
authorships[0].raw_author_name	Ren Wang
authorships[0].is_corresponding	False
authorships[0].raw_affiliation_strings	The Institute of Systems Engineering, Macau University of Science and Technology, Macau 999078, China
authorships[1].author.id	https://openalex.org/A5081318069
authorships[1].author.orcid	https://orcid.org/0000-0002-5408-8752
authorships[1].author.display_name	MengChu Zhou
authorships[1].countries	MO, US
authorships[1].affiliations[0].institution_ids	https://openalex.org/I111950717
authorships[1].affiliations[0].raw_affiliation_string	The Institute of Systems Engineering, Macau University of Science and Technology, Macau 999078, China
authorships[1].affiliations[1].institution_ids	https://openalex.org/I118118575
authorships[1].affiliations[1].raw_affiliation_string	Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ 07102, USA
authorships[1].institutions[0].id	https://openalex.org/I111950717
authorships[1].institutions[0].ror	https://ror.org/03jqs2n27
authorships[1].institutions[0].type	education
authorships[1].institutions[0].lineage	https://openalex.org/I111950717, https://openalex.org/I4391767947
authorships[1].institutions[0].country_code	MO
authorships[1].institutions[0].display_name	Macau University of Science and Technology
authorships[1].institutions[1].id	https://openalex.org/I118118575
authorships[1].institutions[1].ror	https://ror.org/05e74xb87
authorships[1].institutions[1].type	education
authorships[1].institutions[1].lineage	https://openalex.org/I118118575
authorships[1].institutions[1].country_code	US
authorships[1].institutions[1].display_name	New Jersey Institute of Technology
authorships[1].author_position	middle
authorships[1].raw_author_name	Mengchu Zhou
authorships[1].is_corresponding	True
authorships[1].raw_affiliation_strings	Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ 07102, USA, The Institute of Systems Engineering, Macau University of Science and Technology, Macau 999078, China
authorships[2].author.id	https://openalex.org/A5115590325
authorships[2].author.orcid
authorships[2].author.display_name	Jinglin Wang
authorships[2].countries	MO
authorships[2].affiliations[0].institution_ids	https://openalex.org/I111950717
authorships[2].affiliations[0].raw_affiliation_string	The Institute of Systems Engineering, Macau University of Science and Technology, Macau 999078, China
authorships[2].institutions[0].id	https://openalex.org/I111950717
authorships[2].institutions[0].ror	https://ror.org/03jqs2n27
authorships[2].institutions[0].type	education
authorships[2].institutions[0].lineage	https://openalex.org/I111950717, https://openalex.org/I4391767947
authorships[2].institutions[0].country_code	MO
authorships[2].institutions[0].display_name	Macau University of Science and Technology
authorships[2].author_position	middle
authorships[2].raw_author_name	Jinglin Wang
authorships[2].is_corresponding	False
authorships[2].raw_affiliation_strings	The Institute of Systems Engineering, Macau University of Science and Technology, Macau 999078, China
authorships[3].author.id	https://openalex.org/A5082236615
authorships[3].author.orcid	https://orcid.org/0000-0002-9252-6928
authorships[3].author.display_name	Kaizhou Gao
authorships[3].countries	MO
authorships[3].affiliations[0].institution_ids	https://openalex.org/I111950717
authorships[3].affiliations[0].raw_affiliation_string	The Institute of Systems Engineering, Macau University of Science and Technology, Macau 999078, China
authorships[3].institutions[0].id	https://openalex.org/I111950717
authorships[3].institutions[0].ror	https://ror.org/03jqs2n27
authorships[3].institutions[0].type	education
authorships[3].institutions[0].lineage	https://openalex.org/I111950717, https://openalex.org/I4391767947
authorships[3].institutions[0].country_code	MO
authorships[3].institutions[0].display_name	Macau University of Science and Technology
authorships[3].author_position	last
authorships[3].raw_author_name	Kaizhou Gao
authorships[3].is_corresponding	False
authorships[3].raw_affiliation_strings	The Institute of Systems Engineering, Macau University of Science and Technology, Macau 999078, China
has_content.pdf	True
has_content.grobid_xml	True
is_paratext	False
open_access.is_oa	True
open_access.oa_url	https://www.mdpi.com/2227-9717/11/8/2447/pdf?version=1692012730
open_access.oa_status	gold
open_access.any_repository_has_fulltext	False
created_date	2025-10-10T00:00:00
display_name	An Improved Discrete Jaya Algorithm for Shortest Path Problems in Transportation-Related Processes
has_fulltext	True
is_retracted	False
updated_date	2025-11-06T03:46:38.306776
primary_topic.id	https://openalex.org/T11106
primary_topic.field.id	https://openalex.org/fields/17
primary_topic.field.display_name	Computer Science
primary_topic.score	0.9944999814033508
primary_topic.domain.id	https://openalex.org/domains/3
primary_topic.domain.display_name	Physical Sciences
primary_topic.subfield.id	https://openalex.org/subfields/1711
primary_topic.subfield.display_name	Signal Processing
primary_topic.display_name	Data Management and Algorithms
related_works	https://openalex.org/W4281943708, https://openalex.org/W2381419702, https://openalex.org/W1562631103, https://openalex.org/W3205035283, https://openalex.org/W2810620529, https://openalex.org/W4253588386, https://openalex.org/W2170980056, https://openalex.org/W2367161887, https://openalex.org/W1508906807, https://openalex.org/W4310124294
cited_by_count	12
counts_by_year[0].year	2025
counts_by_year[0].cited_by_count	7
counts_by_year[1].year	2024
counts_by_year[1].cited_by_count	5
locations_count	2
best_oa_location.id	doi:10.3390/pr11082447
best_oa_location.is_oa	True
best_oa_location.source.id	https://openalex.org/S4210201879
best_oa_location.source.issn	2227-9717
best_oa_location.source.type	journal
best_oa_location.source.is_oa	True
best_oa_location.source.issn_l	2227-9717
best_oa_location.source.is_core	True
best_oa_location.source.is_in_doaj	False
best_oa_location.source.display_name	Processes
best_oa_location.source.host_organization	https://openalex.org/P4310310987
best_oa_location.source.host_organization_name	Multidisciplinary Digital Publishing Institute
best_oa_location.source.host_organization_lineage	https://openalex.org/P4310310987
best_oa_location.source.host_organization_lineage_names	Multidisciplinary Digital Publishing Institute
best_oa_location.license	cc-by
best_oa_location.pdf_url	https://www.mdpi.com/2227-9717/11/8/2447/pdf?version=1692012730
best_oa_location.version	publishedVersion
best_oa_location.raw_type	journal-article
best_oa_location.license_id	https://openalex.org/licenses/cc-by
best_oa_location.is_accepted	True
best_oa_location.is_published	True
best_oa_location.raw_source_name	Processes
best_oa_location.landing_page_url	https://doi.org/10.3390/pr11082447
primary_location.id	doi:10.3390/pr11082447
primary_location.is_oa	True
primary_location.source.id	https://openalex.org/S4210201879
primary_location.source.issn	2227-9717
primary_location.source.type	journal
primary_location.source.is_oa	True
primary_location.source.issn_l	2227-9717
primary_location.source.is_core	True
primary_location.source.is_in_doaj	False
primary_location.source.display_name	Processes
primary_location.source.host_organization	https://openalex.org/P4310310987
primary_location.source.host_organization_name	Multidisciplinary Digital Publishing Institute
primary_location.source.host_organization_lineage	https://openalex.org/P4310310987
primary_location.source.host_organization_lineage_names	Multidisciplinary Digital Publishing Institute
primary_location.license	cc-by
primary_location.pdf_url	https://www.mdpi.com/2227-9717/11/8/2447/pdf?version=1692012730
primary_location.version	publishedVersion
primary_location.raw_type	journal-article
primary_location.license_id	https://openalex.org/licenses/cc-by
primary_location.is_accepted	True
primary_location.is_published	True
primary_location.raw_source_name	Processes
primary_location.landing_page_url	https://doi.org/10.3390/pr11082447
publication_date	2023-08-14
publication_year	2023
referenced_works	https://openalex.org/W3013212367, https://openalex.org/W3088693554, https://openalex.org/W4200173886, https://openalex.org/W2000263957, https://openalex.org/W3203720427, https://openalex.org/W3211049872, https://openalex.org/W3120527049, https://openalex.org/W2916156896, https://openalex.org/W3010840629, https://openalex.org/W3199732739, https://openalex.org/W4306761563, https://openalex.org/W4283030598, https://openalex.org/W4292877317, https://openalex.org/W4377115715, https://openalex.org/W3216230839, https://openalex.org/W2169528473, https://openalex.org/W3125609744, https://openalex.org/W2573366627, https://openalex.org/W2007572995, https://openalex.org/W4200172719, https://openalex.org/W2144050074, https://openalex.org/W1969483458, https://openalex.org/W3140133525, https://openalex.org/W2066918959, https://openalex.org/W2078360283, https://openalex.org/W1875225138, https://openalex.org/W6704128608, https://openalex.org/W2359757004, https://openalex.org/W2769480762, https://openalex.org/W2811421397, https://openalex.org/W3023430306, https://openalex.org/W3111349382, https://openalex.org/W2770729327, https://openalex.org/W2423456227, https://openalex.org/W2497712405, https://openalex.org/W3007423657, https://openalex.org/W2061594663, https://openalex.org/W3176609373, https://openalex.org/W3108383633, https://openalex.org/W2902320472, https://openalex.org/W2513738642, https://openalex.org/W1990362808, https://openalex.org/W1980349963, https://openalex.org/W2963554715, https://openalex.org/W2887817292, https://openalex.org/W2793185916, https://openalex.org/W2806207758, https://openalex.org/W2928616111, https://openalex.org/W2996176795, https://openalex.org/W2981472119, https://openalex.org/W2945963656, https://openalex.org/W2971981774, https://openalex.org/W3056066159, https://openalex.org/W2999769892, https://openalex.org/W3125146262, https://openalex.org/W2735290765, https://openalex.org/W2585986822, https://openalex.org/W6637189487, https://openalex.org/W3097270832, https://openalex.org/W3192089976, https://openalex.org/W3134877819, https://openalex.org/W3092528380, https://openalex.org/W3066927900, https://openalex.org/W2801016318, https://openalex.org/W2900019936, https://openalex.org/W3126352999, https://openalex.org/W2789305192, https://openalex.org/W3098363382, https://openalex.org/W4378697418, https://openalex.org/W3199469541, https://openalex.org/W3208628878, https://openalex.org/W4212996555, https://openalex.org/W3204625264, https://openalex.org/W4312393609, https://openalex.org/W4312547706, https://openalex.org/W4364322993, https://openalex.org/W4294310652, https://openalex.org/W4321484099, https://openalex.org/W4312266567, https://openalex.org/W4313331239, https://openalex.org/W4322730947, https://openalex.org/W4378804809, https://openalex.org/W4214813201, https://openalex.org/W2160999345, https://openalex.org/W4206111419, https://openalex.org/W2946231253, https://openalex.org/W4308436316, https://openalex.org/W3042732884, https://openalex.org/W4320005669, https://openalex.org/W4285132117, https://openalex.org/W4312835354, https://openalex.org/W4229457263, https://openalex.org/W2344729295, https://openalex.org/W1698059316
referenced_works_count	94
abstract_inverted_index.A	75
abstract_inverted_index.It	137
abstract_inverted_index.an	63
abstract_inverted_index.as	21
abstract_inverted_index.be	140
abstract_inverted_index.in	5, 111
abstract_inverted_index.is	79, 97, 115
abstract_inverted_index.of	28, 48, 85, 95, 131
abstract_inverted_index.on	103
abstract_inverted_index.to	43, 69, 81, 143
abstract_inverted_index.The	18, 92, 126
abstract_inverted_index.and	15, 23, 88, 108, 120
abstract_inverted_index.ant	121
abstract_inverted_index.are	3, 100
abstract_inverted_index.can	138
abstract_inverted_index.for	40
abstract_inverted_index.has	56
abstract_inverted_index.its	135
abstract_inverted_index.out	102
abstract_inverted_index.the	26, 31, 45, 71, 83, 118, 129, 132
abstract_inverted_index.via	25
abstract_inverted_index.Jaya	66
abstract_inverted_index.This	60
abstract_inverted_index.make	30
abstract_inverted_index.many	6, 49
abstract_inverted_index.meet	44, 144
abstract_inverted_index.more	53
abstract_inverted_index.over	134
abstract_inverted_index.path	1, 13, 33, 73
abstract_inverted_index.real	105
abstract_inverted_index.road	106
abstract_inverted_index.thus	36, 139
abstract_inverted_index.time	93
abstract_inverted_index.well	141
abstract_inverted_index.with	117
abstract_inverted_index.(ACO)	124
abstract_inverted_index.dense	109
abstract_inverted_index.e.g.,	9
abstract_inverted_index.local	76
abstract_inverted_index.paper	61
abstract_inverted_index.robot	12
abstract_inverted_index.scope	84
abstract_inverted_index.seven	104
abstract_inverted_index.smart	16
abstract_inverted_index.solve	70
abstract_inverted_index.IDJaya	96, 114, 133
abstract_inverted_index.Things	29
abstract_inverted_index.become	57
abstract_inverted_index.change	34
abstract_inverted_index.colony	122
abstract_inverted_index.expand	82
abstract_inverted_index.graphs	110
abstract_inverted_index.peers.	136
abstract_inverted_index.posing	37
abstract_inverted_index.search	77
abstract_inverted_index.sensed	22
abstract_inverted_index.verify	128
abstract_inverted_index.applied	80
abstract_inverted_index.carried	101
abstract_inverted_index.changes	20
abstract_inverted_index.improve	89
abstract_inverted_index.methods	42
abstract_inverted_index.results	127
abstract_inverted_index.(IDJaya)	68
abstract_inverted_index.Dijkstra	119
abstract_inverted_index.Internet	27
abstract_inverted_index.Shortest	0
abstract_inverted_index.compared	116
abstract_inverted_index.discrete	65
abstract_inverted_index.improved	64
abstract_inverted_index.networks	107
abstract_inverted_index.presents	62
abstract_inverted_index.problem.	74
abstract_inverted_index.problems	2
abstract_inverted_index.quality.	91
abstract_inverted_index.shortest	32, 72
abstract_inverted_index.solution	86, 90
abstract_inverted_index.utilized	142
abstract_inverted_index.algorithm	67
abstract_inverted_index.analyzed.	98
abstract_inverted_index.efficient	54
abstract_inverted_index.operation	78
abstract_inverted_index.planning,	14
abstract_inverted_index.real-time	46, 145
abstract_inverted_index.solutions	55
abstract_inverted_index.Therefore,	51
abstract_inverted_index.complexity	94
abstract_inverted_index.developing	52
abstract_inverted_index.difficulty	39
abstract_inverted_index.important.	59
abstract_inverted_index.logistics.	17
abstract_inverted_index.processes.	113
abstract_inverted_index.Experiments	99
abstract_inverted_index.algorithms.	125
abstract_inverted_index.application	146
abstract_inverted_index.encountered	4
abstract_inverted_index.engineering	7
abstract_inverted_index.exploration	87
abstract_inverted_index.frequently,	35
abstract_inverted_index.intelligent	10
abstract_inverted_index.superiority	130
abstract_inverted_index.traditional	41
abstract_inverted_index.transmitted	24
abstract_inverted_index.optimization	123
abstract_inverted_index.particularly	58
abstract_inverted_index.requirements	47
abstract_inverted_index.applications,	8
abstract_inverted_index.applications.	50
abstract_inverted_index.environmental	19
abstract_inverted_index.requirements.	147
abstract_inverted_index.ever-increasing	38
abstract_inverted_index.transportation,	11
abstract_inverted_index.transportation-related	112
cited_by_percentile_year.max	99
cited_by_percentile_year.min	98
corresponding_author_ids	https://openalex.org/A5081318069
countries_distinct_count	2
institutions_distinct_count	4
corresponding_institution_ids	https://openalex.org/I111950717, https://openalex.org/I118118575
sustainable_development_goals[0].id	https://metadata.un.org/sdg/9
sustainable_development_goals[0].score	0.46000000834465027
sustainable_development_goals[0].display_name	Industry, innovation and infrastructure
citation_normalized_percentile.value	0.91870487
citation_normalized_percentile.is_in_top_1_percent	False
citation_normalized_percentile.is_in_top_10_percent	True