A priori orienteering with time windows and stochastic wait times at customers
From MaRDI portal
Publication:297061
DOI10.1016/j.ejor.2014.04.040zbMath1339.90073OpenAlexW2089207315MaRDI QIDQ297061
Shu Zhang, Barrett W. Thomas, Jeffrey W. Ohlmann
Publication date: 24 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.040
Transportation, logistics and supply chain management (90B06) Queues and service in operations research (90B22)
Related Items (13)
Robust Team Orienteering Problem with Decreasing Profits ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ The probabilistic orienteering problem ⋮ Combined maintenance and routing optimization for large-scale sewage cleaning ⋮ A dynamic and probabilistic orienteering problem ⋮ The median routing problem for simultaneous planning of emergency response and non-emergency jobs ⋮ Rough approximation-based approach for designing a personalized tour route under a fuzzy environment ⋮ A bi-criteria moving-target travelling salesman problem under uncertainty ⋮ Two-stage robust optimization for the orienteering problem with stochastic weights ⋮ Solving the stochastic time-dependent orienteering problem with time windows ⋮ Multi-period orienteering with uncertain adoption likelihood and waiting at customers ⋮ Optimal joint maintenance and orienteering strategy for complex mission-oriented systems: a case study in offshore wind energy ⋮ Rollout-based routing strategies with embedded prediction: a fish trawling application
Cites Work
- A two-stage approach to the orienteering problem with stochastic weights
- Customer equilibrium and optimal strategies in Markovian queues in series
- The orienteering problem: a survey
- The orienteering problem with stochastic travel and service times
- Record breaking optimization results using the ruin and recreate principle
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Challenges and Advances in A Priori Routing
- Variable Neighborhood Search
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Algorithms for a stochastic selective travelling salesperson problem
- Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits
- AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
- On Optimal Balking Rules and Toll Charges in the GI/M/1 Queuing Process
- Customers' Optimal Joining Rules for the GI/M/s Queue
This page was built for publication: A priori orienteering with time windows and stochastic wait times at customers