Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems

详细信息    查看全文

• 作者：Angelo Sifaleras^a ; ^{sifalera@uom.gr} ; Ioannis Konstantaras^b ; ^{ikonst@uom.gr}
• 关键词：Inventory ; Variable Neighborhood Search ; Mathematical Programming ; Lot Sizing ; Reverse Logistics
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：78
• 期：Complete
• 页码：385-392
• 全文大小：307 K
• 卷排序：78

文摘

Tackle the multi-product dynamic lot sizing problem with product returns and recovery. Investigate for the first time a VND approach for this NP-hard problem. Present a new benchmark set with the currently largest instances in the literature. Propose a self-contained solver without any link to other callable library API. The proposed VND heuristic outperforms the state-of-the-art Gurobi optimizer.