An Exploration of GA, DE and PSO in Assignment Problems

Abstract

The optimum solution of assignment problem might not be found by using exact method for a large size assignment problem. The heuristic methods that will take acceptable time should be introduced to solve the problem. The common and well-known methods that are used in this study are genetic algorithm (GA), differential evolution (DE), and Particle Swarm Optimization (PSO). The goal of these three algorithms is the best solutions with appropriate time. We believe one of these three algorithms stands out from the others. We will focus on the best solution and shortest time consuming. In this study, we will classify our study into 3 parts. Firstly, we investigate similarities and differences of each heuristic. Secondly, test our theory by using the same assignment cost matrix. Finally, we compare the results and make conclusions. However, different problem might get different results and conclusions.