Distributed Multistart Hybrid Iterative Tabu Search

Abstract

The quadratic assignment problem (QAP) is one of the most studied NP-hard problems. It is a problem known for its computational cost which makes it a good candidate for parallel and distributed design. In this paper, we propose a new Distributed Multistart Hybrid Iterative Tabu Search (DMHITS). This algorithm follows the design of the algorithmic level… (More)
DOI: 10.1109/SMC.2015.342

Topics

2 Figures and Tables

Slides referencing similar topics