Skip to main content
SpringerLink
Log in

A Novel Method for Prize Collecting Traveling Salesman Problem with Time Windows

  • Conference paper
  • First Online:
Intelligent and Fuzzy Techniques for Emerging Conditions and Digital Transformation (INFUS 2021)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 307))

Included in the following conference series:

Abstract

Traveling salesman problem (TSP) is a well-known problem that has been studied for a long time. Prize Collecting Traveling Salesman Problem with Time Windows (PCTSPTW) is a variant of TSP that includes time windows constraints for each customer to be visited and prize for visited nodes. This paper presents a novel method for solving the PCTSPTW. There are two stages in the proposed method. First stage is a novel constructive heuristic for finding solutions by using a three dimensional distance matrix with time windows. Third dimension of the distance matrix is generated dynamically by the time window constraints defined on the nodes. In the constructive heuristic phase, an initial population of solutions is generated which contain solutions that are close to the best generated solution within a threshold value. Then, in the second stage, a genetic algorithm is implemented for making improvements on generated solutions. Results of computational experiments present that our approach outperforms the ones given in the literature.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Pedro, O., Saldanha, R., Camargo, R.: A Tabu search approach for the prize collecting traveling salesman problem. Electron. Notes Discrete Math. 41, 261–268 (2013)

    Article  Google Scholar 

  2. Bar-Yehuda, R., Even, G., Shahar, S.(Moni).: On approximating a geometric prize-collecting traveling salesman problem with time windows. J. Algorithms 55(1), 76–92 (2005)

    Google Scholar 

  3. Wang, S., Rao, W., Hong, Y.: A distance matrix based algorithm for solving the traveling salesman problem. Oper. Res. 20(3), 1–38 (2020)

    Google Scholar 

  4. Couto, B.: Using Matrices and Hungarian Method to Solve the Traveling Salesman Problem, p. 169. Honors Theses (2018)

    Google Scholar 

  5. Janusz, C.: An application of the Hungarian algorithm to solve traveling salesman problem. Am. J. Comput. Math. 09(02), 61–67 (2019)

    Article  Google Scholar 

  6. Angelelli, E., Bazgan, C., Speranza, M., Tuza, Z.: Complexity and approximation for Traveling Salesman Problems with profits. Theoret. Comput. Sci. 531, 54–65 (2014)

    Article  MathSciNet  Google Scholar 

  7. Horn, M., Maschler, J., Raidl, G.R., Rönnberg, E.: A*-based construction of decision diagrams for a prize-collecting scheduling problem. Comput. Oper. Res. 126, 105–125 (2021)

    Article  MathSciNet  Google Scholar 

  8. López-Ibáñez, M., Blum, C., Ohlmann, J.W., Thomas, B.W.: The travelling salesman problem with time windows: adapting algorithms from travel-time to makespan optimization. Appl. Soft Comput. J. 13(9), 3806–3815 (2013)

    Article  Google Scholar 

  9. Gusti, E.Y., Wayan, F.M., Agung, M.R.: Implementation of genetic algorithm to solve travelling salesman problem with time window (TSP-TW) for scheduling tourist destinations in Malang City. J. Inf. Technol. Comput. Sci. 2(1), 1–10 (2017)

    Google Scholar 

  10. Maity, S., Roy, A., Maiti, M.: Rough genetic algorithm for constrained solid TSP with interval valued costs and times. Fuzzy Inf. Eng. 10, 145–177 (2018)

    Article  Google Scholar 

  11. Shi, X., Wang, L., Zhou, Y., Liang, Y.: An ant colony optimization method for prize-collecting traveling salesman problem with time windows. In: Fourth International Conference on Natural Computation, vol. 7, pp. 480–484 (2008)

    Google Scholar 

  12. Zhang, Y., Tang, L.: Solving prize-collecting traveling salesman problem with time windows by chaotic neural network. In: Liu, D., Fei, S., Hou, Z., Zhang, H., Sun, C. (eds.) ISNN 2007. LNCS, vol. 4492, pp. 63–71. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72393-6_9

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Marmara University, Istanbul, Turkey

    Onur Dogan & Ali Fuat Alkaya

Authors
  1. Onur Dogan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ali Fuat Alkaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Industrial Engineering, Istanbul Technical University, Istanbul, Turkey

    Cengiz Kahraman

  2. Industrial Engineering Department, Yildiz Technical University, Istanbul, Turkey

    Selcuk Cebi

  3. Department of Industrial Engineering, Istanbul Technical University, Istanbul, Turkey

    Sezi Cevik Onar

  4. Department of Industrial Engineering, Istanbul Technical University, Istanbul, Turkey

    Basar Oztaysi

  5. Industrial Engineering Department, Galatasaray University, Istanbul, Turkey

    A. Cagri Tolga

  6. Department of Industrial Engineering, Istanbul Technical University, Istanbul, Turkey

    Irem Ucal Sari

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dogan, O., Alkaya, A.F. (2022). A Novel Method for Prize Collecting Traveling Salesman Problem with Time Windows. In: Kahraman, C., Cebi, S., Cevik Onar, S., Oztaysi, B., Tolga, A.C., Sari, I.U. (eds) Intelligent and Fuzzy Techniques for Emerging Conditions and Digital Transformation. INFUS 2021. Lecture Notes in Networks and Systems, vol 307. Springer, Cham. https://doi.org/10.1007/978-3-030-85626-7_55

Download citation

Publish with us

Policies and ethics

Search

Navigation