Effective anytime algorithm for multiobjective combinatorial optimization problems

DOI10.1016/J.INS.2021.02.074MaRDI QIDQ6086280zbMATH OpenOpenAlexFDO

Authors Miguel Ángel Domínguez-Ríos, Francisco Chicano, Enrique Alba

Publication date 9 November 2023

Published in Information Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.ins.2021.02.074

zbMATH Keywords

anytime algorithmmultiobjective combinatorial optimizationwell-spread non-dominated points

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Multi-objective and goal programming (90C29)

Recommendations

• A model of anytime algorithm performance for bi-objective optimization
• Pareto local search algorithms for anytime bi-objective optimization
• Anytime Pareto local search
• Automatically improving the anytime behaviour of optimisation algorithms
• Improving the anytime behavior of two-phase local search

Cites work

• K-PPM: a new exact method to solve multi-objective combinatorial optimization problems
• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
• An algorithm for the multiple objective integer linear programming problem
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs
• Automatically improving the anytime behaviour of optimisation algorithms
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• Diversity Maximization Approach for Multiobjective Optimization
• Efficient computation of the search region in multi-objective optimization
• Finding a representative nondominated set for multi-objective mixed integer programs
• Finding all nondominated points of multi-objective integer programs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 915988 (Why is no real title available?)
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• Multi-objective integer programming: an improved recursive algorithm
• Multicriteria Optimization
• On the representation of the search region in multi-objective optimization
• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations

Cited in

(3)

• Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
• Generating representative sets for multiobjective discrete optimization problems with specified coverage errors
• Engineering and evaluating multi-objective pseudo-Boolean optimizers

This page was built for publication: Effective anytime algorithm for multiobjective combinatorial optimization problems

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