{"id":"https://openalex.org/W2084812815","doi":"https://doi.org/10.1080/10248079608903712","title":"REAL-TIME OPTIMAL-ROUTE COMPUTATION: A HEURISTIC APPROACH","display_name":"REAL-TIME OPTIMAL-ROUTE COMPUTATION: A HEURISTIC APPROACH","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W2084812815","doi":"https://doi.org/10.1080/10248079608903712","mag":"2084812815"},"language":"en","primary_location":{"id":"doi:10.1080/10248079608903712","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10248079608903712","pdf_url":null,"source":{"id":"https://openalex.org/S136111043","display_name":"ITS Journal - Intelligent Transportation Systems Journal","issn_l":"1024-8072","issn":["1024-8072","1027-751X","1563-5082"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ITS Journal - Intelligent Transportation Systems Journal","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010491831","display_name":"Hassan A. Karimi","orcid":"https://orcid.org/0000-0001-5331-5004"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hassan A. Karimi","raw_affiliation_strings":["Research Scientist MCNC-North Carolina Supercomputing Center , Research Triangle Park, North Carolina"],"affiliations":[{"raw_affiliation_string":"Research Scientist MCNC-North Carolina Supercomputing Center , Research Triangle Park, North Carolina","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010491831"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.25062893,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"3","issue":"2","first_page":"111","last_page":"127"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9781000018119812,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.8246283531188965},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7517356872558594},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7365410327911377},{"id":"https://openalex.org/keywords/time-constraint","display_name":"Time constraint","score":0.5752173066139221},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.523710310459137},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4915972650051117},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44897687435150146},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34748780727386475},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10780686140060425},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10604667663574219}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.8246283531188965},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7517356872558594},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7365410327911377},{"id":"https://openalex.org/C2775907273","wikidata":"https://www.wikidata.org/wiki/Q7805281","display_name":"Time constraint","level":2,"score":0.5752173066139221},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.523710310459137},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4915972650051117},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44897687435150146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34748780727386475},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10780686140060425},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10604667663574219},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10248079608903712","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10248079608903712","pdf_url":null,"source":{"id":"https://openalex.org/S136111043","display_name":"ITS Journal - Intelligent Transportation Systems Journal","issn_l":"1024-8072","issn":["1024-8072","1027-751X","1563-5082"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ITS Journal - Intelligent Transportation Systems Journal","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1519532587","https://openalex.org/W2005314985","https://openalex.org/W2037034392","https://openalex.org/W2144050074","https://openalex.org/W2152475379","https://openalex.org/W2169528473","https://openalex.org/W2315393402","https://openalex.org/W2463421746","https://openalex.org/W2464761887","https://openalex.org/W2539741397","https://openalex.org/W2911302472","https://openalex.org/W4230472303","https://openalex.org/W6679075312","https://openalex.org/W6819915371","https://openalex.org/W6822806907"],"related_works":["https://openalex.org/W2064309607","https://openalex.org/W3200670168","https://openalex.org/W2090344631","https://openalex.org/W3125309996","https://openalex.org/W4313469555","https://openalex.org/W2727768280","https://openalex.org/W2388258497","https://openalex.org/W2963261759","https://openalex.org/W2953077104","https://openalex.org/W3001972822"],"abstract_inverted_index":{"Optimal-route":[0],"computation":[1,24,80],"is":[2,7,25],"an":[3],"important":[4],"function":[5],"that":[6],"needed":[8],"in":[9,13],"many":[10],"applications,":[11,18],"especially":[12,42],"transportation-related":[14],"activities.":[15],"In":[16],"certain":[17],"the":[19,54,63],"real-time":[20,38,64,79],"processing":[21],"of":[22,81],"this":[23,37],"required.":[26],"The":[27],"conventional":[28],"algorithms":[29,50,58],"for":[30,78],"computing":[31],"optimal":[32],"routes":[33,82],"do":[34],"not":[35],"handle":[36],"requirement":[39],"very":[40],"efficiently,":[41],"when":[43],"large":[44],"networks":[45],"are":[46,51,59],"involved.":[47],"Therefore,":[48],"alternative":[49],"needed.":[52],"Of":[53],"possible":[55],"alternatives,":[56],"heuristic":[57,76],"considered":[60],"to":[61],"treat":[62],"constraint":[65],"much":[66],"more":[67],"effectively":[68],"than":[69],"nonheuristic":[70],"algorithms.":[71],"This":[72],"paper":[73],"discusses":[74],"a":[75],"algorithm":[77],"and":[83,89],"compares":[84],"it":[85],"with":[86],"other":[87],"techniques":[88],"approaches.":[90]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}