期刊文献+

越库配送车辆调度优化仿真研究 被引量:1

Research on Vehicle Scheduling Optimization and Simulation in Cross Docking
下载PDF
导出
摘要 越库配送被称为"物流领域的JIT"。越库配送的车辆调度是影响配送效率的关键环节,合理的车辆调度能够使客户和供应商得到及时服务,减少等待时间,加快物品的流转速度。现有研究未考虑越库配送中搬运设备对车辆调度的影响,使调度结果的可操作性不强。针对上述问题,以最小化操作时间为目标,建立了有搬运约束的越库车辆调度的数学模型。依据问题特征结合果蝇优化算法特点,提出基于整数的编码方案;采用贪婪搜索和随机方法初始化种群;设计了基于插入算子和交换算子的嗅觉搜索策略;为了提高算法的优化质量,设计了一种基于优势解集的协作引导策略。通过仿真,结果显示改进果蝇优化算法具有较好的全局搜索能力及较快的收敛速度,是求解越库配送车辆调度问题的有效方法。 Cross docking is called as "JIT for logistics ". The vehicle scheduling is the key factor that affects the distribution efficiency. Reasonable vehicle scheduling can speed up the flow of goods, and reduce the waiting time for the customers and suppliers. But, the existing research does not consider the impact of the handling equipment on the vehicle dispatching, so that the dispatching result is not operational. For the problem, we established a mathematic model of the vehicle scheduling in cross docking with handling equipment constraintswas. The objective of the model is to minimize the operation time. According to the characteristics of the problem and the fruit fly optimization algorithm (FOA), an integer-based coding scheme was proposed. And greedy search and random method were applied to initialize the population. The exchange and insertion operation was used to produce neighbors in the smell-based search stage. A collaboration guiding mechanism using better solution set was designed to improve the algorithm's global search ability and convergence speed. Through the simulation experiments, the result shows that the improved FOA has better global search capability and faster convergence, and is an effective method to solve the cross-docking scheduling problem.
作者 吴斌 包华晟 王超 WU Bin;BAO Hua-sheng;WANG Chao(College of Information Engineering,Nanjing Tech University,Naniing 210009,China)
出处 《计算机仿真》 北大核心 2018年第9期465-469,共5页 Computer Simulation
基金 国家自然科学基金项目(71371097) 南京工业大学项目(ZKJ201531)
关键词 越库配送 车辆调度 果蝇优化算法 Cross-Docking Distribution Vehicle Scheduling Fruit Fly Optimization Algorithm
  • 相关文献

参考文献4

二级参考文献48

  • 1金锋,宋士吉,吴澄.一类基于FSP问题Block性质的快速TS算法[J].控制与决策,2007,22(3):247-251. 被引量:6
  • 2江善和,王其申,江巨浪.一种新型Skew Tent映射的混沌混合优化算法[J].控制理论与应用,2007,24(2):269-273. 被引量:16
  • 3王凌.车问调度及其遗传算法[M].北京:清华大学出版社,2003:1-5.
  • 4GAREY M R, JOHNSON D S, SETHY R. The complexity of flow- shop and job-shop scheduling [J]. Mathematics of Operations Re- search, 1976, 1(2): 117- 129.
  • 5PINEDO M L. Scheduling: Theory, Algorithms, and Systems [M]. Berlin: Springer, 2012.
  • 6WANG L, ZHENG D Z. An effective hybrid heuristic for flow-shop scheduling [J]. International Journal Advanced Manufacturing Tech- nology, 2003, 21(1): 38- 44.
  • 7OSMAN I H, POTTS C N. Simulated annealing for permutation flow- shop scheduling [J]. Omega, 1989, 17(6): 551 -557.
  • 8NOW1CKI E, SMUTNICKI C. A fast tabu search algorithm for the permutation flow-shop scheduling [J]. European Journal of Opera- tionaIResearch, 1996, 91(1): 160- 175.
  • 9GRABOWSKI J, WODECKI M. A very fast tabu search algorithm for the permutation flow-shop problem with makespan criterion [J]. Computers & Operations Research, 2004, 31(11): 1891 - 1909.
  • 10QIAN B, WANG L, HU R, et al. A hybrid differential evolution for permutation flow-shop scheduling [J]. International Journal Ad- vanced Manufacturing Technology, 2008, 38(7/8): 757 - 777.

共引文献69

同被引文献18

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部