Cover Image

A genetic algorithm for solving single level lotsizing problems

The single level lot-sizing problem arises whenever a manufacturing company wishes to translate an aggregate plan for production of an end item into a detailed planning of its production. Although the cost driven problem is widely studied in the literature, only laborious dynamic programming approac...

Full description

Saved in:
Bibliographic Details
Main Authors: Zenon, Nasaruddin, Ahmad, Ab. Rahman, Ali, Rosmah
Format: Article
Language:English
Published: Penerbit UTM Press 2003
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://eprints.utm.my/id/eprint/1475/1/JT38D%5B4%5D.pdf
http://eprints.utm.my/id/eprint/1475/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.1475
record_format eprints
spelling my.utm.14752017-11-01T04:17:42Z http://eprints.utm.my/id/eprint/1475/ A genetic algorithm for solving single level lotsizing problems Zenon, Nasaruddin Ahmad, Ab. Rahman Ali, Rosmah QA75 Electronic computers. Computer science The single level lot-sizing problem arises whenever a manufacturing company wishes to translate an aggregate plan for production of an end item into a detailed planning of its production. Although the cost driven problem is widely studied in the literature, only laborious dynamic programming approaches are known to guarantee global minimum. Thus, stochastically-based heuristics that have the mechanism to escape from local minimum are needed. In this paper a genetic algorithm for solving single level lot-sizing problems is proposed and the results of applying the algorithm toexample problems are discussed. In our implementation, a lot-sizing population-generating heuristic is used to feed chromosomes to a genetic algorithm with operators specially designed for lot-sizing problems. The combination of the population-generating heuristic with genetic algorithm results in a faster convergence in finding the optimal lot-sizing scheme due to the guaranteed feasibility of the initial population. Penerbit UTM Press 2003-06 Article PeerReviewed application/pdf en http://eprints.utm.my/id/eprint/1475/1/JT38D%5B4%5D.pdf Zenon, Nasaruddin and Ahmad, Ab. Rahman and Ali, Rosmah (2003) A genetic algorithm for solving single level lotsizing problems. Jurnal Teknologi D, 38 (D). pp. 47-66. ISSN 0127-9696
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
language English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Zenon, Nasaruddin
Ahmad, Ab. Rahman
Ali, Rosmah
A genetic algorithm for solving single level lotsizing problems
description The single level lot-sizing problem arises whenever a manufacturing company wishes to translate an aggregate plan for production of an end item into a detailed planning of its production. Although the cost driven problem is widely studied in the literature, only laborious dynamic programming approaches are known to guarantee global minimum. Thus, stochastically-based heuristics that have the mechanism to escape from local minimum are needed. In this paper a genetic algorithm for solving single level lot-sizing problems is proposed and the results of applying the algorithm toexample problems are discussed. In our implementation, a lot-sizing population-generating heuristic is used to feed chromosomes to a genetic algorithm with operators specially designed for lot-sizing problems. The combination of the population-generating heuristic with genetic algorithm results in a faster convergence in finding the optimal lot-sizing scheme due to the guaranteed feasibility of the initial population.
format Article
author Zenon, Nasaruddin
Ahmad, Ab. Rahman
Ali, Rosmah
author_facet Zenon, Nasaruddin
Ahmad, Ab. Rahman
Ali, Rosmah
author_sort Zenon, Nasaruddin
title A genetic algorithm for solving single level lotsizing problems
title_short A genetic algorithm for solving single level lotsizing problems
title_full A genetic algorithm for solving single level lotsizing problems
title_fullStr A genetic algorithm for solving single level lotsizing problems
title_full_unstemmed A genetic algorithm for solving single level lotsizing problems
title_sort genetic algorithm for solving single level lotsizing problems
publisher Penerbit UTM Press
publishDate 2003
url http://eprints.utm.my/id/eprint/1475/1/JT38D%5B4%5D.pdf
http://eprints.utm.my/id/eprint/1475/
_version_ 1643643344784457728
score 13.211869

Similar Items