The Rank-One Quadratic Assignment Problem

Author:

Wang Yang1ORCID,Yang Wei1,Punnen Abraham P.2,Tian Jingbo3,Yin Aihua4,Lü Zhipeng5ORCID

Affiliation:

1. School of Management, Northwestern Polytechnical University, 710072 Xi’an, China;

2. Department of Mathematics, Simon Fraser University Surrey, Surrey, British Columbia V3T 0A3, Canada;

3. Department of Civil Engineering and Applied Mechanics, McGill University, Montreal, Quebec H3A 0G4, Canada;

4. School of Software and Communication Engineering, Jiangxi University of Finance and Economics, 330032 Nanchang, China;

5. School of Computer Science and Technology, Huazhong University of Science and Technology, 430074 Wuhan, China

Abstract

In this paper, we study the quadratic assignment problem with a rank-one cost matrix (QAP-R1). Four integer-programming formulations are introduced of which three are assumed to have partial integer data. Unlike the standard quadratic assignment problem, some of our formulations can solve reasonably large instances of QAP-R1 with impressive running times and are faster than some metaheuristics. Pairwise relative strength of the LP relaxations of these formulations are also analyzed from theoretical and experimental points of view. Finally, we present a new metaheuristic algorithm to solve QAP-R1 along with its computational analysis. Our study offers the first systematic experimental analysis of integer-programming models and heuristics for QAP-R1. The benchmark instances with various characteristics generated for our study are made available to the public for future research work. Some new polynomially solvable special cases are also introduced. Summary of Contribution: This paper aims to advance our knowledge and ability in solving an important special case of the quadratic assignment problem. It shows how to exploit inherent properties of an optimization problem to achieve computational advantages, a strategy that was followed by researchers in model building and algorithm developments for decades. Our computational results attest to this time-tested general philosophy. The paper presents the first systematic computational study of the rank one quadratic assignment problem, along with new mathematical programming models and complexity analysis. We believe the theoretical and computational results of this paper will inspire further research on the topic and will be of significant value to practitioners using rank one quadratic assignment models.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

General Engineering

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. MS-CLS: An Effective Partitioning and Placement Metaheuristic for Wafer-Scale Physics Modeling;IEEE Transactions on Emerging Topics in Computational Intelligence;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3