Solving the orienteering problem with time windows via the pulse framework

DOI10.1016/J.COR.2014.08.019zbMATH Open1348.90083DBLPjournals/cor/DuqueLM15OpenAlexW2064310122WikidataQ58759963 ScholiaQ58759963MaRDI QIDQ337360FDOQ337360

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

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

zbMATH Keywords

routingvehicle routing problem with time windowsshortest path problems with side constraintstraveling salesman problem with profits

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (18)

• The orienteering problem with time windows applied to robotic melon harvesting
• Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization
• Orienteering problem with time-windows and updating delay
• An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits
• 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
• An exact bidirectional pulse algorithm for the constrained shortest path
• Genetic algorithm with path relinking for the orienteering problem with time windows
• Bi-objective orienteering for personal activity scheduling
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
• 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
• Multi-period orienteering with uncertain adoption likelihood and waiting at customers
• Addendum to ``Heuristics for the multi-period orienteering problem with multiple time windows
• The Orienteering Problem with Time Windows
• Solving the stochastic time-dependent orienteering problem with time windows
• A fast solution method for the time-dependent orienteering problem

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)