Genetic Algorithms for Dynamic Lot Sizing Problem considering with Customer Order in Supply Chain Management  

Oleh:

Hsu, Sheng-Yuan

Jenis: Article from Proceeding
Dalam koleksi: The 14th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS), 3-6 December 2013 Cebu, Philippines, page 1-12.
Topik: dynamic lot-sizing problem; customer order problem; GA; supply chain management
Fulltext: 1298.pdf (562.61KB)

Isi artikel

The problem DLSCOP, dynamic lot sizing with customer order problem, will be discussed in the paper. How to determine the optimum ordering plan to satisfy a set of known demands over a specific planning horizon is an important issue in supply chain management. The problem of customer order will be considered in the research, too. Customer order problem (COP) is another important issue in supply chain management. The order issued by the customer will purchase more than one items. All the items will have the same delivery date for the customer to proceed the manufacturing processes. In the paper, DLSP and COP will be considered together and a more efficiency methodology will be modeled for solving DLSCOP. A Linear Programming model will be developed for describing the DLSCOP. Genetic algorithms (GA) are applied to the problem. Furthermore, matrix based GA designed for DLSCOP will be modeled for comparing with the traditional GA (TGA). Two traditional heuristic methods for solving DLS, Silver-Meal (SM) algorithms and Wagner-Whitin (WW) algorithms, will be used for benchmark in our research, namely MSM and MWW. MSM and MWW are modified for the research for solving for solving DLSCOP. In the statistical analysis, the performance of MGA will be better than TGA, MSM and MWW. The total material cost based on MGA will save more than 10-50% especially in those scenarios with long term, multiple items, and high expense rate (ordering cost and holding cost). The time for the decision process of MGA will save more than 20-50%. That is, MGA can improve the efficiency and the quality of ordering plan for DLS/COP.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali