Variable Neighborhood Search for the Set Orienteering Problem and its application to other Orienteering Problem variants-Reference-Cited by-同舟云学术

Variable Neighborhood Search for the Set Orienteering Problem and its application to other Orienteering Problem variants

Published:2019-08 Issue:3 Volume:276 Page:816-825
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Pěnička Robert^ORCID,Faigl Jan,Saska Martin

Funder

Czech Science Foundation

Publisher

Elsevier BV

Subject

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

Reference17 articles.

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

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

3. On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents;Dubins;American Journal of Mathematics,1957

4. Self-organizing map-based solution for the orienteering problem with neighborhoods;Faigl,2016

5. Traveling salesman problems with profits;Feillet;Transportation Science,2005

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

1. On solving close enough orienteering problems with overlapped neighborhoods;European Journal of Operational Research;2024-10

2. Seçici Kümelendirilmiş Gezgin Satıcı Problemi ve Matematiksel Formülasyonları;Afyon Kocatepe University Journal of Sciences and Engineering;2024-06-08

3. Multi-Agent Deep Reinforcement Learning for Multi-Modal Orienteering Problem;2024 IEEE 18th International Symposium on Applied Computational Intelligence and Informatics (SACI);2024-05-23

4. Team orienteering with possible multiple visits: Mathematical model and solution algorithms;Computers & Industrial Engineering;2024-04

5. A new formulation and a branch-and-cut algorithm for the set orienteering problem;European Journal of Operational Research;2024-04