روش دقیق و اکتشافی برای طبقه ای از مسائل انتخابی پسر روزنامه فروش با تقاضاهای توزیع نرمال
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|51472||2013||9 صفحه PDF||سفارش دهید||7613 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Omega, Volume 41, Issue 2, April 2013, Pages 250–258
In this paper we study a class of selective newsvendor problems, where a decision maker has a set of raw materials each of which can be customized shortly before satisfying demand. The goal is then to select which subset of customizations maximizes expected profit. We show that certain multi-period and multi-product selective newsvendor problems fall within our problem class. Under the assumption that the demands are independent and normally, but not necessarily identically, distributed we show that some problem instances from our class can be solved efficiently using an attractive sorting property that was also established in the literature for some related problems. For our general model we use the KKT conditions to develop an exact algorithm that is efficient in the number of raw materials. In addition, we develop a class of heuristic algorithms. In a numerical study, we compare the performance of the algorithms, and the heuristics are shown to have excellent performance and running times as compared to available commercial solvers.