A model of anytime algorithm performance for bi-objective optimization

DOI10.1007/S10898-020-00909-9MaRDI QIDQ2022237zbMATH OpenOpenAlexFDO

Authors Alexandre D. Jesus, Luís Paquete, Arnaud Liefooghe

Publication date 28 April 2021

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-02898963/file/main.pdf

zbMATH Keywords

\(\varepsilon\)-constraintanytime algorithmsanytime behaviorcombinatorial optimizationmulti-objective optimization

Mathematics Subject Classification ID

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

Recommendations

• Automatically improving the anytime behaviour of optimisation algorithms
• Pareto local search algorithms for anytime bi-objective optimization
• Improving the anytime behavior of two-phase local search
• Monitoring and control of anytime algorithms: A dynamic programming approach
• Anytime Pareto local search

Cites work

• An analysis of approximations for maximizing submodular set functions—I
• Anytime Pareto local search
• Automatically improving the anytime behaviour of optimisation algorithms
• Combining VNS with constraint programming for solving anytime optimization problems
• Deliberation scheduling for problem solving in time-constrained environments
• Discrete dynamic programming and capital allocation
• Evolutionary multi-criterion optimization. 4th international conference, EMO 2007, Matsushima, Japan, March 5--8, 2007. Proceedings
• Experimental Methods for the Analysis of Optimization Algorithms
• Finding representations for an unconstrained bi-objective combinatorial optimization problem
• Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
• Monitoring and control of anytime algorithms: A dynamic programming approach
• Multicriteria Optimization
• On Klee's measure problem for grounded boxes
• Optimal schedules for monitoring anytime algorithms
• Representation of the non-dominated set in biobjective discrete optimization

Cited in

(5)

• Preface to the special issue dedicated to the 14th international workshop on global optimization held in Leiden, the Netherlands, September 18--21, 2018
• Automatically improving the anytime behaviour of optimisation algorithms
• Optimal schedules for monitoring anytime algorithms
• Effective anytime algorithm for multiobjective combinatorial optimization problems
• Fifty years of multi-objective optimization and decision-making: from mathematical programming to evolutionary computation

Describes a project that uses

Uses Software

• irace
• GLPK
• SPOT

This page was built for publication: A model of anytime algorithm performance for bi-objective optimization

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