%0 Journal Article
%T Study on VRP based on improved ant colony optimization<br>基于改进蚁群算法的车辆路径优化问题研究
%A CHEN Ying-xin
%A <br>陈迎欣
%J 计算机应用研究
%D 2012
%I 
%X Logistics activities need to find different distribution node of the shortest path, to instruct the logistics vehicle scheduling, and then save the logistics cost. This paper proposed the solution of vehicle routing optimization problem. In order to conquer the defects and improve the basic ant colony optimization, it improved pheromones updating strategy, stimulating factor and the introduction of search hotspots, solved the defects of ant colony optimization effectively. With the help of Harbin city map as the prototype and the MATLAB software, it carried out simulation to check the improved ant colony optimization. The result verifies the feasibility and effectiveness of the improved ant colony optimization.
%K ant colony optimization
%K vehicle routing problem(VRP)
%K pheromone
%K logistics<br>蚁群算法
%K 车辆路径优化
%K 信息素
%K 物流
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=AB480754FB5F26FEBCB75127E2C9AC8D&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=B31275AF3241DB2D&sid=DB7C57A2F6AB0CB0&eid=770F25CE148F797D&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=7