Challenges and Advances in A Priori Routing
From MaRDI portal
Recommendations
- Integrating routing decisions in network problems
- An axiomatic approach to routing
- Preface: Static and dynamic optimization models for network routing problems
- Routing problems: A bibliography
- Optimization of dynamic routing networks
- scientific article; zbMATH DE number 4068590
- Optimal Dynamic Routing in Multidestination Networks
- Probabilistic a priori routing-location problems
Cites work
- A p-center grid-positioning aggregation procedure
- A noisy Euclidean traveling salesman problem: a computational analysis
- A Priori Optimization
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- A TABU search heuristic for the team orienteering problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- Aggregation effects in maximum covering models
- Aggregation for the probabilistic traveling salesman problem
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
- An O(N log N) planar travelling salesman heuristic based on spacefilling curves
- Chance-constrained programming
- Computational Approaches to Stochastic Vehicle Routing Problems
- Computer Solutions of the Traveling Salesman Problem
- Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
- Discrete-Time Finite Horizon Approximation of Infinite Horizon Optimization Problems with Steady-State Invariance
- Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
- Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
- Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers
- Further results on the probabilistic traveling salesman problem
- scientific article; zbMATH DE number 4055393 (Why is no real title available?)
- scientific article; zbMATH DE number 4104744 (Why is no real title available?)
- scientific article; zbMATH DE number 1487884 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- Introduction to Stochastic Programming
- Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
- Models and exact solutions for a class of stochastic location-routing problems
- On worst-case aggregation analysis for network location problems
- Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
- Quantifying the benefits of route reoptimisation under stochastic customer demands
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
- Solving the probabilistic TSP with ant colony optimization
- Stochastic vehicle routing
- Stochastic vehicle routing problem with restocking
- Stochastic vehicle routing with modified savings algorithm
- Stochastic vehicle routing: A comprehensive approach
- The stochastic vehicle routing problem revisited
- The vehicle scheduling problem with intermittent customer demands
- Using aggregation to optimize long-term production planning at an underground mine
- Vehicle routing with a sparse feasibility graph
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- Vehicle-scheduling Problems with Uncertainty and Omitted Customers
Cited in
(11)- The probabilistic orienteering problem
- Rollout-based routing strategies with embedded prediction: a fish trawling application
- A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands
- A priori orienteering with time windows and stochastic wait times at customers
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
- Detecting and preventing routing problems in the planning process of CCSS\#7 networks
- The in‐house logistics routing problem
- The orienteering problem with stochastic travel and service times
- Consistent routing for local same-day delivery via micro-hubs
- The dynamic dispatch waves problem for same-day delivery
- Estimation-based metaheuristics for the probabilistic traveling salesman problem
This page was built for publication: Challenges and Advances in A Priori Routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564352)
