{"id":"https://openalex.org/W2802713222","doi":"https://doi.org/10.1080/00207543.2018.1461952","title":"An optimal and a heuristic algorithm for the single-item retrieval problem in puzzle-based storage systems with multiple escorts","display_name":"An optimal and a heuristic algorithm for the single-item retrieval problem in puzzle-based storage systems with multiple escorts","publication_year":2018,"publication_date":"2018-05-04","ids":{"openalex":"https://openalex.org/W2802713222","doi":"https://doi.org/10.1080/00207543.2018.1461952","mag":"2802713222"},"language":"en","primary_location":{"id":"doi:10.1080/00207543.2018.1461952","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2018.1461952","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"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":"International Journal of Production Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/journal_contribution/An_optimal_and_a_heuristic_algorithm_for_the_single-item_retrieval_problem_in_puzzle-based_storage_systems_with_multiple_escorts/6222674","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012797801","display_name":"Altan Yalcin","orcid":null},"institutions":[{"id":"https://openalex.org/I254029264","display_name":"European University Viadrina","ror":"https://ror.org/02msan859","country_code":"DE","type":"education","lineage":["https://openalex.org/I254029264"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Altan Yalcin","raw_affiliation_strings":["Department of Business Informatics, European University Viadrina , Frankfurt (Oder), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Business Informatics, European University Viadrina , Frankfurt (Oder), Germany","institution_ids":["https://openalex.org/I254029264"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064863234","display_name":"Achim Koberstein","orcid":"https://orcid.org/0000-0002-9648-3013"},"institutions":[{"id":"https://openalex.org/I254029264","display_name":"European University Viadrina","ror":"https://ror.org/02msan859","country_code":"DE","type":"education","lineage":["https://openalex.org/I254029264"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Achim Koberstein","raw_affiliation_strings":["Department of Business Informatics, European University Viadrina , Frankfurt (Oder), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Business Informatics, European University Viadrina , Frankfurt (Oder), Germany","institution_ids":["https://openalex.org/I254029264"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017157028","display_name":"Kai-Oliver Schocke","orcid":null},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]},{"id":"https://openalex.org/I5237613","display_name":"Frankfurt University of Applied Sciences","ror":"https://ror.org/02r625m11","country_code":"DE","type":"education","lineage":["https://openalex.org/I5237613"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Kai-Oliver Schocke","raw_affiliation_strings":["Department of Logistics, Frankfurt University of Applied Sciences , Frankfurt (Main), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Logistics, Frankfurt University of Applied Sciences , Frankfurt (Main), Germany","institution_ids":["https://openalex.org/I114090438","https://openalex.org/I5237613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012797801"],"corresponding_institution_ids":["https://openalex.org/I254029264"],"apc_list":null,"apc_paid":null,"fwci":3.0846,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.91767203,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"57","issue":"1","first_page":"143","last_page":"165"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.987500011920929,"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.9811000227928162,"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/heuristic","display_name":"Heuristic","score":0.6751319766044617},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.6181030869483948},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5947200059890747},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5720675587654114},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5509414672851562},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5412715077400208},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.49985527992248535},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4206335246562958},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.40806689858436584},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.3751671016216278},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3667093515396118},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.30146026611328125}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6751319766044617},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6181030869483948},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5947200059890747},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5720675587654114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5509414672851562},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5412715077400208},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.49985527992248535},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4206335246562958},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.40806689858436584},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.3751671016216278},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3667093515396118},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.30146026611328125},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1080/00207543.2018.1461952","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2018.1461952","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"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":"International Journal of Production Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:taf:tprsxx:v:57:y:2019:i:1:p:143-165","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/00207543.2018.1461952","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:figshare.com:article/6222674","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/An_optimal_and_a_heuristic_algorithm_for_the_single-item_retrieval_problem_in_puzzle-based_storage_systems_with_multiple_escorts/6222674","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"doi:10.6084/m9.figshare.6222674.v1","is_oa":true,"landing_page_url":"https://doi.org/10.6084/m9.figshare.6222674.v1","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/6222674","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/An_optimal_and_a_heuristic_algorithm_for_the_single-item_retrieval_problem_in_puzzle-based_storage_systems_with_multiple_escorts/6222674","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G798389824","display_name":null,"funder_award_id":"HA 405/13-44","funder_id":"https://openalex.org/F4320321147","funder_display_name":"Ministry of Higher Education"},{"id":"https://openalex.org/G8936320566","display_name":null,"funder_award_id":"HA 422/14-32","funder_id":"https://openalex.org/F4320321147","funder_display_name":"Ministry of Higher Education"}],"funders":[{"id":"https://openalex.org/F4320321147","display_name":"Ministry of Higher Education","ror":"https://ror.org/0512bh102"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W170032574","https://openalex.org/W1775783412","https://openalex.org/W1833716365","https://openalex.org/W1963859756","https://openalex.org/W1969483458","https://openalex.org/W1974700506","https://openalex.org/W2010233396","https://openalex.org/W2012255306","https://openalex.org/W2021773858","https://openalex.org/W2022501163","https://openalex.org/W2032056620","https://openalex.org/W2032540341","https://openalex.org/W2036722182","https://openalex.org/W2122410182","https://openalex.org/W2150470619","https://openalex.org/W2160080538","https://openalex.org/W2169528473","https://openalex.org/W2319958627","https://openalex.org/W2581272845","https://openalex.org/W2586143730","https://openalex.org/W2949807561","https://openalex.org/W3151559616","https://openalex.org/W3169495683","https://openalex.org/W4205093675","https://openalex.org/W4242811155","https://openalex.org/W4247245376"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W4302010637","https://openalex.org/W2740367979","https://openalex.org/W2112094742","https://openalex.org/W1622225657","https://openalex.org/W2402589461","https://openalex.org/W2376959332","https://openalex.org/W2885402535","https://openalex.org/W2224555876","https://openalex.org/W2347472569"],"abstract_inverted_index":{"Puzzle-based":[0],"storage":[1,29],"systems":[2],"consist":[3],"of":[4,34,94,110,128,170],"densely":[5],"stored":[6,23],"unit":[7,24],"loads":[8],"on":[9,91,124],"a":[10,22,27,70,107,125],"square":[11],"grid.":[12,64],"The":[13,65,159],"problem":[14,66,73,117,129],"addressed":[15],"in":[16,62],"this":[17],"paper":[18],"is":[19,67],"to":[20,46,76,114,156],"retrieve":[21],"load":[25],"from":[26],"puzzle-based":[28],"using":[30,78],"the":[31,63,85,92,111,136],"minimum":[32],"number":[33,93],"item":[35],"moves.":[36],"While":[37],"previous":[38],"research":[39],"contributed":[40],"optimal":[41],"algorithms":[42,123,137],"for":[43,166],"only":[44],"up":[45],"two":[47],"empty":[48,57,96],"locations":[49,58,97],"(escorts),":[50],"our":[51],"approach":[52],"solves":[53],"configurations":[54],"where":[55,142],"multiple":[56],"are":[59,144],"arbitrarily":[60],"positioned":[61],"formulated":[68],"as":[69],"state":[71],"space":[72],"and":[74,98,146],"solved":[75,155],"optimality":[77,157],"an":[79],"exact":[80],"search":[81,86,112],"algorithm.":[82],"To":[83],"reduce":[84],"space,":[87],"we":[88,105],"derive":[89],"bounds":[90],"eligible":[95],"develop":[99],"several":[100],"search-guiding":[101],"estimate":[102],"functions.":[103],"Furthermore,":[104],"present":[106],"heuristic":[108,160],"variant":[109,161],"algorithm":[113],"solve":[115,147],"larger":[116,168],"instances.":[118,130],"We":[119],"evaluate":[120],"both":[121],"solution":[122],"large":[126],"set":[127],"Our":[131],"computational":[132],"results":[133],"show":[134],"that":[135],"clearly":[138],"outperform":[139],"existing":[140],"approaches":[141],"they":[143],"applicate":[145],"more":[148],"general":[149],"configurations,":[150],"which":[151],"could":[152],"not":[153],"be":[154],"before.":[158],"efficiently":[162],"yields":[163],"high-quality":[164],"solutions":[165],"significantly":[167],"instances":[169],"practically":[171],"relevant":[172],"size.":[173]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}