Two-phase Pareto local search for the biobjective traveling salesman problem
type: Item
instance of: scholarly article
title: Two-phase Pareto local search for the biobjective traveling salesman problem
zbMATH Open document ID: 1189.90145
author: Thibaut Lust
author: Jacques Teghem
published in: Journal of Heuristics
publication date: 2010-05-21T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5710644
zbMATH Keywords: combinatorial multiobjective optimization
zbMATH Keywords: biobjective traveling salesman problem
zbMATH Keywords: two-phase method
zbMATH Keywords: supported efficient solutions
zbMATH Keywords: Pareto local search
zbMATH Keywords: data perturbation technique
zbMATH Keywords: performance assessment of multiobjective metaheuristics
describes a project that uses: TSPLIB
describes a project that uses: LKH
MaRDI profile type: Publication
full work available at URL: s10732-009-9103-9
OpenAlex ID: W1990912193
cites work: Bicriteria Transportation Problem
cites work: Q4817407
cites work: Chained Lin-Kernighan for large traveling salesman problems
cites work: Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis)
cites work: Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
cites work: Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
cites work: Multicriteria Optimization
cites work: Bound sets for biobjective combinatorial optimization problems
cites work: Connectedness of efficient solutions in multiple criteria combinatorial optimization
cites work: Q5532825
cites work: On spanning tree problems with multiple objectives
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: Q4187195
cites work: Genetic local search for multi-objective combinatorial optimization
cites work: Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Q4452900
cites work: Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis
cites work: Q4817408
cites work: On local optima in multiobjective combinatorial optimization problems
cites work: A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
cites work: Two phase algorithms for the bi-objective assignment problem
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Q4889471
cites work: MOSA method: a tool for solving multiobjective combinatorial optimization problems
DOI: 10.1007/S10732-009-9103-9
description: scientific article; zbMATH DE number 5710644