A Simulated Annealing for Multi-modal Team Orienteering Problem with Time Windows
暂无分享,去创建一个
[1] R. Montemanni,et al. An Enhanced Ant Colony System for the Team Orienteering Problem with Time Windows , 2011, 2011 International Symposium on Computer Science and Society.
[2] Tom M. Cavalier,et al. A heuristic for the multiple tour maximum collection problem , 1994, Comput. Oper. Res..
[3] María Merino,et al. An efficient evolutionary algorithm for the orienteering problem , 2018, Comput. Oper. Res..
[4] Giri Narasimhan,et al. Resource-constrained geometric network optimization , 1998, SCG '98.
[5] Ching-Jung Ting,et al. Two-level particle swarm optimization for the multi-modal team orienteering problem with time windows , 2017, Appl. Soft Comput..
[6] VansteenwegenPieter,et al. The City Trip Planner , 2011 .
[7] Hoong Chuin Lau,et al. Orienteering Problem: A survey of recent variants, solution approaches and applications , 2016, Eur. J. Oper. Res..
[8] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[9] Marius M. Solomon,et al. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..
[10] M. G. Kantor,et al. The Orienteering Problem with Time Windows , 1992 .
[11] Shih-Wei Lin,et al. Solving the team orienteering problem with time windows and mandatory visits by multi-start simulated annealing , 2017, Comput. Ind. Eng..
[12] Dirk Van Oudheusden,et al. Iterated local search for the team orienteering problem with time windows , 2009, Comput. Oper. Res..
[13] Dirk Van Oudheusden,et al. The City Trip Planner: An expert system for tourists , 2011, Expert Syst. Appl..
[14] R. Vohra,et al. The Orienteering Problem , 1987 .
[15] T. Tsiligirides,et al. Heuristic Methods Applied to Orienteering , 1984 .