SavedAdd your journal

Journals / Yaşar Üniversitesi E-Dergisi / 2017 / Cilt: 12 - Sayı: 45

A Hyperheuristic Approach for Dynamic Multilevel Capacitated Lot Sizing with Linked Lot Sizes for APS implementations

Mahmut Ali GÖKÇE
Berkay BEYGO
Turgut EKMEKÇİ
Pages
1–13
Publication Date
2017-02-22
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

New model is demonstrated by solving moderate size test problem along with software developed.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:This study is concerned with solving real-life sized APS problems practically.
📊
Key Findings & Data:Specifically, the problem of Multilevel Capacitated Lot Sizing Problem with linked lot sizes (MLCLSP-L) is considered.
💡
Conclusion & Impact:New model is demonstrated by solving moderate size test problem along with software developed.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

This study is concerned with solving real-life sized APS problems practically. Specifically, the problem of Multilevel Capacitated Lot Sizing Problem with linked lot sizes (MLCLSP-L) is considered. The problem is a classical, practical and notoriously hard problem. We propose a new modeling technique for MLCLSP-L based on a GA-driven hyperheuristic, which enables modeling of some issues previously not modeled. Proposed model uses an indirect representation by allowing GA search through a space of low level heuristics. Each one of the low level heuristics is simple and determines the detailed production plan of a machine in a period. The solution is constructed through combination of these low level heuristics. New model is demonstrated by solving moderate size test problem along with software developed.

🔖

Cite This Article

GÖKÇE, M. A., BEYGO, B., EKMEKÇİ, T. (2017). A Hyperheuristic Approach for Dynamic Multilevel Capacitated Lot Sizing with Linked Lot Sizes for APS implementations. Yaşar Üniversitesi E-Dergisi, Cilt: 12 - Sayı: 45, 1–13. https://ajindex.com/articles/193827

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (15)

  1. Bai R., Burke E.K. and Kendall G. (2008)
  2. Heuristic, Meta-heuristic and Hyper-heuristic Approaches for Fresh Produce Inventory Control and Shelf Space Allocation. Journal of the Operational Research Society, 59(10), pages 187-1397.
  3. Bitran, G.R., Yanasse, H.H. (1982). Computational complexity of the capacitated lot size problem, Management Science 28, 1174-1186.
  4. Blackstone, John H., and James F. Cox. 2005.
  5. APICS dictionary. Alexandria, VA: APICS Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., and Schulenburg, S., 2003, Handbook of metaheuristics, chapter 16, Hyper-heuristics: an emerging direction in modern search technology, pp. 457--474. Kluwer Academic Publishers,
  6. Chaklevitch K., Cowling, P.:Hyperheuristics: Recent Developments. In: Cotta, C., Sevaux, M., and Srensen, K.(eds.), 2008, Adaptive and Multilevel Metaheuristics (Studies in Computational Intelligence), pp 3-29,
  7. Springer Publishing Company, Incorporated Chen, W.H., Thizy, J.M., 1990, Analysis of relaxations for the multi-item capacitated lot-sizing problem, Annals of Operations Research 26, 29–72.
  8. Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 176–190.
  9. Springer, Heidelberg (2001)
  10. De Kok, A.G and Graves, S.C. (2003). Handbook in Operations Research and Management Science Vol. 11- Supply Chain Management: Design, Coordination and Operation, Elsevier, Amsterdam. Denizel, M and Süral, H (2006). On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times, Journal of the Operational Research Society, 57 (4), 389-399. Drexl A., & Kimms A. (1997). Lot sizing and scheduling – survey and extensions. European Journal of Operations Research 99, 221-235.
  11. Drexl, A., Haase, K. (1995). Proportional lot sizing and scheduling, International Journal of Production Economics 40, 73-87.
  12. Fleischmann, B. (1990). The discrete lot-sizing and scheduling problem, European Journal of Operational Research 44, 337-348.
  13. Fleischmann, B.; Meyr, H.; Wagner, M. (2008) Advanced planning, in: H. Stadtler; C. Kilger (Eds.) Supply Chain Management and Advanced Planning, Springer, Berlin et al., 4th ed., 81–109
  14. Florian, M., Lenstra, J.K., Rinnooy Kan, A.H.G., 1980, Deterministic Production Planning: Algorithms and Complexity, Management Science 26 (7), 669-679.
  15. Günter, H.P. (2005), Supply Chain Management and Advanced Planning Systems: A Tutorial, Physica-Verlag HD.