面向有限拼载与嵌套满足约束的出厂物流组合装载问题的模型与优化算法研究

项目名称： 面向有限拼载与嵌套满足约束的出厂物流组合装载问题的模型与优化算法研究

项目编号： No.71272115

项目类型： 面上项目

立项/批准年度： 2013

项目学科： 管理科学

项目作者： 陈峰

作者单位： 上海交通大学

项目金额： 48万元

中文摘要： 出厂物流是制造企业的重要物流环节；装载效率是决定出厂物流运作水平的关键因素。通过深入分析出厂物流的实际运作流程,本项目提出研究一类新的具有装载组合约束的组合装载问题，特点在于装载的有限拼载性与嵌套性。在对该装载决策过程进行系统描述基础上，研究装载及数学规划模型的建模方法。进一步，基于物流与供应链、装箱、组合优化与计算复杂性理论，从建立集成装载模型与设计高效优化算法的角度出发，通过分析问题的最优解特征,提炼其数学特征量.分析问题的计算难解性,并设计精确及启发式算法,从理论及数值上研究模型及算法性能。通过合作企业进行实证研究，提出高效鲁棒的系统解决方案。研究内容属于物流与供应链管理的应用基础研究，研究方法具有可行性和探索性，研究成果有较强的理论价值。项目完成对促进管理科学、物流工程甚至组合优化学科的发展有一定科学意义。项目源于生产实践，研究成果对指导物流实践，促进物流应用技术发展有现实意义。

中文关键词： 汽车物流；出厂物流；智能调度；近似算法；精确算法

英文摘要： Outbound logistics is the key phrase for manufacturer to satisfy their customers. The full truckload ratio is an important factor in deciding the operational level of outbound logistics. By analyzing the operational flow of outbound logistics, the proposal presents a so called combinatorial loading problem with two main properties of limited LTL and nested satisfaction. Modeling methodologies including mathematical programming will be studied based on the systematic description of decision process. In order to build efficient models and design high performance algorithms, optimal conditions of solutions, mathematical indices of properties and computational intractability of problems will be first investigated. Then exact and approximation algorithms will be given with performance analysis from both theoretical and practical aspects. By cooperation with a 3PL company, a robust systematic solution will be provided. Our studies belong to the fundamental applied theoretical research for logistics and supply chain, and research methodologies adopted in the proposal are feasible and innovative. The expected results have strong theoretical values. It is significant to implement the project for the development of management science, logistics engineering and combinatorial optimization. The proposal is motivated by prac

英文关键词： automobile logsittics；outbound logistics；intelligent scheduling；approximation algorithm；exact algorithm