Solving the orienteering problem with time windows via the pulse framework

DOI10.1016/J.COR.2014.08.019MaRDI QIDQ337360zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Daniel Duque, Leonardo Lozano, Andrés L. Medaglia

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2014.08.019

zbMATH Keywords

routingshortest path problems with side constraintstraveling salesman problem with profitsvehicle routing problem with time windows

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Recommendations

• The Orienteering Problem with Time Windows
• Solving the stochastic time-dependent orienteering problem with time windows
• Heuristics for the multi-period orienteering problem with multiple time windows
• A fast solution method for the time-dependent orienteering problem
• Orienteering problem with time-windows and updating delay
• scientific article; zbMATH DE number 1839476
• The time-dependent orienteering problem with time windows: a fast ant colony system

Cites work

• A fast and effective heuristic for the orienteering problem
• A fast solution method for the time-dependent orienteering problem
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A TABU search heuristic for the team orienteering problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• An exact method for the biobjective shortest path problem for large-scale road networks
• Coupling ant colony systems with strong local searches
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• Heuristics for the multi-period orienteering problem with multiple time windows
• scientific article; zbMATH DE number 6676558 (Why is no real title available?)
• scientific article; zbMATH DE number 1769325 (Why is no real title available?)
• Incomplete service and split deliveries in a routing problem with profits
• Iterated local search for the team orienteering problem with time windows
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• On an exact method for the constrained shortest path problem
• Optimal solutions for routing problems with profits
• Solving Real-World Linear Programs: A Decade and More of Progress
• Solving the Orienteering Problem through Branch-and-Cut
• The orienteering problem
• The orienteering problem: a survey
• The split delivery capacitated team orienteering problem
• Using a genetic algorithm to solve the generalized orienteering problem

Cited in

(20)

• Bi-objective orienteering for personal activity scheduling
• Solving the stochastic time-dependent orienteering problem with time windows
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
• Multi-period orienteering with uncertain adoption likelihood and waiting at customers
• A fast solution method for the time-dependent orienteering problem
• The orienteering problem with time windows applied to robotic melon harvesting
• Orienteering problem with time-windows and updating delay
• An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits
• Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows
• Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks
• Orienteering problem: a survey of recent variants, solution approaches and applications
• The Orienteering Problem with Time Windows
• Addendum to ``Heuristics for the multi-period orienteering problem with multiple time windows
• Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization
• Genetic algorithm with path relinking for the orienteering problem with time windows
• An exact bidirectional pulse algorithm for the constrained shortest path
• Branch-and-cut-and-price for agile Earth observation satellite scheduling
• An exact method for reliable shortest path problems with correlation
• Heuristics for the multi-period orienteering problem with multiple time windows
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming

This page was built for publication: Solving the orienteering problem with time windows via the pulse framework

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