Institutional Repository
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Particle swarm optimization for the vehicle routing problem with stochastic demands

Marinaki Magdalini, Marinakis Ioannis, Iordanidou Georgia-Roumpini

Full record


URI: http://purl.tuc.gr/dl/dias/BC25BDBF-4116-4C77-A416-DA3B48AE0BAD
Year 2013
Type of Item Unreviewed Journal Publication
License
Details
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
Appears in Collections

Summary

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.

Services

Statistics