Το work with title Particle swarm optimization for the vehicle routing problem with stochastic demands by Marinaki Magdalini, Marinakis Ioannis, Iordanidou Georgia-Roumpini is licensed under Creative Commons Attribution 4.0 International
Bibliographic Citation
Y. Marinakis, G.R. Iordanidou and M. Marinaki, (2013) “Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands”, Applied Soft Computing, Vol. 13, Issue 4, Apr. 2013, p.p 1693–1704, doi:10.1016/j.asoc.2013.01.007
https://doi.org/10.1016/j.asoc.2013.01.007
This paper introduces a new hybrid algorithmic approach based on Particle Swarm Optimization (PSO) for successfully solving one of the most popular supply chain management problems, the Vehicle Routing Problem with Stochastic Demands (VRPSD). The VRPSD is a well known NP-hard problem in which a vehicle with finite capacity leaves from the depot with full load and has to serve a set of customers whose demands are known only when the vehicle arrives to them. A number of different variants of the PSO are tested and the one that performs better is used for solving benchmark instances from the literature.