Solve some benchmark instances
-
In this paper, a revised version of the discrete particle swarm optimization algorithm is proposed for solving Quadratic Assignment Problems (QAP). Instead of using the general velocity and position update procedures in particle swarm optimization algorithms, four different possible positions are found out for each particle and the best among them is accepted as the updated position.
18p toritori 11-05-2020 10 0 Download
-
The first solution approach is based on a non-dominated sorting genetic algorithm improved by a local search heuristic and the second one is the GRASP algorithm (Greedy Randomised Adaptive Search Procedure) with iterated local search heuristics. They are tested on theoretical and real case benchmark instances and compared with the standard NSGA-II. Results are analysed and the efficiency of algorithms is discussed using some performance metrics.
22p toritori 11-05-2020 15 0 Download