当前位置: X-MOL 学术Comput. Ind. Eng. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Dynamic pricing and lot sizing for a newsvendor problem with supplier selection, quantity discounts, and limited supply capacity
Computers & Industrial Engineering ( IF 7.9 ) Pub Date : 2021-01-13 , DOI: 10.1016/j.cie.2021.107113
Omid Jadidi , Mohamad Y. Jaber , Saeed Zolfaghri , Roberto Pinto , Fatemeh Firouzi

This study considers the joint pricing and sourcing decision problem for a buyer purchasing a product from a set of suppliers who offer quantity discounts. The suppliers’ supply and/or the buyer’s warehouse capacities are bounded, causing the buyer to split its order over multiple suppliers and periods. This study assumes that demand is random over the planning horizon, divided into several periods, and dependent on price and time. The buyer, in each period, has to determine its retail price and the order quantities from the suppliers that maximize its expected profit. The problem is, therefore, formulated as mixed-integer nonlinear programming one, and an algorithm is developed to solve it. Numerical results show that the buyer may not buy up to the maximum capacity of a supplier with the lowest price when its order quantity exceeds the supply capacity of that supplier. In this case, the buyer needs to assign the remaining quantity to a more expensive supplier given that it exceeds that supplier’s minimum order quantity. The buyer could consider, as another option, convincing the low-priced supplier to increase its supply capacity in return for accepting a higher wholesale price, which only applies to the portion of an order exceeding the original supply capacity. For this to work, it should be economical for both players. Many numerical examples are provided with their results discussed to draw some insights and concluding remarks.



中文翻译:

动态定价和批量确定新闻供应商的问题,包括选择供应商,数量折扣和供应能力有限

这项研究考虑了购买者从一组提供数量折扣的供应商那里购买产品的联合定价和采购决策问题。供应商的供应和/或买方的仓库容量受到限制,导致买方将其订单拆分为多个供应商和多个期间。这项研究假设需求在计划范围内是随机的,分为几个时期,并取决于价格和时间。在每个时期,买方都必须确定其零售价和从供应商处获得的订单数量,以使其预期利润最大化。因此,将该问题表述为混合整数非线性规划,并开发了一种算法来解决该问题。数值结果表明,当买方的订单数量超过该供应商的供应能力时,其可能无法以最低的价格购买该供应商的最大能力。在这种情况下,买方需要将剩余数量分配给更昂贵的供应商,前提是剩余数量超过了该供应商的最低订购数量。买方可以考虑作为另一种选择,说服低价供应商增加其供应能力,以换取接受更高的批发价,该价格仅适用于超出原始供应能力的订单部分。要使此方法有效,对于两个参与者都应该是经济的。提供了许多数值示例,并对其结果进行了讨论,以得出一些见解和结论。买方需要将剩余数量分配给更昂贵的供应商,因为该数量超过了该供应商的最低订购数量。买方可以考虑作为另一种选择,说服低价供应商增加其供应能力,以换取接受更高的批发价,该价格仅适用于超出原始供应能力的订单部分。要使此方法有效,对于两个参与者都应该是经济的。提供了许多数值示例,并对其结果进行了讨论,以得出一些见解和结论。买方需要将剩余数量分配给更昂贵的供应商,因为该数量超过了该供应商的最低订购数量。买方可以考虑作为另一种选择,说服低价供应商增加其供应能力,以换取接受更高的批发价,该价格仅适用于超出原始供应能力的订单部分。要使此方法有效,对于两个参与者都应该是经济的。提供了许多数值示例,并对其结果进行了讨论,以得出一些见解和结论。仅适用于订单中超出原始供应量的部分。要使此方法有效,对于两个参与者都应该是经济的。提供了许多数值示例,并对其结果进行了讨论,以得出一些见解和结论。仅适用于订单中超出原始供应量的部分。要使此方法有效,对于两个参与者都应该是经济的。提供了许多数值示例,并对其结果进行了讨论,以得出一些见解和结论。

更新日期:2021-01-24
down
wechat
bug