Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems
From MaRDI portal
Publication:2815512
DOI10.1080/10556788.2015.1121485zbMath1382.90098OpenAlexW2295163330MaRDI QIDQ2815512
Publication date: 29 June 2016
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2015.1121485
decompositionlocal searchmultiobjective optimizationquadratic assignment problemtravelling salesman problemevolutionary computing
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis)
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Steepest descent methods for multicriteria optimization.
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Genetic local search for multi-objective combinatorial optimization
This page was built for publication: Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems