Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem

DOI10.1016/J.EJOR.2007.10.054MaRDI QIDQ954938zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

metaheuristics

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

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

• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 1975100 (Why is no real title available?)
• scientific article; zbMATH DE number 2046100 (Why is no real title available?)
• scientific article; zbMATH DE number 1784661 (Why is no real title available?)
• scientific article; zbMATH DE number 2102227 (Why is no real title available?)
• scientific article; zbMATH DE number 2102231 (Why is no real title available?)
• A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
• Evolutionary Multi-Criterion Optimization
• Fundamentals of scatter search and path relinking
• Genetic local search for multi-objective combinatorial optimization
• Nonlinear goal programming using multi-objective genetic algorithms
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(16)

• 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
• Many-objective Pareto local search
• Evolutionary Multi-Criterion Optimization
• 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
• scientific article; zbMATH DE number 624797 (Why is no real title available?)
• 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

Describes a project that uses

Uses Software

• Scatter Search
• TSPLIB

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)