Anytime Pareto local search (Q319099)

From MaRDI portal

Revision as of 16:26, 8 December 2024 by Import241208021249 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Anytime Pareto local search	scientific article

Statements

scholarly article

0 references

Anytime Pareto local search (English)

0 references

Jérémie Dubois-Lacoste

0 references

Manuel López-Ibáñez

0 references

Thomas Stützle

0 references

European Journal of Operational Research

0 references

publication date

6 October 2016

0 references

full work available at URL

https://dipot.ulb.ac.be/dspace/bitstream/2013/190892/1/anytimepls.pdf

0 references

zbMATH Keywords

Pareto local search

0 references

anytime optimization

0 references

multi-objective optimization

0 references

traveling salesman problem

0 references

quadratic assignment problem

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem

0 references

SMS-EMOA: multiobjective selection based on dominated hypervolume

0 references

Improving the anytime behavior of two-phase local search

0 references

A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems

0 references

Pareto Local Search Algorithms for Anytime Bi-objective Optimization

0 references

Evolutionary multi-criterion optimization. 6th international conference, EMO 2011, Ouro Preto, Brazil, April 5--8, 2011. Proceedings

0 references

0 references

Variable neighborhood search: Principles and applications

0 references

0 references

Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances

0 references

0 references

Stochastic convergence of random search methods to fixed size Pareto front approximations

0 references

On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems

0 references

Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings

0 references

Hybrid population-based algorithms for the bi-objective quadratic assignment problem

0 references

Automatically improving the anytime behaviour of optimisation algorithms

0 references

Combining VNS with constraint programming for solving anytime optimization problems

0 references

The Multiobjective Traveling Salesman Problem: A Survey and a New Approach

0 references

Two-phase Pareto local search for the biobjective traveling salesman problem

0 references

The multiobjective multidimensional knapsack problem: a survey and a new approach

0 references

0 references

On local optima in multiobjective combinatorial optimization problems

0 references

0 references

A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices

0 references

Design and analysis of stochastic local search for the multiobjective traveling salesman problem

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.EJOR.2014.10.062

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:319099

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q319099&oldid=38061502"