A simulated annealing heuristic for the multiconstraint team orienteering problem with multiple time windows

- We study multiconstraint team orienteering problem with multiple time windows (MC-TOP-MTW).
- We develop a simulated annealing (SA) with special solution encoding and restart strategy for MC-TOP-MTW.
- Using restart strategy in SA is promising for solving MC-TOP-MTW.
- Cauchy function is better than Boltzmann function in determining acceptance probability.
- The proposed simulated annealing outperforms existing approaches.