The probabilistic orienteering problem

详细信息    查看全文

• 作者：Enrico Angelelli ^{enrico.angelelli@unibs.it} ; Claudia Archetti ^{claudia.archetti@unibs.it} ; Carlo Filippi ; ^{carlo.filippi@unibs.it} ; Michele Vindigni ^{michele.vindigni@unibs.it}
• 关键词：Stochastic routing ; Orienteering problem ; Probabilistic TSP ; L-shaped method ; Matheuristics
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：May 2017
• 年：2017
• 卷：81
• 期：Complete
• 页码：269-281
• 全文大小：795 K
• 卷排序：81

文摘

A novel stochastic version of the orienteering problem is considered. The problem generalizes the probabilistic TSP. A deterministic equivalent MILP model is derived. A branch-and-cut procedure with special branching rules is developed. Matheuristic procedures are proved to be efficient and effective.