A Improved Pareto of Ant Colony Algorithm to Solve the Vehicle Routing Problem with Time Windows
2014 ◽
Vol 1030-1032
◽
pp. 1941-1944
Keyword(s):
Vehicle routing problem with time Windows (VRPTW) that is a kind of important extension type for VPR. In view of problem which the ant colony algorithm in solving VRPTW easily plunged into local optimum , this paper defines a new ant transition probability of saving ideas, and uses the Pareto optimal solution set of global pheromone updating rule, and puts forward a kind of improved Pareto ant colony algorithm (IPACA) . Through the simulation experiments show that IPACA improves the global search ability of ACA, effectively avoids the algorithm falls into local optimum, and reduces the total distribution cost (distance), so as to verify the effectiveness of the proposed algorithm.
2013 ◽
Vol 2013
◽
pp. 1-9
◽
Keyword(s):
2011 ◽
Vol 219-220
◽
pp. 1285-1288
◽
Keyword(s):
Keyword(s):
2012 ◽
Vol 263-266
◽
pp. 1609-1613
◽
Keyword(s):
2010 ◽
Vol 121-122
◽
pp. 1006-1011