The orienteering problem with time windows applied to robotic melon harvesting

DOI10.1007/s10957-015-0767-zzbMath1343.90079OpenAlexW774315383MaRDI QIDQ255095

Itzhak Shmulevich, Boaz Zion, Rafi Linker, Moshe Mann, Dror Rubinstein

Publication date: 9 March 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-015-0767-z

zbMATH Keywords

dynamic programmingcombinatorial optimizationtime windowsharvesting robotorienteering

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85) Artificial intelligence for robotics (68T40)

Related Items (1)

An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem

Cites Work

• Unnamed Item
• The orienteering problem: a survey
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• A reoptimization algorithm for the shortest path problem with time windows
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• Automation in Agriculture
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• The Orienteering Problem with Time Windows
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• On approximating a geometric prize-collecting traveling salesman problem with time windows
• Shortest Path Problems with Resource Constraints

This page was built for publication: The orienteering problem with time windows applied to robotic melon harvesting