Vehicle Routing Problems with Profits

[1]  Andrew Lim,et al.  An adaptive ejection pool with toggle-rule diversification approach for the capacitated team orienteering problem , 2013, Eur. J. Oper. Res..

[2]  Alain Hertz,et al.  Metaheuristics for the team orienteering problem , 2005, J. Heuristics.

[3]  S. Kulturel-Konak,et al.  Meta heuristics for the orienteering problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[4]  M. Fischetti,et al.  AN ADDITIVE APPROACH FOR THE OPTIMAL SOLUTION OF THE PRIZE-COLLECTING TRAVELLING SALESMAN PROBLEM. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[5]  Duc-Cuong Dang,et al.  An effective PSO-inspired algorithm for the team orienteering problem , 2013, Eur. J. Oper. Res..

[6]  Bruce L. Golden,et al.  Analysis of a large scale vehicle routing problem with an inventory component , 1984 .

[7]  Duc-Cuong Dang,et al.  A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem , 2013, CPAIOR.

[8]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[9]  David Pisinger,et al.  Branch-and-cut and Branch-and-Cut-and-Price Algorithms for Solving Vehicle Routing Problems , 2011 .

[10]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[11]  Christos D. Tarantilis,et al.  The Capacitated Team Orienteering Problem: A Bi-level Filter-and-Fan method , 2013, Eur. J. Oper. Res..

[12]  Richard F. Hartl,et al.  Heuristics for the multi-period orienteering problem with multiple time windows , 2010, Comput. Oper. Res..

[13]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[14]  Susumu Morito,et al.  Minimum directed 1-subtree relaxation for score orienteering problem , 1998 .

[15]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[16]  J. Potvin,et al.  Panconnectivity and edge-pancyclicity of k-ary n-cubes , 2009 .

[17]  E. Erkut,et al.  The maximum collection problem with time-dependent rewards , 1996 .

[18]  C. Keller.  Algorithms to solve the orienteering problem: A comparison , 1989 .

[19]  Fred W. Glover,et al.  Multi-objective Meta-heuristics for the Traveling Salesman Problem with Profits , 2008, J. Math. Model. Algorithms.

[20]  Zuren Feng,et al.  Ants can solve the team orienteering problem , 2008, Comput. Ind. Eng..

[21]  M. Rosenwein,et al.  Strong linear programming relaxations for the orienteering problem , 1994 .

[22]  André Langevin,et al.  The multi-district team orienteering problem , 2014, Comput. Oper. Res..

[23]  Abraham Duarte,et al.  GRASP with path relinking for the orienteering problem , 2014, J. Oper. Res. Soc..

[24]  H H Millar,et al.  A time-based formulation and upper bounding scheme for the selective travelling salesperson problem , 1997 .

[25]  Xia Wang,et al.  Using a Genetic Algorithm to Solve the Generalized Orienteering Problem , 2008 .

[26]  Giorgio Ausiello,et al.  The online Prize-Collecting Traveling Salesman Problem , 2008, Inf. Process. Lett..

[27]  Stefan Irnich,et al.  Solving elementary shortest-path problems as mixed-integer programs , 2014, OR Spectr..

[28]  Qiwen Wang,et al.  Using artificial neural networks to solve the orienteering problem , 1995, Ann. Oper. Res..

[29]  Elise Miller-Hooks,et al.  A TABU search heuristic for the team orienteering problem , 2005, Comput. Oper. Res..

[30]  Michel Gendreau,et al.  An exact algorithm for team orienteering problems , 2007, 4OR.

[31]  Roberto Montemanni,et al.  An ant colony system for team orienteering problems with time windows , 2023, 2305.07305.

[32]  Steven E. Butt,et al.  An optimal solution procedure for the multiple tour maximum collection problem using column generation , 1999, Comput. Oper. Res..

[33]  C. Verbeeck,et al.  A fast solution method for the time-dependent orienteering problem , 2013, Eur. J. Oper. Res..

[34]  Henrique Viana,et al.  The Team Orienteering Problem: Formulations and Branch-Cut and Price , 2010, ATMOS.

[35]  R. Ravi,et al.  Spanning trees short or small , 1994, SODA '94.

[36]  R. Montemanni,et al.  Objective function evaluation methods for the orienteering problem with stochastic travel and service times , 2014 .

[37]  Michel Gendreau,et al.  The orienteering problem with stochastic travel and service times , 2011, Ann. Oper. Res..

[38]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[39]  Santosh S. Vempala,et al.  New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen , 1999, SIAM J. Comput..

[40]  Nacima Labadie,et al.  The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search , 2012, Eur. J. Oper. Res..

[41]  Ram Ramesh,et al.  An efficient four-phase heuristic for the generalized orienteering problem , 1991, Comput. Oper. Res..

[42]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[43]  Mark S. Daskin,et al.  The orienteering problem with stochastic profits , 2008 .

[44]  Dirk Cattrysse,et al.  A memetic algorithm for the orienteering problem with hotel selection , 2014, Eur. J. Oper. Res..

[45]  Nacima Labadie,et al.  Hybridized evolutionary local search algorithm for the team orienteering problem with time windows , 2011, J. Heuristics.

[46]  Roberto Montemanni,et al.  Coupling ant colony systems with strong local searches , 2012, Eur. J. Oper. Res..

[47]  Daniele Vigo,et al.  An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping , 2013, Transp. Sci..

[48]  Andrew Lim,et al.  An iterative three-component heuristic for the team orienteering problem with time windows , 2014, Eur. J. Oper. Res..

