Abstract

This paper presents a new adaptive genetic algorithm (GA) to escape local optimum solutions of the traditional lot-sizing rules. In this GA, the timing of replenishment is encoded as a string of binary digits (a chromosome). Each gene in that chromosome stands for a period. Standard GA operators are used to generate new populations. These populations are evaluated by a fitness function using the replenishment scheme of solution based on the total cost. Through this evaluation, the rates of GA operators for the next generation are automatically adjusted based on the rate of survivor offsprings, which are generated by corresponding operators. The oriented search procedure using these self-adjustment rates of operator schemes can give faster and better solutions. Some experimental results confirm the theoretical judgment.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.