Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands

Authors:
Yannis Marinakis;Georgia-Roumbini Iordanidou;Magdalene Marinaki
Affiliations:
Technical University of Crete, Department of Production Engineering and Management, University Campus, 73100 Chania, Crete, Greece;Technical University of Crete, Department of Production Engineering and Management, University Campus, 73100 Chania, Crete, Greece;Technical University of Crete, Department of Production Engineering and Management, University Campus, 73100 Chania, Crete, Greece
Venue:
Applied Soft Computing
Year:
2013

Citing 19
Cited 2

Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands

Computers and Operations Research - Neural networks in business
Swarm intelligence

Swarm intelligence
The vehicle routing problem

The vehicle routing problem
Classical heuristics for the capacitated VRP

The vehicle routing problem
Metaheuristics for the capacitated VRP

The vehicle routing problem
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Very Large Scale Vehicle Routing with Time Windows and Stochastic Demand Using Genetic Algorithms with Parallel Fitness Evaluation

HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
Stochastic Vehicle Routing Problem with Restocking

Transportation Science
Stochastic Vehicle Routing with Random Travel Times

Transportation Science
Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers

Operations Research
Solving the vehicle routing problem with adaptive memory programming methodology

Computers and Operations Research
A review of particle swarm optimization. Part I: background and development

Natural Computing: an international journal
A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications

Natural Computing: an international journal
Bio-inspired Algorithms for the Vehicle Routing Problem

Bio-inspired Algorithms for the Vehicle Routing Problem
A survey on metaheuristics for stochastic combinatorial optimization

Natural Computing: an international journal
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands

Computers and Operations Research
The capacitated vehicle routing problem with stochastic demands and time windows

Computers and Operations Research
The particle swarm - explosion, stability, and convergence in amultidimensional complex space

IEEE Transactions on Evolutionary Computation
A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands

Operations Research Letters

Combinatorial expanding neighborhood topology particle swarm optimization for the vehicle routing problem with stochastic demands

Proceedings of the 15th annual conference on Genetic and evolutionary computation
Rotation-invariant texture image retrieval using particle swarm optimization and support vector regression

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

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.