Performance of the MOSA method for the bicriteria assignment problem

DOI10.1023/A:1009670112978MaRDI QIDQ2567886zbMATH OpenOpenAlexFDO

Authors Philippe Fortemps, K. Van Nieuwenhuyze, Daniel Tuyttens, Jacques Teghem

Publication date 13 October 2005

Published in Journal of Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009670112978

zbMATH Keywords

assignment problemmulti-objective programmingsimulated annealing

Mathematics Subject Classification ID

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

Recommendations

• A hybrid method for solving the multi-objective assignment problem
• The bicriterion multimodal assignment problem: introduction, analysis, and experimental results
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
• Two phase algorithms for the bi-objective assignment problem

Cited in

(25)

• An interactive heuristic method for multi-objective combinatorial optimization
• A population-based algorithm for solving linear assignment problems with two objectives
• Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
• Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
• Algorithm robust for the bicriteria discrete optimization problem
• A bi-criteria approach for the data association problem
• Two phase algorithms for the bi-objective assignment problem
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
• A multi-period machine assignment problem
• A criterion space search algorithm for biobjective integer programming: the balanced box method
• The bicriterion multimodal assignment problem: introduction, analysis, and experimental results
• Cross entropy for multiobjective combinatorial optimization problems with linear relaxations
• Resource allocation in multi-class dynamic PERT networks with finite capacity
• Nature-Inspired Particle Mechanics Algorithm for Multi-Objective Optimization
• MOBILE SECONDARY IDEAL POINT AND MOMA-PLUS METHOD IN TWO-PHASE METHOD FOR SOLVING BI-OBJECTIVE ASSIGNMENT PROBLEMS
• An interactive approach for biobjective integer programs under quasiconvex preference functions
• A hybrid method for solving the multi-objective assignment problem
• Augmenting bi-objective branch and bound by scalarization-based information
• Grouping strategies on two-phase methods for bi-objective combinatorial optimization
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• Considering manufacturing cost and scheduling performance on a CNC turning machine
• A multi-objective production scheduling case study solved by simulated annealing
• Multi-start and path relinking methods to deal with multiobjective Knapsack problems
• Ant algorithms and simulated annealing for multicriteria dynamic programming
• Using support vector machines to learn the efficient set in multiple objective discrete optimization

This page was built for publication: Performance of the MOSA method for the bicriteria assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2567886)