针对单配送中心—多客户配送系统,建立带时间窗约束的单周期随机需求库存—运输整合优化( ITIO)问题模型.运用禁忌搜索算法,求解无时间窗约束的算例,结果表明库存—运输整合优化策略在总成本和车辆数上都优于全选最佳和全选次优策略,证明ITIO问题的研究具有理论意义和实际价值.同时,与遗传算法求解结果的比较表明,禁忌搜索算法求解此类问题具有优势.求解引入时间窗约束的算例,结果显示既满足时限要求,又比其他两种策略节省了库存—运输总成本,使得本模型及其求解算法更贴近实际应用要求.%The model of single-cycle inventory-transportation integrated optimization(ITIO) with time windows was constructed for one-center & multi-client distribution system. The results of the example without time windows by tabu search algorithm show that TTTO is superior to best-select and suboptimal-select strategy on total cost and total number of vehicles used, and therefore prove the theoretical and practical values of ITIO. Meanwhile, a comparison with results by genetic algorithm shows that the tabu search algorithm has an advantage while solving this kind problem. Furthermore, the time windows was added into the ITIO and the problem was solved. The results obtained not only meet clients' time limits, but save the total cost of inventory-transportation compared with best -select and suboptimal-select strategy, which promotes the ITIO model and its algorithm to be more closely applicable.
展开▼
