Tobacco Distribution Vehicle Routing Program and the Resolving Method
The problem of tobacco distribution was resolved as two phases: static delivery routing programming phase and dynamic vehicle routing daily schedule phase. The static phase was modeled as the multiple traveling salesmen problem (MTSP) with workload balance. A hybrid ant colony optimization algorithm (HACO) was developed for this MTSP. The proposed HACO was tested on some benchmark instances in literatures with the objective of minimizing the maximum distance traveled by each salesman, which is related with balancing the workload among salesmen. Computational results show that the HACO is competitive. One real tobacco distribution instance was resolved by proposed method which result in distribution cost reducing and efficiency improving.
Multiple Traveling Salesmen Problem Distribution Ant Colony Optimization
Weimin Liu Sujian Li Aiyun Zheng Fanggeng Zhao
School of Mechanical Engineering,University of Science and Technology Beijing,Beijing 100083;Hebei P School of Mechanical Engineering,University of Science and Technology Beijing,Beijing 100083 Hebei Polytechnic University,Tangshan 063009,China Vehicle Management Institute,Bengbu 233011,China
国际会议
2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)
广西桂林
英文
5172-5175
2009-06-17（万方平台首次上网日期，不代表论文的发表时间）