Stable solving of CVRPs using hyperheuristics
暂无分享,去创建一个
[1] Eric Soubeiga,et al. Development and application of hyperheuristics to personnel scheduling , 2003 .
[2] Bertrand Neveu,et al. An Efficient Hyperheuristic for Strip-Packing Problems , 2008, Adaptive and Multilevel Metaheuristics.
[3] Nicos Christofides,et al. The period routing problem , 1984, Networks.
[4] Michel Gendreau,et al. New Heuristics for the Vehicle Routing Problem , 2005 .
[5] É. Taillard,et al. MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .
[6] LysgaardJens,et al. A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004 .
[7] E. Soubeiga,et al. Multi-Objective Hyper-Heuristic Approaches for Space Allocation and Timetabling , 2005 .
[8] Adam N. Letchford,et al. A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..
[9] Gilbert Laporte,et al. Classical and modern heuristics for the vehicle routing problem , 2000 .
[10] Peter Ross,et al. Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics , 2003, GECCO.
[11] María Cristina Riff,et al. Collaboration Between Hyperheuristics to Solve Strip-Packing Problems , 2007, IFSA.
[12] Graham Kendall,et al. Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.
[13] Jeffrey L. Rummel,et al. A Subpath Ejection Method for the Vehicle Routing Problem , 1998 .
[14] Olli Bräysy,et al. Active guided evolution strategies for large-scale vehicle routing problems with time windows , 2005, Comput. Oper. Res..
[15] Éric D. Taillard,et al. Parallel iterative search methods for vehicle routing problems , 1993, Networks.
[16] N. Given. Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyper-heuristics , 2003 .
[17] Marshall L. Fisher,et al. Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..
[18] Yves Rochat,et al. Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.
[19] Patrick Prosser,et al. Dynamic VRPs: A Study of Scenarios , 1998 .
[20] Riccardo Poli,et al. Generating SAT Local-Search Heuristics Using a GP Hyper-Heuristic Framework , 2007, Artificial Evolution.