Traveling salesman problems with profits and stochastic customers

[1]  Thomas Stützle,et al.  Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers , 2015, Comput. Optim. Appl..

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

[3]  Shu Zhang,et al.  A priori orienteering with time windows and stochastic wait times at customers , 2014, Eur. J. Oper. Res..

[4]  Hoong Chuin Lau,et al.  Multi-agent orienteering problem with time-dependent capacity constraints , 2014, Web Intell. Agent Syst..

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

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

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

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

[9]  Barrett W. Thomas,et al.  The probabilistic traveling salesman problem with time windows , 2013, EURO J. Transp. Logist..

[10]  Frits C. R. Spieksma,et al.  Heuristics for the traveling repairman problem with profits , 2010, Comput. Oper. Res..

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

[12]  Magdalene Marinaki,et al.  A Hybrid Multi-Swarm Particle Swarm Optimization algorithm for the Probabilistic Traveling Salesman Problem , 2010, Comput. Oper. Res..

[13]  Prasanna Balaprakash,et al.  Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem , 2009, Eur. J. Oper. Res..

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

[15]  Barrett W. Thomas,et al.  Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines , 2009, Comput. Oper. Res..

[16]  Kenneth K. Boyer,et al.  THE LAST MILE CHALLENGE: EVALUATING THE EFFECTS OF CUSTOMER DENSITY AND DELIVERY WINDOW PATTERNS , 2009 .

[17]  Yu-Hsin Liu.  Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem , 2008, Eur. J. Oper. Res..

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

[19]  Barrett W. Thomas,et al.  Probabilistic Traveling Salesman Problem with Deadlines , 2008, Transp. Sci..

[20]  Yu-Hsin Liu.  A hybrid scatter search for the probabilistic traveling salesman problem , 2007, Comput. Oper. Res..

[21]  Elise Miller-Hooks,et al.  Solving a generalized traveling salesperson problem with stochastic customers , 2007, Comput. Oper. Res..

[22]  Ann Melissa Campbell.  Aggregation for the probabilistic traveling salesman problem , 2006, Comput. Oper. Res..

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

[24]  Elise Miller-Hooks,et al.  Approximate Procedures for Probabilistic Traveling Salesperson Problem , 2004 .

[25]  Bruce L. Golden,et al.  A fast and effective heuristic for the orienteering problem , 1996 .

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

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

[28]  Gilbert Laporte,et al.  A Priori Optimization of the Probabilistic Traveling Salesman Problem , 1994, Oper. Res..

[29]  Patrick Jaillet,et al.  A Priori Optimization , 1990, Oper. Res..

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

[31]  Patrick Jaillet,et al.  A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited , 1988, Oper. Res..

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

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