Solving the team orienteering problem using effective multi-start simulated annealing

Authors:
Shih-Wei Lin
Affiliations:
Department of Information Management, Chang Gung University, 259 Wen-Hwa 1st Road, Kwei-Shan, Taoyuan 333, Taiwan
Venue:
Applied Soft Computing
Year:
2013

Citing 11
Cited 0

A heuristic for the multiple tour maximum collection problem

Computers and Operations Research
An optimal solution procedure for the multiple tour maximum collection problem using column generation

Computers and Operations Research - Special issue on the traveling salesman problem
Metaheuristics for the team orienteering problem

Journal of Heuristics
A TABU search heuristic for the team orienteering problem

Computers and Operations Research
Ants can solve the team orienteering problem

Computers and Industrial Engineering
Solving the truck and trailer routing problem based on a simulated annealing heuristic

Computers and Operations Research
A hybrid immune simulated annealing algorithm for the job shop scheduling problem

Applied Soft Computing
A parallel simulated annealing algorithm based on functional feature tree modeling for 3D engineering layout design

Applied Soft Computing
A Path Relinking approach for the Team Orienteering Problem

Computers and Operations Research
Simulated annealing algorithm with adaptive neighborhood

Applied Soft Computing
Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The team orienteering problem (TOP) is known as an NP-complete problem. A set of locations is provided and a score is collected from the visit to each location. The objective is to maximize the total score given a fixed time limit for each available tour. Given the computational complexity of this problem, a multi-start simulated annealing (MSA) algorithm which combines a simulated annealing (SA) based meta-heuristic with a multi-start hill climbing strategy is proposed to solve TOP. To verify the developed MSA algorithm, computational experiments are performed on well-known benchmark problems involving numbers of locations ranging between 42 and 102. The experimental results demonstrate that the multi-start hill climbing strategy can significantly improve the performance of the traditional single-start SA. Meanwhile, the proposed MSA algorithm is highly effective compared to the state-of-the-art meta-heuristics on the same benchmark instances. The proposed MSA algorithm obtained 135 best solutions to the 157 benchmark problems, including five new best solutions. In terms of both solution quality and computational expense, this study successfully constructs a high-performance method for solving this challenging problem.