A multi-product multi-period inventory control problem under inflation and discount: a parameter-tuned particle swarm optimization algorithm
In this paper, a seasonal multi-product multi-period inventory control problem is modeled in which the inventory costs are obtained under inflation and all-unit discount policy. Furthermore, the products are delivered in boxes of known number of items, and in case of shortage, a fraction of demand i...
Gespeichert in:
Veröffentlicht in: | International journal of advanced manufacturing technology 2014-02, Vol.70 (9-12), p.1739-1756 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, a seasonal multi-product multi-period inventory control problem is modeled in which the inventory costs are obtained under inflation and all-unit discount policy. Furthermore, the products are delivered in boxes of known number of items, and in case of shortage, a fraction of demand is considered backorder and a fraction lost sale. Besides, the total storage space and total available budget are limited. The objective is to find the optimal number of boxes of the products in different periods to minimize the total inventory cost (including ordering, holding, shortage, and purchasing costs). Since the integer nonlinear model of the problem is hard to solve using exact methods, a particle swarm optimization (PSO) algorithm is proposed to find a near-optimal solution. Since there is no bench mark available in the literature to justify and validate the results, a genetic algorithm is presented as well. In order to compare the performances of the two algorithms in terms of the fitness function and the required CPU time, they are first tuned using the Taguchi approach, in which a metric called “smaller is better” is used to model the response variable. Then, some numerical examples are provided to demonstrate the application and to validate the results obtained. The results show that, while both algorithms have statistically similar performances, PSO tends to be the better algorithm in almost all problems. |
---|---|
ISSN: | 0268-3768 1433-3015 |
DOI: | 10.1007/s00170-013-5378-y |