{"id":"https://openalex.org/W4417332982","doi":"https://doi.org/10.1287/trsc.2024.0969","title":"Picking the Best Bot: Collaboration Strategies for Humans and Bots in Order Pick Systems with Traveling Salesman Problem Routing","display_name":"Picking the Best Bot: Collaboration Strategies for Humans and Bots in Order Pick Systems with Traveling Salesman Problem Routing","publication_year":2025,"publication_date":"2025-12-15","ids":{"openalex":"https://openalex.org/W4417332982","doi":"https://doi.org/10.1287/trsc.2024.0969"},"language":"en","primary_location":{"id":"doi:10.1287/trsc.2024.0969","is_oa":false,"landing_page_url":"https://doi.org/10.1287/trsc.2024.0969","pdf_url":null,"source":{"id":"https://openalex.org/S130252234","display_name":"Transportation Science","issn_l":"0041-1655","issn":["0041-1655","1526-5447"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Science","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/A5074732181","display_name":"Seyyed Mahdi Ghorashi Khalilabadi","orcid":"https://orcid.org/0000-0003-2594-342X"},"institutions":[{"id":"https://openalex.org/I913958620","display_name":"Erasmus University Rotterdam","ror":"https://ror.org/057w15z03","country_code":"NL","type":"education","lineage":["https://openalex.org/I913958620"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Mahdi Ghorashi Khalilabadi","raw_affiliation_strings":["Rotterdam School of Management, Erasmus University, 3062 PA Rotterdam, Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-2594-342X","affiliations":[{"raw_affiliation_string":"Rotterdam School of Management, Erasmus University, 3062 PA Rotterdam, Netherlands","institution_ids":["https://openalex.org/I913958620"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102007305","display_name":"Debjit Roy","orcid":"https://orcid.org/0000-0001-5298-9664"},"institutions":[{"id":"https://openalex.org/I150870154","display_name":"Indian Institute of Management Ahmedabad","ror":"https://ror.org/02egcpy68","country_code":"IN","type":"education","lineage":["https://openalex.org/I150870154"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Debjit Roy","raw_affiliation_strings":["Operations and Decision Sciences, Indian Institute of Management, Ahmedabad 380015, India"],"raw_orcid":"https://orcid.org/0000-0001-5298-9664","affiliations":[{"raw_affiliation_string":"Operations and Decision Sciences, Indian Institute of Management, Ahmedabad 380015, India","institution_ids":["https://openalex.org/I150870154"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087965800","display_name":"Ren\u00e9 de Koster","orcid":"https://orcid.org/0000-0002-1740-7822"},"institutions":[{"id":"https://openalex.org/I913958620","display_name":"Erasmus University Rotterdam","ror":"https://ror.org/057w15z03","country_code":"NL","type":"education","lineage":["https://openalex.org/I913958620"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ren\u00e9 de Koster","raw_affiliation_strings":["Rotterdam School of Management, Erasmus University, 3062 PA Rotterdam, Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-1740-7822","affiliations":[{"raw_affiliation_string":"Rotterdam School of Management, Erasmus University, 3062 PA Rotterdam, Netherlands","institution_ids":["https://openalex.org/I913958620"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074732181"],"corresponding_institution_ids":["https://openalex.org/I913958620"],"apc_list":null,"apc_paid":null,"fwci":0.994,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.83898,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"60","issue":"1","first_page":"101","last_page":"131"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9010000228881836,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9010000228881836,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.019999999552965164,"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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.012500000186264515,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/throughput","display_name":"Throughput","score":0.7645000219345093},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.5748999714851379},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.5410000085830688},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5342000126838684},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5311999917030334},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5267999768257141},{"id":"https://openalex.org/keywords/service","display_name":"Service (business)","score":0.524399995803833},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.506600022315979},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4174000024795532}],"concepts":[{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.7645000219345093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6312000155448914},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5748999714851379},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.5410000085830688},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5342000126838684},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5311999917030334},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5267999768257141},{"id":"https://openalex.org/C2780378061","wikidata":"https://www.wikidata.org/wiki/Q25351891","display_name":"Service (business)","level":2,"score":0.524399995803833},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.506600022315979},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.4982999861240387},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4174000024795532},{"id":"https://openalex.org/C2778963849","wikidata":"https://www.wikidata.org/wiki/Q1473552","display_name":"Order fulfillment","level":3,"score":0.41600000858306885},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3889000117778778},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38830000162124634},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.384799987077713},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.3564999997615814},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.34850001335144043},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.3443000018596649},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3239000141620636},{"id":"https://openalex.org/C181889124","wikidata":"https://www.wikidata.org/wiki/Q380204","display_name":"Service level","level":2,"score":0.3093999922275543},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.3066999912261963},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.3037000000476837},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2904999852180481},{"id":"https://openalex.org/C180518391","wikidata":"https://www.wikidata.org/wiki/Q355217","display_name":"Time allocation","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.28060001134872437},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C2779454638","wikidata":"https://www.wikidata.org/wiki/Q7100700","display_name":"Order picking","level":3,"score":0.27649998664855957},{"id":"https://openalex.org/C2778203192","wikidata":"https://www.wikidata.org/wiki/Q939723","display_name":"Aisle","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.2581999897956848}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1287/trsc.2024.0969","is_oa":false,"landing_page_url":"https://doi.org/10.1287/trsc.2024.0969","pdf_url":null,"source":{"id":"https://openalex.org/S130252234","display_name":"Transportation Science","issn_l":"0041-1655","issn":["0041-1655","1526-5447"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.eur.nl:openaire_cris_publications/acb12061-ab42-4a59-a467-54cba2b476c5","is_oa":false,"landing_page_url":"https://pure.eur.nl/en/publications/acb12061-ab42-4a59-a467-54cba2b476c5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401266","display_name":"EUR Research Repository (Erasmus University Rotterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I913958620","host_organization_name":"Erasmus University Rotterdam","host_organization_lineage":["https://openalex.org/I913958620"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ghorashi Khalilabadi, M, Roy, D & de Koster, R 2025, 'Picking the Best Bot : Collaboration Strategies for Humans and Bots in Order Pick Systems with Traveling Salesman Problem Routing', Transportation Science, vol. 60, no. 1, pp. 101-131. https://doi.org/10.1287/trsc.2024.0969","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W2002425124","https://openalex.org/W2015670703","https://openalex.org/W2017932090","https://openalex.org/W2058155782","https://openalex.org/W2094055697","https://openalex.org/W2128970394","https://openalex.org/W2334863247","https://openalex.org/W2888729493","https://openalex.org/W2904681706","https://openalex.org/W2952367389","https://openalex.org/W2999490101","https://openalex.org/W3047334099","https://openalex.org/W3047773630","https://openalex.org/W3092206546","https://openalex.org/W3110682088","https://openalex.org/W3125055412","https://openalex.org/W3169363004","https://openalex.org/W3193444724","https://openalex.org/W3198784911","https://openalex.org/W3199522953","https://openalex.org/W4226424556","https://openalex.org/W4308868305","https://openalex.org/W4372298435","https://openalex.org/W4390034995","https://openalex.org/W4392907305","https://openalex.org/W4407041089"],"related_works":[],"abstract_inverted_index":{"The":[0,114,143,163,188,263],"rapid":[1],"growth":[2],"of":[3,39,117,211,226,244],"e-commerce":[4],"has":[5],"increased":[6],"the":[7,37,50,62,87,118,167,175,182,201,227,236,241,246,252],"demand":[8],"for":[9,104,128,248],"efficient":[10],"order":[11,71,133],"picking":[12],"systems":[13],"in":[14,53,65,158,181],"large":[15],"warehouses.":[16],"To":[17],"improve":[18],"throughput":[19,33,109,173],"performance,":[20],"many":[21],"facilities":[22],"deploy":[23],"autonomous":[24],"mobile":[25],"robots":[26],"(AMRs)":[27],"to":[28,81,217],"assist":[29],"human":[30],"pickers.":[31],"Warehouse":[32],"critically":[34],"depends":[35],"on":[36,46],"choice":[38],"human-robot":[40],"collaboration":[41],"policy.":[42],"This":[43,222],"study":[44],"focuses":[45],"two":[47],"popular":[48],"policies:":[49],"swarm":[51,88,168],"policy,":[52,64,177],"which":[54,66,230],"pickers":[55],"switch":[56],"between":[57],"AMRs":[58],"while":[59],"picking,":[60],"and":[61,99,108,140,185,196,205,233,256],"system-directed":[63,176,189],"a":[67,73,91,96,208],"picker":[68,197],"completes":[69],"an":[70],"with":[72,95,152,178],"single":[74],"AMR.":[75],"An":[76],"analytical":[77,144],"framework":[78],"is":[79,191,207,224,266],"developed":[80],"evaluate":[82],"these":[83],"policies.":[84],"We":[85],"model":[86],"policy":[89,169,190,219],"as":[90],"closed":[92],"queuing":[93],"network":[94,119],"synchronization":[97],"station,":[98],"we":[100],"derive":[101],"closed-form":[102],"expressions":[103],"its":[105],"steady-state":[106],"probabilities":[107],"given":[110],"load-dependent":[111],"service":[112,115],"rates.":[113],"rates":[116],"nodes":[120],"are":[121,146,199,203,215],"estimated":[122],"by":[123,235],"Monte":[124],"Carlo":[125],"simulation,":[126],"accounting":[127],"stochastic":[129],"travel":[130],"times,":[131],"varying":[132],"sizes,":[134],"item":[135],"allocation":[136],"strategies,":[137],"matching":[138],"rules,":[139],"warehouse":[141],"layouts.":[142],"predictions":[145],"validated":[147],"against":[148],"detailed":[149],"discrete-event":[150],"simulations,":[151],"average":[153],"relative":[154],"errors":[155],"below":[156],"2%":[157],"[Formula:":[159],"see":[160],"text]":[161],"instances.":[162],"results":[164],"indicate":[165],"that":[166],"generally":[170],"provides":[171],"higher":[172],"than":[174],"gains":[179],"increasing":[180],"AMR-to-picker":[183],"count":[184],"speed":[186],"ratios.":[187],"more":[192],"effective":[193],"when":[194],"AMR":[195],"speeds":[198],"similar,":[200],"orders":[202],"large,":[204],"there":[206],"limited":[209],"number":[210],"AMRs.":[212],"Managerial":[213],"insights":[214],"provided":[216],"guide":[218],"choice.":[220],"Funding:":[221],"research":[223],"part":[225],"Sharehouse":[228],"Project,":[229],"was":[231],"cofinanced":[232],"supported":[234],"Dutch":[237,242,253],"Research":[238,250],"Council":[239],"NWO,":[240],"Ministry":[243],"I&W,":[245],"Taskforce":[247],"Applied":[249],"SIA,":[251],"Topsector":[254],"Logistics,":[255],"TKI":[257],"Dinalog":[258],"[Project":[259],"439.18.452].":[260],"Supplemental":[261],"Material:":[262],"online":[264],"appendix":[265],"available":[267],"at":[268],"https://doi.org/10.1287/trsc.2024.0969":[269],".":[270]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-12-15T00:00:00"}