Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem

DOI10.1016/j.cor.2016.04.025zbMath1391.90510OpenAlexW2343637366MaRDI QIDQ1652176

Daniel Vanderpooten, Tristan Cazenave, Marek Cornu

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://basepub.dauphine.fr/handle/123456789/16038

zbMATH Keywords

meta-heuristicsmulti-objective combinatorial optimizationdecomposition algorithmPareto local searchdata perturbationmulti-objective traveling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows ⋮ Many-objective Pareto local search ⋮ Multi- and many-objective path-relinking: a taxonomy and decomposition approach ⋮ Research on improved ant colony optimization for traveling salesman problem ⋮ Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios

Uses Software

• TSPLIB
• Performance Assessment

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improving the anytime behavior of two-phase local search
• On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
• A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP
• Two-phase Pareto local search for the biobjective traveling salesman problem
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem
• Speed-up techniques for solving large-scale biobjective TSP
• Multiobjective programming and planning
• The noising method: A new method for combinatorial optimization
• Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems
• Iterated local search for the quadratic assignment problem
• Chained Lin-Kernighan for Large Traveling Salesman Problems
• Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis
• Bicriteria Transportation Problem
• TSPLIB—A Traveling Salesman Problem Library
• Fast Algorithms for Geometric Traveling Salesman Problems
• Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
• Multicriteria Optimization
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
• Genetic local search for multi-objective combinatorial optimization