References

Archetti, C., A. Hertz and M.G. Speranza, 2007. Metaheuristics for the team orienteering problem. J. Heurist., 13: 49-76.
CrossRef  |  

Bouly, H., D.C. Dang and A. Moukrim, 2010. A memetic algorithm for the team orienteering problem. 4OR, 8: 49-70.
CrossRef  |  Direct Link  |  

Burke, E.K., T. Curtois, R. Qu and G.V. Berghe, 2010. A scatter search methodology for the nurse rostering problem. J. Oper. Res. Soc., 61: 1667-1679.
CrossRef  |  Direct Link  |  

Butt, S.E. and T.M. Cavalier, 1994. A heuristic for the multiple tour maximum collection problem. Comput. Oper. Res., 21: 101-111.
CrossRef  |  

Chao, I.M., B.L. Golden and E.A. Wasil, 1996. A fast and effective heuristic for the orienteering problem. Eur. J. Oper. Res., 88: 475-489.
CrossRef  |  

Engin, O., C. Kahraman and M.K. Yilmaz, 2009. A scatter search method for multiobjective fuzzy permutation flow shop scheduling problem: A real world application. Comput. Intel. Flow Shop Job Shop Scheduling, 230: 169-189.
CrossRef  |  

Fischetti, M., J.J.S. Gonzalez and P. Toth, 1998. Solving the orienteering problem through branch-and-cut. INFORMS J. Comput., 10: 133-148.
CrossRef  |  

Gendreau, M., G. Laporte and F. Semet, 1998. A tabu search heuristic for the undirected selective travelling salesman problem. Eur. J. Oper. Res., 106: 539-545.
CrossRef  |  

Glover, F., 1977. Heuristics for integer programming using surrogate constraints. Decis. Sci., 8: 156-166.
CrossRef  |  

Glover, F., 1998. A template for scatter search and path relinking. http://leeds-faculty.colorado.edu/glover/SS-PR%20Template.pdf.

Glover, F., 1999. Scatter Search and Path Relinking. In: New Ideas in Optimization, Corne, D., M. Dorigo and F. Glover (Eds.). McGraw-Hill Ltd., UK., pp: 297-316.

Glover, F., M. Laguna and R. Marti, 2003. Scatter Search. Springer-Verlag, USA., pp: 519-537.

Golden, B.L., Q. Wang and L. Liu, 1988. A multifaceted heuristic for the orienteering problem. Naval Res. Logistics, 35: 359-366.
Direct Link  |  

Jaradat, G.M. and M. Ayob, 2011. Scatter search for solving the course timetabling problem. Proceedings of the 3rd Conference on Data Mining and Optimization, June, 28-29, 2011, Malaysia, pp: 213-218.

Ke, L., C. Archetti and Z. Feng, 2008. Ants can solve the team orienteering problem. Comput. Ind. Eng., 54: 648-665.
CrossRef  |  

Laguna, M. and V. Armentano, 2005. Lessons from Applying and Experimenting with Scatter Search. In: Metaheuristic Optimization via Memory and Evolution, Sharda, R., S. Vob, C. Rego and B. Alidaee (Eds.). Vol. 30, Springer, USA., pp: 229-246.

Laguna, M., R. Marti and R.C. Marti, 2003. Scatter Search: Methodology and Implementations in C. Vol. 1, Springer, Netherlands, ISBN-13: 9781402073762, Pages: 291.

Liu, Y.H., 2008. Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem. Eur. J. Oper. Res., 191: 332-346.
Direct Link  |  

Maquera, G., M. Laguna, D.A. Gandelman and A.P. Sant'Anna, 2011. Scatter search applied to the vehicle routing problem with simultaneous delivery and pickup. Int. J. Applied Metaheuristic Comput., 2: 1-20.
Direct Link  |  

Miller, C., A.W. Tucker and R. Zemlin, 1960. Integer programming formulation of traveling salesman problems. J. ACM, 7: 326-329.
CrossRef  |  

Muthuswamy, S. and S.S. Lam, 2011. Discrete particle swarm optimization for the team orienteering problem. Memetic Comput., 3: 287-303.
CrossRef  |  

Ramesh, R., Y.S. Yoon and M.H. Karwan, 1992. An optimal algorithm for the orienteering tour problem. ORSA J. Comput., 4: 155-165.
CrossRef  |  

Resende, M.G.C., C.C. Ribeiro, F. Glover and R. Marti, 2010. Scatter Search and Path-Relinking: Fundamentals, Advances and Applications. In: Handbook of Metaheuristics, Gendreau, M. and J.Y. Potvin (Eds.). Springer, USA., pp: 87-107.

Sabar, N.R. and M. Ayob, 2009. Examination timetabling using scatter search hyper-heuristic. Proceedings of the 2nd Conference on Data Mining and Optimization, October 27-28, 2009, Kajand, pp: 127-131.

Souffriau, W., P. Vansteenwegen, G.V. Berghe and D. van Oudheusden, 2010. A path relinking approach for the team orienteering problem. Comput. Oper. Res., 37: 1853-1859.
CrossRef  |  

Tang, H. and E. Miller-Hooks, 2005. A tabu search heuristic for the team orienteering problem. Comput. Oper. Res., 32: 1379-1407.
CrossRef  |  Direct Link  |  

Vansteenwegen, P., W. Souffriau, G.V. Berghe and D.V. Oudheusden, 2009. A guided local search metaheuristic for the team orienteering problem. Eur. J. Oper. Res., 196: 118-127.
CrossRef  |  

Vansteenwegen, P., W. Souffriau, G.V. Berghe and D.V. Oudheusden, 2009. Metaheuristics for tourist trip planning. Metaheuristics Serv. Ind., 624: 15-31.
CrossRef  |  Direct Link  |