计算机应用研究2026，Vol.43Issue(8)：2293-2300,8.DOI:10.19734/j.issn.1001-3695.2025.11.0500
生鲜产品零滞留与需求拆分下的生产配送优化算法
Research on optimization of production and transportation scheduling considering job splitting in no on-site storage
摘要
Abstract
This study investigated the production and transportation scheduling problem with no on-site storage and job split-ting.A mixed-integer programming model was developed to minimize the total cost,which consists of backorder cost,inventory holding cost,and transportation cost,under constraints including sequence-dependent setup times and multiple hard time win-dows.To improve scalability on large instances,this paper proposed an enhanced heuristic algorithm.The upper level applied a dichotomy search.The lower level used a dual-population genetic algorithm and incorporated local search and simulated annea-ling to form a hybrid heuristic.Computational experiments demonstrate the practical value of both the model and the algorithm,with the optimized solution reducing the total cost by 8.17％.Further numerical results show that the improved heuristic achieves significantly better solution stability and quality while maintaining low computational complexity.Its Gap consistently remains be-low 3％,outperforming the dual-population genetic algorithm,the single-population genetic algorithm,and the Gurobi solver.关键词
生产配送/JIT/产地零滞留/需求拆分/序列依赖准备时间/混合启发式Key words
production and transportation scheduling/JIT/no on-site storage/job splitting/sequence-dependent setup time/hybrid heuristic分类
信息技术与安全科学引用本文复制引用
曹搏悦,储诚斌..生鲜产品零滞留与需求拆分下的生产配送优化算法[J].计算机应用研究,2026,43(8):2293-2300,8.基金项目
国家自然科学基金资助项目(71871159) （71871159）
