Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
type: Item
instance of: scholarly article
title: Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
zbMATH Open document ID: 1391.90510
author: Marek Cornu
author: Tristan Cazenave
author: Daniel Vanderpooten
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
full work available at URL: https://basepub.dauphine.fr/handle/123456789/16038
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901350
zbMATH Keywords: multi-objective combinatorial optimization
zbMATH Keywords: multi-objective traveling salesman problem
zbMATH Keywords: meta-heuristics
zbMATH Keywords: Pareto local search
zbMATH Keywords: decomposition algorithm
zbMATH Keywords: data perturbation
describes a project that uses: TSPLIB
describes a project that uses: Performance Assessment
MaRDI profile type: Publication
OpenAlex ID: W2343637366
cites work: Multicriteria Optimization
cites work: Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
cites work: Q3815146
cites work: Q4452900
cites work: Iterated local search for the quadratic assignment problem
cites work: Q4817407
cites work: Q4817408
cites work: On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
cites work: Two-phase Pareto local search for the biobjective traveling salesman problem
cites work: Genetic local search for multi-objective combinatorial optimization
cites work: Q4424321
cites work: Improving the anytime behavior of two-phase local search
cites work: Design and analysis of stochastic local search for the multiobjective traveling salesman problem
cites work: Speed-up techniques for solving large-scale biobjective TSP
cites work: Bicriteria Transportation Problem
cites work: Multiobjective programming and planning
cites work: Q4365133
cites work: Fast Algorithms for Geometric Traveling Salesman Problems
cites work: Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems
cites work: A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP
cites work: The noising method: A new method for combinatorial optimization
cites work: The noising methods: A survey
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
cites work: Q4187195
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Chained Lin-Kernighan for large traveling salesman problems
cites work: Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis
DOI: 10.1016/J.COR.2016.04.025
description: scientific article; zbMATH DE number 6901350