Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
From MaRDI portal
Publication:367631
DOI10.1007/s10479-011-0918-zzbMath1272.90009OpenAlexW2045173308WikidataQ57782998 ScholiaQ57782998MaRDI QIDQ367631
Joan Manuel Marquès, Angel A. Juan, Jose Cáceres, Josep Jorba, Javier Faulin
Publication date: 16 September 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0918-z
heuristicsprobabilistic algorithmsMonte Carlo simulationparallel and distributed computingvehicle routing problem with stochastic demands
Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items
A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times ⋮ A multi-agent based cooperative approach to scheduling and routing ⋮ A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals ⋮ A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics ⋮ Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery ⋮ Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands ⋮ Designing e‐commerce supply chains: a stochastic facility–location approach ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands ⋮ Order matters -- a variable neighborhood search for the swap-body vehicle routing problem ⋮ Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
Uses Software
Cites Work
- Unnamed Item
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
- The vehicle routing problem. Latest advances and new challenges.
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- Estimation-based metaheuristics for the probabilistic traveling salesman problem
- A survey on metaheuristics for stochastic combinatorial optimization
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- Vendor managed inventory for environments with stochastic product usage
- The stochastic vehicle routing problem revisited
- Stochastic vehicle routing
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- The sample average approximation method applied to stochastic routing problems: a computational study
- A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
- Online stochastic optimization under time constraints
- COSEARCH: A parallel cooperative metaheuristic
- Hybrid metaheuristics for the vehicle routing problem with stochastic demands
- A parallel clustering technique for the vehicle routing problem with split deliveries and pickups
- What you should know about the vehicle routing problem
- Parallel Solution Methods for Vehicle Routing Problems
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
