Title
A memetic algorithm for the orienteering problem with hotel selection.
Abstract
•An extensive literature review is presented on node routing problems with intermediate facilities.•176 New and larger benchmark instances with known optimal solutions are created.•A memetic algorithm is designed which improves the results presented in the literature.•A sensitivity analysis on the critical characteristics of the OPHS is performed.
Year
DOI
Venue
2014
10.1016/j.ejor.2014.01.001
European Journal of Operational Research
Keywords
Field
DocType
Orienteering problem,Memetic algorithm,Population management,Intermediate facilities,Hotel selection
Memetic algorithm,Mathematical optimization,Vertex (geometry),Orienteering,Local search (optimization),Mathematics,Operations management
Journal
Volume
Issue
ISSN
237
1
0377-2217
Citations 
PageRank 
References 
13
0.69
24
Authors
4
Name
Order
Citations
PageRank
A. Divsalar1130.69
Pieter Vansteenwegen2102648.63
Kenneth Sörensen317519.42
Dirk Cattrysse430424.12