基于禁忌搜索的生产 ---库存 ---配送协同计划问题研究

Research on Coordinated Production-Inventory-Distribution PlanningProblem Based on Tabu Search

  • 摘要: 针对具有一定生产期和存储期的快速消费品,从供应链集成的角度研究了确定性需求情形下多工厂、多产品、多客户供应网络的生产 ---库存 ---配送协同计划问题, 并建立了多周期环境下生产 ---库存 ---配送协同计划问题的混合整数规划模型,以协同优化各工厂的生产计划、库存计划与配送计划.提出了求解该模型的禁忌搜索算法方案, 且通过设计启发式顺序分配方法生成初始解,采用了从改进的2-opt和λ -interchange的邻域解中产生候选解的策略,给出了提出算法的具体实现过程.最后,通过测试算例的仿真结果, 证明了禁忌搜索算法在求解该类问题时具有比混合遗传算法更强的鲁棒性,并且能够得到更好的解.

     

    Abstract: For the fast moving customer goods with a certain production and storage cycle, the coordinated production-inventory-distribution planning problem with multiple plants, multiple products and multiple customers under the deterministic demand are studied from the view of supply chain integration. A multi-period model of coordinated production-inventory-distribution planning problem is proposed using a mixed integer programming approach. This model effectively optimizes the production plan, inventory plan and distribution plan in the system simultaneously. To solve the model, a method based on tabu search algorithm is presented. Initial solutions are constructed by the designed sequential allocation method, candidate solutions are generated from neighborhood solutions of the improved 2-opt and 2-interchange, and then the implementation process of the algorithm is given. Finally, the results of the simulation examples prove that the tabu search algorithm is more robust than the hybrid genetic algorithm to solve this kind of problems, and can get a better solution.

     

/

返回文章
返回