On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
DOI10.1007/S10732-011-9181-3zbMATH Open1358.90046DBLPjournals/heuristics/LiefoogheHMJT12OpenAlexW2021383390WikidataQ59262726 ScholiaQ59262726MaRDI QIDQ519093FDOQ519093
Authors: Arnaud Liefooghe, Jérémie Humeau, Salma Mesmoudi, Laetitia Jourdan, El-Ghazali Talbi 
Publication date: 4 April 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-011-9181-3
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
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- ParadisEO-MOEO: A software framework for evolutionary multi-objective optimization
- Title not available (Why is that?)
- Nonlinear multiobjective optimization
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Metaheuristics. From design to implementation.
- Multi-objective optimization using evolutionary algorithms
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Speed-up techniques for solving large-scale biobjective TSP
- Title not available (Why is that?)
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Genetic local search for multi-objective combinatorial optimization
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Benchmarks for basic scheduling problems
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- On local optima in multiobjective combinatorial optimization problems
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- On operators and search space topology in multi-objective flow shop scheduling
- Title not available (Why is that?)
- Minimum spanning trees made easier via multi-objective optimization
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (16)
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- Many-objective Pareto local search
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Clusters of non-dominated solutions in multiobjective combinatorial optimization: an experimental analysis
- Title not available (Why is that?)
- Local dominance and local recombination in MOEAs on \(0/1\) multiobjective knapsack problems
- Anytime Pareto local search
- 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
- A study with neighborhood searches to deal with multiobjective unconstrained permutation problems
- On the performance of local search for the biobjective traveling salesman problem
- On operators and search space topology in multi-objective flow shop scheduling
- Parameter-less co-clustering for star-structured heterogeneous data
- Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem
- On local optima in multiobjective combinatorial optimization problems
Uses Software
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)
