Improving the anytime behavior of two-phase local search
From MaRDI portal
(Redirected from Publication:408982)
Recommendations
- Pareto local search algorithms for anytime bi-objective optimization
- Anytime Pareto local search
- Automatically improving the anytime behaviour of optimisation algorithms
- scientific article; zbMATH DE number 1975100
- Proper balance between search towards and along Pareto front: biobjective TSP case study
Cites work
- scientific article; zbMATH DE number 1975100 (Why is no real title available?)
- scientific article; zbMATH DE number 2102231 (Why is no real title available?)
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- A review and evaluation of multiobjective algorithms for the flowshop scheduling problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Bicriteria Transportation Problem
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Exploratory analysis of stochastic local search algorithms in biobjective optimization
- Improving the anytime behavior of two-phase local search
- Minimizing Total Tardiness on One Machine is NP-Hard
- Optimal two- and three-stage production schedules with set-up time included
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- Stochastic local search. Foundations and applications.
- The Complexity of Flowshop and Jobshop Scheduling
- Two-phase Pareto local search for the biobjective traveling salesman problem
Cited in
(11)- Automatically improving the anytime behaviour of optimisation algorithms
- Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms
- A study of scalarisation techniques for multi-objective QUBO solving
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
- Improving the anytime behavior of two-phase local search
- Effective anytime algorithm for multiobjective combinatorial optimization problems
- A model of anytime algorithm performance for bi-objective optimization
- Pareto local search algorithms for anytime bi-objective optimization
- A coordinate-exchange two-phase local search algorithm for the D- and I-optimal designs of split-plot experiments
- Anytime Pareto local search
- A multi-objective coordinate-exchange two-phase local search algorithm for multi-stratum experiments
This page was built for publication: Improving the anytime behavior of two-phase local search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408982)
