A New Metric to Measure Distances Between Solutions to the Quadratic Assignment Problem

Andreas Beham; Erik Pitzer; Michael Affenzeller

doi:10.1109/LINDI.2011.6031161

A New Metric to Measure Distances Between Solutions to the Quadratic Assignment Problem

Andreas Beham, Erik Pitzer, Michael Affenzeller

Research output: Chapter in Book/Report/Conference proceedings › Conference contribution

3 Citations (Scopus)

Abstract

Solutions to the Quadratic Assignment Problem (QAP) can be compared with each other in several ways. In this work a new distance metric for measuring the distance respectively similarity between two solutions will be introduced. Such a metric is useful in measuring the performance of heuristic optimization algorithms and generally in the analysis of the QAP's fitness landscape. The new metric is described, compared to the most commonly used metric and evaluated on a number of problem instances. The correlation between the fitness distance and the solution distance can be improved in several problem instances providing a different and more interesting picture on algorithm performance.

Original language	English
Title of host publication	LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings
Pages	45-50
Number of pages	6
DOIs	https://doi.org/10.1109/LINDI.2011.6031161
Publication status	Published - 2011
Event	3rd IEEE International Symposium on Logistics and Industrial Informatics (LINDI 2011) - Budapest, Hungary Duration: 25 Aug 2011 → 27 Aug 2011 http://conf.uni-obuda.hu/lindi2011/

Publication series

Name	LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings

Conference

Conference	3rd IEEE International Symposium on Logistics and Industrial Informatics (LINDI 2011)
Country/Territory	Hungary
City	Budapest
Period	25.08.2011 → 27.08.2011
Internet address	http://conf.uni-obuda.hu/lindi2011/

Keywords

distance metric
fitness landscape
quadratic assignment problem

Access to Document

10.1109/LINDI.2011.6031161

Cite this

Beham, A., Pitzer, E., & Affenzeller, M. (2011). A New Metric to Measure Distances Between Solutions to the Quadratic Assignment Problem. In LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings (pp. 45-50). Article 6031161 (LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings). https://doi.org/10.1109/LINDI.2011.6031161

@inproceedings{1794db0d219642839be1c1aba9ef7447,

title = "A New Metric to Measure Distances Between Solutions to the Quadratic Assignment Problem",

abstract = "Solutions to the Quadratic Assignment Problem (QAP) can be compared with each other in several ways. In this work a new distance metric for measuring the distance respectively similarity between two solutions will be introduced. Such a metric is useful in measuring the performance of heuristic optimization algorithms and generally in the analysis of the QAP's fitness landscape. The new metric is described, compared to the most commonly used metric and evaluated on a number of problem instances. The correlation between the fitness distance and the solution distance can be improved in several problem instances providing a different and more interesting picture on algorithm performance.",

keywords = "distance metric, fitness landscape, quadratic assignment problem",

author = "Andreas Beham and Erik Pitzer and Michael Affenzeller",

year = "2011",

doi = "10.1109/LINDI.2011.6031161",

language = "English",

isbn = "9781457718410",

series = "LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings",

pages = "45--50",

booktitle = "LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings",

note = "3rd IEEE International Symposium on Logistics and Industrial Informatics (LINDI 2011) ; Conference date: 25-08-2011 Through 27-08-2011",

url = "http://conf.uni-obuda.hu/lindi2011/",

}

Beham, A, Pitzer, E & Affenzeller, M 2011, A New Metric to Measure Distances Between Solutions to the Quadratic Assignment Problem. in LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings., 6031161, LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings, pp. 45-50, 3rd IEEE International Symposium on Logistics and Industrial Informatics (LINDI 2011), Budapest, Hungary, 25.08.2011. https://doi.org/10.1109/LINDI.2011.6031161

A New Metric to Measure Distances Between Solutions to the Quadratic Assignment Problem. / Beham, Andreas; Pitzer, Erik ; Affenzeller, Michael.
LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings. 2011. p. 45-50 6031161 (LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings).

Research output: Chapter in Book/Report/Conference proceedings › Conference contribution

TY - GEN

T1 - A New Metric to Measure Distances Between Solutions to the Quadratic Assignment Problem

AU - Beham, Andreas

AU - Pitzer, Erik

AU - Affenzeller, Michael

PY - 2011

Y1 - 2011

N2 - Solutions to the Quadratic Assignment Problem (QAP) can be compared with each other in several ways. In this work a new distance metric for measuring the distance respectively similarity between two solutions will be introduced. Such a metric is useful in measuring the performance of heuristic optimization algorithms and generally in the analysis of the QAP's fitness landscape. The new metric is described, compared to the most commonly used metric and evaluated on a number of problem instances. The correlation between the fitness distance and the solution distance can be improved in several problem instances providing a different and more interesting picture on algorithm performance.

AB - Solutions to the Quadratic Assignment Problem (QAP) can be compared with each other in several ways. In this work a new distance metric for measuring the distance respectively similarity between two solutions will be introduced. Such a metric is useful in measuring the performance of heuristic optimization algorithms and generally in the analysis of the QAP's fitness landscape. The new metric is described, compared to the most commonly used metric and evaluated on a number of problem instances. The correlation between the fitness distance and the solution distance can be improved in several problem instances providing a different and more interesting picture on algorithm performance.

KW - distance metric

KW - fitness landscape

KW - quadratic assignment problem

UR - http://www.scopus.com/inward/record.url?scp=80555149927&partnerID=8YFLogxK

U2 - 10.1109/LINDI.2011.6031161

DO - 10.1109/LINDI.2011.6031161

M3 - Conference contribution

SN - 9781457718410

T3 - LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings

SP - 45

EP - 50

BT - LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings

T2 - 3rd IEEE International Symposium on Logistics and Industrial Informatics (LINDI 2011)

Y2 - 25 August 2011 through 27 August 2011

ER -

Beham A, Pitzer E , Affenzeller M. A New Metric to Measure Distances Between Solutions to the Quadratic Assignment Problem. In LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings. 2011. p. 45-50. 6031161. (LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings). doi: 10.1109/LINDI.2011.6031161

A New Metric to Measure Distances Between Solutions to the Quadratic Assignment Problem

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this