A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands
From MaRDI portal
Publication:1023176
DOI10.1155/2008/571414zbMath1162.90325OpenAlexW2166658012WikidataQ58646205 ScholiaQ58646205MaRDI QIDQ1023176
Ömer Faruk Baykoç, Selçuk Kürşat İşleyen
Publication date: 11 June 2009
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/55481
Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Uses Software
Cites Work
- Unnamed Item
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
- Stochastic vehicle routing with modified savings algorithm
- Large-step Markov chains for the TSP incorporating local search heuristics
- Stochastic vehicle routing
- Heuristics for minimizing total weighted tardiness in flexible flow shops
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
- A survey on stochastic location and routing problems
- Routing problems: A bibliography
- Iterated local search for the quadratic assignment problem
- Hybrid metaheuristics for the vehicle routing problem with stochastic demands
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- Stochastic Vehicle Routing Problem with Restocking
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
- Computational Approaches to Stochastic Vehicle Routing Problems
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers