Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
From MaRDI portal
Publication:954938
DOI10.1016/J.EJOR.2007.10.054zbMath1151.90043OpenAlexW2009651104MaRDI QIDQ954938
Andrzej Jaszkiewicz, Piotr Zielniewicz
Publication date: 18 November 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.10.054
Related Items (10)
Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ An evolutionary approach to generalized biobjective traveling salesperson problem ⋮ Many-objective Pareto local search ⋮ Proper balance between search towards and along Pareto front: biobjective TSP case study ⋮ Multi- and many-objective path-relinking: a taxonomy and decomposition approach ⋮ Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems ⋮ An interactive approach for biobjective integer programs under quasiconvex preference functions ⋮ Two-phase Pareto local search for the biobjective traveling salesman problem ⋮ Design and analysis of stochastic local search for the multiobjective traveling salesman problem ⋮ Memory and Learning in Metaheuristics
Uses Software
Cites Work
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
- TSPLIB—A Traveling Salesman Problem Library
- Nonlinear goal programming using multi-objective genetic algorithms
- Evolutionary Multi-Criterion Optimization
- Genetic local search for multi-objective combinatorial optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
