Statistical bound of genetic solutions to quadratic assignment problems
2015 (English)Report (Other academic)
Quadratic assignment problems (QAPs) are commonly solved by heuristic methods, where the optimum is sought iteratively. Heuristics are known to provide good solutions but the quality of the solutions, i.e., the confidence interval of the solution is unknown. This paper uses statistical optimum estimation techniques (SOETs) to assess the quality of Genetic algorithm solutions for QAPs. We examine the functioning of different SOETs regarding biasness, coverage rate and length of interval, and then we compare the SOET lower bound with deterministic ones. The commonly used deterministic bounds are confined to only a few algorithms. We show that, the Jackknife estimators have better performance than Weibull estimators, and when the number of heuristic solutions is as large as 100, higher order JK-estimators perform better than lower order ones. Compared with the deterministic bounds, the SOET lower bound performs significantly better than most deterministic lower bounds and is comparable with the best deterministic ones.
Place, publisher, year, edition, pages
Borlänge: Högskolan Dalarna, 2015. , 20 p.
Working papers in transport, tourism, information technology and microdata analysis, ISSN 1650-5581 ; 2015:02
quadratic assignment problem, genetic algorithm, Jack-knife, discrete optimization, extreme value theory
Research subject Komplexa system - mikrodataanalys
IdentifiersURN: urn:nbn:se:du-17034OAI: oai:DiVA.org:du-17034DiVA: diva2:791806