A vehicle routing problem with stochastic demand
Operations Research
Computers and Operations Research - Neural networks in business
Simulation Modeling and Analysis
Simulation Modeling and Analysis
GVR: A New Genetic Representation for the Vehicle Routing Problem
AICS '02 Proceedings of the 13th Irish International Conference on Artificial Intelligence and Cognitive 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
An evolutionary-based decision support system for vehicle routing: The case of a public utility
Decision Support Systems
A hybrid metaheuristic for a real life vehicle routing problem
NMA'06 Proceedings of the 6th international conference on Numerical methods and applications
A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
Operations Research Letters
Computers and Operations Research
The capacitated vehicle routing problem with stochastic demands and time windows
Computers and Operations Research
Optimization of infectious medical waste collection using RFID
ICCL'11 Proceedings of the Second international conference on Computational logistics
Improved packing and routing of vehicles with compartments
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Variable Neighborhood Search heuristic for the Inventory Routing Problem in fuel delivery
Expert Systems with Applications: An International Journal
An event-driven optimization framework for dynamic vehicle routing
Decision Support Systems
Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands
Applied Soft Computing
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
Region based memetic algorithm for real-parameter optimisation
Information Sciences: an International Journal
Hi-index | 0.01 |
The multi-compartment vehicle routing problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of customers for several products that, because of incompatibility constraints, must be loaded in independent vehicle compartments. Despite its wide practical applicability the MC-VRP has not received much attention in the literature, and the few existing methods assume perfect knowledge of the customer demands, regardless of their stochastic nature. This paper extends the MC-VRP by introducing uncertainty on what it is known as the MC-VRP with stochastic demands (MC-VRPSD). The MC-VRPSD is modeled as a stochastic program with recourse and solved by means of a memetic algorithm. The proposed memetic algorithm couples genetic operators and local search procedures proven to be effective on deterministic routing problems with a novel individual evaluation and reparation strategy that accounts for the stochastic nature of the problem. The algorithm was tested on instances of up to 484 customers, and its results were compared to those obtained by a savings-based heuristic and a memetic algorithm (MA/SCS) for the MC-VRP that uses a spare capacity strategy to handle demand fluctuations. In addition to effectively solve the MC-VRPSD, the proposed MA/SCS also improved 14 best known solutions in a 40-problem testbed for the MC-VRP.