A hybrid method for solving the multi-objective assignment problem

摘要

Most of the well known methods for solving multi-objective combinatorial optimization problems deal with only two objectives. In this paper, we develop a metaheuristic method for solving multi-objective assignment problems with three or more objectives. This method is based on the dominance cost variant of the multi-objective simulated annealing (DCMOSA) and hybridizes neighborhood search techniques which consist of either a local search or a multi-objective branch and bound search (here the multi-objective branch and bound search is used as a local move to a fragment of a solution).