Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
type: Item
instance of: scholarly article
title: Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
zbMATH Open document ID: 1151.90043
author: Andrzej Jaszkiewicz
author: Piotr Zielniewicz
published in: European Journal of Operational Research
publication date: 2008-11-18T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5368262
zbMATH Keywords: metaheuristics
describes a project that uses: TSPLIB
describes a project that uses: Scatter Search
MaRDI profile type: Publication
full work available at URL: j.ejor.2007.10.054
OpenAlex ID: W2009651104
cites work: Evolutionary Multi-Criterion Optimization
cites work: Q4451071
cites work: Nonlinear goal programming using multi-objective genetic algorithms
cites work: Fundamentals of scatter search and path relinking
cites work: Q4546411
cites work: Genetic local search for multi-objective combinatorial optimization
cites work: A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
cites work: Q4817403
cites work: Q4817408
cites work: Q4424321
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Q3815146
DOI: 10.1016/J.EJOR.2007.10.054
description: scientific article; zbMATH DE number 5368262