Two-Stage Robust Optimization for the Orienteering Problem with Stochastic Weights

Ke Shang, Felix T.S. Chan, Stephen Karungaru, Kenji Terada, Zuren Feng, Liangjun Ke

Research output: Journal article publicationReview articleAcademic researchpeer-review

Abstract

In this paper, the two-stage orienteering problem with stochastic weights is studied, where the first-stage problem is to plan a path under the uncertain environment and the second-stage problem is a recourse action to make sure that the length constraint is satisfied after the uncertainty is realized. First, we explain the recourse model proposed by Evers et al. (2014) and point out that this model is very complex. Then, we introduce a new recourse model which is much simpler with less variables and less constraints. Based on these two recourse models, we introduce two different two-stage robust models for the orienteering problem with stochastic weights. We theoretically prove that the two-stage robust models are equivalent to their corresponding static robust models under the box uncertainty set, which indicates that the two-stage robust models can be solved by using common mathematical programming solvers (e.g., IBM CPLEX optimizer). Furthermore, we prove that the two two-stage robust models are equivalent to each other even though they are based on different recourse models, which indicates that we can use a much simpler model instead of a complex model for practical use. A case study is presented by comparing the two-stage robust models with a one-stage robust model for the orienteering problem with stochastic weights. The numerical results of the comparative studies show the effectiveness and superiority of the proposed two-stage robust models for dealing with the two-stage orienteering problem with stochastic weights.

Original languageEnglish
Article number5649821
JournalComplexity
Volume2020
DOIs
Publication statusPublished - 16 Nov 2020

ASJC Scopus subject areas

  • Computer Science(all)
  • General

Cite this