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

DOI10.1007/s10732-011-9181-3zbMath1358.90046OpenAlexW2021383390WikidataQ59262726 ScholiaQ59262726MaRDI QIDQ519093

Jérémie Humeau, Arnaud Liefooghe, Laetitia Jourdan, Salma Mesmoudi, 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

zbMATH Keywords

local searchmultiobjective optimizationtraveling salesman problemflowshop scheduling problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (7)

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 ⋮ 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 ⋮ Many-objective Pareto local search ⋮ Parameter-less co-clustering for star-structured heterogeneous data

Uses Software

• ParadisEO-MOEO
• PISA
• SPEA2

Cites Work

• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• Minimum spanning trees made easier via multi-objective optimization
• On operators and search space topology in multi-objective flow shop scheduling
• Two-phase Pareto local search for the biobjective traveling salesman problem
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem
• Speed-up techniques for solving large-scale biobjective TSP
• Connectedness of efficient solutions in multiple criteria combinatorial optimization
• Nonlinear multiobjective optimization
• Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem
• Benchmarks for basic scheduling problems
• On local optima in multiobjective combinatorial optimization problems
• A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
• ParadisEO-MOEO: A Software Framework for Evolutionary Multi-Objective Optimization
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Evolutionary Algorithms for Solving Multi-Objective Problems
• Genetic local search for multi-objective combinatorial optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems