Solving lot-sizing problem with quantity discount and transportation cost

勤益科大機構典藏 > 管理學院 > 工業工程與管理系(所) > 【工業工程與管理系所】期刊論文 > Item 987654321/6185

請使用永久網址來引用或連結此文件: http://ir.lib.ncut.edu.tw/handle/987654321/6185

題名:	Solving lot-sizing problem with quantity discount and transportation cost
作者:	康鶴耀
貢獻者:	工業工程與(工程)管理系
日期:	2013-04
上傳時間:	2017-09-30 11:19:56 (UTC+8)
摘要:	Owing to today's increasingly competitive market and ever-changing manufacturing environment, the inventory problem is becoming more complicated to solve. The incorporation of heuristics methods has become a new trend to tackle the complex problem in the past decade. This article considers a lot-sizing problem, and the objective is to minimise total costs, where the costs include ordering, holding, purchase and transportation costs, under the requirement that no inventory shortage is allowed in the system. We first formulate the lot-sizing problem as a mixed integer programming (MIP) model. Next, an efficient genetic algorithm (GA) model is constructed for solving large-scale lot-sizing problems. An illustrative example with two cases in a touch panel manufacturer is used to illustrate the practicality of these models, and a sensitivity analysis is applied to understand the impact of the changes in parameters to the outcomes. The results demonstrate that both the MIP model and the GA model are effective and relatively accurate tools for determining the replenishment for touch panel manufacturing for multi-periods with quantity discount and batch transportation. The contributions of this article are to construct an MIP model to obtain an optimal solution when the problem is not too complicated itself and to present a GA model to find a near-optimal solution efficiently when the problem is complicated. © 2013 Taylor & Francis Group, LLC. (51 refs)
關聯:	International Journal of Systems Science
顯示於類別:	[工業工程與管理系(所)] 【工業工程與管理系所】期刊論文

文件中的檔案:

沒有與此文件相關的檔案.

檢視Licence

在NCUTIR中所有的資料項目都受到原著作權保護.

資料載入中.....