Skip to main content
SpringerLink
Log in

The Selective Traveling Salesman Problem with Regular Working Time Windows

  • Chapter
Opportunities and Challenges for Next-Generation Applied Intelligence

Part of the book series: Studies in Computational Intelligence ((SCI,volume 214))

Abstract

Most literature on variations of traveling salesman problem (TSP) assumes that the worker is continuously available. However, this assumption may not be valid in some real applications due to the human’s natural needs. In this work, we study a selective TSP with regular working time windows in which a set of jobs at dispersed locations requires a specific length of time for completion from the worker. In the whole working time horizon, the worker can only travel or process jobs during the working time windows and the rest of time is used for taking breaks. The objective is to maximize the sum of the job processing time. By conducting extensive experiments, we show that our devised tabu search is a good approach to solve this problem.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Dordrecht (2002)

    MATH  Google Scholar 

  2. Dumas, Y., Desrosiers, J., Gelinas, E., Solomon, M.M.: An optimal algorithm for the traveling salesman problem with time windows. Operations Research 43(2), 367–371 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  3. Gendreau, M., Laporte, G., Semet, F.: A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks 32(4), 263–273 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Laporte, G., Martello, S.: The selective travelling salesman problem. Discrete Applied Mathematics 26(2-3), 193–207 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Fischetti, M., González, J.J.S., Toth, P.: Solving the orienteering problem through branchand-cut. INFORMS Journal on Computing 10(2), 133–148 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transportation Science 39(2), 188–205 (2005)

    Article  Google Scholar 

  7. Naderi, B., Zandieh, M., Fatemi Ghomi, S.M.T.: Scheduling sequence-dependent setup time job shops with preventive maintenance. The International Journal of Advanced Manufacturing Technology (accepted) (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Sciences, City University of Hong Kong, Tat Chee Ave, Kowloon Tong, Hong Kong,  

    Hu Qin & Andrew Lim

  2. School of Business, Sun Yat-Sen University, Guangzhou, P.R. China

    Dongsheng Xu

Authors
  1. Hu Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dongsheng Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Information on Engineering, National University of Tainan, 33, Sec. 2, Su-Lin St., 700, Tainan City, Taiwan

    Been-Chian Chien

  2. Department of Computer Science and Information Engineering, National University of Kaohsiung, Nanzih District, 700, Kaohsiung University Rd., 811, Kaohsiung, Taiwan

    Tzung-Pei Hong

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Qin, H., Lim, A., Xu, D. (2009). The Selective Traveling Salesman Problem with Regular Working Time Windows. In: Chien, BC., Hong, TP. (eds) Opportunities and Challenges for Next-Generation Applied Intelligence. Studies in Computational Intelligence, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92814-0_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92814-0_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92813-3

  • Online ISBN: 978-3-540-92814-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation