Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Genetic algorithm and Hopfield neural network for a dynamic lot sizing problem

  • Original Article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

The dynamic lot sizing plays an important role when the demand of an item varies with time. This paper addresses a dynamic lot sizing problem (DLSP) with capacity constraint and discount price structure. Although the well-known dynamic programming (DP) of Wagner-Within is capable of providing an optimal solution for single stage lot sizing problems, it suffers from its high computational complexity. This limits the use of DP in practical problems that are generally larger in size. Two meta-heuristics, genetic algorithm (GA) and Hopfield neural network (HNN) are designed for DLSP to get best trade-off between solution quality and computational time. The DP algorithm is modeled to derive the optimal solution to the experimental problem. The optimality of GA and HNN are tested by comparing the percentage deviation of GA and HNN results against the optimal solution derived using DP.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Elhafsi M (2002) A production planning model for an unreliable production facility: case of finite horizon and single demand. Eur J Oper Res 143:94

    Article  MATH  Google Scholar 

  2. Voros J (2002) On the relaxation of multi-level dynamic lot-sizing models. Int J Prod Econ 77:53

    Article  Google Scholar 

  3. Wang SP (2002) An inventory replenishment policy for deteriorating items with shortages and partial backlogging. Comput Oper Res 29:2043

    Article  MATH  MathSciNet  Google Scholar 

  4. Ozdamar L, Birbil SI (1998) Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions. Eur J Oper Res 110:525

    Article  Google Scholar 

  5. Ozdamar L, Barbarosoglu G (2000) An integrated Lagrangean relaxation-simulated annealing approach to the multi-level multi-item capacitated lot sizing problem. Int J Prod Econ 68:319 (2000)

    Article  Google Scholar 

  6. Moon, Silsver EA, Choi S (2002) Hybrid genetic algorithm for the economic lot-scheduling problem. Int J Prod Res 40(4):809

    Article  MATH  Google Scholar 

  7. Dellaert N, Jeunet J, Jonard N (2000) A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs. Int J Prod Econ 68:241

    Article  Google Scholar 

  8. Wagner BJ, Davis DJ (2002) A search heuristic for the sequence-dependent economic lot scheduling problem. Eur J Oper Res 141:133

    Article  MATH  Google Scholar 

  9. Xie J, Dung J (2002) Heuristic genetic algorithms for general capacitated lot-sizing problems. Int J Comput Math 44:263

    MATH  Google Scholar 

  10. Gaafar LK, Choueiki MH (2000) A neural network model for solving the lot-sizing problem. Int J Manage Sci 28:175

    Article  Google Scholar 

  11. Del Re E, Fantacci R, Ronga L (1996) A dynamic channel allocation technique based on Hopfield Neural Networks. IEEE Trans Vehicular Technol 45(1):26

    Article  Google Scholar 

  12. Yuan SY, Kuo SY (1998) A new technique for optimization problems in graph theory. IEEE Trans Comput 47(2):190

    Article  MathSciNet  Google Scholar 

  13. Salcedo-Sanz S, Bousono-Calzon C, Figueiras-Vidal AR (2003) A mixed neural-genetic algorithm for the broadcast scheduling problem. IEEE Trans Wirel Commun 2(2):277

    Article  Google Scholar 

  14. Li SZ (1996) Improving convergence and solution quality of Hopfield-type neural networks with Augmented Lagrange Multipliers. IEEE Trans Neural Netw 7(6):1507

    Article  Google Scholar 

  15. Liu X, Chen T (2002) A new result on the global convergence of Hopfield Neural Networks. IEEE Trans Circuits Sys-I: Fundamental Theory Appl 49(10):1514

    Google Scholar 

  16. Goldberg DE (2002) Genetic algorithms in search, optimistion and machine learning. Pearson Education, Singapore

  17. Michalewize Z (1996) Genetic algorithm + data structures = evolution programming. Springer, Berlin Heidelberg New York

  18. Smith KA (1999) Neural Networks for combinatorial optimisation: a review more than a decade of research. Informs J Compu 11(1):15–31

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, Kamaraj College of Engineering and Technology, Virudhunagar, 626 001, India

    N. Megala

  2. Department of Mechanical Engineering, Thiagarajar College of Engineering, Madurai, 625 015, India

    N. Jawahar

Authors
  1. N. Megala
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Jawahar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. Jawahar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Megala, N., Jawahar, N. Genetic algorithm and Hopfield neural network for a dynamic lot sizing problem. Int J Adv Manuf Technol 27, 1178–1191 (2006). https://doi.org/10.1007/s00170-004-2306-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-004-2306-1

Keywords

Search

Navigation