[49]  Daniele Vigo,et al.  Enhanced exact solution methods for the Team Orienteering Problem , 2016 .

[50]  Shih-Wei Lin,et al.  A simulated annealing heuristic for the team orienteering problem with time windows , 2012, Eur. J. Oper. Res..

[51]  M. G. Kantor,et al.  The Orienteering Problem with Time Windows , 1992 .

[52]  Ali Ekici,et al.  Multiple agents maximum collection problem with time dependent rewards , 2013, Comput. Ind. Eng..

[53]  Zsolt Tuza,et al.  Complexity and approximation for Traveling Salesman Problems with profits , 2014, Theor. Comput. Sci..

[54]  Ching-Wu Chu,et al.  A heuristic algorithm for the truckload and less-than-truckload problem , 2005, Eur. J. Oper. Res..

[55]  Dirk Van Oudheusden,et al.  The Mobile Tourist Guide: An OR Opportunity , 2007, OR Insight.

[56]  Michel X. Goemans.  Combining Approximation Algorithms for the Prize-Collecting TSP , 2009, ArXiv.

[57]  David R. Karger,et al.  Approximation Algorithms for Orienteering and Discounted-Reward TSP , 2007, SIAM J. Comput..

[58]  Dirk Van Oudheusden,et al.  A Path Relinking approach for the Team Orienteering Problem , 2010, Comput. Oper. Res..

[59]  Jean-Yves Potvin,et al.  A tabu search heuristic for the vehicle routing problem with private fleet and common carrier , 2009, Eur. J. Oper. Res..

[60]  Dirk Cattrysse,et al.  A variable neighborhood search method for the orienteering problem with hotel selection , 2013 .

[61]  Dirk Van Oudheusden,et al.  A guided local search metaheuristic for the team orienteering problem , 2009, Eur. J. Oper. Res..

[62]  Andrew L. Johnson,et al.  An augmented large neighborhood search method for solving the team orienteering problem , 2013, Expert Syst. Appl..

[63]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[64]  Michel Gendreau,et al.  A tabu search heuristic for the undirected selective travelling salesman problem , 1998, Eur. J. Oper. Res..

[65]  Bruce L. Golden,et al.  The effective application of a new approach to the generalized orienteering problem , 2010, J. Heuristics.

[66]  B. Golden,et al.  A multifaceted heuristic for the orienteering problem , 1988 .

[67]  F. Maffioli,et al.  On prize-collecting tours and the asymmetric travelling salesman problem , 1995 .

[68]  X. Wang,et al.  An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem , 2008, J. Oper. Res. Soc..

[69]  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..

[70]  Xueming Qian,et al.  Proportion-based robust optimization and team orienteering problem with interval data , 2013, Eur. J. Oper. Res..

[71]  Gilbert Laporte,et al.  A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers , 2008, J. Oper. Res. Soc..

[72]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[73]  Chandra Chekuri,et al.  Improved algorithms for orienteering and related problems , 2008, SODA '08.

[74]  Alain Hertz,et al.  The split delivery capacitated team orienteering problem , 2010, Networks.

[75]  Suzanne van der Ster,et al.  A two-stage approach to the orienteering problem with stochastic weights , 2014, Comput. Oper. Res..

[76]  Duc-Cuong Dang,et al.  A memetic algorithm for the team orienteering problem , 2008, 4OR.

[77]  Jean-Yves Potvin,et al.  Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier , 2011, J. Oper. Res. Soc..

[78]  Andrzej Lingas,et al.  Approximation algorithms for time-dependent orienteering , 2002, Inf. Process. Lett..

[79]  Ray Deitch,et al.  The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm , 2000, Eur. J. Oper. Res..

[80]  Necati Aras,et al.  Selective multi-depot vehicle routing problem with pricing , 2011 .

[81]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[82]  Tom M. Cavalier,et al.  A heuristic for the multiple tour maximum collection problem , 1994, Comput. Oper. Res..

[83]  Richard F. Hartl,et al.  Metaheuristics for the bi-objective orienteering problem , 2009, Swarm Intelligence.

[84]  Viet Hung Nguyen,et al.  Approximating the asymmetric profitable tour , 2010, Electron. Notes Discret. Math..

[85]  Maria Grazia Speranza,et al.  Optimal solutions for routing problems with profits , 2013, Discret. Appl. Math..

[86]  Alain Hertz,et al.  The capacitated team orienteering and profitable tour problems , 2007, J. Oper. Res. Soc..

[87]  Charalampos Konstantopoulos,et al.  A survey on algorithmic approaches for solving tourist trip design problems , 2014, Journal of Heuristics.

[88]  Mark H. Karwan,et al.  An Optimal Algorithm for the Orienteering Tour Problem , 1992, INFORMS J. Comput..

[89]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[90]  Johannes O. Royset,et al.  Generalized orienteering problem with resource dependent rewards , 2013 .

[91]  Gilbert Laporte,et al.  The orienteering problem with variable profits , 2013, Networks.

[92]  Anna Sciomachen,et al.  A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem , 1998, Ann. Oper. Res..

[93]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[94]  Matteo Fischetti,et al.  Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..

[95]  R. Ravi,et al.  The Directed Orienteering Problem , 2011, Algorithmica.

[96]  John M. Norman,et al.  Dynamic Programming in Orienteering: Route Choice and the Siting of Controls , 1984 .

[97]  S. Morito,et al.  AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM , 1988 .

[98]  Mohammad Taghi Hajiaghayi,et al.  Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.