A hybrid method for solving the multi-objective assignment problem

DOI10.1007/s10852-010-9123-3zbMath1230.90165OpenAlexW2048696354MaRDI QIDQ656068

Chahrazad Adiche, Méziane Aïder

Publication date: 26 January 2012

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-010-9123-3

zbMATH Keywords

combinatorial optimizationassignment problemmulti-objective branch and bound methodmulti-objective simulated annealing

Mathematics Subject Classification ID

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

Related Items

MOBILE SECONDARY IDEAL POINT AND MOMA-PLUS METHOD IN TWO-PHASE METHOD FOR SOLVING BI-OBJECTIVE ASSIGNMENT PROBLEMS

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Bi-criteria assignment problem
• Two phase algorithms for the bi-objective assignment problem
• Heuristics for a bidding problem
• Performance of the MOSA method for the bicriteria assignment problem
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• MOSA method: a tool for solving multiobjective combinatorial optimization problems