An improved double-population genetic algorithm for vehicle routing problem with soft time windows
暂无分享,去创建一个
[1] Chi-Bin Cheng,et al. Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm , 2009, Expert Syst. Appl..
[2] Martin W. P. Savelsbergh,et al. Local search in routing problems with time windows , 1984 .
[3] Marius M. Solomon,et al. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..
[4] Shih-Wei Lin,et al. Applying hybrid meta-heuristics for capacitated vehicle routing problem , 2009, Expert Syst. Appl..
[5] Henry C. W. Lau,et al. A hybrid genetic algorithm for the multi-depot vehicle routing problem , 2008, Eng. Appl. Artif. Intell..
[6] Roberto Montemanni,et al. Time dependent vehicle routing problem with a multi ant colony system , 2008, Eur. J. Oper. Res..
[7] Chung-Ho Wang,et al. A hybrid genetic algorithm that optimizes capacitated vehicle routing problems , 2009, Expert Syst. Appl..
[8] Mohamed Barkaoui,et al. A parallel hybrid genetic algorithm for the vehicle routing problem with time windows , 2004, Comput. Oper. Res..
[9] H. Van Landeghem,et al. A bi-criteria heuristic for the vehicle routing problem with time windows , 1988 .
[10] Warren B. Powell,et al. An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints , 1992, Transp. Sci..
[11] Ana Moura. A Multi-Objective Genetic Algorithm for the Vehicle Routing with Time Windows and Loading Problem , 2008 .