Design and analysis of stochastic local search for the multiobjective traveling salesman problem
type: Item
instance of: scholarly article
title: Design and analysis of stochastic local search for the multiobjective traveling salesman problem
zbMATH Open document ID: 1179.90302
author: Luís Paquete
author: Thomas Stützle
published in: Computers \& Operations Research
publication date: 2009-04-03T00:00:00Z
full work available at URL: http://hdl.handle.net/10316/9994
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5539861
zbMATH Keywords: multiobjective combinatorial optimization
zbMATH Keywords: meta-heuristics
describes a project that uses: TSPLIB
describes a project that uses: Concorde
describes a project that uses: LKH
MaRDI profile type: Publication
OpenAlex ID: W2071540136
cites work: Q5472387
cites work: Handbook of Approximation Algorithms and Metaheuristics
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: Q3500163
cites work: Hybrid population-based algorithms for the bi-objective quadratic assignment problem
cites work: Q4424321
cites work: Q3802899
cites work: On cardinality of the set of alternatives in discrete many-criterion problems
cites work: Q4365133
cites work: Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
cites work: Q4817407
cites work: Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP
cites work: Genetic local search for multi-objective combinatorial optimization
cites work: CHESS -- changing horizon efficient set search: a simple principle for multiobjective optimization
cites work: Algorithms to solve the orienteering problem: A comparison
cites work: Algorithms for solving the two-criterion large-scale travelling salesman problem
cites work: Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
cites work: On spanning tree problems with multiple objectives
cites work: A Gray code for compositions
cites work: Analysing the run-time behaviour of iterated local search for the travelling salesman problem.
cites work: Q3815146
cites work: Fast Algorithms for Geometric Traveling Salesman Problems
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Q4452900
cites work: Multiple Comparisons
cites work: Permutation tests. A practical guide to resampling methods for testing hypotheses.
cites work: The traveling salesman. Computational solutions for RSP applications
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: Q3425132
cites work: Q4461911
cites work: The plane with parallel coordinates
cites work: Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
cites work: Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis
DOI: 10.1016/J.COR.2008.11.013
Recommended article: Q5297748
Recommended article: Q3500163
Recommended article: Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem
Recommended article: On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
Recommended article: On the Performance of Local Search for the Biobjective Traveling Salesman Problem
Recommended article: Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem
Recommended article: Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem
Recommended article: Advancing local search approximations for multiobjective combinatorial optimization problems
description: scientific article; zbMATH DE number 5539861