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

DOI10.1016/j.cor.2016.07.006zbMath1391.90548OpenAlexW2473397157MaRDI QIDQ1652173

Naoki Katoh, Hiroyuki Morita, Xavier Gandibleux

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.006

zbMATH Keywords

multiobjective optimizationmetaheuristiclinear assignment problemheterogeneous functions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ A heuristic two-phase solution approach for the multi-objective dial-a-ride problem

Uses Software

• Tabu search

Cites Work

• Bi-criteria assignment problem
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Two phase algorithms for the bi-objective assignment problem
• Performance of the MOSA method for the bicriteria assignment problem
• The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results
• Assignment Problems
• Zur Lösung des Zuordnungsproblems bei zwei Zielgrößen
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Multicriteria Optimization
• Static and Dynamic Assignment Models with Multiple Objectives, and Some Remarks on Organization Design
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item