A population-based algorithm for solving linear assignment problems with two objectives - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2017

A population-based algorithm for solving linear assignment problems with two objectives

Résumé

The paper presents a population-based algorithm for computing approximations of the efficient solution set for the linear assignment problem with two objectives. This is a multiobjective metaheuristic based on the intensive use of three operators – a local search, a crossover and a path-relinking – performed on a population composed only of elite solutions. The initial population is a set of feasible solutions, where each solution is one optimal assignment for an appropriate weighted sum of two objectives. Genetic information is derived from the elite solutions, providing a useful genetic heritage to be exploited by crossover operators. An upper bound set, defined in the objective space, provides one acceptable limit for performing a local search. Results reported using referenced data sets have shown that the heuristic is able to quickly find a very good approximation of the efficient frontier, even in situation of heterogeneity of objective functions. In addition, this heuristic has two main advantages. It is based on simple easy-to-implement principles, and it does not need a parameter tuning phase.
Fichier non déposé

Dates et versions

hal-01435487 , version 1 (14-01-2017)

Identifiants

Citer

Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh. A population-based algorithm for solving linear assignment problems with two objectives. Computers and Operations Research, 2017, 79, pp.291-303. ⟨10.1016/j.cor.2016.07.006⟩. ⟨hal-01435487⟩
156 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More