Paper Info
Title
A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
Abstract
In this paper, we present an ant-based algorithm for solving unconstrained multi-level lot-sizing problems called ant system for multi-level lot-sizing algorithm (ASMLLS). We apply a hybrid approach where we use ant colony optimization in order to find a good lot-sizing sequence, i.e. a sequence of the different items in the product structure in which we apply a modified Wagner-Whitin algorithm for each item separately. Based on the setup costs each ant generates a sequence of items. Afterwards a simple single-stage lot-sizing rule is applied with modified setup costs. This modification of the setup costs depends on the position of the item in the lot-sizing sequence, on the items which have been lot-sized before, and on two further parameters, which are tried to be improved by a systematic search. For small-sized problems ASMLLS is among the best algorithms, but for most medium- and large-sized problems it outperforms all other approaches regarding solution quality as well as computational time.
Year
DOI
Venue
2007
10.1016/j.cor.2005.09.022
Computers & OR
Keywords
DocType
Volume
ant colony optimization,wagner- whitin algorithm,Wagner–Whitin algorithm,good lot-sizing sequence,multi-level lot-sizing algorithm,ant-based algorithm,best algorithm,modified Wagner-Whitin algorithm,multi-level lot-sizing,modified setup cost,setup cost,Ant colony optimization,Material requirements planning,lot-sizing sequence,unconstrained multi-level,Multi-level lot-sizing,MAX-MIN ant system,material requirements planning.,ant system
Journal
34
Issue
ISSN
Citations 
9
Computers and Operations Research
14
PageRank 
References 
Authors
0.82
8
4
Name
Order
Citations
PageRank
Rapeepan Pitakaso1323.85
Christian Almeder2907.09
Karl F Doerner3123562.24
Richard F. Hartl41863137.30