Application of Ant Colony Optimization to Logistic Scheduling Algorithm
The logistic scheduling is a typical combinatorial optimization problem.Vehicle routing optimization is one of the most critical parts in logistics,and the Vehicle Routing Problem (VRP) is an important problem occurring in many distribution systems.This paper proposes an improved ant colony optimization algorithm to optimize the dynamic assignment to the Capacitated Vehicle Routing Problem (CVRP) and the Vehicle Routing Problem with Time Windows (VRPTW).The improved algorithm tests several different combinations and derives the solution that is able to deliver more orders at the correct delivery date.Results show the effectiveness of the proposed algorithm.
logistics vehicle routing problem ant colony optimization
Ruoying Sun Gang Zhao Xingfen Wang
School of Information ManagementBeijing Information Science and Technology UniversityBeijing,China School of Information Management Beijing Information Science and Technology University Beijing,China
国际会议
北京
英文
2008-10-12（万方平台首次上网日期，不代表论文的发表时间）