A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order

DOI10.1016/j.ejor.2015.02.038zbMath1346.90098OpenAlexW2067914633MaRDI QIDQ319511

Theodosis D. Dimitrakos, Epaminondas G. Kyriakidis

Publication date: 6 October 2016

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

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

zbMATH Keywords

dynamic programminglogisticscontinuous demandsrouting with pickup and deliveries

Mathematics Subject Classification ID

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

Related Items

A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order ⋮ Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands ⋮ Heterogeneous instant delivery orders scheduling and routing problem ⋮ An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup ⋮ 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 ⋮ A polymorphic uncertain equilibrium model and its deterministic equivalent formulation for decentralized supply chain management ⋮ Scheduling heterogeneous delivery tasks on a mixed logistics platform

Uses Software

• MCQueue

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
• Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands
• The capacitated vehicle routing problem with stochastic demands and time windows
• Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
• Designing delivery districts for the vehicle routing problem with stochastic demands
• 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 approximate dynamic programming approach for the vehicle routing problem with stochastic demands
• Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery
• Solving the vehicle routing problem with stochastic demands using the cross-entropy method
• Stochastic Vehicle Routing Problem with Restocking
• SINGLE VEHICLE ROUTING PROBLEMS WITH A PREDEFINED CUSTOMER ORDER, UNIFIED LOAD AND STOCHASTIC DISCRETE DEMANDS
• Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands