• 论文 •    

沿途补货的多车场开放式车辆路径问题及蚁群算法

李延晖, 刘向   

  1. 华中师范大学 信息管理系,湖北武汉430079
  • 出版日期:2008-03-15 发布日期:2008-03-25

Modelling and its ant colony algorithm for multi-depot open vehicle routing problem with replenishment on the way

LI Yan-hui, LIU Xiang   

  1. Department of Information Management, Huazhong Normal University, Wuhan 430079, P.R.China
  • Online:2008-03-15 Published:2008-03-25

摘要: 针对大区域多仓库多需求点的物流配送系统,建立了基于沿途多点补货策略的开放式车辆路径问题模型,强化了区域之间物流资源的整合和配送路径的跨区域优化。根据该模型需货车沿途多次访问仓库补货的特点,提出了带补货控制因子的蚁群算法。利用补货控制因子对仓库和需求点的区别赋权,控制了货车对仓库的访问时机和次数,从而解决了多仓库且车辆装载能力有限的开放式配送网络中货车沿途补货的问题。仿真试验表明了该算法的有效性和稳定性。

关键词: 沿途补货, 多车场, 开放式车辆路径问题, 补货控制因子, 蚁群算法

Abstract: Aiming at large-scale distribution system with multi-depot and multi-demand nodes, a multi-depot open vehicle routing model with replenishment on the way was constructed, which strengthened the logistic resources sharing and cross-region optimization of distribution routes. An ant colony algorithm with replenishment controlling factors was put forward based on the characteristics of the model that depot should be visited many times. Algorithms solved the problem of replenishment on the way in load-restricted open vehicle routing network, by controlling the visiting time and frequency of the depots and demand nodes that were assigned distinctive values by controlling factors. Simulation test showed that the algorithm was effective and stable.

Key words: replenishment on the way, multi-depot, open vehicle routing problem, replenishment controlling factor, ant colony algorithm0引言

中图分类号: