A generalized variable neighborhood search heuristic for the robust traveling salesman problem with time windows
暂无分享,去创建一个
[1] Thomas Stützle,et al. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..
[2] Michel Gendreau,et al. A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows , 1998, Oper. Res..
[3] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[4] Korhan Karabulut,et al. A variable iterated greedy algorithm for the traveling salesman problem with time windows , 2014, Inf. Sci..
[5] G. Zhang,et al. Robust vehicle routing problem with hard time windows under demand and travel time uncertainty , 2018, Comput. Oper. Res..
[6] Reinaldo Morabito,et al. The Robust Vehicle Routing Problem with Time Windows: Compact Formulation and Branch-Price-and-Cut Method , 2019, Transp. Sci..
[7] Gregorio Tirado,et al. Heuristics for the robust vehicle routing problem with time windows , 2017, Expert Syst. Appl..
[8] Marielle Christiansen,et al. The robust vehicle routing problem with time windows , 2013, Comput. Oper. Res..
[9] Pierre Hansen,et al. Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..
[10] Sebastián Urrutia,et al. A General VNS heuristic for the traveling salesman problem with time windows , 2010, Discret. Optim..