Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

An application of genetic algorithms for general dynamic lotsizing problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Xie Jinxing ; Tsinghua Univ., Beijing, China

This paper presents an application of genetic algorithms for dynamic lotsizing problems, including the implementation methodology and the testing results of the algorithms. Currently, most of the existing studies for dynamic lotsizing problems concentrate on heuristic lot-sizing techniques which only consider some simple production structures and/or simple external demands structures. In this paper, the general dynamic lot-sizing problems are considered, which are characterized by the fact that each stage may have several predecessor and/or successor stages, all the items can have independent requirements, and/or all the cost parameters can be time-varying. A genetic algorithm for the problems is introduced, which attempts to heuristically optimize under all the conditions simultaneously. As to my knowledge,this genetic algorithm is the first one capable of solving such general dynamic lotsizing problems. In order to apply genetic algorithm, a coding scheme for lotsize plan/schedule is given and a feasibility routine is presented. In computational experiments, this genetic algorithm performed extremely well. It is concluded that the genetic algorithm is efficient and effective for dynamic lotsizing problems

Published in:

Genetic Algorithms in Engineering Systems: Innovations and Applications, 1995. GALESIA. First International Conference on (Conf. Publ. No. 414)

Date of Conference:

12-14 Sep 1995