{"id":"https://openalex.org/W2035777259","doi":"https://doi.org/10.1109/cdc.2011.6161406","title":"An asymptotically optimal algorithm for pickup and delivery problems","display_name":"An asymptotically optimal algorithm for pickup and delivery problems","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2035777259","doi":"https://doi.org/10.1109/cdc.2011.6161406","mag":"2035777259"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2011.6161406","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2011.6161406","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Conference on Decision and Control and European 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/A5008581954","display_name":"Kyle Treleaven","orcid":null},"institutions":[{"id":"https://openalex.org/I46020346","display_name":"American Institute of Aeronautics and Astronautics","ror":"https://ror.org/00a1rzv11","country_code":"US","type":"other","lineage":["https://openalex.org/I46020346"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kyle Treleaven","raw_affiliation_strings":["Laboratory for Information and Decision Systems, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MA, USA","Laboratory for Information and Decision Systems, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, 02139, USA"],"affiliations":[{"raw_affiliation_string":"Laboratory for Information and Decision Systems, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I46020346","https://openalex.org/I63966007"]},{"raw_affiliation_string":"Laboratory for Information and Decision Systems, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, 02139, USA","institution_ids":["https://openalex.org/I46020346","https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050003000","display_name":"Marco Pavone","orcid":"https://orcid.org/0000-0002-0206-4337"},"institutions":[{"id":"https://openalex.org/I1334627681","display_name":"Jet Propulsion Laboratory","ror":"https://ror.org/027k65916","country_code":"US","type":"facility","lineage":["https://openalex.org/I122411786","https://openalex.org/I1334627681","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marco Pavone","raw_affiliation_strings":["Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, USA","Jet Propulsion Laboratory, California Institute of Technology, Pasadena, 91109, USA"],"affiliations":[{"raw_affiliation_string":"Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I1334627681"]},{"raw_affiliation_string":"Jet Propulsion Laboratory, California Institute of Technology, Pasadena, 91109, USA","institution_ids":["https://openalex.org/I1334627681"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029069358","display_name":"Emilio Frazzoli","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I46020346","display_name":"American Institute of Aeronautics and Astronautics","ror":"https://ror.org/00a1rzv11","country_code":"US","type":"other","lineage":["https://openalex.org/I46020346"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emilio Frazzoli","raw_affiliation_strings":["Laboratory for Information and Decision Systems, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MA, USA","Laboratory for Information and Decision Systems, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, 02139, USA"],"affiliations":[{"raw_affiliation_string":"Laboratory for Information and Decision Systems, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I46020346","https://openalex.org/I63966007"]},{"raw_affiliation_string":"Laboratory for Information and Decision Systems, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, 02139, USA","institution_ids":["https://openalex.org/I46020346","https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008581954"],"corresponding_institution_ids":["https://openalex.org/I46020346","https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":3.7779,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.92644807,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"14","issue":null,"first_page":"584","last_page":"590"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9965999722480774,"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.9965999722480774,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9902999997138977,"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/pickup","display_name":"Pickup","score":0.7571752071380615},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5621901154518127},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5444612503051758},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49170809984207153},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.47736382484436035},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.47518932819366455},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4493086338043213},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4478038549423218},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4359624981880188},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4179450571537018},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41505444049835205},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3825961947441101},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10010987520217896}],"concepts":[{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.7571752071380615},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5621901154518127},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5444612503051758},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49170809984207153},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.47736382484436035},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.47518932819366455},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4493086338043213},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4478038549423218},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4359624981880188},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4179450571537018},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41505444049835205},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3825961947441101},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10010987520217896},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2011.6161406","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2011.6161406","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Conference on Decision and Control and European Control Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W89721177","https://openalex.org/W643227642","https://openalex.org/W1573914938","https://openalex.org/W1975176199","https://openalex.org/W1980236799","https://openalex.org/W1985351788","https://openalex.org/W1996847651","https://openalex.org/W2075420967","https://openalex.org/W2082772228","https://openalex.org/W2110940003","https://openalex.org/W2138358085","https://openalex.org/W2222512263","https://openalex.org/W4251443860"],"related_works":["https://openalex.org/W2185313546","https://openalex.org/W2185850456","https://openalex.org/W2994962043","https://openalex.org/W2351571732","https://openalex.org/W1496169957","https://openalex.org/W2324305961","https://openalex.org/W1971021931","https://openalex.org/W2075333697","https://openalex.org/W202150730","https://openalex.org/W166444759"],"abstract_inverted_index":{"Pickup":[0],"and":[1,45,49,68,97,139,157,177],"delivery":[2,47,71],"problems":[3,23],"(PDPs),":[4],"in":[5,24,75],"which":[6],"objects":[7],"or":[8],"people":[9],"have":[10],"to":[11,53,137],"be":[12],"transported":[13],"between":[14,171],"specific":[15],"locations,":[16],"are":[17,73],"among":[18],"the":[19,31,50,62,98,114,128,132,152,172,178],"most":[20],"common":[21],"combinatorial":[22],"real-world":[25],"operations.":[26],"One":[27],"particular":[28],"PDP":[29],"is":[30,39,52,80,95,119,151,159],"Stacker":[32],"Crane":[33],"problem":[34,84],"(SCP),":[35],"where":[36,149],"each":[37,65],"commodity/customer":[38],"associated":[40,70],"with":[41,61],"a":[42,46,55,81,105,125,168],"pickup":[43,66],"location":[44,67,72],"location,":[48],"objective":[51],"find":[54],"minimum-length":[56],"tour":[57],"visiting":[58],"all":[59],"locations":[60],"constraint":[63],"that":[64],"its":[69],"visited":[74],"consecutive":[76],"order.":[77],"The":[78,93],"SCP":[79,94,116],"route":[82],"optimization":[83],"behind":[85],"several":[86],"transportation":[87],"systems,":[88],"e.g.,":[89],"Transportation-On-Demand":[90],"(TOD)":[91],"systems.":[92],"NP-Hard":[96],"best":[99],"know":[100],"approximation":[101,107],"algorithm":[102,112],"only":[103],"provides":[104],"9/5":[106],"ratio.":[108],"We":[109],"present":[110],"an":[111,160],"for":[113],"stochastic":[115],"which:":[117],"(i)":[118],"asymptotically":[120],"optimal,":[121],"i.e.,":[122],"it":[123],"produces":[124],"solution":[126],"approaching":[127],"optimal":[129],"one":[130],"as":[131],"number":[133,153],"of":[134,154,180],"pickups/deliveries":[135],"goes":[136],"infinity;":[138],"(ii)":[140],"has":[141],"computational":[142],"complexity":[143],"O(n":[144],"<sup":[145],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[146],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2+\u03f5</sup>":[147],"),":[148],"n":[150],"pickup/delivery":[155],"pairs":[156],"\u03f5":[158],"arbitrarily":[161],"small":[162],"positive":[163],"constant.":[164],"Our":[165],"results":[166],"leverage":[167],"novel":[169],"connection":[170],"Euclidean":[173],"Bipartite":[174],"Matching":[175],"Problem":[176],"theory":[179],"random":[181],"permutations.":[182]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}