Perishable inventory control with backlogging penalties: A mixed-integer linear programming model via two-step approximation

IF 4.3 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2025-04-01 Epub Date: 2024-12-17 DOI:10.1016/j.cor.2024.106953
Yulun Wu , Shunji Tanaka
{"title":"Perishable inventory control with backlogging penalties: A mixed-integer linear programming model via two-step approximation","authors":"Yulun Wu ,&nbsp;Shunji Tanaka","doi":"10.1016/j.cor.2024.106953","DOIUrl":null,"url":null,"abstract":"<div><div>This study proposes a novel approximate mixed-integer linear programming (MILP) model for the perishable inventory control problem considering non-stationary demands and backlogging penalties. Because of the existence of the waste costs incurred by outdated products in the cost function, it is difficult to apply the linearization technique employed for the non-perishable inventory control problem directly to our problem. To address this difficulty, we develop a two-step approximation method. In the first step, we approximate each expected cost to simplify the cost function, making it easy to handle. In the second step, we apply an existing linearization technique to linearize this function and then obtain the MILP model. We evaluate the proposed model in computer simulations by comparing it with other existing methods. The results show that our model closely matches a benchmark method capable of obtaining near-optimal solutions in solution quality, and it achieves a better trade-off between solution quality and computational efficiency than existing heuristics.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"176 ","pages":"Article 106953"},"PeriodicalIF":4.3000,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824004258","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/12/17 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

This study proposes a novel approximate mixed-integer linear programming (MILP) model for the perishable inventory control problem considering non-stationary demands and backlogging penalties. Because of the existence of the waste costs incurred by outdated products in the cost function, it is difficult to apply the linearization technique employed for the non-perishable inventory control problem directly to our problem. To address this difficulty, we develop a two-step approximation method. In the first step, we approximate each expected cost to simplify the cost function, making it easy to handle. In the second step, we apply an existing linearization technique to linearize this function and then obtain the MILP model. We evaluate the proposed model in computer simulations by comparing it with other existing methods. The results show that our model closely matches a benchmark method capable of obtaining near-optimal solutions in solution quality, and it achieves a better trade-off between solution quality and computational efficiency than existing heuristics.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有积压惩罚的易腐库存控制:基于两步逼近的混合整数线性规划模型
针对易腐库存控制问题,提出了一种考虑非平稳需求和积压惩罚的近似混合整数线性规划(MILP)模型。由于成本函数中存在过期产品产生的浪费成本,难以将非易腐库存控制问题的线性化技术直接应用于我们的问题。为了解决这个困难,我们开发了一种两步逼近方法。在第一步中,我们近似每个期望成本以简化成本函数,使其易于处理。在第二步中,我们应用现有的线性化技术对该函数进行线性化,然后得到MILP模型。通过与其他现有方法的比较,我们在计算机模拟中对所提出的模型进行了评估。结果表明,该模型在求解质量上与一种能够获得近似最优解的基准方法非常接近,并且在求解质量和计算效率之间取得了比现有启发式方法更好的平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
A dual-heuristic crossover genetic algorithm with variable neighborhood search for flexible job shop scheduling with transportation times Solving heterogeneous vehicle routing problems using decomposition and set covering Multi-depot electric vehicle routing problem with half-open rotations: a formulation and metaheuristic algorithms The covering tour problem with path upgrades Combining relax-and-fix and fix-and-optimize approaches to solve the Multi-Item Capacitated Lot-Sizing Problem with Unrelated Parallel Machines
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1