A computational study of smoothing heuristics for the traveling salesman problem
type: Item
instance of: scholarly article
title: A computational study of smoothing heuristics for the traveling salesman problem
zbMATH Open document ID: 0977.90070
DOI: 10.1016/S0377-2217(99)00125-3
author: Steven P. Coy
author: Bruce Golden
author: Edward Wasil
published in: European Journal of Operational Research
publication date: 2002-01-27T00:00:00Z
review text: Over the last five years or so, data smoothing has be used to improve the performance of heuristics that solve combinatorial optimization problems. Data smoothing allow a local search heuristic to escape from a poor, local optimum. In practice, data smoothing has worked well when applied to the traveling salesman problem. In this paper, we conduct an extensive computational study to test the performance of eight smoothing heuristics for the traveling salesman problem. In particular, we apply eight smoothing heuristics and standard versions of two-opt and three-opt to 40 randomly generated Euclidean problems and 30 problems taken from a well-known library of test problems. We compare the solutions generated by the heuristics and provide insight into the behavior of the smoothing heuristics.
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1491136
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: data smoothing
zbMATH Keywords: smoothing heuristics
MaRDI profile type: Publication
cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel
cites work: Q4365133
cites work: Q4845366
full work available at URL: s0377-2217(99)00125-3
OpenAlex ID: W2073279712
description: scientific article; zbMATH DE number 1491136