Anytime Pareto local search
From MaRDI portal
Publication:319099
DOI10.1016/J.EJOR.2014.10.062zbMATH Open1346.90735OpenAlexW2064659014MaRDI QIDQ319099FDOQ319099
Authors: Jérémie Dubois-Lacoste, Manuel López-Ibáñez, Thomas Stützle 
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/190892/1/anytimepls.pdf
Recommendations
quadratic assignment problemmulti-objective optimizationtraveling salesman problemanytime optimizationPareto local search
Cites Work
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- Title not available (Why is that?)
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- The multiobjective traveling salesman problem: A survey and a new approach
- Title not available (Why is that?)
- On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
- Variable neighborhood search: Principles and applications
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Stochastic local search. Foundations and applications.
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- Automatically improving the anytime behaviour of optimisation algorithms
- Evolutionary multi-criterion optimization. 6th international conference, EMO 2011, Ouro Preto, Brazil, April 5--8, 2011. Proceedings
- On local optima in multiobjective combinatorial optimization problems
- Hybrid population-based algorithms for the bi-objective quadratic assignment problem
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- Pareto local search algorithms for anytime bi-objective optimization
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
- Improving the anytime behavior of two-phase local search
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stochastic convergence of random search methods to fixed size Pareto front approximations
- Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings
- Combining VNS with constraint programming for solving anytime optimization problems
Cited In (9)
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows
- Many-objective Pareto local search
- A model of anytime algorithm performance for bi-objective optimization
- Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms
- Improving the anytime behavior of two-phase local search
- Effective anytime algorithm for multiobjective combinatorial optimization problems
- A stochastic process approach for multi-agent path finding with non-asymptotic performance guarantees
- Pareto local search algorithms for anytime bi-objective optimization
- Automatically improving the anytime behaviour of optimisation algorithms
Uses Software
This page was built for publication: Anytime Pareto local search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319099)
