Mixed-Integer Optimization for Multi-Item Multi-Echelon Production and Distribution Planning

多项目多梯次生产和配送计划的混合整数优化

• 批准号: 0917952
• 负责人: Simge Kucukyavuz
• 金额: $ 23.61万
• 依托单位: Ohio State University Research Foundation -DO NOT USE
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2008
• 资助国家: 美国
• 起止时间: 2008-12-22 至 2012-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0917952&HistoricalAwards=false
• 关键词: Mixed; Integer; Optimization; Multi; Item

The objectives of this research are (1) to develop fixed-charge network flow (FCNF) models for complex multi-item multi-echelon production and distribution planning problems under possible scenario uncertainty, (2) to provide a rigorous study of the polyhedral structure of FCNF, (3) to develop and implement effective algorithms for FCNF, (4) to apply these algorithms to solve the aforementioned problems. This grant provides funding for the development of a unified theory of cutting planes for FCNF on a general network, without making any assumptions on the structure of the subgraphs. The proposed method for developing cutting planes will exploit the underlying network flow information. The explicit and combinatorial nature of the resulting inequalities will enable the characterization of the conditions under which the inequalities are strong. They will also enable the development of effective separation algorithms. Furthermore, the inequalities proposed for the deterministic production and distribution planning problems will be adapted to their stochastic counterparts to address the volatile nature of the demand and supply patterns. If successful, the solution methods developed will be very effective in solving not only challenging production and distribution planning problems in industry, but also a large class of mixed-integer programs defined on networks, such as telecommunications network design and emergency medical services deployment. The strong cutting planes developed can also be integrated into existing commercial or open-source mixed-integer programming solvers, which are increasingly used in state-of-the-art planning and scheduling software. The research activities will be closely integrated with the teaching and advising of graduate and undergraduate students. The research results will be further disseminated through publications and conference presentations.

本研究的目的是：（1）建立复杂的多产品多级生产和分销计划问题的固定费用网络流（FCNF）模型，（2）对FCNF的多面体结构进行严格的研究，（3）开发和实现FCNF的有效算法，（4）应用这些算法来解决上述问题。这笔赠款提供资金，用于在一般网络上开发FCNF切割平面的统一理论，而不对子图的结构进行任何假设。所提出的用于开发切割平面的方法将利用底层网络流信息。由此产生的不平等的明确和组合的性质将使表征的条件下，不等式是强的。它们还将使有效分离算法的开发成为可能。此外，为确定性生产和分配规划问题提出的不等式将适用于其随机对应物，以解决需求和供应模式的波动性。如果成功，开发的解决方案方法将是非常有效的，不仅在解决具有挑战性的生产和分销规划问题的行业，但也是一个大类的混合整数规划定义的网络，如电信网络设计和紧急医疗服务部署。开发的强切割平面也可以集成到现有的商业或开源混合整数规划求解器中，这些求解器越来越多地用于最先进的规划和调度软件中。研究活动将与研究生和本科生的教学和咨询紧密结合。研究结果将通过出版物和会议介绍进一步传播。