On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
From MaRDI portal
Recommendations
- On the performance of local search for the biobjective traveling salesman problem
- Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem
- The multiobjective traveling salesman problem: A survey and a new approach
- An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem
- Many-objective Pareto local search
Cites work
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Benchmarks for basic scheduling problems
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Genetic local search for multi-objective combinatorial optimization
- scientific article; zbMATH DE number 4070651 (Why is no real title available?)
- scientific article; zbMATH DE number 1975100 (Why is no real title available?)
- scientific article; zbMATH DE number 1975101 (Why is no real title available?)
- scientific article; zbMATH DE number 4115948 (Why is no real title available?)
- scientific article; zbMATH DE number 2102226 (Why is no real title available?)
- scientific article; zbMATH DE number 2102228 (Why is no real title available?)
- scientific article; zbMATH DE number 2102230 (Why is no real title available?)
- scientific article; zbMATH DE number 2102231 (Why is no real title available?)
- Metaheuristics. From design to implementation.
- Minimum spanning trees made easier via multi-objective optimization
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- Multi-objective optimization using evolutionary algorithms
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- Nonlinear multiobjective optimization
- On local optima in multiobjective combinatorial optimization problems
- On operators and search space topology in multi-objective flow shop scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- ParadisEO-MOEO: A software framework for evolutionary multi-objective optimization
- Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem
- Speed-up techniques for solving large-scale biobjective TSP
- Two-phase Pareto local search for the biobjective traveling salesman problem
Cited in
(17)- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
- Many-objective Pareto local search
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- A study with neighborhood searches to deal with multiobjective unconstrained permutation problems
- On local optima in multiobjective combinatorial optimization problems
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- Anytime Pareto local search
- On the performance of local search for the biobjective traveling salesman problem
- Parameter-less co-clustering for star-structured heterogeneous data
- Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem
- Clusters of non-dominated solutions in multiobjective combinatorial optimization: an experimental analysis
- scientific article; zbMATH DE number 2013570 (Why is no real title available?)
- Fifty years of multi-objective optimization and decision-making: from mathematical programming to evolutionary computation
- On operators and search space topology in multi-objective flow shop scheduling
- Local dominance and local recombination in MOEAs on \(0/1\) multiobjective knapsack problems
This page was built for publication: On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q519093)
