A tabu search heuristic for the undirected selective travelling salesman problem

@article{Gendreau1998ATS,
  title={A tabu search heuristic for the undirected selective travelling salesman problem},
  author={Michel Gendreau and Gilbert Laporte and Fr{\'e}d{\'e}ric Semet},
  journal={European Journal of Operational Research},
  year={1998},
  volume={106},
  pages={539-545}
}
The undirected Selective Travelling Salesman Problem (STSP) is defined on a graph G= ( V, E) with positive profits associated with vertices, and distances associated with edges. The STSP consists of determining a maximal profit Hamiltonian cycle over a subset of V whose length does not exceed a preset limit L. We describe a tabu search (TS) heuristic for this problem. The algorithm iteratively inserts clusters of vertices in the current tour or removes a chain of vertices. Tests performed on… CONTINUE READING
Highly Cited
This paper has 126 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 73 extracted citations

Parametric Optimization of Storage Systems

HotStorage • 2015
View 2 Excerpts
Highly Influenced

The orienteering problem: A survey

European Journal of Operational Research • 2011
View 6 Excerpts
Highly Influenced

An Improved Partitioning Heuristic for Solving TSP: An Empirical Study

2018 19th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) • 2018
View 1 Excerpt

Towards an online heuristic method for energy-constrained underwater sensing mission planning

2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) • 2017
View 1 Excerpt

126 Citations

01020'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 126 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Algorithms and Solutions to Multi-Level Vehicle Routing Problems

Chao, L-M
Ph.D. Dissertation, • 1993

Algorithms to solve the orienteering problem: A comparison

C. P. Keller
European Journal of Operational Research • 1989
View 1 Excerpt

Formules de reactualisation pour une famille d”indices de proximite inter-classe en classification hicrarchique

Tricot. M.L.. Donegani, M..
RAIRO Recherche Operationnelle 23. 1655192. • 1989

A multi-faceted heuristic for the orienteering problem

Golden, Q.B.L.. Wang, Liu. L..
Naval Research Logistics 35. 359-366. • 1988
View 1 Excerpt

Dynamic programming in orienteering: Route choice and siting of controls

M. Hayes, Norman, J.M..
Journal of the Operational Research Society 35, 791-796. • 1984

Similar Papers

Loading similar papers…