The orienteering problem with time windows applied to robotic melon harvesting

DOI10.1007/S10957-015-0767-ZzbMATH Open1343.90079OpenAlexW774315383MaRDI QIDQ255095FDOQ255095

Authors: Moshe Mann, Boaz Zion, D. Rubinstein, Rafi Linker, Itzhak Shmulevich 

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

Recommendations

• The Orienteering Problem with Time Windows
• Solving the orienteering problem with time windows via the pulse framework
• Solving the stochastic time-dependent orienteering problem with time windows
• An Optimal Algorithm for the Orienteering Tour Problem
• The effective application of a new approach to the generalized orienteering problem

zbMATH Keywords

combinatorial optimizationdynamic programmingharvesting robotorienteeringtime windows

Mathematics Subject Classification ID

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

Cites Work

• Introduction to algorithms
• A reoptimization algorithm for the shortest path problem with time windows
• The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 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
• The orienteering problem: a survey
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming

Cited In (1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255095)