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

@article{Lin2013SolvingTT,
  title={Solving the team orienteering problem using effective multi-start simulated annealing},
  author={Shih-Wei Lin},
  journal={Appl. Soft Comput.},
  year={2013},
  volume={13},
  pages={1064-1073}
}
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… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS
13 Citations
28 References
Similar Papers

Citations

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

References

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

Cavalier, A heuristic for the multiple tour maximum collection problem, Computers & Operations Research

  • T.M.S.E. Butt
  • 1994
Highly Influential
6 Excerpts

Scheduling a bi - criteria flowshop manufacturing cell with sequence - dependent family setup times

  • C.-C. Lu, K.-C. Ying
  • European Journal of Industrial Engineering
  • 2012

Applying multi - start simulated annealing to schedule a flowline manufacturing cell with sequence dependent family setup times

  • K.-C. Ying Lin
  • International Journal of Production Economics
  • 2011

Cell formation using a simulated annealing algorithm with variable neighbourhood

  • S.-W. Lin Ying, C.-C. Lu
  • European Journal of Industrial Engineering
  • 2011

Similar Papers

Loading similar papers…