Anytime Pareto local search
From MaRDI portal
Publication:319099
DOI10.1016/j.ejor.2014.10.062zbMath1346.90735OpenAlexW2064659014MaRDI QIDQ319099
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
multi-objective optimizationquadratic assignment problemtraveling salesman problemanytime optimizationPareto local search
Related Items
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
- Stochastic convergence of random search methods to fixed size Pareto front approximations
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- Combining VNS with constraint programming for solving anytime optimization problems
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- 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
- The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
- Variable neighborhood search: Principles and applications
