Improving the anytime behavior of two-phase local search
From MaRDI portal
Publication:408982
DOI10.1007/S10472-011-9235-0zbMATH Open1234.68362OpenAlexW2046984822MaRDI QIDQ408982FDOQ408982
Authors: Manuel López-Ibáñez, Jérémie Dubois-Lacoste, Thomas Stützle 
Publication date: 12 April 2012
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/99870/1/IridiaTr2010-022.pdf
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
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- Optimal two- and three-stage production schedules with set-up time included
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- The Complexity of Flowshop and Jobshop Scheduling
- Title not available (Why is that?)
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- Stochastic local search. Foundations and applications.
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- Exploratory analysis of stochastic local search algorithms in biobjective optimization
- Bicriteria Transportation Problem
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Improving the anytime behavior of two-phase local search
- Title not available (Why is that?)
- A review and evaluation of multiobjective algorithms for the flowshop scheduling problem
Cited In (11)
- A coordinate-exchange two-phase local search algorithm for the D- and I-optimal designs of split-plot experiments
- A model of anytime algorithm performance for bi-objective optimization
- A study of scalarisation techniques for multi-objective QUBO solving
- Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms
- Anytime Pareto local search
- 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
- Pareto local search algorithms for anytime bi-objective optimization
- Automatically improving the anytime behaviour of optimisation algorithms
- A multi-objective coordinate-exchange two-phase local search algorithm for multi-stratum experiments
Uses Software
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)
