%0 Journal Article
%T Chaotic genetic algorithm for solving vehicle routing problems with time windows<br>求解带时间窗车辆路径问题的混沌遗传算法
%A WANG Yong-feng
%A YANG Yu
%A GU Yong-ming
%A WU Cai-ming
%A <br>王永锋
%A 杨　育
%A 顾永明
%A 吴彩明
%J 计算机应用研究
%D 2012
%I 
%X Aiming at the disadvantage of big randomness and premature convergence in genetic algorithm, the paper put forward the chaotic genetic algorithms which was a combination of chaotic search technology and genetic algorithms to solve the vehicle routing problem with time windows VRPTW during the logistics and distribution. The algorithm mapped chaotic va-riables to the range of optimization variables and coded the getting variables to generate the initial population. Then, after the genetic operations, it increased chaotic disturbance to the excellent individuals, and promoted the convergence rate of populations' evolution and get the optional solution. Compared the calculation results with other algorithms show that when the algorithm solves the VRPTW problem, the search efficiency is high and it can converge in the optional solution in a fast speed and offers a new method to the VRPTW solving.
%K 混沌搜索技术
%K 混沌遗传算法
%K 带时间窗的车辆路径问题
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=3178011684088478E2E61A030980C2ED&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=DF92D298D3FF1E6E&sid=A618C28A570A66E3&eid=73BDA90843961663&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=17