Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities Article Swipe
Oren Salzman
,
Ariel Felner
,
Carlos Hernández
,
Han Zhang
,
Shao-Hung Chan
,
Sven Koenig
·
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.24963/ijcai.2023/757
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.24963/ijcai.2023/757
In the multi-objective shortest-path problem we are interested in computing a path, or a set of paths that simultaneously balance multiple cost functions. This problem is important for a diverse range of applications such as transporting hazardous materials considering travel distance and risk. This family of problems is not new with results dating back to the 1970's. Nevertheless, the significant progress made in the field of heuristic search resulted in a new and growing interest in the sub-field of multi-objective search. Consequently, in this paper we review the fundamental problems and techniques common to most algorithms and provide a general overview of the field. We then continue to describe recent work with an emphasis on new challenges that emerged and the resulting research opportunities.
Related Topics
Concepts
Shortest path problem
Heuristic
Computer science
Set (abstract data type)
Path (computing)
Field (mathematics)
Incremental heuristic search
Mathematical optimization
Search algorithm
Theoretical computer science
Beam search
Artificial intelligence
Mathematics
Algorithm
Graph
Pure mathematics
Programming language
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.24963/ijcai.2023/757
- https://www.ijcai.org/proceedings/2023/0757.pdf
- OA Status
- gold
- Cited By
- 13
- References
- 69
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4385764049
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4385764049Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.24963/ijcai.2023/757Digital Object Identifier
- Title
-
Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research OpportunitiesWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2023Year of publication
- Publication date
-
2023-08-01Full publication date if available
- Authors
-
Oren Salzman, Ariel Felner, Carlos Hernández, Han Zhang, Shao-Hung Chan, Sven KoenigList of authors in order
- Landing page
-
https://doi.org/10.24963/ijcai.2023/757Publisher landing page
- PDF URL
-
https://www.ijcai.org/proceedings/2023/0757.pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://www.ijcai.org/proceedings/2023/0757.pdfDirect OA link when available
- Concepts
-
Shortest path problem, Heuristic, Computer science, Set (abstract data type), Path (computing), Field (mathematics), Incremental heuristic search, Mathematical optimization, Search algorithm, Theoretical computer science, Beam search, Artificial intelligence, Mathematics, Algorithm, Graph, Pure mathematics, Programming languageTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
13Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 3, 2024: 9, 2023: 1Per-year citation counts (last 5 years)
- References (count)
-
69Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4385764049 |
|---|---|
| doi | https://doi.org/10.24963/ijcai.2023/757 |
| ids.doi | https://doi.org/10.24963/ijcai.2023/757 |
| ids.openalex | https://openalex.org/W4385764049 |
| fwci | 3.23509031 |
| type | article |
| title | Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | 6768 |
| biblio.first_page | 6759 |
| topics[0].id | https://openalex.org/T12709 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9879000186920166 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2207 |
| topics[0].subfield.display_name | Control and Systems Engineering |
| topics[0].display_name | Optimization and Mathematical Programming |
| topics[1].id | https://openalex.org/T10586 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9817000031471252 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1707 |
| topics[1].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[1].display_name | Robotic Path Planning Algorithms |
| topics[2].id | https://openalex.org/T12423 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9807000160217285 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1712 |
| topics[2].subfield.display_name | Software |
| topics[2].display_name | Software Reliability and Analysis Research |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C22590252 |
| concepts[0].level | 3 |
| concepts[0].score | 0.7257277965545654 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q1058754 |
| concepts[0].display_name | Shortest path problem |
| concepts[1].id | https://openalex.org/C173801870 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6806586980819702 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q201413 |
| concepts[1].display_name | Heuristic |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.6420555710792542 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C177264268 |
| concepts[3].level | 2 |
| concepts[3].score | 0.512603223323822 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1514741 |
| concepts[3].display_name | Set (abstract data type) |
| concepts[4].id | https://openalex.org/C2777735758 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5084747076034546 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q817765 |
| concepts[4].display_name | Path (computing) |
| concepts[5].id | https://openalex.org/C9652623 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5002501010894775 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q190109 |
| concepts[5].display_name | Field (mathematics) |
| concepts[6].id | https://openalex.org/C139979381 |
| concepts[6].level | 4 |
| concepts[6].score | 0.4994044303894043 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q17056021 |
| concepts[6].display_name | Incremental heuristic search |
| concepts[7].id | https://openalex.org/C126255220 |
| concepts[7].level | 1 |
| concepts[7].score | 0.46571066975593567 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[7].display_name | Mathematical optimization |
| concepts[8].id | https://openalex.org/C125583679 |
| concepts[8].level | 2 |
| concepts[8].score | 0.32209667563438416 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q755673 |
| concepts[8].display_name | Search algorithm |
| concepts[9].id | https://openalex.org/C80444323 |
| concepts[9].level | 1 |
| concepts[9].score | 0.28858065605163574 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[9].display_name | Theoretical computer science |
| concepts[10].id | https://openalex.org/C19889080 |
| concepts[10].level | 3 |
| concepts[10].score | 0.25885769724845886 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q2835852 |
| concepts[10].display_name | Beam search |
| concepts[11].id | https://openalex.org/C154945302 |
| concepts[11].level | 1 |
| concepts[11].score | 0.20949149131774902 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[11].display_name | Artificial intelligence |
| concepts[12].id | https://openalex.org/C33923547 |
| concepts[12].level | 0 |
| concepts[12].score | 0.1975233554840088 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[12].display_name | Mathematics |
| concepts[13].id | https://openalex.org/C11413529 |
| concepts[13].level | 1 |
| concepts[13].score | 0.17382949590682983 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[13].display_name | Algorithm |
| concepts[14].id | https://openalex.org/C132525143 |
| concepts[14].level | 2 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q141488 |
| concepts[14].display_name | Graph |
| concepts[15].id | https://openalex.org/C202444582 |
| concepts[15].level | 1 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q837863 |
| concepts[15].display_name | Pure mathematics |
| concepts[16].id | https://openalex.org/C199360897 |
| concepts[16].level | 1 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[16].display_name | Programming language |
| keywords[0].id | https://openalex.org/keywords/shortest-path-problem |
| keywords[0].score | 0.7257277965545654 |
| keywords[0].display_name | Shortest path problem |
| keywords[1].id | https://openalex.org/keywords/heuristic |
| keywords[1].score | 0.6806586980819702 |
| keywords[1].display_name | Heuristic |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.6420555710792542 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/set |
| keywords[3].score | 0.512603223323822 |
| keywords[3].display_name | Set (abstract data type) |
| keywords[4].id | https://openalex.org/keywords/path |
| keywords[4].score | 0.5084747076034546 |
| keywords[4].display_name | Path (computing) |
| keywords[5].id | https://openalex.org/keywords/field |
| keywords[5].score | 0.5002501010894775 |
| keywords[5].display_name | Field (mathematics) |
| keywords[6].id | https://openalex.org/keywords/incremental-heuristic-search |
| keywords[6].score | 0.4994044303894043 |
| keywords[6].display_name | Incremental heuristic search |
| keywords[7].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[7].score | 0.46571066975593567 |
| keywords[7].display_name | Mathematical optimization |
| keywords[8].id | https://openalex.org/keywords/search-algorithm |
| keywords[8].score | 0.32209667563438416 |
| keywords[8].display_name | Search algorithm |
| keywords[9].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[9].score | 0.28858065605163574 |
| keywords[9].display_name | Theoretical computer science |
| keywords[10].id | https://openalex.org/keywords/beam-search |
| keywords[10].score | 0.25885769724845886 |
| keywords[10].display_name | Beam search |
| keywords[11].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[11].score | 0.20949149131774902 |
| keywords[11].display_name | Artificial intelligence |
| keywords[12].id | https://openalex.org/keywords/mathematics |
| keywords[12].score | 0.1975233554840088 |
| keywords[12].display_name | Mathematics |
| keywords[13].id | https://openalex.org/keywords/algorithm |
| keywords[13].score | 0.17382949590682983 |
| keywords[13].display_name | Algorithm |
| language | en |
| locations[0].id | doi:10.24963/ijcai.2023/757 |
| locations[0].is_oa | True |
| locations[0].source | |
| locations[0].license | |
| locations[0].pdf_url | https://www.ijcai.org/proceedings/2023/0757.pdf |
| locations[0].version | publishedVersion |
| locations[0].raw_type | proceedings-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence |
| locations[0].landing_page_url | https://doi.org/10.24963/ijcai.2023/757 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5078885681 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-4541-8219 |
| authorships[0].author.display_name | Oren Salzman |
| authorships[0].countries | IL |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I174306211 |
| authorships[0].affiliations[0].raw_affiliation_string | Technion-Israel Institute of Technology |
| authorships[0].institutions[0].id | https://openalex.org/I174306211 |
| authorships[0].institutions[0].ror | https://ror.org/03qryx823 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I174306211 |
| authorships[0].institutions[0].country_code | IL |
| authorships[0].institutions[0].display_name | Technion – Israel Institute of Technology |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Oren Salzman |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Technion-Israel Institute of Technology |
| authorships[1].author.id | https://openalex.org/A5011195666 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-0065-2757 |
| authorships[1].author.display_name | Ariel Felner |
| authorships[1].countries | IL |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I124227911 |
| authorships[1].affiliations[0].raw_affiliation_string | Ben-Gurion University of the Negev |
| authorships[1].institutions[0].id | https://openalex.org/I124227911 |
| authorships[1].institutions[0].ror | https://ror.org/05tkyf982 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I124227911 |
| authorships[1].institutions[0].country_code | IL |
| authorships[1].institutions[0].display_name | Ben-Gurion University of the Negev |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Ariel Felner |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Ben-Gurion University of the Negev |
| authorships[2].author.id | https://openalex.org/A5007629410 |
| authorships[2].author.orcid | https://orcid.org/0000-0001-7947-3684 |
| authorships[2].author.display_name | Carlos Hernández |
| authorships[2].countries | CL |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I3124150290 |
| authorships[2].affiliations[0].raw_affiliation_string | Facultad de Ingeniería, Arquitectura y Diseno, Universidad San Sebastian, Santiago, Chile |
| authorships[2].institutions[0].id | https://openalex.org/I3124150290 |
| authorships[2].institutions[0].ror | https://ror.org/04jrwm652 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I3124150290 |
| authorships[2].institutions[0].country_code | CL |
| authorships[2].institutions[0].display_name | San Sebastián University |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Carlos Hernández |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Facultad de Ingeniería, Arquitectura y Diseno, Universidad San Sebastian, Santiago, Chile |
| authorships[3].author.id | https://openalex.org/A5100399399 |
| authorships[3].author.orcid | https://orcid.org/0009-0007-5071-0130 |
| authorships[3].author.display_name | Han Zhang |
| authorships[3].countries | US |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I1174212, https://openalex.org/I2800817003 |
| authorships[3].affiliations[0].raw_affiliation_string | University of Southern California |
| authorships[3].institutions[0].id | https://openalex.org/I2800817003 |
| authorships[3].institutions[0].ror | https://ror.org/058zz0t50 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I2800817003 |
| authorships[3].institutions[0].country_code | US |
| authorships[3].institutions[0].display_name | Southern California University for Professional Studies |
| authorships[3].institutions[1].id | https://openalex.org/I1174212 |
| authorships[3].institutions[1].ror | https://ror.org/03taz7m60 |
| authorships[3].institutions[1].type | education |
| authorships[3].institutions[1].lineage | https://openalex.org/I1174212 |
| authorships[3].institutions[1].country_code | US |
| authorships[3].institutions[1].display_name | University of Southern California |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Han Zhang |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | University of Southern California |
| authorships[4].author.id | https://openalex.org/A5025283623 |
| authorships[4].author.orcid | |
| authorships[4].author.display_name | Shao-Hung Chan |
| authorships[4].countries | US |
| authorships[4].affiliations[0].institution_ids | https://openalex.org/I1174212, https://openalex.org/I2800817003 |
| authorships[4].affiliations[0].raw_affiliation_string | University of Southern California |
| authorships[4].institutions[0].id | https://openalex.org/I2800817003 |
| authorships[4].institutions[0].ror | https://ror.org/058zz0t50 |
| authorships[4].institutions[0].type | education |
| authorships[4].institutions[0].lineage | https://openalex.org/I2800817003 |
| authorships[4].institutions[0].country_code | US |
| authorships[4].institutions[0].display_name | Southern California University for Professional Studies |
| authorships[4].institutions[1].id | https://openalex.org/I1174212 |
| authorships[4].institutions[1].ror | https://ror.org/03taz7m60 |
| authorships[4].institutions[1].type | education |
| authorships[4].institutions[1].lineage | https://openalex.org/I1174212 |
| authorships[4].institutions[1].country_code | US |
| authorships[4].institutions[1].display_name | University of Southern California |
| authorships[4].author_position | middle |
| authorships[4].raw_author_name | Shao-Hung Chan |
| authorships[4].is_corresponding | False |
| authorships[4].raw_affiliation_strings | University of Southern California |
| authorships[5].author.id | https://openalex.org/A5026549557 |
| authorships[5].author.orcid | https://orcid.org/0000-0002-5458-094X |
| authorships[5].author.display_name | Sven Koenig |
| authorships[5].countries | US |
| authorships[5].affiliations[0].institution_ids | https://openalex.org/I1174212, https://openalex.org/I2800817003 |
| authorships[5].affiliations[0].raw_affiliation_string | University of Southern California |
| authorships[5].institutions[0].id | https://openalex.org/I2800817003 |
| authorships[5].institutions[0].ror | https://ror.org/058zz0t50 |
| authorships[5].institutions[0].type | education |
| authorships[5].institutions[0].lineage | https://openalex.org/I2800817003 |
| authorships[5].institutions[0].country_code | US |
| authorships[5].institutions[0].display_name | Southern California University for Professional Studies |
| authorships[5].institutions[1].id | https://openalex.org/I1174212 |
| authorships[5].institutions[1].ror | https://ror.org/03taz7m60 |
| authorships[5].institutions[1].type | education |
| authorships[5].institutions[1].lineage | https://openalex.org/I1174212 |
| authorships[5].institutions[1].country_code | US |
| authorships[5].institutions[1].display_name | University of Southern California |
| authorships[5].author_position | last |
| authorships[5].raw_author_name | Sven Koenig |
| authorships[5].is_corresponding | False |
| authorships[5].raw_affiliation_strings | University of Southern California |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.ijcai.org/proceedings/2023/0757.pdf |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T12709 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9879000186920166 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2207 |
| primary_topic.subfield.display_name | Control and Systems Engineering |
| primary_topic.display_name | Optimization and Mathematical Programming |
| related_works | https://openalex.org/W2740367979, https://openalex.org/W4302010637, https://openalex.org/W2112094742, https://openalex.org/W126812865, https://openalex.org/W2137407544, https://openalex.org/W174564869, https://openalex.org/W4280557953, https://openalex.org/W1522468556, https://openalex.org/W4285599953, https://openalex.org/W2435925411 |
| cited_by_count | 13 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 3 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 9 |
| counts_by_year[2].year | 2023 |
| counts_by_year[2].cited_by_count | 1 |
| locations_count | 1 |
| best_oa_location.id | doi:10.24963/ijcai.2023/757 |
| best_oa_location.is_oa | True |
| best_oa_location.source | |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://www.ijcai.org/proceedings/2023/0757.pdf |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | proceedings-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence |
| best_oa_location.landing_page_url | https://doi.org/10.24963/ijcai.2023/757 |
| primary_location.id | doi:10.24963/ijcai.2023/757 |
| primary_location.is_oa | True |
| primary_location.source | |
| primary_location.license | |
| primary_location.pdf_url | https://www.ijcai.org/proceedings/2023/0757.pdf |
| primary_location.version | publishedVersion |
| primary_location.raw_type | proceedings-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence |
| primary_location.landing_page_url | https://doi.org/10.24963/ijcai.2023/757 |
| publication_date | 2023-08-01 |
| publication_year | 2023 |
| referenced_works | https://openalex.org/W4292542951, https://openalex.org/W4310926234, https://openalex.org/W3106241941, https://openalex.org/W2039591135, https://openalex.org/W2768606431, https://openalex.org/W3205463111, https://openalex.org/W4304944116, https://openalex.org/W4287266177, https://openalex.org/W1515513820, https://openalex.org/W211670071, https://openalex.org/W3205066010, https://openalex.org/W1928381443, https://openalex.org/W4292864963, https://openalex.org/W4312293481, https://openalex.org/W4312954736, https://openalex.org/W2174383934, https://openalex.org/W1875923360, https://openalex.org/W3177374642, https://openalex.org/W3126319264, https://openalex.org/W4297932321, https://openalex.org/W2807637204, https://openalex.org/W3195634984, https://openalex.org/W2013525683, https://openalex.org/W2062294368, https://openalex.org/W2066426639, https://openalex.org/W2909085420, https://openalex.org/W2148105250, https://openalex.org/W4288075835, https://openalex.org/W4285249829, https://openalex.org/W2149079374, https://openalex.org/W1998062665, https://openalex.org/W3173608822, https://openalex.org/W3037469527, https://openalex.org/W4383621574, https://openalex.org/W2404199818, https://openalex.org/W2147277731, https://openalex.org/W4220712670, https://openalex.org/W1527511816, https://openalex.org/W2405407348, https://openalex.org/W4313148659, https://openalex.org/W2526909673, https://openalex.org/W3171043051, https://openalex.org/W1513540105, https://openalex.org/W4312951198, https://openalex.org/W2506642202, https://openalex.org/W2158955496, https://openalex.org/W1969483458, https://openalex.org/W1603934459, https://openalex.org/W1973516337, https://openalex.org/W4312386570, https://openalex.org/W2461759988, https://openalex.org/W2548023599, https://openalex.org/W1481195904, https://openalex.org/W4283792718, https://openalex.org/W2735676410, https://openalex.org/W86593919, https://openalex.org/W2811330410, https://openalex.org/W1480013811, https://openalex.org/W2085041447, https://openalex.org/W1970287505, https://openalex.org/W119169328, https://openalex.org/W1490423772, https://openalex.org/W4210773084, https://openalex.org/W640136309, https://openalex.org/W2068113337, https://openalex.org/W2949992533, https://openalex.org/W3103262232, https://openalex.org/W2066047491, https://openalex.org/W2133839585 |
| referenced_works_count | 69 |
| abstract_inverted_index.a | 10, 13, 28, 70, 98 |
| abstract_inverted_index.In | 0 |
| abstract_inverted_index.We | 104 |
| abstract_inverted_index.an | 112 |
| abstract_inverted_index.as | 34 |
| abstract_inverted_index.in | 8, 62, 69, 75, 82 |
| abstract_inverted_index.is | 25, 47 |
| abstract_inverted_index.of | 15, 31, 45, 65, 78, 101 |
| abstract_inverted_index.on | 114 |
| abstract_inverted_index.or | 12 |
| abstract_inverted_index.to | 54, 93, 107 |
| abstract_inverted_index.we | 5, 85 |
| abstract_inverted_index.and | 41, 72, 90, 96, 119 |
| abstract_inverted_index.are | 6 |
| abstract_inverted_index.for | 27 |
| abstract_inverted_index.new | 49, 71, 115 |
| abstract_inverted_index.not | 48 |
| abstract_inverted_index.set | 14 |
| abstract_inverted_index.the | 1, 55, 58, 63, 76, 87, 102, 120 |
| abstract_inverted_index.This | 23, 43 |
| abstract_inverted_index.back | 53 |
| abstract_inverted_index.cost | 21 |
| abstract_inverted_index.made | 61 |
| abstract_inverted_index.most | 94 |
| abstract_inverted_index.such | 33 |
| abstract_inverted_index.that | 17, 117 |
| abstract_inverted_index.then | 105 |
| abstract_inverted_index.this | 83 |
| abstract_inverted_index.with | 50, 111 |
| abstract_inverted_index.work | 110 |
| abstract_inverted_index.field | 64 |
| abstract_inverted_index.paper | 84 |
| abstract_inverted_index.path, | 11 |
| abstract_inverted_index.paths | 16 |
| abstract_inverted_index.range | 30 |
| abstract_inverted_index.risk. | 42 |
| abstract_inverted_index.common | 92 |
| abstract_inverted_index.dating | 52 |
| abstract_inverted_index.family | 44 |
| abstract_inverted_index.field. | 103 |
| abstract_inverted_index.recent | 109 |
| abstract_inverted_index.review | 86 |
| abstract_inverted_index.search | 67 |
| abstract_inverted_index.travel | 39 |
| abstract_inverted_index.1970's. | 56 |
| abstract_inverted_index.balance | 19 |
| abstract_inverted_index.diverse | 29 |
| abstract_inverted_index.emerged | 118 |
| abstract_inverted_index.general | 99 |
| abstract_inverted_index.growing | 73 |
| abstract_inverted_index.problem | 4, 24 |
| abstract_inverted_index.provide | 97 |
| abstract_inverted_index.results | 51 |
| abstract_inverted_index.search. | 80 |
| abstract_inverted_index.continue | 106 |
| abstract_inverted_index.describe | 108 |
| abstract_inverted_index.distance | 40 |
| abstract_inverted_index.emphasis | 113 |
| abstract_inverted_index.interest | 74 |
| abstract_inverted_index.multiple | 20 |
| abstract_inverted_index.overview | 100 |
| abstract_inverted_index.problems | 46, 89 |
| abstract_inverted_index.progress | 60 |
| abstract_inverted_index.research | 122 |
| abstract_inverted_index.resulted | 68 |
| abstract_inverted_index.computing | 9 |
| abstract_inverted_index.hazardous | 36 |
| abstract_inverted_index.heuristic | 66 |
| abstract_inverted_index.important | 26 |
| abstract_inverted_index.materials | 37 |
| abstract_inverted_index.resulting | 121 |
| abstract_inverted_index.sub-field | 77 |
| abstract_inverted_index.algorithms | 95 |
| abstract_inverted_index.challenges | 116 |
| abstract_inverted_index.functions. | 22 |
| abstract_inverted_index.interested | 7 |
| abstract_inverted_index.techniques | 91 |
| abstract_inverted_index.considering | 38 |
| abstract_inverted_index.fundamental | 88 |
| abstract_inverted_index.significant | 59 |
| abstract_inverted_index.applications | 32 |
| abstract_inverted_index.transporting | 35 |
| abstract_inverted_index.Consequently, | 81 |
| abstract_inverted_index.Nevertheless, | 57 |
| abstract_inverted_index.shortest-path | 3 |
| abstract_inverted_index.opportunities. | 123 |
| abstract_inverted_index.simultaneously | 18 |
| abstract_inverted_index.multi-objective | 2, 79 |
| cited_by_percentile_year.max | 99 |
| cited_by_percentile_year.min | 89 |
| countries_distinct_count | 3 |
| institutions_distinct_count | 6 |
| citation_normalized_percentile.value | 0.90905722 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |