Information Technology Reference
In-Depth Information
the rigidity of the rest periods limited the scope of the neighborhood heuris-
tics. This suggests the study of alternative mathematical models and alternative
methodologies better tailored to handle the specificities of this second real-life
problem.
Acknowledgments.
This research was partially supported by Portuguese
National Funding from FCT under project PEst-OE/MAT/UI0152.
References
1. Fischetti, M., Salazar-Gonzalez, J.-J., Toth, P.: The generalized traveling salesman
and orienteering problems. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Sales-
man Problem and its Variations, pp. 609-662. Kluwer (2002)
2. Gendreau, M., Laporte, G., Semet, F.: A branch-and-cut algorithm for the undi-
rected selective traveling salesman problem. Networks 32(4), 263-273 (1998)
3. Kaufman, L., Rousseeuw, P.J.: Finding groups in data: an introduction to cluster
analysis. Wiley, New York (1990)
4. Labadie, N., Mansini, R., Melechovsky, J., Calvo, R.W.: The team orienteering
problem with time windows: An LP-based granular variable neighborhood search.
European Journal of Operational Research 220, 15-27 (2012)
5. Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Computers
& Operations Research 34, 2403-2435 (2007)
6. Ropke, S., Pisinger, D.: An adaptative large neighborhood search heuristic for the
pickup and delivery problem with time windows. Transportation Science 40(4), 455-
472 (2006)
7. Tricoire, F., Romauch, M., Doerner, K.F., Hartl, R.F.: Heuristics for the multi-
period orienteering problem with multiple time windows. Computers & Operations
Research 37, 351-367 (2010)
8. Vansteenwegen, P., Souffriau, W., Berghe, G.V., Oudheusden, D.V.: Iterated local
search for the team orienteering problem with time windows. Computers & Opera-
tions Research 36, 3281-3290 (2009)
9. Vansteenwegen, P., Souffriau, W., Oudheusden, D.V.: The orienteering problem: A
survey. European Journal of Operational Research 209, 1-10 (2011)
