Solving the orienteering problem with time windows via the pulse framework

DOI10.1016/j.cor.2014.08.019zbMath1348.90083OpenAlexW2064310122WikidataQ58759963 ScholiaQ58759963MaRDI QIDQ337360

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

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

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

Mathematics Subject Classification ID

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

Related Items (8)

Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem ⋮ Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization ⋮ 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 ⋮ An exact bidirectional pulse algorithm for the constrained shortest path ⋮ Multi-period orienteering with uncertain adoption likelihood and waiting at customers

Cites Work

• Unnamed Item
• Unnamed Item
• On an exact method for the constrained shortest path problem
• The orienteering problem: a survey
• Heuristics for the multi-period orienteering problem with multiple time windows
• Iterated local search for the team orienteering problem with time windows
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• A fast and effective heuristic for the orienteering problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• A TABU search heuristic for the team orienteering problem
• Coupling ant colony systems with strong local searches
• Optimal solutions for routing problems with profits
• 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
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
• Solving Real-World Linear Programs: A Decade and More of Progress
• The 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
• Solving the Orienteering Problem through Branch-and-Cut
• Incomplete service and split deliveries in a routing problem with profits
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

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