Stochastic Vehicle Routing Problem with Restocking

From MaRDI portal
Revision as of 15:17, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2783878

DOI10.1287/trsc.34.1.99.12278zbMath1014.90020OpenAlexW1973220928MaRDI QIDQ2783878

Wen-Huei Yang, Kamlesh Mathur, Ronald H. Ballou

Publication date: 17 July 2003

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.34.1.99.12278




Related Items (51)

Single vehicle routing with predefined client sequence and multiple warehouse returns: the case of two warehousesA hybrid clonal selection algorithm for the location routing problem with stochastic demandsA solution method for a two-dispatch delivery problem with stochastic customersA single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer orderOn-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windowsAn integer L-shaped method for the generalized vehicle routing problem with stochastic demandsExact Algorithms for the Chance-Constrained Vehicle Routing ProblemSolving multiobjective vehicle routing problem with stochastic demand via evolutionary computationPaired cooperative reoptimization strategy for the vehicle routing problem with stochastic demandsA branch-and-price approach for a multi-period vehicle routing problemFaster rollout search for the vehicle routing problem with stochastic demands and restockingFailure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demandsA hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demandsA multi-space sampling heuristic for the vehicle routing problem with stochastic demandsFuzzy green vehicle routing problem with simultaneous pickup – delivery and time windowsOptimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demandsA concise guide to existing and emerging vehicle routing problem variantsOffline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demandSolving the multidepot vehicle routing problem with limited depot capacity and stochastic demandsPartial-route inequalities for the multi-vehicle routing problem with stochastic demandsThe Vehicle Routing Problem with Stochastic Demands and Split DeliveriesRouting Courier Delivery Services with Urgent DemandAn integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickupAn integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demandsStochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequenceCyclic-order neighborhoods with application to the vehicle routing problem with stochastic demandSingle vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demandsThe Distributionally Robust Chance-Constrained Vehicle Routing ProblemA stochastic single vehicle routing problem with a predefined sequence of customers and collection of two similar materialsSingle vehicle routing with a predefined customer sequence and multiple depot returnsChallenges and Advances in A Priori RoutingAn exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policyRuntime reduction techniques for the probabilistic traveling salesman problem with deadlinesHybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clusteringThe capacitated vehicle routing problem with stochastic demands and time windowsA hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problemsSINGLE VEHICLE ROUTING PROBLEMS WITH A PREDEFINED CUSTOMER ORDER, UNIFIED LOAD AND STOCHASTIC DISCRETE DEMANDSA memetic algorithm for the multi-compartment vehicle routing problem with stochastic demandsA two-stage vehicle routing model for large-scale bioterrorism emergenciesHybrid metaheuristics for the vehicle routing problem with stochastic demandsExact algorithms for the chance-constrained vehicle routing problemStochastic single vehicle routing with a predefined customer sequence and multiple depot returnsAN EFFICIENTLY NOVEL MODEL FOR VEHICLE ROUTING PROBLEMS WITH STOCHASTIC DEMANDSA solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demandsA survey on metaheuristics for stochastic combinatorial optimizationAn approximate dynamic programming approach for the vehicle routing problem with stochastic demandsA self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problemA branch-and-price algorithm for the capacitated arc routing problem with stochastic demandsComparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demandsEstimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customersFinite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery




This page was built for publication: Stochastic Vehicle Routing Problem with Restocking