Particle swarm optimization for tackling continuous review inventory models

Authors:
K. E. Parsopoulos;K. Skouri;M. N. Vrahatis
Affiliations:
Computational Intelligence Laboratory, Department of Mathematics, University of Patras, Patras, Greece and University of Patras Artificial Intelligence Research Center, University of Patras, Patra ...;Department of Mathematics, University of Ioannina, Ioannina, Greece;Computational Intelligence Laboratory, Department of Mathematics, University of Patras, Patras, Greece and University of Patras Artificial Intelligence Research Center, University of Patras, Patra ...
Venue:
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
Year:
2008

Citing 7
Cited 1

Swarm intelligence

Swarm intelligence
Recent approaches to global optimization problems through Particle Swarm Optimization

Natural Computing: an international journal
Fundamentals of Computational Swarm Intelligence

Fundamentals of Computational Swarm Intelligence
Particle swarm optimization for integer programming

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
The particle swarm - explosion, stability, and convergence in amultidimensional complex space

IEEE Transactions on Evolutionary Computation
On the computation of all global minimizers through particle swarm optimization

IEEE Transactions on Evolutionary Computation
An optimal replenishment policy for deteriorating items with time-varying demand and partial backlogging

Operations Research Letters

Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an alternative algorithm for solving continuous review inventory model problems for deteriorating items over a finite horizon. Our interest focuses on the case of time-dependent demand and backlogging rates, limited or infinite warehouse capacity and taking into account the time value of money. The algorithm is based on Particle Swarm Optimization and it is capable of computing the number of replenishment cycles as well as the corresponding shortage and replenishment instances concurrently, thereby alleviating the heavy computational burden posed by the analytical solution of the problem through the Kuhn-Tucker approach. The proposed technique does not require any gradient information but cost function values solely, while a penalty function is employed to address the cases of limited warehouse capacity. Experiments are conducted on models proposed in the relative literature, justifying the usefulness of the algorithm.