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

DOI10.1016/J.EJOR.2018.05.049zbMATH Open1403.90194OpenAlexW2803158063WikidataQ129751287 ScholiaQ129751287MaRDI QIDQ1653371FDOQ1653371

Authors: Lin Zhu, Jiuh-Biing Sheu 

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

Recommendations

• Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
• Vehicle routing problem with stochastic demand
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
• Vehicle routing with stochastic demands and restricted failures

zbMATH Keywords

logisticsstochastic vehicle routingpickup and deliveryadaptive large neighbourhood searcha priori route optimisation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

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

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

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