New Heuristic Rounding Approaches to the Quadratic Assignment Problem

TL;DR

This paper introduces a novel heuristic rounding method with a parametric optimization model for the quadratic assignment problem, demonstrating improved efficiency through numerical experiments.

Contribution

It extends existing rounding approaches to a parametric model and identifies a near-optimal parameter, enhancing solution quality for quadratic assignment problems.

Findings

The new heuristic improves solution quality.

Numerical experiments confirm the method's efficiency.

A near-optimal parameter is identified.

Abstract

Quadratic assignment problem is one of the great challenges in combinatorial optimization. It has many applications in Operations research and Computer Science. In this paper, the author extends the most-used rounding approach to a one-parametric optimization model for the quadratic assignment problems. A near-optimum parameter is also predestinated. The numerical experiments confirm the efficiency.