|
|||||
|
|
Performance of the MOSA Method for the Bicriteria Assignment Problem |
|
| Authors: | D Tuyttens J Teghem Ph Fortemps K Van Nieuwenhuyze |
| Institution: | (1) Laboratory of Mathematics and Operational Research, Faculté Polytechnique de Mons, 9, rue de Houdain, B-7000 Mons, Belgium;(2) Laboratory of Mathematics and Operational Research, Faculté, Polytechnique de Mons, 9, rue de Houdain, B-7000 Mons, Belgium;(3) Laboratory of Mathematics and Operational Research, Faculté, Polytechnique de Mons, 9, rue de Houdain, B-7000 Mons, Belgium;(4) Laboratory of Mathematics and Operational Research, Faculté, Polytechnique de Mons, 9, rue de Houdain, B-7000 Mons, Belgium |
| Abstract: | 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. |
| Keywords: | multi-objective programming assignment problem simulated annealing |
| 本文献已被 SpringerLink 等数据库收录！ | |