An adaptive memory matheuristic for the set orienteering problem-Reference-Cited by-同舟云学术

An adaptive memory matheuristic for the set orienteering problem

Published:2023-09 Issue:3 Volume:309 Page:1010-1023
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Dontas Michael,Sideris Georgios,Manousakis Eleftherios G.^ORCID,Zachariadis Emmanouil E.^ORCID

Funder

Hellenic Foundation for Research and Innovation

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference35 articles.

1. The clustered orienteering problem;Angelelli;European Journal of Operational Research,2014

2. Applegate, D., Bixby, R., Chvatal, V., & Cook, W. (2006). Concorde TSP solver.

3. The set orienteering problem;Archetti;European Journal of Operational Research,2018

4. Solving the family traveling salesman problem;Bernardino;European Journal of Operational Research,2018

5. A fast string searching algorithm;Boyer;Communications of the ACM,1977

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Branch-Price-and-Cut algorithms for the team orienteering problem with interval-varying profits;European Journal of Operational Research;2024-12

2. An effective hybrid evolutionary algorithm for the clustered orienteering problem;European Journal of Operational Research;2024-03

3. Simulated annealing with reinforcement learning for the set team orienteering problem with time windows;Expert Systems with Applications;2024-03

4. An effective hybrid evolutionary algorithm for the set orienteering problem;Information Sciences;2024-01

5. The capacitated family traveling salesperson problem;International Transactions in Operational Research;2023-12-28