Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands

DOI10.1016/J.EJOR.2011.09.027zbMath1244.90045OpenAlexW2069286402MaRDI QIDQ439377

Dimitrios G. Pandelis, Epaminondas G. Kyriakidis, Theodosis D. Dimitrakos

Publication date: 16 August 2012

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

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

zbMATH Keywords

dynamic programminglogisticsstochastic demandsmultiple-product delivery

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Related Items (11)

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 ⋮ Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands ⋮ Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands ⋮ Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand ⋮ 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 dynamic vehicle routing in the light of prescriptive analytics: a review ⋮ Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery

Uses Software

• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
• Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns
• An improved ant system algorithm for the vehicle routing problem
• A genetic algorithm for the vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• Probabilistic diversification and intensification in local search for vehicle routing
• Single vehicle routing with a predefined customer sequence and multiple depot returns
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• Stochastic Vehicle Routing Problem with Restocking
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation

This page was built for publication: Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands