A
Alfonsas Misevičius
Researcher at Kaunas University of Technology
Publications - 49
Citations - 871
Alfonsas Misevičius is an academic researcher from Kaunas University of Technology. The author has contributed to research in topics: Quadratic assignment problem & Tabu search. The author has an hindex of 15, co-authored 49 publications receiving 812 citations.
Papers
More filters
Journal ArticleDOI
A tabu search algorithm for the quadratic assignment problem
TL;DR: A new version of the tabu search algorithm for the well-known problem, the quadratic assignment problem (QAP), with an efficient use of mutations applied to the best solutions found so far.
Journal ArticleDOI
An Improved Hybrid Genetic Algorithm: New Results for the Quadratic Assignment Problem
TL;DR: The results obtained from the numerous experiments on different QAP instances from the instances library QAPLIB show that the proposed algorithm appears to be superior to other modem heuristic approaches that are among the best algorithms for the QAP.
Journal ArticleDOI
A Modified Simulated Annealing Algorithm for the Quadratic Assignment Problem
TL;DR: A modified simulated annealing algorithm for the QAP - M-SA-QAP with an advanced formula of calculation of the initial and final temperatures, as well as an original cooling schedule with oscillation, i.e., periodical decreasing and increasing of the temperature.
Journal ArticleDOI
Genetic algorithm hybridized with ruin and recreate procedure: application to the quadratic assignment problem
TL;DR: This paper has applied this new hybrid strategy to the well-known combinatorial optimization problem, the quadratic assignment problem (QAP), and shows that the proposed algorithm belongs to the best heuristics for the QAP.
Journal ArticleDOI
Enhancing the performance of hybrid genetic algorithms by differential improvement
Zvi Drezner,Alfonsas Misevičius +1 more
TL;DR: A differential improvement modification to Hybrid Genetic Algorithms is proposed to perform more extensive improvement algorithms on higher quality solutions and yielded six new best known solutions to benchmark quadratic assignment problems.