Abstract
The orienteering problem (OP) consists in finding an elementary path over a subset of vertices. Each vertex has associated a profit that is collected on the visitor’s first visit. The objective is to maximize the collected profit with respect to a limit on the path’s length. The team orienteering problem (TOP) is an extension of the OP where a fixed number m of paths must be determined. This paper presents an effective hybrid metaheuristic to solve both the OP and the TOP with time windows. The method combines the greedy randomized adaptive search procedure (GRASP) with the evolutionary local search (ELS). The ELS generates multiple distinct child solutions using a mutation mechanism and a local search. The GRASP provides multiple starting solutions to the ELS. The method is able to improve several best known results on available benchmark instances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Belenguer, J.M., Benavent, E., Labadi, N., Prins, C., Reghioui, M.: Split delivery capacitated arc routing problem: lower bound and metaheuristic. Transportation Science 44, 206–220 (2010)
Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105–119 (1997)
Dongarra, J.J.: Performance of various computers using standard linear equations software in a fortran environment. Tech. rep., Electrical Engineering and Computer Science Department, University of Tennessee, Knoxville, TN 37996 - 1301 (2009), http://www.netlib.org/benchmark/performance.ps
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109–133 (1995)
Kindervater, G.A.P., Savelsbergh, M.W.P.: Vehicle routing: handling edge exchanges. In: Aarts, E., Lenstra, J. (eds.) Local search in combinatorial optimization, pp. 311–336. Wiley, Chichester (1997)
Merz, P., Wolf, S.: Evolutionary local search for the super-peer selection problem and the p-hub median problem. In: Bartz-Beielstein, T., et al. (eds.) HCI/ICCV 2007. LNCS, vol. 4771, pp. 1–15. Springer, Heidelberg (2007)
Montemanni, R., Gambardella, L.M.: Ant colony system for team orienteering problem with time windows. Foundations of Computing and Decision Sciences (34) (2009)
Prins, C.: A grasp x evolutionary local search hybrid for the vehicle routing problem. In: Pereira, F., Tavares, J. (eds.) Bio-inspired Algorithms for the Vehicle Routing Problem, vol. 16, pp. 35–53. Springer, Heidelberg (2009)
Righini, G., Salani, M.: Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Computers & Operations Research 36(4), 1191–1203 (2009)
Solomon, M.: Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research 35, 254–265 (1987)
Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35(9), 797–809 (1984)
Vansteenwegen, P., Souffriau, W., Berghe, G.V., Oudheusden, D.V.: Iterated local search for the team orienteering problem with time windows. Computers & Operations Research 36(12), 3281–3290 (2009)
Vansteenwegen, P., Souffriau, W., Oudheusden, D.V.: The orienteering problem: a survey. European Journal of Operational Research (2010) (accepted manuscript)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Labadi, N., Melechovský, J., Calvo, R.W. (2010). An Effective Hybrid Evolutionary Local Search for Orienteering and Team Orienteering Problems with Time Windows. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds) Parallel Problem Solving from Nature, PPSN XI. PPSN 2010. Lecture Notes in Computer Science, vol 6239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15871-1_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-15871-1_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15870-4
Online ISBN: 978-3-642-15871-1
eBook Packages: Computer ScienceComputer Science (R0)