A vehicle routing problem with stochastic demand
Operations Research
The vehicle routing problem
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Scheduling Deliveries in Vehicles with Multiple Compartments
Journal of Global Optimization
Stochastic Vehicle Routing Problem with Restocking
Transportation Science
SSJ: SSJ: a framework for stochastic simulation in Java
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
Computers and Operations Research
A Paired-Vehicle Recourse Strategy for the Vehicle-Routing Problem with Stochastic Demands
Transportation Science
Fifty Years of Vehicle Routing
Transportation Science
First vs. best improvement: An empirical study
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
A guided local search procedure for the multi-compartment capacitated arc routing problem
Computers and Operations Research
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
Computers and Operations Research
A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
Operations Research Letters
A hybrid topology optimization methodology combining simulated annealing and SIMP
Computers and Structures
Improved packing and routing of vehicles with compartments
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Hi-index | 0.00 |
The vehicle routing problem with stochastic demands (VRPSD) consists of designing transportation routes of minimal expected cost to satisfy a set of customers with random demands of known probability distribution. This paper tackles a generalization of the VRPSD known as the multicompartment VRPSD (MC-VRPSD), a problem in which each customer demands several products that, because of incompatibility constraints, must be loaded in independent vehicle compartments. To solve the problem, we propose three simple and effective constructive heuristics based on a stochastic programming with recourse formulation. One of the heuristics is an extension to the multicompartment scenario of a savings-based algorithm for the VRPSD; the other two are different versions of a novel look-ahead heuristic that follows a route-first, cluster-second approach. In addition, to enhance the performance of the heuristics these are coupled with a post-optimization procedure based on the classical 2-Opt heuristic. The three algorithms were tested on instances of up to 200 customers from the MC-VRPSD and VRPSD literature. The proposed heuristics unveiled 26 and 12 new best known solutions for a set of 180 MC-VRPSD problems and a 40-instance testbed for the VRPSD, respectively.