Two phase algorithms for the bi-objective assignment problem

DOI10.1016/j.ejor.2006.12.054zbMath1137.90005OpenAlexW1964735783MaRDI QIDQ2455615

Xavier Gandibleux, Anthony Przybylski, Matthias Ehrgott

Publication date: 25 October 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.12.054

zbMATH Keywords

integer programming combinatorial optimization metaheuristics heuristic assignment problem efficient solution path relinking two phase method ranking algorithm Multi-objective optimisation

Mathematics Subject Classification ID

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

Related Items

Variable and large neighborhood search to solve the multiobjective set covering problem, Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems, BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM, Guided moth-flame optimiser for multi-objective optimization problems, On the representation of the search region in multi-objective optimization, The multi-objective generalized consistent vehicle routing problem, Choquet optimal set in biobjective combinatorial optimization, Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits, A population-based algorithm for solving linear assignment problems with two objectives, An efficient procedure for finding best compromise solutions to the multi-objective assignment problem, ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design, An exact algorithm for biobjective integer programming problems, Win-win match using a genetic algorithm, Two‐phase strategies for the bi‐objective minimum spanning tree problem, A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem, A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives, A hybrid method for solving the multi-objective assignment problem, Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets, Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint, On the multicriteria allocation problem, An interactive approach for biobjective integer programs under quasiconvex preference functions, Finding a representative nondominated set for multi-objective mixed integer programs, Bi-objective matchings with the triangle inequality, Discrete representation of the non-dominated set for multi-objective optimization problems using kernels, A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs, A comparison of solution strategies for biobjective shortest path problems, Two-phase Pareto local search for the biobjective traveling salesman problem, A heuristic two-phase solution approach for the multi-objective dial-a-ride problem, Multiobjective optimization for multimode transportation problems, Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations, A two-phase algorithm for the biobjective integer minimum cost flow problem, A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method, A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem, Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem, Speed-up techniques for solving large-scale biobjective TSP, A Lower Bound of the Choquet Integral Integrated Within Martins’ Algorithm

Uses Software

Tabu search

Cites Work