%0 Journal Article
%T Genetic algorithm for solving the complex pickup and delivery problem with time windows<br>求解复杂有时间窗装卸货问题的遗传算法
%A WU Jing-li
%A <br>吴璟莉
%J 计算机应用
%D 2006
%I 
%X The pickup and delivery problem with time windows requires that a group of vehicles satisfy a collection of customer requests. Each customer request requires the use of a single vehicle both to load a specified amount of goods at one location and to deliver them to another location. All requests must be performed without violating either ttle vehicle maximal capacity constrain, maximal travel distance limitation or the customer time window stipulated at each location. The general PDPTW was extended on three aspects, which were multi depots, multi load type and fully loaded. And a genetic algorithm suitable for solving complex PDPTW was proposed. As the experiment proved, when this algorithm is used for solving complex PDPTW, it can obtain preferable result and solve this problem effeetivcly.
%K Pickup and Delivery Problem with Time Windows(PDPTW)
%K fully loaded
%K genetic algorithm
%K crossover operator<br>有时间窗装卸货问题
%K 满载
%K 遗传算法
%K 交叉算子
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=C306E07F172206E1&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=B31275AF3241DB2D&sid=AA170179913DEBCD&eid=B60306E6036A044A&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=3