The capacitated vehicle routing problem with stochastic demands and time windows

DOI10.1016/J.COR.2011.02.007zbMATH Open1215.90013OpenAlexW2153921194MaRDI QIDQ547129FDOQ547129

Authors: Hongtao Lei, G. Laporte, Bo Guo 

Publication date: 30 June 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.02.007

Recommendations

• A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• scientific article; zbMATH DE number 1195627
• The Vehicle Routing Problem with Stochastic Travel Times
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers

zbMATH Keywords

stochastic vehicle routingadaptive large neighborhood search heuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)

Cites Work

• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• Stochastic vehicle routing: A comprehensive approach
• Models and exact solutions for a class of stochastic location-routing problems
• Dynamic vehicle routing: Status and prospects
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Handbooks in operations Research \& management science: Transportation
• Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• A Vehicle Routing Problem with Stochastic Demand
• Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
• A general heuristic for vehicle routing problems
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
• Stochastic vehicle routing problem with restocking
• Designing delivery districts for the vehicle routing problem with stochastic demands
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• A Priori Optimization
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• Title not available (Why is that?)
• Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
• A generalized insertion heuristic for the travelling salesman problem with time windows

Cited In (26)

• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
• Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows
• Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
• A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority
• Elective course student sectioning at Danish high schools
• A multi-period TSP with stochastic regular and urgent demands
• Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem
• Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry
• The capacitated vehicle routing problem with evidential demands
• 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
• Title not available (Why is that?)
• On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows
• Satisficing measure approach for vehicle routing problem with time windows under uncertainty
• Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
• Dynamic design of sales territories
• Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
• An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands
• The consultation timetabling problem at Danish high schools
• The Vehicle Routing Problem with Stochastic Demands and Split Deliveries
• Convex approximations of two-stage risk-averse mixed-integer recourse models
• Urban regional logistics distribution path planning considering road characteristics
• Robust vehicle routing problem with hard time windows under demand and travel time uncertainty
• A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times

This page was built for publication: The capacitated vehicle routing problem with stochastic demands and time windows

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