摘要
车辆路径问题中,行驶路线往往取决于一系列约束条件,如配送中心个数,货物需求量,交发货时间,车辆容量限制等。要想达到一定的目标,如路程最短,费用最小,时间尽量少,车辆尽量少等,就得借助于合适的算法去解决实际的问题。蚂蚁算法在解决著名的旅行商(TSP)问题上已取得了很好的成效,目前已陆续渗透到其他问题的求解上。文章主要针对多车场多车型车辆路径问题,用蚁群算法以及蚁群算法的优化算法去解决一些实际问题。
In the Vehicle routing problem （VRP）, the traveling route usually depends on a series of restrictive conditions,such as the number of the distribution centers, the quantity of the demanding freight, the delivery time and the vehicle capacity constraints. To achieve a certain goal, such as the shortest distance, the minimum cost. the least time and the vehicles as few as possible and so on. we have to use appropriate algorithms to solve practical problems. Ant algorithm has achieved a good result in solving the well-known traveling salesman problem （TSP）, now it has been infiltrated into the other problems＇ solving. In this paper, mainly for Multipie-depot and Heterogeneous-vehicle vehicle routing we adopt ant algorithm and its improved method to solve some practical problems.
出处
《物流科技》
2009年第10期43-46,共4页
Logistics Sci-Tech
基金
科研基金资助项目(2008021)
