| Article ID: | iaor20023443 |
| Country: | Netherlands |
| Volume: | 6 |
| Issue: | 3 |
| Start Page Number: | 295 |
| End Page Number: | 310 |
| Publication Date: | Aug 2000 |
| Journal: | Journal of Heuristics |
| Authors: | Teghem J., Tuyttens D., Fortemps Ph., Nieuwenhuyze K. Van |
| Keywords: | optimization: simulated annealing, programming: multiple criteria |
The classical linear assignment problem is considered with two objectives. The aim is to generate the set of efficient solutions. An exact method is first developed based on the two-phase approach. In the second phase a new upper bound is proposed so that larger instances can be solved exactly. The so-called MOSA (Multi-Objective Simulated Annealing) is then recalled; its efficiency is improved by initialization with a greedy approach. Its results are compared to those obtained with the exact method. Extensive numerical experiments have been realized to measure the performance of the MOSA method.