Skip to main content
SpringerLink
Log in

A Simulated Annealing for Multi-modal Team Orienteering Problem with Time Windows

  • Conference paper
  • First Online:
Bio-inspired Computing: Theories and Applications (BIC-TA 2018)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 952))

Abstract

Team orienteering problem (TOP) is NP-hard problem. Recently, a multi-modal team orienteering problem with time windows (MM-TOPTW) as a new extension of TOP is developed. Many real-world applications can be modeled as MM-TOPTW. In this paper, a simulated annealing (SA) is designed for MM-TOPTW. In the SA, a temperature reannealing scheme is adopted to get away the local optimum, and multiple neighborhood searches are carefully designed to improve solution. The computation results demonstrate the proposed algorithm can obtain better solution than the recently proposed algorithm for MM-TOPTW.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35(9), 797–809 (1984)

    Article  Google Scholar 

  2. Gunawan, A., Lau, H.C., Vansteenwegen, P.: Orienteering problem: a survey of recent variants, solution approaches and applications. Eur. J. Oper. Res. 255, 315–332 (2016)

    Article  MathSciNet  Google Scholar 

  3. Kantor, M.G., Rosenwein, M.B.: The orienteering problem with time windows. J. Oper. Res. Soc. 43(6), 629–635 (1992)

    Article  Google Scholar 

  4. Vansteenwegen, P.: Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res. 36(12), 3281–3290 (2009)

    Article  Google Scholar 

  5. Montemanni, R., Weyland, D., Gambardella, L.M.: An enhanced ant colony system for the team orienteering problem with time windows. In: International Symposium on Computer Science and Society 2011, vol. 2011, pp. 381–384. IEEE Computer Society (2011)

    Google Scholar 

  6. Lin, S.W., Vincent, F.Y.: Solving the team orienteering problem with time windows and mandatory visits by multi-start simulated annealing. Comput. Ind. Eng. 114, 195–205 (2017)

    Article  Google Scholar 

  7. Yu, V.F., Jewpanya, P., Ting, C.J., Redi, A.P.: Two-level particle swarm optimization for the multi-modal team orienteering problem with time windows. Appl. Soft Comput. 61, 1022–1040 (2017)

    Article  Google Scholar 

  8. Vansteenwegen, P., Souffriau, W., Berghe, G.V., et al.: The city trip planner: an expert system for tourists. Expert Syst. Appl. 38(6), 6540–6546 (2011)

    Article  Google Scholar 

  9. Arkin, E.M., Mitchell, J.S.B., Narasimhan, G.: Resource-constrained geometric network optimization. In: Fourteenth Symposium on Computational Geometry, vol. 1998, pp. 307–316. ACM (1998)

    Google Scholar 

  10. Butt, S.E., Cavalier, T.M.: A heuristic for the multiple tour maximum collection problem. Comput. Oper. Res. 21(1), 101–111 (1994)

    Article  Google Scholar 

  11. Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Nav. Res. Logist. 34(3), 307–318 (1987)

    Article  Google Scholar 

  12. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  13. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254–265 (1987)

    Article  MathSciNet  Google Scholar 

  14. Kobeaga, G., Merino, M., Lozano, J.A.: An efficient evolutionary algorithm for the orienteering problem. Comput. Oper. Res. 90, 42–59 (2018)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work was supported in part by the Foundation for Distinguished Young Talents in Higher Education of Guangdong, China, under Grant Yqgdufe1404, and in part by the Program for Characteristic Innovation Talents of Guangdong under Grant 2014KTSCX127, and in part by the Opening Project of Guangdong High Performance Computing Society under Grant 2017060109, in part by the Foundation of Key Laboratory of Machine Intelligence and Advanced Computing of the Ministry of Education under Grant MSC-201606A, in part by the China Scholarship Council under Grant 201608440449.

Author information

Authors and Affiliations

  1. College of Information, Guangdong University of Finance and Economics, Guangzhou, 510320, China

    Yalan Zhou & Chen Li

  2. Key Laboratory of Machine Intelligence and Advanced Computing, Ministry of Education, Sun Yat-sen University, Guangzhou, 510006, China

    Yalan Zhou

  3. Department of Computer Science, Sun Yat-sen University, Guangzhou, 510006, China

    Yanyue Li

Authors
  1. Yalan Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chen Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yanyue Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yalan Zhou .

Editor information

Editors and Affiliations

  1. Beijing University of Posts and Telecommunications, Beijing, China

    Jianyong Qiao

  2. Beijing University of Posts and Telecommunications, Beijing, China

    Xinchao Zhao

  3. Huazhong University of Science and Technology, Wuhan, China

    Linqiang Pan

  4. Beijing University of Posts and Telecommunications, Beijing, China

    Xingquan Zuo

  5. Anhui University, Hefei, China

    Xingyi Zhang

  6. City University of Hong Kong, Kowloon, Hong Kong

    Qingfu Zhang

  7. Beijing University of Posts and Telecommunications, Beijing, China

    Shanguo Huang

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhou, Y., Li, C., Li, Y. (2018). A Simulated Annealing for Multi-modal Team Orienteering Problem with Time Windows. In: Qiao, J., et al. Bio-inspired Computing: Theories and Applications. BIC-TA 2018. Communications in Computer and Information Science, vol 952. Springer, Singapore. https://doi.org/10.1007/978-981-13-2829-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-2829-9_3

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-2828-2

  • Online ISBN: 978-981-13-2829-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation