A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
From MaRDI portal
Publication:4888180
DOI10.1287/opre.44.2.286zbMath0855.90053OpenAlexW1966197373WikidataQ89223443 ScholiaQ89223443MaRDI QIDQ4888180
David Simchi-Levi, Dimitris J. Bertsimas
Publication date: 28 October 1996
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9732b6a557ffa320fbf588f5b7b4b98931fd3adb
surveyanalysis of algorithmsrobust algorithmsprobabilisticworst casenear-optimal solutionsclassical, deterministic vehicle routing
Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)
Related Items
A solution method for a two-dispatch delivery problem with stochastic customers ⋮ A queueing framework for routing problems with time-dependent travel times ⋮ A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem ⋮ The mixed capacitated general routing problem under uncertainty ⋮ Uncertain multiobjective traveling salesman problem ⋮ A survey on combinatorial optimization in dynamic environments ⋮ Optimal routing for electric vehicle service systems ⋮ The vehicle rescheduling problem ⋮ Faster rollout search for the vehicle routing problem with stochastic demands and restocking ⋮ The probabilistic orienteering problem ⋮ Heuristics for dynamic and stochastic routing in industrial shipping ⋮ Dynamic vehicle routing: Status and prospects ⋮ A robust optimization approach to dispatching technicians under stochastic service times ⋮ The secure time-dependent vehicle routing problem with uncertain demands ⋮ Improved approximation algorithms for cumulative VRP with stochastic demands ⋮ Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ A multilevel evaluation method for heuristics with an application to the VRPTW ⋮ Household-Level Economies of Scale in Transportation ⋮ Vehicle routing with dynamic travel times: a queueing approach ⋮ Risky traveling salesman problem ⋮ Routing Courier Delivery Services with Urgent Demand ⋮ Network routing in a dynamic environment ⋮ Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands ⋮ The Distributionally Robust Chance-Constrained Vehicle Routing Problem ⋮ Dynamic VRP in pharmaceutical distribution -- a case study ⋮ Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics ⋮ A neural-tabu search heuristic for the real time vehicle routing problem ⋮ A decomposition approach for commodity pickup and delivery with time-windows under uncertainty ⋮ Minimizing customers' waiting time in a vehicle routing problem with unit demands ⋮ Recent Developments in Dynamic Vehicle Routing Systems ⋮ Worst-case demand distributions in vehicle routing ⋮ Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines ⋮ Real-time vehicle rerouting problems with time windows ⋮ An improved LNS algorithm for real-time vehicle routing problem with time windows ⋮ New policies for the dynamic traveling salesman problem ⋮ Reoptimization gaps versus model errors in online-dispatching of service units for ADAC ⋮ Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models ⋮ A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands ⋮ A two-stage vehicle routing model for large-scale bioterrorism emergencies ⋮ A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows ⋮ Hybrid metaheuristics for the vehicle routing problem with stochastic demands ⋮ Approximation Algorithms for Cumulative VRP with Stochastic Demands ⋮ Minimising average passenger waiting time in personal rapid transit systems ⋮ Modelling vehicle routing in GIS ⋮ Dynamic path optimization in sharing mode to relieve urban traffic congestion ⋮ Routing Optimization Under Uncertainty ⋮ A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands ⋮ An approximate dynamic programming approach for the vehicle routing problem with stochastic demands ⋮ Unnamed Item ⋮ Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand ⋮ Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands ⋮ On line Routing per Mobile Phone A Case on Subsequent Deliveries of Newspapers
