{"id":"https://openalex.org/W2130381285","doi":"https://doi.org/10.2514/1.i010219","title":"Air Traffic Control Area Configuration Advisories from Near-Optimal Distinct Paths","display_name":"Air Traffic Control Area Configuration Advisories from Near-Optimal Distinct Paths","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2130381285","doi":"https://doi.org/10.2514/1.i010219","mag":"2130381285"},"language":"en","primary_location":{"id":"doi:10.2514/1.i010219","is_oa":false,"landing_page_url":"https://doi.org/10.2514/1.i010219","pdf_url":null,"source":{"id":"https://openalex.org/S4210240151","display_name":"Journal of Aerospace Information Systems","issn_l":"2327-3097","issn":["2327-3097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315709","host_organization_name":"American Institute of Aeronautics and Astronautics","host_organization_lineage":["https://openalex.org/P4310315709"],"host_organization_lineage_names":["American Institute of Aeronautics and Astronautics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Aerospace Information Systems","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/A5068955929","display_name":"Michael Bloem","orcid":"https://orcid.org/0000-0001-5864-7753"},"institutions":[{"id":"https://openalex.org/I1280536761","display_name":"Ames Research Center","ror":"https://ror.org/02acart68","country_code":"US","type":"facility","lineage":["https://openalex.org/I1280536761","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Bloem","raw_affiliation_strings":["Systems Modeling and Optimization Branch, NASA Ames Research Center, Moffett Field, California 94035"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Systems Modeling and Optimization Branch, NASA Ames Research Center, Moffett Field, California 94035","institution_ids":["https://openalex.org/I1280536761"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002056995","display_name":"Nicholas Bambos","orcid":"https://orcid.org/0000-0001-9250-4553"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicholas Bambos","raw_affiliation_strings":["Departments of Management Science and Engineering and Electrical Engineering, Stanford University, Stanford, California 94305","Departments of Management Science and Engineering and Electrical Engineering, Stanford University, Stanford, California 94305#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departments of Management Science and Engineering and Electrical Engineering, Stanford University, Stanford, California 94305","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Departments of Management Science and Engineering and Electrical Engineering, Stanford University, Stanford, California 94305#TAB#","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5778,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77366013,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"11","issue":"11","first_page":"764","last_page":"784"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11489","display_name":"Air Traffic Management and Optimization","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7234596014022827},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6761236786842346},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.634162425994873},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6137668490409851},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.5997548699378967},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5616034269332886},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5287922024726868},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.4721643626689911},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44543907046318054},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.44432270526885986},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37804216146469116},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28227636218070984},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.13104817271232605},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.104312002658844}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7234596014022827},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6761236786842346},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.634162425994873},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6137668490409851},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.5997548699378967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5616034269332886},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5287922024726868},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.4721643626689911},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44543907046318054},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.44432270526885986},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37804216146469116},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28227636218070984},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.13104817271232605},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.104312002658844},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2514/1.i010219","is_oa":false,"landing_page_url":"https://doi.org/10.2514/1.i010219","pdf_url":null,"source":{"id":"https://openalex.org/S4210240151","display_name":"Journal of Aerospace Information Systems","issn_l":"2327-3097","issn":["2327-3097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315709","host_organization_name":"American Institute of Aeronautics and Astronautics","host_organization_lineage":["https://openalex.org/P4310315709"],"host_organization_lineage_names":["American Institute of Aeronautics and Astronautics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Aerospace Information Systems","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.720.4995","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.720.4995","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.aviationsystemsdivision.arc.nasa.gov/publications/2015/bloem_JAIS_mul_advisories_AAM.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W607954230","https://openalex.org/W629434729","https://openalex.org/W1523265685","https://openalex.org/W1871367359","https://openalex.org/W1964443412","https://openalex.org/W1969483458","https://openalex.org/W2005142267","https://openalex.org/W2015035116","https://openalex.org/W2023132252","https://openalex.org/W2034355834","https://openalex.org/W2062747776","https://openalex.org/W2075532100","https://openalex.org/W2089845007","https://openalex.org/W2099147332","https://openalex.org/W2103051118","https://openalex.org/W2106841911","https://openalex.org/W2112643276","https://openalex.org/W2131058166","https://openalex.org/W2136190542","https://openalex.org/W2144050074","https://openalex.org/W2153926625","https://openalex.org/W2154434560","https://openalex.org/W2155061423","https://openalex.org/W2161077594","https://openalex.org/W2177047785","https://openalex.org/W2316255177","https://openalex.org/W2318155700","https://openalex.org/W2340006107","https://openalex.org/W4246153096","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W4312926500","https://openalex.org/W2067280619","https://openalex.org/W4251343851","https://openalex.org/W2041180560","https://openalex.org/W3177062893"],"abstract_inverted_index":{"Area":[0],"of":[1,35,47,128],"specialization":[2],"supervisors":[3,25],"dynamically":[4],"configure":[5],"available":[6],"air":[7,13],"traffic":[8,14],"control":[9],"resources":[10],"so":[11],"that":[12,53,72,91],"can":[15],"operate":[16],"safely":[17],"and":[18,37,59,62,79,85,106,146,161,186],"efficiently.":[19],"It":[20,69],"is":[21,51,54,70,75,88,98,109],"proposed":[22],"to":[23,56,95,121,133],"assist":[24],"with":[26,32],"this":[27,73],"process":[28],"by":[29],"presenting":[30],"them":[31],"a":[33,45,49,66,89,99,107,110,167],"set":[34,46],"near-optimal":[36,61],"meaningfully":[38],"different":[39],"configuration":[40],"advisories.":[41,188],"To":[42],"find":[43],"such":[44],"advisories,":[48],"problem":[50,74,94,126,136],"defined":[52],"equivalent":[55],"finding":[57],"optimal":[58,148,163],"other":[60],"distinct":[63],"paths":[64,125,140],"in":[65,165],"time-expanded":[67],"graph.":[68],"shown":[71],"nondeterministic":[76],"polynomial-time":[77],"hard,":[78],"then":[80],"four":[81],"algorithms":[82],"are":[83],"motivated":[84],"specified.":[86],"One":[87],"benchmark":[90],"solves":[92,120],"the":[93,115,123,129,138,147,155,178],"optimality,":[96],"one":[97],"novel":[100,111,157],"heuristic":[101,112,172,181],"based":[102,113],"on":[103,114],"value":[104,179],"iteration,":[105],"third":[108],"algorithm.":[116],"The":[117,170],"fourth":[118],"algorithm":[119,141,149],"optimality":[122],"lowest-cost":[124,139],"relaxation":[127],"problem.":[130],"When":[131],"used":[132],"solve":[134],"realistic":[135],"instances,":[137],"rarely":[142],"returned":[143],"feasible":[144,160],"solutions":[145,164],"required":[150],"excessive":[151],"computation":[152,175],"times,":[153,176],"but":[154],"two":[156],"heuristics":[158],"found":[159,183],"often":[162],"just":[166],"few":[168],"seconds.":[169],"-based":[171],"achieved":[173],"lower":[174],"whereas":[177],"iteration-based":[180],"typically":[182],"more":[184],"advisories":[185],"lower-cost":[187]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}