Proper balance between search towards and along Pareto front: biobjective TSP case study
From MaRDI portal
Publication:2400011
DOI10.1007/s10479-017-2415-5zbMath1369.90159OpenAlexW2589632760MaRDI QIDQ2400011
Thibaut Lust, Andrzej Jaszkiewicz
Publication date: 25 August 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2415-5
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
- Bound sets for biobjective combinatorial optimization problems
- Reactive search and intelligent optimization
- 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
- Routing problems: A bibliography
- Variable and large neighborhood search to solve the multiobjective set covering problem
- 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
- Chained Lin-Kernighan for Large Traveling Salesman Problems
- Bicriteria Transportation Problem
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- Multicriteria Optimization
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Proper balance between search towards and along Pareto front: biobjective TSP case study
