A tabu search heuristic for the undirected selective traveling salesman problem
Article Abstract:
A tabu search (TS) heuristic is developed to solve the undirected selective traveling salesman problem. The algorithm repeatedly inserts clusters of vertices in the current tour or removes a chain of vertices. Computational results reveal that the algorithm generates optimal or near-optimal solutions. The algorithm, however, cannot be compared with other heuristics because these heuristics were tested on the problem of finding a chain of maximal profit.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
Branch-and-cut algorithms for the undirected m-peripatetic salesman problem
Article Abstract:
The exact Branch-and-cut solution procedures for the undirected m-Peripatetic Traveling Salesman Problem are presented.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: The traveling salesman problem: an overview of exact and approximate algorithms. The vehicle routing problem: an overview of exact and approximate algorithms
- Abstracts: Tangled web; cracking of alleged spy ring shakes opposition. part 2 The outsider
- Abstracts: Homes still out of reach. Fiscal bottleneck; taxes help to dry up real-estate market. Financial earthquake
- Abstracts: Empire of the glum. Not-so-funny wages
- Abstracts: Bold talk. Positive thinking. Political jitters