Abstract
The orienteering problem (OP) is one of the most classical optimization problems, and the objective is to find a tour of some of the given nodes to obtain as much value as possible, with a maximum tour length constraint. Since the OP is an NP-hard problem, how to deal with it efficiently and effectively is always challenging. This study proposes to solve it through a greedy strategy based iterative local search algorithm (ILS-G). In detail, the greedy strategy is used to generate a good initial solution for accelerating the search process, and the iterative local search algorithm is proposed to further optimize the initial solution. An insertion operator, a 2-OPT operator, and a deletion operator are introduced in the iterative local search algorithm for updating the solution. Experimental results on instances with different problem sizes demonstrate the effectiveness and the efficiency of the proposed ILS-G.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
