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

DOI10.1016/J.EJOR.2011.09.027MaRDI QIDQ439377zbMATH OpenOpenAlexFDO

Authors D. G. Pandelis, E. G. Kyriakidis, T. 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

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

Recommendations

• Single vehicle routing problem with a predefined customer sequence, stochastic demands and partial satisfaction of demands
• SINGLE VEHICLE ROUTING PROBLEMS WITH A PREDEFINED CUSTOMER ORDER, UNIFIED LOAD AND STOCHASTIC DISCRETE DEMANDS
• Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence
• Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns
• A stochastic single vehicle routing problem with a predefined sequence of customers and collection of two similar materials
• A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order
• Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• The Vehicle Routing Problem with Stochastic Demands and Split Deliveries
• A Vehicle Routing Problem with Stochastic Demand

Cites work

• scientific article; zbMATH DE number 2126322 (Why is no real title available?)
• scientific article; zbMATH DE number 805121 (Why is no real title available?)
• scientific article; zbMATH DE number 3338194 (Why is no real title available?)
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
• A genetic algorithm for the vehicle routing problem
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• An improved ant system algorithm for the vehicle routing problem
• Probabilistic diversification and intensification in local search for vehicle routing
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• Single vehicle routing with a predefined customer sequence and multiple depot returns
• Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns
• Stochastic vehicle routing problem with restocking
• The truck dispatching problem
• The vehicle routing problem

Cited in

(18)

• Discrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle
• SINGLE VEHICLE ROUTING PROBLEMS WITH A PREDEFINED CUSTOMER ORDER, UNIFIED LOAD AND STOCHASTIC DISCRETE DEMANDS
• A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order
• Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence
• Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands
• On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows
• A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands
• Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns
• Single vehicle routing with a predefined customer sequence and multiple depot returns
• Single vehicle routing with predefined client sequence and multiple warehouse returns: the case of two warehouses
• Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand
• Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands
• Single vehicle routing problem with a predefined customer sequence, stochastic demands and partial satisfaction of demands
• Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
• A stochastic single vehicle routing problem with a predefined sequence of customers and collection of two similar materials
• Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery
• Buy online and pick up in-store: design of the service area
• Deliveries in an Inventory/Routing Problem Using Stochastic Dynamic Programming

Describes a project that uses

Uses Software

• CVRPSP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439377)