摘要
钢铁企业物流库存资源调度,关系着企业的物流成本和下游产线物料能否得到及时供应。传统方法没有从车辆分配角度来对资源入库调度的物流成本和调度效率进行分析。选择合适的车辆入厂顺序和入厂时间可以在降低物流成本的同时提高调度效率,为解决上述问题,建立了最小化货车卸货时间跨度和仓库运转成本的整数规划模型,并提出了一种协同改进引力搜索算法对问题进行求解。算法采用变压力的质量公式来平衡探索和开采能力,应用协同方式使群间信息共享加快了算法的运算速度,在种群多样性缺失时引入基于区间对称的反向学习种群,并与原种群共同进行精英选择,保证优秀解不被破坏的同时增大种群多样性。通过一个应用实例使用不同方案的对比实验验证了上述算法的有效性。
Appropriate vehicles incoming sequence and time can reduce logistics cost and improve the scheduling efficiency of logistics inventory resource for iron and steel enterprise, so an integer programming model is established to minimize the time span of truck unloading and the operation cost of warehouse and an improved cooperative Gravita- tion Search Algorithm (ICGSA) is proposed. The algorithm uses mass formula of variable pressure to balance the ex- ploration and exploitation ability. The application of cooperative method makes the information sharing among the groups to speed up the computing of the algorithm. When in low level of population diversity, elite selection is intro- duced between an opposition-based learning population based on interval symmetry with the original population to en- sure that the excellent solution is not destroyed and increase the diversity of the population. Finally, an application example is used to demonstrate the effectiveness of the proposed algorithm compared with different schemes.
出处
《计算机仿真》
北大核心
2017年第7期395-399,共5页
Computer Simulation
基金
河北省科技支撑计划项目(13210307D)
关键词
库存资源调度
车辆分配
变压力
协同方式
反向学习
Inventory resource scheduling
Vehicle distribution
Variable pressure
Cooperative method
Opposi-tion-based learning