Column generation based heuristics for a generalized location routing problem with profits arising in space exploration
暂无分享,去创建一个
Diego Klabjan | Jaemyung Ahn | Yue Geng | Olivier L. de Weck | O. Weck | D. Klabjan | Jaemyung Ahn | Yue Geng
[1] Michel Gendreau,et al. An exact epsilon-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits , 2009, Eur. J. Oper. Res..
[2] Alain Hertz,et al. Metaheuristics for the team orienteering problem , 2005, J. Heuristics.
[3] Michel Gendreau,et al. Traveling Salesman Problems with Profits , 2005, Transp. Sci..
[4] Bruce L. Golden,et al. The team orienteering problem , 1996 .
[5] Gilbert Laporte,et al. Models and exact solutions for a class of stochastic location-routing problems , 1987 .
[6] Ismail Karaoglan,et al. A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery , 2011, Eur. J. Oper. Res..
[7] Egon Balas,et al. The prize collecting traveling salesman problem , 1989, Networks.
[8] Philippe Lacomme,et al. A GRASP×ELS approach for the capacitated location-routing problem , 2010, Comput. Oper. Res..
[9] Saïd Salhi,et al. Location-routing: Issues, models and methods , 2007, Eur. J. Oper. Res..
[10] W. C. Benton,et al. The location-routing problem: Considerations in physical distribution system design , 1990, Comput. Oper. Res..
[11] Hokey Min,et al. Combined location-routing problems: A synthesis and future research directions , 1998, Eur. J. Oper. Res..
[12] Steven E. Butt,et al. An optimal solution procedure for the multiple tour maximum collection problem using column generation , 1999, Comput. Oper. Res..
[13] Laura I. Burke,et al. A two-phase tabu search approach to the location routing problem , 1999, Eur. J. Oper. Res..
[14] Gilbert Laporte,et al. Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..
[15] Bruce L. Golden,et al. A fast and effective heuristic for the orienteering problem , 1996 .
[16] Mark S. Daskin,et al. Location-Routing Problems with Distance Constraints , 2007, Transp. Sci..
[17] JAEMYUNG AHN,et al. An Optimization Framework for Global Planetary Surface Exploration Campaigns , 2008 .
[18] S. Morito,et al. AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM , 1988 .
[19] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[20] Cyrille Gueguen. Méthodes de résolution exacte pour les problèmes de tournées de véhicules , 1999 .
[21] Dirk Van Oudheusden,et al. The Multiconstraint Team Orienteering Problem with Multiple Time Windows , 2010, Transp. Sci..
[22] Elise Miller-Hooks,et al. A TABU search heuristic for the team orienteering problem , 2005, Comput. Oper. Res..
[23] Jeffrey A. Hoffman,et al. Design of Power Systems for Extensible Surface Mobility Systems on the Moon and Mars , 2008 .
[24] T. Tsiligirides,et al. Heuristic Methods Applied to Orienteering , 1984 .
[25] Tom M. Cavalier,et al. A heuristic for the multiple tour maximum collection problem , 1994, Comput. Oper. Res..
[26] Gilbert Laporte,et al. The selective travelling salesman problem , 1990, Discret. Appl. Math..
[27] Dirk Van Oudheusden,et al. The orienteering problem: A survey , 2011, Eur. J. Oper. Res..