An Evolutionary Approach to Pickup and Delivery Problem with Time Windows
暂无分享,去创建一个
[1] J. Wesley Barnes,et al. Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .
[2] Andrew Lim,et al. SOLVING THE PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS USING iSSQUEAKY WHEELli OPTIMIZATION WITH LOCAL SEARCH , 2002 .
[3] Andrew Lim,et al. A Metaheuristic for the Pickup and Delivery Problem with Time Windows , 2003, Int. J. Artif. Intell. Tools.
[4] Michel Gendreau,et al. Route Construction and Local Search Algorithms for the Vehicle Routing Problem with Time Windows , 2001 .
[5] Michel Gendreau,et al. Neighborhood Search Heuristics for a Dynamic Vehicle Dispatching Problem with Pick-ups and Deliveries , 2006 .
[6] Hoong Chuin Lau,et al. Pickup and Delivery with Time Windows: Algorithms and Test Case Generation , 2002, Int. J. Artif. Intell. Tools.
[7] Oli B. G. Madsen,et al. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives , 1995, Ann. Oper. Res..
[8] Jacques Desrosiers,et al. VRP with Pickup and Delivery , 2000, The Vehicle Routing Problem.
[9] O. Bräysy,et al. Genetic Algorithms for the Vehicle Routing Problem with Time Windows , 1999 .
[10] Samy Bengio,et al. The Vehicle Routing Problem with Time Windows Part II: Genetic Search , 1996, INFORMS J. Comput..
[11] Gilbert Laporte,et al. The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms , 2003, 4OR.