State-of-the-Art Solution Techniques for OPTW and TOPTW
暂无分享,去创建一个
[1] Maria Grazia Speranza,et al. A branch-and-cut algorithm for the Team Orienteering Problem , 2018, Int. Trans. Oper. Res..
[2] Hoong Chuin Lau,et al. Well-tuned algorithms for the Team Orienteering Problem with Time Windows , 2017, J. Oper. Res. Soc..
[3] Nacima Labadie,et al. The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search , 2012, Eur. J. Oper. Res..
[4] Charalampos Konstantopoulos,et al. Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows , 2013, SEA.
[5] Bruce L. Golden,et al. A fast and effective heuristic for the orienteering problem , 1996 .
[6] Egon Balas,et al. The prize collecting traveling salesman problem , 1989, Networks.
[7] Magdalene Marinaki,et al. A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem , 2015, MCO.
[8] Giovanni Righini,et al. New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008 .
[9] Dirk Van Oudheusden,et al. The Multiconstraint Team Orienteering Problem with Multiple Time Windows , 2010, Transp. Sci..
[10] Viet Hung Nguyen,et al. Approximating the asymmetric profitable tour , 2010, Electron. Notes Discret. Math..
[11] Steven E. Butt,et al. An optimal solution procedure for the multiple tour maximum collection problem using column generation , 1999, Comput. Oper. Res..
[12] Aise Zülal Sevkli,et al. StPSO: Strengthened particle swarm optimization , 2010 .
[13] Anna Sciomachen,et al. A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem , 1998, Ann. Oper. Res..
[14] Michel Gendreau,et al. Traveling Salesman Problems with Profits , 2005, Transp. Sci..
[15] Egon Balas,et al. The prize collecting traveling salesman problem: II. Polyhedral results , 1995, Networks.
[16] Felix T.S. Chan,et al. Pareto mimic algorithm: An approach to the team orienteering problem , 2016 .
[17] Shih-Wei Lin,et al. A simulated annealing heuristic for the team orienteering problem with time windows , 2012, Eur. J. Oper. Res..
[18] Viet Hung Nguyen. A Primal-Dual Approximation Algorithm for the Asymmetric Prize-Collecting TSP , 2010, COCOA.
[19] Alberto Santini. An adaptive large neighbourhood search algorithm for the orienteering problem , 2019, Expert Syst. Appl..
[20] Hoong Chuin Lau,et al. Orienteering Problem: A survey of recent variants, solution approaches and applications , 2016, Eur. J. Oper. Res..
[21] Andrew Lim,et al. An iterative three-component heuristic for the team orienteering problem with time windows , 2014, Eur. J. Oper. Res..
[22] T. Tsiligirides,et al. Heuristic Methods Applied to Orienteering , 1984 .
[23] Duc-Cuong Dang,et al. An effective PSO-inspired algorithm for the team orienteering problem , 2013, Eur. J. Oper. Res..
[24] Bruce L. Golden,et al. The team orienteering problem , 1996 .
[25] Dirk Van Oudheusden,et al. The orienteering problem: A survey , 2011, Eur. J. Oper. Res..
[26] J. Potvin,et al. Panconnectivity and edge-pancyclicity of k-ary n-cubes , 2009 .
[27] Shih-Wei Lin,et al. Solving the team orienteering problem using effective multi-start simulated annealing , 2013, Appl. Soft Comput..
[28] M. G. Kantor,et al. The Orienteering Problem with Time Windows , 1992 .
[29] Dirk Van Oudheusden,et al. Iterated local search for the team orienteering problem with time windows , 2009, Comput. Oper. Res..
[30] Daniele Vigo,et al. Enhanced exact solution methods for the Team Orienteering Problem , 2016 .
[31] Nacima Labadie,et al. Hybridized evolutionary local search algorithm for the team orienteering problem with time windows , 2011, J. Heuristics.
[32] María Merino,et al. An efficient evolutionary algorithm for the orienteering problem , 2018, Comput. Oper. Res..
[33] Matteo Fischetti,et al. Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..
[34] Christos D. Tarantilis,et al. The Vehicle Routing Problem with Profits and consistency constraints , 2019, Eur. J. Oper. Res..
[35] Duc-Cuong Dang,et al. A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem , 2013, CPAIOR.
[36] Michel X. Goemans. Combining Approximation Algorithms for the Prize-Collecting TSP , 2009, ArXiv.
[37] Fatih Erdogan Sevilgen,et al. Discrete Particle Swarm Optimization for the Orienteering Problem , 2010, IEEE Congress on Evolutionary Computation.
[38] Giovanni Righini,et al. New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008, Networks.
[39] Michel X. Goemans,et al. On the parsimonious property of connectivity problems , 1990, SODA '90.
[40] Roberto Montemanni,et al. An ant colony system for team orienteering problems with time windows , 2023, 2305.07305.
[41] F. Maffioli,et al. On prize-collecting tours and the asymmetric travelling salesman problem , 1995 .
[42] Giovanni Righini,et al. Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming , 2009, Comput. Oper. Res..
[43] Abraham Duarte,et al. GRASP with path relinking for the orienteering problem , 2014, J. Oper. Res. Soc..
[44] Duc-Cuong Dang,et al. A memetic algorithm for the team orienteering problem , 2008, 4OR.
[45] Deniz Aksen,et al. Customer Selection and Profit Maximization in Vehicle Routing Problems , 2005, OR.
[46] Michel Gendreau,et al. An exact algorithm for team orienteering problems , 2007, 4OR.
[47] Tunchan Cura,et al. An artificial bee colony algorithm approach for the team orienteering problem with time windows , 2014, Comput. Ind. Eng..
[48] Dirk Van Oudheusden,et al. The City Trip Planner: An expert system for tourists , 2011, Expert Syst. Appl..