Performance of the MOSA Method for the Bicriteria Assignment Problem

Authors:
D. Tuyttens;J. Teghem;Ph. Fortemps;K. Van Nieuwenhuyze
Affiliations:
Laboratory of Mathematics and Operational Research, Faculté Polytechnique de Mons, 9, rue de Houdain, B-7000 Mons, Belgium. tuyttens@mathro.fpms.ac.be;Laboratory of Mathematics and Operational Research, Faculté, Polytechnique de Mons, 9, rue de Houdain, B-7000 Mons, Belgium. teghem@mathro.fpms.ac.be;Laboratory of Mathematics and Operational Research, Faculté, Polytechnique de Mons, 9, rue de Houdain, B-7000 Mons, Belgium. fortemps@mathro.fpms.ac.be;Laboratory of Mathematics and Operational Research, Faculté, Polytechnique de Mons, 9, rue de Houdain, B-7000 Mons, Belgium
Venue:
Journal of Heuristics
Year:
2000

Citing 1
Cited 6

Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem

Journal of Global Optimization

A meta-heuristic based on simulated annealing for solving multiple-objective problems in simulation optimization

WSC '04 Proceedings of the 36th conference on Winter simulation
The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm

Management Science
Ant algorithms and simulated annealing for multicriteria dynamic programming

Computers and Operations Research
Use of a genetic heritage for solving the assignment problem with two objectives

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
A two-phase local search for the biobjective traveling salesman problem

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Multicriteria assignment problem (selection of access points)

IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

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.