The selective traveling salesman problem with regular working time windows

Studies in Computational Intelligence

Volumn 214, Issue , 2009, Pages 291-296

  Qin, Hu ^a   Lim, Andrew ^a   Xu, Dongsheng ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b SUN YAT SEN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78049302123     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-92814-0_45     Document Type: Article

References (7)

1. Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Dordrecht (2002)
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)
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)
4. Laporte, G., Martello, S.: The selective travelling salesman problem. Discrete Applied Mathematics 26(2-3), 193-207 (1990)
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)
6. Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transportation Science 39(2), 188-205 (2005)
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)