{"id":"https://openalex.org/W4323240788","doi":"https://doi.org/10.5220/0011785100003396","title":"Storage Assignment Using Nested Annealing and Hamming Distances","display_name":"Storage Assignment Using Nested Annealing and Hamming Distances","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4323240788","doi":"https://doi.org/10.5220/0011785100003396"},"language":"en","primary_location":{"id":"doi:10.5220/0011785100003396","is_oa":true,"landing_page_url":"http://dx.doi.org/10.5220/0011785100003396","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dx.doi.org/10.5220/0011785100003396","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022889087","display_name":"Johan Oxenstierna","orcid":"https://orcid.org/0000-0002-6608-9621"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johan Oxenstierna","raw_affiliation_strings":["Dept. of Computer Science, Lund University, Lund, Sweden, --- Select a Country ---","Kairos Logic AB, Lund, Sweden, --- Select a Country ---","Dept. of Computer Science, Lund University, Lund, Sweden, --- Select a Country ---; Kairos Logic AB, Lund, Sweden, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Lund University, Lund, Sweden, --- Select a Country ---","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Kairos Logic AB, Lund, Sweden, --- Select a Country ---","institution_ids":[]},{"raw_affiliation_string":"Dept. of Computer Science, Lund University, Lund, Sweden, --- Select a Country ---; Kairos Logic AB, Lund, Sweden, --- Select a Country ---","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062219821","display_name":"Louis van Rensburg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Louis van Rensburg","raw_affiliation_strings":["Optisol, 90 Sippy Downs Dr, QLD, Australia, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Optisol, 90 Sippy Downs Dr, QLD, Australia, --- Select a Country ---","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064839018","display_name":"Peter J. Stuckey","orcid":"https://orcid.org/0000-0003-2186-0459"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Peter Stuckey","raw_affiliation_strings":["Faculty of Information Technology, Monash University, Australia, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Australia, --- Select a Country ---","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109357557","display_name":"Volker Krueger","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Volker Krueger","raw_affiliation_strings":["Dept. of Computer Science, Lund University, Lund, Sweden, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Lund University, Lund, Sweden, --- Select a Country ---","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"94","last_page":"105"},"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.9998999834060669,"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.9998999834060669,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9932000041007996,"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.9894999861717224,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.742533802986145},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6678757667541504},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6655789017677307},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5595768094062805},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.5364314913749695},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.48490244150161743},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.42192697525024414},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.41295456886291504},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38595038652420044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22095349431037903},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.11909249424934387}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.742533802986145},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6678757667541504},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6655789017677307},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5595768094062805},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.5364314913749695},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.48490244150161743},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.42192697525024414},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.41295456886291504},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38595038652420044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22095349431037903},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.11909249424934387},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.5220/0011785100003396","is_oa":true,"landing_page_url":"http://dx.doi.org/10.5220/0011785100003396","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:monash.edu:openaire/507afd20-fbac-4a89-bc62-0ae79dfd93ab","is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/507afd20-fbac-4a89-bc62-0ae79dfd93ab","pdf_url":"https://researchmgt.monash.edu/ws/files/579923001/568172242_oa.pdf","source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:monash.edu:publications/507afd20-fbac-4a89-bc62-0ae79dfd93ab","is_oa":true,"landing_page_url":"https://research.monash.edu/files/579923001/568172242_oa.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:lup.lub.lu.se:87f74cef-2c31-4ff3-9a04-3062076de719","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/87f74cef-2c31-4ff3-9a04-3062076de719","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"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":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"doi:10.5220/0011785100003396","is_oa":true,"landing_page_url":"http://dx.doi.org/10.5220/0011785100003396","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322327","display_name":"Knut och Alice Wallenbergs Stiftelse","ror":"https://ror.org/004hzzk67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W92396308","https://openalex.org/W1489119587","https://openalex.org/W1985830248","https://openalex.org/W1988119270","https://openalex.org/W2008502375","https://openalex.org/W2012437673","https://openalex.org/W2030061985","https://openalex.org/W2042770989","https://openalex.org/W2045954696","https://openalex.org/W2050357215","https://openalex.org/W2075041695","https://openalex.org/W2078638564","https://openalex.org/W2082432101","https://openalex.org/W2083276257","https://openalex.org/W2109917971","https://openalex.org/W2128970394","https://openalex.org/W2144045033","https://openalex.org/W2181059453","https://openalex.org/W2325283512","https://openalex.org/W2339321571","https://openalex.org/W2424318082","https://openalex.org/W2603290257","https://openalex.org/W2623629395","https://openalex.org/W2792630828","https://openalex.org/W2899284147","https://openalex.org/W2908740892","https://openalex.org/W2921924300","https://openalex.org/W2946470972","https://openalex.org/W2952367389","https://openalex.org/W2981432975","https://openalex.org/W3011813096","https://openalex.org/W3041012824","https://openalex.org/W3105621768","https://openalex.org/W3152006781","https://openalex.org/W3175423153","https://openalex.org/W3181413152","https://openalex.org/W4212774775"],"related_works":["https://openalex.org/W2375684291","https://openalex.org/W2354676191","https://openalex.org/W3188646203","https://openalex.org/W2132461435","https://openalex.org/W2392101695","https://openalex.org/W2361943787","https://openalex.org/W1992534732","https://openalex.org/W4312532478","https://openalex.org/W2411789204","https://openalex.org/W2271841533"],"abstract_inverted_index":{"The":[0,67],"assignment":[1],"of":[2,11,35,83,100,139],"products":[3],"to":[4,56,73,80,89,104],"storage":[5],"locations":[6],"significantly":[7],"impacts":[8],"the":[9,57,81,84,154],"efficiency":[10],"warehouse":[12],"operations.":[13],"We":[14,141],"propose":[15],"a":[16,20,32,45,143],"multi-phase":[17],"optimizer":[18],"for":[19,93],"Storage":[21],"Location":[22],"Assignment":[23],"Problem":[24],"(SLAP)":[25],"where":[26],"solution":[27,95],"quality":[28],"is":[29,69],"based":[30],"on":[31,153],"distance":[33,127],"estimate":[34],"future-forecasted":[36],"order":[37],"picking.":[38],"Candidate":[39],"assignments":[40,59],"are":[41,52,87],"first":[42],"sampled":[43],"using":[44],"Markov":[46],"Chain":[47],"accept/reject":[48],"method.":[49],"Future-forecasted":[50],"pick-rounds":[51],"then":[53],"modified":[54],"according":[55],"candidate":[58],"and":[60,71,123,149],"solved":[61],"as":[62,109,111,132,134],"Traveling":[63],"Salesman":[64],"Problems":[65],"(TSP).":[66],"model":[68],"graph-based":[70],"generalizes":[72],"any":[74],"obstacle":[75],"layout":[76],"in":[77],"2D.":[78],"Due":[79],"intractability":[82],"SLAP,":[85],"methods":[86,120],"proposed":[88],"speed":[90],"up":[91],"search":[92],"strong":[94,107],"candidates.":[96],"These":[97],"include":[98],"usage":[99],"fast":[101],"function":[102],"approximation":[103],"find":[105],"potentially":[106],"samples,":[108],"well":[110],"restarts":[112],"from":[113],"local":[114],"minima.":[115],"Results":[116],"show":[117],"that":[118,124],"these":[119],"improve":[121],"performance":[122],"total":[125],"travel":[126],"can":[128],"be":[129],"reduced":[130],"by":[131],"much":[133],"30%":[135],"within":[136],"8":[137],"hours":[138],"CPU-time.":[140],"share":[142],"public":[144],"repository":[145],"with":[146],"SLAP":[147],"instances":[148],"corresponding":[150],"benchmark":[151],"results":[152],"generalizable":[155],"TSPLIB":[156],"format.":[157]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}