The Orienteering Problem under Uncertainty Stochastic Programming and Robust Optimization compared

The Orienteering Problem (OP) is a generalization of the well-known traveling salesman problem and has many interesting applications in logistics, tourism and defense. To reflect real-life situations, we focus on an uncertain variant of the OP. Two main approaches that deal with optimization under uncertainty are stochastic programming and robust optimization. We will explore the potentialities and bottlenecks of these two approaches applied to the uncertain OP. We will compare the known robust approach for the uncertain OP (the robust orienteering problem) to the new stochastic programming counterpart (the two-stage orienteering problem). The application of both approaches will be explored in terms of their suitability in practice.

[1]  Twan Dollevoet,et al.  Robust UAV mission planning , 2011, Ann. Oper. Res..

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

[3]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[4]  E. Beale.  ON MINIMIZING A CONVEX FUNCTION SUBJECT TO LINEAR INEQUALITIES , 1955 .

[5]  Michel Gendreau,et al.  TRAVELING SALESMAN PROBLEMS WITH PROFITS: AN OVERVIEW , 2001 .

[6]  D. Bertsimas,et al.  Robust and Data-Driven Optimization: Modern Decision-Making Under Uncertainty , 2006 .

[7]  G. Laporte,et al.  A Branch-and-Cut Algorithm for the Undirected Selective Traveling Salesman Problem , 1998 .

[8]  A. Charnes,et al.  Chance-Constrained Programming , 1959 .

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

[10]  Takeshi Koshizuka,et al.  The Operations Research Society of Japan , 2013 .

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

[12]  Georg Ch. Pflug,et al.  A branch and bound method for stochastic global optimization , 1998, Math. Program..

[13]  Elise Miller-Hooks,et al.  Algorithms for a stochastic selective travelling salesperson problem , 2005, J. Oper. Res. Soc..

[14]  H. L. Ong,et al.  An Integer L-shaped Algorithm for Time-Constrained Traveling Salesman Problem with Stochastic Travel and Service times , 2004, Asia Pac. J. Oper. Res..

[15]  Daniel N. Reber,et al.  Optimized Routing of Unmanned Aerial Systems for the Interdiction of Improvised Explosive Devices , 2009 .

[16]  A. Charnes,et al.  Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints , 1963 .

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

[18]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[19]  Peng Sun,et al.  A Robust Optimization Perspective on Stochastic Programming , 2007, Oper. Res..

[20]  Rakesh Nagi,et al.  Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans , 2012, Comput. Oper. Res..

[21]  Arkadi Nemirovski,et al.  Robust solutions of Linear Programming problems contaminated with uncertain data , 2000, Math. Program..

[22]  Gilbert Laporte,et al.  An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands , 2002, Oper. Res..

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

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

[25]  David P. Morton,et al.  Monte Carlo bounding techniques for determining solution quality in stochastic programs , 1999, Oper. Res. Lett..

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

[27]  Giri Narasimhan,et al.  Resource-constrained geometric network optimization , 1998, SCG '98.

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

[29]  Giuseppe Carlo Calafiore,et al.  Robust convex optimization: The scenario approach , 2006 .

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

[31]  Laurent El Ghaoui,et al.  Robust Solutions to Least-Squares Problems with Uncertain Data , 1997, SIAM J. Matrix Anal. Appl..

[32]  Dirk Van Oudheusden,et al.  A PERSONALIZED TOURIST TRIP DESIGN ALGORITHM FOR MOBILE TOURIST GUIDES , 2008, Appl. Artif. Intell..

[33]  Arkadi Nemirovski,et al.  Robust Truss Topology Design via Semidefinite Programming , 1997, SIAM J. Optim..

[34]  Laurent El Ghaoui,et al.  Robust Solutions to Uncertain Semidefinite Programs , 1998, SIAM J. Optim..

[35]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

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

[37]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

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

[39]  Constantine Caramanis,et al.  Finite Adaptability in Multistage Linear Optimization , 2010, IEEE Transactions on Automatic Control.

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

[41]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

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

[43]  Michel Gendreau,et al.  A branch-and-cut algorithm for the undirected selective traveling salesman problem , 1998, Networks.

[44]  Peter Kall,et al.  Stochastic Programming , 1995 .

[45]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

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

[47]  Peng Sun,et al.  A Linear Decision-Based Approximation Approach to Stochastic Programming , 2008, Oper. Res..

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

[49]  Alper Atamtürk,et al.  Two-Stage Robust Network Flow and Design Under Demand Uncertainty , 2007, Oper. Res..

[50]  Allen L. Soyster,et al.  Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..

[51]  A. Ben-Tal,et al.  Adjustable robust solutions of uncertain linear programs , 2004, Math. Program..