A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands
type: Item
instance of: scholarly article
title: A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands
zbMATH Open document ID: 1162.90325
DOI: 10.1155/2008/571414
published in: Mathematical Problems in Engineering
publication date: 2009-06-11T00:00:00Z
full work available at URL: https://eudml.org/doc/55481
review text: Summary: We define a special case for the vehicle routing problem with stochastic demands (SC-VRPSD) where customer demands are normally distributed. We propose a new linear model for computing the expected length of a tour in SC-VRPSD. The proposed model is based on the integration of the ``Traveling Salesman Problem'' (TSP) and the Assignment Problem. For large-scale problems, we also use an Iterated Local Search (ILS) algorithm in order to reach an effective solution.
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5564125
Wikidata QID: Q58646205
author: Selçuk Kürşat İşleyen
author: Ömer Faruk Baykoç
describes a project that uses: VRP
MaRDI profile type: Publication
OpenAlex ID: W2166658012
cites work: Routing problems: A bibliography
cites work: Models, relaxations and exact approaches for the capacitated vehicle routing problem
cites work: Stochastic vehicle routing
cites work: Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
cites work: Computational Approaches to Stochastic Vehicle Routing Problems
cites work: Stochastic vehicle routing problem with restocking
cites work: Hybrid metaheuristics for the vehicle routing problem with stochastic demands
cites work: Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
cites work: A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
cites work: An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
cites work: Stochastic vehicle routing with modified savings algorithm
cites work: A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
cites work: A survey on stochastic location and routing problems
cites work: Large-step Markov chains for the TSP incorporating local search heuristics
cites work: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
cites work: Heuristics for minimizing total weighted tardiness in flexible flow shops
cites work: Guided local search with shifting bottleneck for job shop scheduling
cites work: Iterated local search for the quadratic assignment problem
cites work: Q4452900
cites work: Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
description: scientific article; zbMATH DE number 5564125