Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands

DOI10.1016/j.ejor.2018.05.049zbMath1403.90194OpenAlexW2803158063WikidataQ129751287 ScholiaQ129751287MaRDI QIDQ1653371

Jiuh-Biing Sheu, Lin Zhu

Publication date: 3 August 2018

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

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

zbMATH Keywords

logisticsstochastic vehicle routingpickup and deliveryadaptive large neighbourhood searcha priori route optimisation

Mathematics Subject Classification ID

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

Related Items (5)

Optimization of simultaneous delivery and pickup wagon scheme on hybrid siding network of railway terminal ⋮ Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup ⋮ Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery

Cites Work

• A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order
• Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands
• 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
• The capacitated vehicle routing problem with stochastic demands and time windows
• Dynamic pickup and delivery problems
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery
• A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Stochastic Vehicle Routing Problem with Restocking
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands

This page was built for publication: Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands