A Hybrid Metaheuristic Approach to Optimize the Districting Design of a Parcel Company
暂无分享,去创建一个
Rosa G. González-Ramírez | Neale R. Smith | Ronald G. Askin | J. M. Sánchez | Pablo Miranda | P. Miranda | R. G. González-Ramírez | N. Smith | J. M. Sanchez
[1] André Langevin,et al. Design of multiple-vehicle delivery tours satisfying time constraints , 1989 .
[2] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[3] Antonio Galvão Naclério Novaes,et al. A continuous approach to the design of physical distribution systems , 2000, Comput. Oper. Res..
[4] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[5] Luc Muyldermans,et al. District design for arc-routing applications , 2003, J. Oper. Res. Soc..
[6] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..
[7] Antonio Galvão Naclério Novaes,et al. Designing multi-vehicle delivery tours in a grid-cell format , 1999, Eur. J. Oper. Res..
[8] Micah Altman,et al. Is automation the answer: the computational complexity of automated redistricting , 1997 .
[9] Gilbert Laporte,et al. Designing delivery districts for the vehicle routing problem with stochastic demands , 2007, Eur. J. Oper. Res..
[10] E. Erkut,et al. Comparison Of Four Models For dispersing Facilities , 1991 .
[11] Luc Muyldermans,et al. Districting for salt spreading operations , 2002, Eur. J. Oper. Res..