Abstract: A request is received for an answer to a problem comprising optimum assignment of a plurality of first entities to a plurality of second entities. A particle swarm optimization (PSO) is defined associated with a swarm comprising a plurality of particles, each particle location in the swarm representing an assignment of a first entity to a second entity. The PSO determines a set of solutions as a potential answer to the optimum assignment. A cost matrix is configured to analyze each solution PSO in accordance with a Hungarian algorithm, is configured to optimize at least one constraint associated with the pluralities of first and second entities and is applied to the set of PSO solutions generated to determine a cost score for each respective particle. The solution having the particle with best cost score is selected to be an optimized global best particle location for the next PSO iteration.