Anytime Pareto local search
type: Item
instance of: scholarly article
title: Anytime Pareto local search
zbMATH Open document ID: 1346.90735
author: Jérémie Dubois-Lacoste
author: Manuel López-Ibáñez
author: Thomas Stützle
published in: European Journal of Operational Research
publication date: 2016-10-06T00:00:00Z
full work available at URL: anytimepls.pdf
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6633424
zbMATH Keywords: Pareto local search
zbMATH Keywords: anytime optimization
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: quadratic assignment problem
describes a project that uses: Scatter Search
describes a project that uses: SMS-EMOA
MaRDI profile type: Publication
OpenAlex ID: W2064659014
cites work: Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
cites work: SMS-EMOA: multiobjective selection based on dominated hypervolume
cites work: Improving the anytime behavior of two-phase local search
cites work: A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
cites work: Pareto Local Search Algorithms for Anytime Bi-objective Optimization
cites work: Evolutionary multi-criterion optimization. 6th international conference, EMO 2011, Ouro Preto, Brazil, April 5--8, 2011. Proceedings
cites work: Q4198056
cites work: Variable neighborhood search: Principles and applications
cites work: Q5472387
cites work: Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
cites work: Q4424305
cites work: Stochastic convergence of random search methods to fixed size Pareto front approximations
cites work: On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
cites work: Q731477
cites work: Hybrid population-based algorithms for the bi-objective quadratic assignment problem
cites work: Automatically improving the anytime behaviour of optimisation algorithms
cites work: Combining VNS with constraint programming for solving anytime optimization problems
cites work: The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
cites work: Two-phase Pareto local search for the biobjective traveling salesman problem
cites work: The multiobjective multidimensional knapsack problem: a survey and a new approach
cites work: Q4817408
cites work: On local optima in multiobjective combinatorial optimization problems
cites work: Q4424321
cites work: A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
cites work: Design and analysis of stochastic local search for the multiobjective traveling salesman problem
DOI: 10.1016/J.EJOR.2014.10.062
description: scientific article; zbMATH DE number 6633424