Routing Optimization Under Uncertainty
From MaRDI portal
Publication:2806069
DOI10.1287/opre.2015.1462zbMath1338.90107OpenAlexW2236944418WikidataQ96141531 ScholiaQ96141531MaRDI QIDQ2806069
Patrick Jaillet, Jin Qi, Melvyn Sim
Publication date: 13 May 2016
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/111105
Minimax problems in mathematical programming (90C47) Traffic problems in operations research (90B20)
Related Items (22)
Robust vehicle routing problem with hard time windows under demand and travel time uncertainty ⋮ Anonymous Stochastic Routing ⋮ An approach to the distributionally robust shortest path problem ⋮ Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings ⋮ Routing optimization with time windows under uncertainty ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ Robust traveling salesman problem with drone: balancing risk and makespan in contactless delivery ⋮ A survey of attended home delivery and service problems with a focus on applications ⋮ Travel Time Estimation in the Age of Big Data ⋮ The Distributionally Robust Chance-Constrained Vehicle Routing Problem ⋮ A survey of adjustable robust optimization ⋮ Itinerary planning with time budget for risk-averse travelers ⋮ A robust optimization approach for humanitarian needs assessment planning under travel time uncertainty ⋮ Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios ⋮ Generalized Bounded Rationality and Robust Multicommodity Network Design ⋮ Robust Adaptive Routing Under Uncertainty ⋮ The risk-averse traveling repairman problem with profits ⋮ A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems ⋮ Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty ⋮ Robust Data-Driven Vehicle Routing with Time Windows ⋮ Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- The robust vehicle routing problem with time windows
- A robust optimization approach to dispatching technicians under stochastic service times
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Reduction approaches for robust shortest path problems
- Complexity of the min-max and min-max regret assignment problems
- A comparative analysis of several asymmetric traveling salesman problem formulations
- A stochastic dynamic traveling salesman problem with hard time windows
- Maxmin expected utility with non-unique prior
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- A branch and bound algorithm for the robust shortest path problem with interval data.
- Interval data minmax regret network optimization problems
- Dynamic journeying under uncertainty
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
- The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
- Stochastic Shortest Path Problem with Delay Excess Penalty
- Distributionally Robust Convex Optimization
- The problem of calculating the volume of a polyhedron is enumerably hard
- Satisficing Measures for Analysis of Risky Positions
- An Economic Index of Riskiness
- A New Formulation for the Travelling Salesman Problem
- Managing Underperformance Risk in Project Portfolio Selection
- Vehicle routing with soft time windows and Erlang travel times
- A concise guide to the Traveling Salesman Problem
- The Price of Robustness
- The traveling salesman problem on a graph and some related integer polyhedra
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- Multiple Objectives Satisficing Under Uncertainty
- Stochastic Shortest Paths Via Quasi-convex Maximization
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: Routing Optimization Under Uncertainty
