Route recombination for deterministic and non-deterministic orienteering problems with time windows: A dynamic programming approach
-
Published:2024-07
Issue:
Volume:167
Page:106663
-
ISSN:0305-0548
-
Container-title:Computers & Operations Research
-
language:en
-
Short-container-title:Computers & Operations Research
Author:
Tran Trong-HieuORCID, Pralet CédricORCID, Fargier Hélène
Reference37 articles.
1. The probabilistic orienteering problem;Angelelli;Comput. Oper. Res.,2017 2. Feasibility of autonomous decision makingon board an agile earth-observing satellite;Beaumet;Comput. Intell.,2011 3. GRASP with path relinking for the orienteering problem;Campos;J. Oper. Res. Soc.,2014 4. Chien, S., Doubleday, J., Thompson, D.R., Wagstaff, K.L., Bellardo, J., Francis, C., Baumgarten, E., Williams, A., Yee, E., Fluitt, D., Stanton, E., Piug-Suari, J., 2014. Onboard autonomyon the intelligent payload experiment (IPEX) cubesat mission: a pathfinder for the proposed HyspIRI mission intelligent payload module. In: Proceedings of the International Symposium on Artificial Intelligence, Robotics and Automation in Space. ISAIRAS-14. 5. A tabu search algorithm for the probabilistic orienteering problem;Chou;Comput. Oper. Res.,2021
|
|