{"id":"https://openalex.org/W3158303553","doi":"https://doi.org/10.7148/2021-0016","title":"Evaluation Of Algorithm Performance For Simulated Square And Non-Square Logistic Assignment Problems","display_name":"Evaluation Of Algorithm Performance For Simulated Square And Non-Square Logistic Assignment Problems","publication_year":2021,"publication_date":"2021-04-29","ids":{"openalex":"https://openalex.org/W3158303553","doi":"https://doi.org/10.7148/2021-0016","mag":"3158303553"},"language":"en","primary_location":{"id":"doi:10.7148/2021-0016","is_oa":false,"landing_page_url":"https://doi.org/10.7148/2021-0016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ECMS 2021 Proceedings edited by Khalid Al-Begain, Mauro Iacono, Lelio Campanile, Andrzej Bargiela","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/A5037076175","display_name":"Maximilian Selmair","orcid":"https://orcid.org/0000-0002-9158-4480"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maximilian Selmair","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066710731","display_name":"Sascha Hamzehi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sascha Hamzehi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5075650904","display_name":"Klaus-Juergen Meier","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Klaus-Juergen Meier","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05515651,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"16","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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.9993000030517578,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T12546","display_name":"Smart Parking Systems Research","score":0.9957000017166138,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7074378728866577},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5840086936950684},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.5764758586883545},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5621001720428467},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5568714737892151},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5283663272857666},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5166738033294678},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.47969362139701843},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4493558406829834},{"id":"https://openalex.org/keywords/square","display_name":"Square (algebra)","score":0.4405019283294678},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4328480064868927},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4315902590751648},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.4204452931880951},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32311996817588806},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.26790860295295715}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7074378728866577},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5840086936950684},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.5764758586883545},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5621001720428467},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5568714737892151},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5283663272857666},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5166738033294678},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.47969362139701843},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4493558406829834},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.4405019283294678},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4328480064868927},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4315902590751648},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.4204452931880951},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32311996817588806},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26790860295295715},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.7148/2021-0016","is_oa":false,"landing_page_url":"https://doi.org/10.7148/2021-0016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ECMS 2021 Proceedings edited by Khalid Al-Begain, Mauro Iacono, Lelio Campanile, Andrzej Bargiela","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":35,"referenced_works":["https://openalex.org/W37994088","https://openalex.org/W124429991","https://openalex.org/W1494735819","https://openalex.org/W1498919107","https://openalex.org/W1505177662","https://openalex.org/W1972978715","https://openalex.org/W1973907457","https://openalex.org/W1978264569","https://openalex.org/W1986940512","https://openalex.org/W1988832667","https://openalex.org/W1989179252","https://openalex.org/W2013754286","https://openalex.org/W2020267722","https://openalex.org/W2029078304","https://openalex.org/W2041786457","https://openalex.org/W2042453802","https://openalex.org/W2047281923","https://openalex.org/W2054420170","https://openalex.org/W2056393887","https://openalex.org/W2058233069","https://openalex.org/W2058494699","https://openalex.org/W2065295938","https://openalex.org/W2068706708","https://openalex.org/W2073532769","https://openalex.org/W2080488179","https://openalex.org/W2091299439","https://openalex.org/W2092921338","https://openalex.org/W2124852572","https://openalex.org/W2131075792","https://openalex.org/W2137019587","https://openalex.org/W2139688603","https://openalex.org/W2141461755","https://openalex.org/W2157529519","https://openalex.org/W2222512263","https://openalex.org/W2550952896"],"related_works":["https://openalex.org/W3091931714","https://openalex.org/W2793371964","https://openalex.org/W2937059810","https://openalex.org/W2153234111","https://openalex.org/W1586515950","https://openalex.org/W2067336310","https://openalex.org/W2572498786","https://openalex.org/W2002489438","https://openalex.org/W3092222000","https://openalex.org/W2565453737"],"abstract_inverted_index":{"The":[0,119,177],"optimal":[1,88,132,138,169,243],"allocation":[2],"of":[3,9,15,136,149,202,216,250],"transportation":[4],"tasks":[5],"to":[6,34,42,64,78,101,130,145,162,167,189,230],"a":[7,24,39],"fleet":[8],"vehicles,":[10],"especially":[11],"for":[12,116,235,255,266],"large-scale":[13],"systems":[14],"more":[16],"than":[17],"20":[18],"Autonomous":[19],"Mobile":[20],"Robots":[21],"(AMRs),":[22],"remains":[23],"major":[25],"challenge":[26],"in":[27,30,134,153,157,160,185,198,248],"logistics.":[28],"Optimal":[29],"this":[31,66,80,83],"context":[32],"refers":[33],"two":[35],"criteria:":[36],"how":[37],"close":[38],"result":[40],"is":[41,228,253],"the":[43,49,96,137,164,168,191,199,203,223,232,262],"best":[44,233],"achievable":[45],"objective":[46,139],"value":[47],"and":[48,95,112,155,213,238,260],"shortest":[50],"possible":[51],"computational":[52,175,251],"time.":[53,176],"Operations":[54],"research":[55],"has":[56,72],"provided":[57],"different":[58,217],"methods":[59,77,89,105,183],"that":[60,181,222],"can":[61],"be":[62,231],"applied":[63,76,144],"solve":[65,79,190],"assignment":[67,192,240],"problem.":[68,81],"Our":[69],"literature":[70],"review":[71],"revealed":[73],"six":[74],"commonly":[75],"In":[82],"paper,":[84],"we":[85,219],"compared":[86],"three":[87,102,103],"(Integer":[90],"Linear":[91],"Programming,":[92],"Hungarian":[93],"Method":[94,111,115,265],"Jonker":[97,224],"Volgenant":[98,225],"Castanon":[99,226],"algorithm)":[100],"heuristic":[104],"(Greedy":[106],"Search":[107],"algorithm,":[108],"Vogel\u2019s":[109,113,263],"Approximation":[110,114,264],"non-quadratic":[117,214,239,257,267],"Matrices).":[118],"latter":[120],"group":[121],"generally":[122],"yield":[123],"results":[124,133,179,208],"faster,":[125],"but":[126],"were":[127],"not":[128],"developed":[129],"provide":[131],"terms":[135,249],"value.":[140],"Every":[141],"method":[142,234],"was":[143],"20.000":[146],"randomised":[147],"samples":[148],"matrices,":[150],"which":[151],"differed":[152],"scale":[154],"configuration,":[156],"simulation":[158,178],"experiments":[159],"order":[161],"determine":[163],"results\u2019":[165],"proximity":[166],"solution":[170],"as":[171,173,195,197],"well":[172,196],"their":[174,186],"demonstrate":[180],"all":[182],"vary":[184],"time":[187,252],"needed":[188],"problem":[193],"scenarios":[194],"respective":[200],"quality":[201],"solution.":[204],"Based":[205],"on":[206],"these":[207],"yielded":[209],"by":[210],"computing":[211],"quadratic":[212,237],"matrices":[215,258],"scales,":[218],"have":[220],"concluded":[221],"algorithm":[227],"deemed":[229],"solving":[236],"problems":[241],"with":[242],"precision.":[244],"However,":[245],"if":[246],"performance":[247],"prioritised":[254],"large":[256],"(50\u00d7300":[259],"larger),":[261],"Matrices":[268],"generates":[269],"faster":[270],"approximated":[271],"solutions.":[272]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}