{"id":"https://openalex.org/W2143206869","doi":"https://doi.org/10.1109/acc.2007.4282854","title":"Solving the aircraft routing problem using network flow algorithms","display_name":"Solving the aircraft routing problem using network flow algorithms","publication_year":2007,"publication_date":"2007-07-01","ids":{"openalex":"https://openalex.org/W2143206869","doi":"https://doi.org/10.1109/acc.2007.4282854","mag":"2143206869"},"language":"en","primary_location":{"id":"doi:10.1109/acc.2007.4282854","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2007.4282854","pdf_url":null,"source":{"id":"https://openalex.org/S4210168941","display_name":"Proceedings of the ... American Control Conference/Proceedings of the American Control Conference","issn_l":"0743-1619","issn":["0743-1619","2378-5861"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 American Control Conference","raw_type":"proceedings-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/A5101602034","display_name":"Kaushik Roy","orcid":"https://orcid.org/0000-0003-2727-6704"},"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":true,"raw_author_name":"Kaushik Roy","raw_affiliation_strings":["Electrical Engineering, University of Stanford, USA","[Stanford Univ., Stanford]"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering, University of Stanford, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"[Stanford Univ., Stanford]","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045155646","display_name":"Claire J. Tomlin","orcid":"https://orcid.org/0000-0003-3192-3185"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Claire J. Tomlin","raw_affiliation_strings":["Electrical Engineering and Computer Sciences, University of California Berkeley, USA","University of California, Berkeley, Berkeley, United States"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Sciences, University of California Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California, Berkeley, Berkeley, United States","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101602034"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.6797,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.64071567,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"3330","last_page":"3335"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11489","display_name":"Air Traffic Management and Optimization","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11489","display_name":"Air Traffic Management and Optimization","score":0.9998999834060669,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9918000102043152,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/rounding","display_name":"Rounding","score":0.7888157367706299},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6173756718635559},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5754756927490234},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5742599964141846},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5555046796798706},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5468608140945435},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5461190938949585},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5202288031578064},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5103849768638611},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.4998185634613037},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.47710591554641724},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4738978445529938},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.43979576230049133},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4351709485054016},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3473014235496521},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25584155321121216},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14018970727920532}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7888157367706299},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6173756718635559},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5754756927490234},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5742599964141846},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5555046796798706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5468608140945435},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5461190938949585},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5202288031578064},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5103849768638611},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.4998185634613037},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47710591554641724},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4738978445529938},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.43979576230049133},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4351709485054016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3473014235496521},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25584155321121216},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14018970727920532},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/acc.2007.4282854","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2007.4282854","pdf_url":null,"source":{"id":"https://openalex.org/S4210168941","display_name":"Proceedings of the ... American Control Conference/Proceedings of the American Control Conference","issn_l":"0743-1619","issn":["0743-1619","2378-5861"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 American Control Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1483946635","https://openalex.org/W1531832884","https://openalex.org/W1599888194","https://openalex.org/W1964568645","https://openalex.org/W1979552577","https://openalex.org/W2011039300","https://openalex.org/W2066074485","https://openalex.org/W2076171427","https://openalex.org/W2104050785","https://openalex.org/W2117997508","https://openalex.org/W2476096155","https://openalex.org/W6631773907","https://openalex.org/W6636033555"],"related_works":["https://openalex.org/W4231500168","https://openalex.org/W3100114454","https://openalex.org/W2507810539","https://openalex.org/W2035016254","https://openalex.org/W90079504","https://openalex.org/W1600160158","https://openalex.org/W2137277194","https://openalex.org/W2031277014","https://openalex.org/W1968111265","https://openalex.org/W2593184009"],"abstract_inverted_index":{"The":[0],"aircraft":[1],"routing":[2,82],"problem":[3,12,26],"(ARP)":[4],"is":[5,77,105,126],"formulated":[6],"as":[7,55],"a":[8,19,114],"time-dependent":[9],"network":[10,32],"flow":[11],"and":[13,30,61,85,125],"proved":[14],"to":[15,37,66,88],"be":[16,49],"NP-hard,":[17],"using":[18],"reduction":[20],"from":[21],"the":[22,45,92,95,102,118],"NP-complete":[23],"3-dimensional":[24],"matching":[25],"(3DM).":[27],"Flow":[28],"scheduling":[29],"dynamic":[31],"theory":[33],"concepts":[34],"are":[35,64],"used":[36,65],"develop":[38],"an":[39],"Integer":[40],"Program":[41],"(IP)":[42],"formulation":[43,69,104,120],"of":[44,81],"ARP,":[46],"which":[47],"can":[48],"solved":[50],"exactly":[51],"through":[52],"software":[53],"such":[54],"CPLEX.":[56],"Linear":[57],"program":[58],"(LP)":[59],"relaxation":[60],"rounding":[62],"techniques":[63],"solve":[67],"this":[68],"in":[70,122],"pseudo-polynomial":[71],"time.":[72],"A":[73],"heuristic":[74],"first-come-first-served":[75],"(FCFS)":[76],"also":[78],"implemented.":[79],"Scenarios":[80],"under":[83],"congestion":[84],"rerouting":[86],"due":[87],"weather":[89],"show":[90],"that":[91],"FCFS":[93],"has":[94,108],"fastest":[96],"run-time":[97],"but":[98,107],"worst":[99],"performance,":[100],"while":[101],"IP":[103],"optimal":[106],"no":[109],"guarantees":[110],"on":[111],"run-time.":[112],"For":[113],"given":[115],"time":[116,124],"horizon,":[117],"LP":[119],"runs":[121],"polynomial":[123],"often":[127],"optimal,":[128],"with":[129],"bounded":[130],"suboptimality":[131],"otherwise.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}