Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
From MaRDI portal
Publication:954938
DOI10.1016/J.EJOR.2007.10.054zbMATH Open1151.90043OpenAlexW2009651104MaRDI QIDQ954938FDOQ954938
Authors: 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
Recommendations
- The multiobjective traveling salesman problem: A survey and a new approach
- scientific article; zbMATH DE number 624797
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Many-objective Pareto local search
- A hybrid distribution algorithm based on membrane computing for solving the multiobjective multiple traveling salesman problem
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- Title not available (Why is that?)
- Nonlinear goal programming using multi-objective genetic algorithms
- Fundamentals of scatter search and path relinking
- Title not available (Why is that?)
- Title not available (Why is that?)
- Genetic local search for multi-objective combinatorial optimization
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Evolutionary Multi-Criterion Optimization
Cited In (15)
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- A hybrid distribution algorithm based on membrane computing for solving the multiobjective multiple traveling salesman problem
- Evolutionary Multi-Criterion Optimization
- Many-objective Pareto local search
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Two-phase Pareto local search for the biobjective traveling salesman problem
- The multiobjective traveling salesman problem: A survey and a new approach
- An evolutionary approach to generalized biobjective traveling salesperson problem
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
- Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems
- Multi- and many-objective path-relinking: a taxonomy and decomposition approach
- Proper balance between search towards and along Pareto front: biobjective TSP case study
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem
- An interactive approach for biobjective integer programs under quasiconvex preference functions
- Memory and learning in metaheuristics
Uses Software
This page was built for publication: Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954938)
