Hybrid PSO-TS Approach for solving the Quadratic Three-Dimensional Assignment Problem

EasyChair Preprint 2801

Abstract

The quadratic three-dimensional assignment prob- lem (Q3AP) is a generalization of the well-known quadratic assignment problem (QAP). Unlike QAP which has been exten- sively studied by the combinatorial optimization community, few works have been devoted to the resolution of the Q3AP which is proved to be an NP-hard problem. In this paper, a particle swarm optimization algorithm hybridized with a tabu search is presented to solve the quadratic three-dimensional assignment problem.

Keyphrases: Hybridization, Operational Research, PSO algorithm, Particle Swarm Optimization (PSO), Quadratic Assignment Problem, Quadratic Three-Dimensional Assignment Problem (Q3AP), Quadratic assignment problem (QAP), Tabu Search Algorithm (TS), known quadratic assignment problem, swarm optimization algorithm

@booklet{EasyChair:2801,
  author    = {Ait Abderrahim Imene and Loukil Lakhdar},
  title     = {Hybrid PSO-TS Approach for solving the Quadratic Three-Dimensional Assignment Problem},
  howpublished = {EasyChair Preprint 2801},
  year      = {EasyChair, 2020}}