Many-objective Pareto local search
From MaRDI portal
Publication:1653381
DOI10.1016/j.ejor.2018.06.009zbMath1403.90609arXiv1707.07899OpenAlexW2962840996MaRDI QIDQ1653381
Publication date: 3 August 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.07899
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Anytime Pareto local search
- On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Speed-up techniques for solving large-scale biobjective TSP
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
- Variable and large neighborhood search to solve the multiobjective set covering problem
- Proper balance between search towards and along Pareto front: biobjective TSP case study
- On local optima in multiobjective combinatorial optimization problems
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- Multi‐objective optimization using metaheuristics: non‐standard algorithms
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Genetic local search for multi-objective combinatorial optimization
