Kernels of Mallows Models under the Hamming Distance for solving the Quadratic Assignment Problem

10/19/2019
by   Etor Arza, et al.
0

The Quadratic Assignment Problem (QAP) is a well-known permutation-based combinatorial optimization problem with real applications in industrial and logistics environments. Motivated by the challenge that this NP-hard problem represents, it has captured the attention of the evolutionary computation community for decades. As a result, a large number of algorithms have been proposed to optimize this algorithm. Among these, exact methods are only able to solve instances of size n<40, and thus, many heuristic and metaheuristic methods have been applied to the QAP. In this work, we follow this direction by approaching the QAP through Estimation of Distribution Algorithms (EDAs). Particularly, a non-parametric distance-based exponential probabilistic model is used. Based on the analysis of the characteristics of the QAP, and previous work in the area, we introduce Kernels of Mallows Model under the Hamming distance to the context of EDAs. Conducted experiments point out that the performance of the proposed algorithm in the QAP is superior to (i) the classical EDAs adapted to deal with the QAP, and also (ii) to the specific EDAs proposed in the literature to deal with permutation problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/05/2023

Doubly Stochastic Matrix Models for Estimation of Distribution Algorithms

Problems with solutions represented by permutations are very prominent i...
research
05/10/2020

Implementation of iterative local search (ILS) for the quadratic assignment problem

The quadratic assignment problem (QAP) is one of the hardest NP-hard pro...
research
11/05/2011

An efficient implementation of the simulated annealing heuristic for the quadratic assignment problem

The quadratic assignment problem (QAP) is one of the most difficult comb...
research
09/28/2021

Multiple contractions of permutation arrays

Given a permutation σ on n symbols {0, 1, …, n-1} and an integer 1 ≤ m ≤...
research
10/03/2019

A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT

X3SAT is the problem of whether one can satisfy a given set of clauses w...
research
12/16/2020

Solving the Travelling Thief Problem based on Item Selection Weight and Reverse Order Allocation

The Travelling Thief Problem (TTP) is a challenging combinatorial optimi...
research
07/21/2011

Local Optima Networks of the Quadratic Assignment Problem

Using a recently proposed model for combinatorial landscapes, Local Opti...

Please sign up or login with your details

Forgot password? Click here to reset