The hazardous orienteering problem

DOI10.1002/NET.22129MaRDI QIDQ6179713zbMATH OpenOpenAlexFDO

Authors Alberto Santini, C. Archetti

Publication date 18 December 2023

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1002/net.22129

zbMATH Keywords

cash-in-transit logisticshazardous material transportationorienteering problemprimal and dual bounds

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• The orienteering problem
• The directed orienteering problem
• The probabilistic orienteering problem
• The team orienteering problem
• The set orienteering problem
• The orienteering problem: a survey
• A dynamic and probabilistic orienteering problem
• The capacitated orienteering problem
• The clustered orienteering problem
• The Orienteering Problem with Time Windows

Cites work

• A dynamic and probabilistic orienteering problem
• A two-stage approach to the orienteering problem with stochastic weights
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• Distributionally robust stochastic knapsack problem
• Exact algorithms for the 0-1 time-bomb knapsack problem
• scientific article; zbMATH DE number 3789740 (Why is no real title available?)
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer Programming Formulation of Traveling Salesman Problems
• Low Probability—High Consequence Considerations in Routing Hazardous Material Shipments
• Lower and upper bounds for the m-peripatetic vehicle routing problem
• Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
• Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
• Solving the Orienteering Problem through Branch-and-Cut
• State-space relaxation procedures for the computation of bounds to routing problems
• The orienteering problem
• The orienteering problem with stochastic travel and service times
• The prize collecting traveling salesman problem
• The probabilistic orienteering problem
• The selective travelling salesman problem
• The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
• Vehicle routing with arrival time diversification

Cited in

(7)

• The Safest Escape problem
• Modeling a humanitarian-aid covering tour problem with location selection and vehicle assignment decisions
• An exact algorithm for the hazardous orienteering problem
• A model-based algorithm for the probabilistic orienteering problem
• A unifying framework for selective routing problems
• Branch-price-and-cut algorithms for the team orienteering problem with interval-varying profits
• Scheduling and routing with degradation-triggered job arrivals: an application to forest firefighting with an unmanned aerial vehicle fleet

This page was built for publication: The hazardous orienteering problem

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