Genetic algorithm for solving the complex pickup and delivery problem with time windows
求解复杂有时间窗装卸货问题的遗传算法

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.