节点文献

基于模拟退火的n-n入厂物流运输方案规划

n-n Inbound Logistic Transportation Planning Based on Improved Simulated Annealing Algorithm

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 郑硕蔺宇

【Author】 ZHENG Shuo;LIN Yu;College of Management and Economics, Tianjin University;

【机构】 天津大学管理与经济学部

【摘要】 为降低企业入厂物流成本,以最小化运行成本为目标,将直送、越库和循环取货3种入厂物流运输模式拓展到多供应商、多制造商(n-n)的研究空间,建立入厂物流运输方案规划问题的非线性整数规划模型并使用模拟退火算法进行求解。该算法中解的表示方法采用了综合循环取货与越库的m×n矩阵编码方法,并设计了基于3种变异操作的邻域选择方法。最后的算例验证了算法的有效性及使用该方法设计的运输方案所具有的显著优越性。

【Abstract】 To reduce inbound logistic cost of enterprises, aiming at minimizing running costs, three kinds of inbound logistic transportation modes: the direct transportation mode, the cross-dock transportation mode, and the milk-run transportation mode, were applied to the multi-suppliers and multi-manufactures(n-n) inbound logistic transportation problem. Then, the respective non-linear integer programming model was built and solved by simulated annealing algorithm. The solution coding scheme in this algorithm was m×n matrix coding scheme combining with the milk-run and the cross-dock. And the neighborhood selection process was designed based on three mutation operations. Finally, numerical examples verified the significant advantages of the proposed programming method and the validity of this proposed algorithm.

  • 【文献出处】 工业工程 ,Industrial Engineering Journal , 编辑部邮箱 ,2017年02期
  • 【分类号】F252;O221.2
  • 【被引频次】3
  • 【下载频次】208
节点文献中: 

本文链接的文献网络图示:

本文的引文网络