Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10348002 | Computers & Operations Research | 2012 | 11 Pages |
Abstract
⺠We investigate the dynamic lot-size problem under stochastic and non-stationary demand over the planning horizon. ⺠The problem is tackled by using three popular heuristic methods from the fields of evolutionary computation and swarm intelligence, namely particle swarm optimization, differential evolution and harmony search. ⺠The algorithms are properly manipulated to fit the requirements of the problem. ⺠Their performance, in terms of run-time and solution accuracy, is investigated on test cases previously used in relevant works. ⺠The obtained results are analyzed, providing evidence on the efficiency of the employed approaches as promising alternatives to the established Wagner-Whitin algorithm, as well as hints on their proper configuration.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
G.S. Piperagkas, I. Konstantaras, K. Skouri, K.E. Parsopoulos,