By Topic

Genetic algorithms in lot sizing decisions

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 $13
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

2 Author(s)
Hernandez, W. ; Dept. of Ind. Eng., Puerto Rico Univ., Mayaguez, Puerto Rico ; Suer, G.A.

This paper presents a genetic algorithm approach for the lot sizing problem. The lot sizing problem is defined as obtaining the order quantities for an uncapacitated, no shortages allowed, single-item, and single-level case. Experimentation was conducted to evaluate how different aspects of the genetic algorithm affect the results. In particular it was observed how scaling has the biggest impact

Published in:

Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on  (Volume:3 )

Date of Conference: