Lot-sizing and pricing decisions under attraction demand models and multi-channel environment: New efficient formulations

IF 3.7 4区 管理学 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Mourad Terzi , Yassine Ouazene , Alice Yalaoui , Farouk Yalaoui
{"title":"Lot-sizing and pricing decisions under attraction demand models and multi-channel environment: New efficient formulations","authors":"Mourad Terzi ,&nbsp;Yassine Ouazene ,&nbsp;Alice Yalaoui ,&nbsp;Farouk Yalaoui","doi":"10.1016/j.orp.2023.100269","DOIUrl":null,"url":null,"abstract":"<div><p>The presented paper considers the pricing and lot-sizing decisions for a manufacturer who produces and sells a single product in different selling channels i.e physical stock, website, mobile, etc. The objective is to find the production plan and prices of each channel to maximize the total profit defined from difference between the revenues and the productions, holding and setups costs. The consumers’ demand in each channel is represented by attraction demand models which include the multinomial logit (<span><math><mrow><mi>M</mi><mi>N</mi><mi>L</mi></mrow></math></span>), multiplicative competitive interaction (<span><math><mrow><mi>M</mi><mi>C</mi><mi>I</mi></mrow></math></span>) and linear demand models. The addressed problem is formulated as a non-convex mixed-integer nonlinear program (<span><math><mrow><mi>M</mi><mi>I</mi><mi>N</mi><mi>L</mi><mi>P</mi></mrow></math></span>). Based on properties of attraction functions, an efficient reformulation which transforms the initial non-convex problem into a convex one is presented. Therefore, an optimization approach based on the outer approximation algorithm is presented to solve the problem. Numerical tests based on large benchmark of real inspired instances show the efficiency of the proposed approach to solve the addressed problem compared to the initial non-convex model.</p></div>","PeriodicalId":38055,"journal":{"name":"Operations Research Perspectives","volume":"10 ","pages":"Article 100269"},"PeriodicalIF":3.7000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Perspectives","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2214716023000040","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The presented paper considers the pricing and lot-sizing decisions for a manufacturer who produces and sells a single product in different selling channels i.e physical stock, website, mobile, etc. The objective is to find the production plan and prices of each channel to maximize the total profit defined from difference between the revenues and the productions, holding and setups costs. The consumers’ demand in each channel is represented by attraction demand models which include the multinomial logit (MNL), multiplicative competitive interaction (MCI) and linear demand models. The addressed problem is formulated as a non-convex mixed-integer nonlinear program (MINLP). Based on properties of attraction functions, an efficient reformulation which transforms the initial non-convex problem into a convex one is presented. Therefore, an optimization approach based on the outer approximation algorithm is presented to solve the problem. Numerical tests based on large benchmark of real inspired instances show the efficiency of the proposed approach to solve the addressed problem compared to the initial non-convex model.

吸引-需求模型和多渠道环境下的批量和定价决策:新的高效配方
本文考虑了制造商在不同的销售渠道(即实体库存,网站,移动等)生产和销售单一产品的定价和批量决策。目标是找到每个渠道的生产计划和价格,以最大限度地利用收入与生产、持有和设置成本之间的差额来定义总利润。各渠道的消费者需求由吸引需求模型表示,吸引需求模型包括多项logit (MNL)、乘法竞争交互(MCI)和线性需求模型。该问题被表述为一个非凸混合整数非线性规划(MINLP)。根据吸引函数的性质,给出了一种将初始非凸问题转化为凸问题的有效的重新表述。因此,提出了一种基于外部逼近算法的优化方法来解决这一问题。基于实际启发实例的大型基准数值测试表明,与初始非凸模型相比,所提出的方法能够有效地解决所处理的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Operations Research Perspectives
Operations Research Perspectives Mathematics-Statistics and Probability
CiteScore
6.40
自引率
0.00%
发文量
36
审稿时长
27 days
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信