Affordable Access

Publisher Website

Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands

Authors
Journal
Applied Soft Computing
1568-4946
Publisher
Elsevier
Volume
13
Issue
4
Identifiers
DOI: 10.1016/j.asoc.2013.01.007
Keywords
  • Particle Swarm Optimization
  • Path Relinking
  • Vehicle Routing Problem With Stochastic Demands
Disciplines
  • Computer Science

Abstract

Abstract 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.

There are no comments yet on this publication. Be the first to share your thoughts.