Name
Abstract | ||
|---|---|---|
The multidimensional assignment problem (MAP), also known as multi-index assignment problem, is a natural extension of the assignment problem. A MAP deals with the question of how to assign elements from s disjoint sets with n
<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub>
,...,n
<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub>
items on each. A MAP with s dimensions is called a sAP. Local search heuristics and Memetic algorithms have been proven to be the most effective techniques to solve MAP. In this work we use an exact technique that outperforms some local searches and Memetic algorithms on several instances of MAP. Then, we design a heuristic that uses repeatedly our exact technique in order to provide high quality solutions for harder types of instances of MAP. We perform an experimental evaluation of our exact technique and of our heuristic and we show its effectiveness against more complex local searches and some Memetic algorithms for MAP. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/ICEEE.2018.8533978 | 2018 15th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE) |
Keywords | Field | DocType |
multidimensional assignment problem,exact technique,local search,memetic algorithm | Memetic algorithm,Heuristic,Mathematical optimization,Disjoint sets,Computer science,Theoretical computer science,Heuristics,Assignment problem,Linear programming,Local search (optimization),Memetics | Conference |
ISBN | Citations | PageRank |
978-1-5386-7034-7 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlos E. Valencia | 1 | 11 | 4.99 |
| Carlos A. Alfaro | 2 | 7 | 2.63 |
| Francisco Javier Zaragoza Martínez | 3 | 0 | 1.35 |
| Marcos Cesar Vargas Magana | 4 | 0 | 0.34 |
| Sergio Luis Pérez-Pérez | 5 | 0 | 0.34 |