Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns

DOI10.1016/j.ejor.2008.07.006zbMath1159.90506OpenAlexW2047451495MaRDI QIDQ1014953

A. Tatarakis, Ioannis Minis

Publication date: 30 April 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.07.006

zbMATH Keywords

dynamic programminglogisticsstochastic vehicle routingmultiple product delivery

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (max. 100)

Single vehicle routing with predefined client sequence and multiple warehouse returns: the case of two warehouses ⋮ A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands ⋮ A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order ⋮ On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows ⋮ Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands ⋮ Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands ⋮ Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge ⋮ Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence ⋮ Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands ⋮ A stochastic single vehicle routing problem with a predefined sequence of customers and collection of two similar materials ⋮ Buy online and pick up in-store: design of the service area ⋮ SINGLE VEHICLE ROUTING PROBLEMS WITH A PREDEFINED CUSTOMER ORDER, UNIFIED LOAD AND STOCHASTIC DISCRETE DEMANDS ⋮ Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns ⋮ Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
• Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns
• Stochastic vehicle routing: A comprehensive approach
• Models and exact solutions for a class of stochastic location-routing problems
• Stochastic vehicle routing
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
• Routing problems: A bibliography
• Single vehicle routing with a predefined customer sequence and multiple depot returns
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• Stochastic Vehicle Routing Problem with Restocking
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
• Stochastic Inventory Routing: Route Design with Stockouts and Route Failures
• Tight bounds for christofides' traveling salesman heuristic
• An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
• A Vehicle Routing Problem with Stochastic Demand

This page was built for publication: Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns