The orienteering problem with stochastic travel and service times

被引：0
|
作者：
Ann M. Campbell
Michel Gendreau
Barrett W. Thomas
机构：
[1] The University of Iowa,Dept. of Management Sciences, Tippie College of Business
[2] École Polytechnique de Montréal,CIRRELT and MAGI
来源：
Annals of Operations Research | 2011年 / 186卷
关键词：
Orienteering; Stochastic travel times; Variable neighborhood search; Dynamic programming;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, we introduce a variant of the orienteering problem in which travel and service times are stochastic. If a delivery commitment is made to a customer and is completed by the end of the day, a reward is received, but if a commitment is made and not completed, a penalty is incurred. This problem reflects the challenges of a company who, on a given day, may have more customers than it can serve. In this paper, we discuss special cases of the problem that we can solve exactly and heuristics for general problem instances. We present computational results for a variety of parameter settings and discuss characteristics of the solution structure.
引用
收藏
页码：61 / 81
页数：20
相关论文
共 50 条
  • [1] The orienteering problem with stochastic travel and service times
    Campbell, Ann M.
    Gendreau, Michel
    Thomas, Barrett W.
    ANNALS OF OPERATIONS RESEARCH, 2011, 186 (01) : 61 - 81
  • [2] Adaptive orienteering problem with stochastic travel times
    Dolinskaya, Irina
    Shi, Zhenyu
    Smilowitz, Karen
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2018, 109 : 1 - 19
  • [3] A Sampling-Based Metaheuristic for the Orienteering Problem with Stochastic Travel Times
    Papapanagiotou, Vassilis
    Montemanni, Roberto
    Gambardella, Luca Maria
    THEORY AND PRACTICE OF NATURAL COMPUTING, TPNC 2016, 2016, 10071 : 97 - 109
  • [4] Research on team orienteering problem with dynamic travel times
    Li, Jin
    Journal of Software, 2012, 7 (02) : 249 - 255
  • [5] THE TEAM ORIENTEERING PROBLEM WITH STOCHASTIC SERVICE TIMES AND DRIVING-RANGE LIMITATIONS: A SIMHEURISTIC APPROACH
    Reyes-Rubiano, Lorena S.
    Ospina-Trujillo, Carlos F.
    Faulin, Javier
    Mozos, Jose M.
    Panadero, Javier
    Juan, Angel A.
    2018 WINTER SIMULATION CONFERENCE (WSC), 2018, : 3025 - 3035
  • [6] Exact and heuristic algorithms for team orienteering problem with fuzzy travel times
    Liu, Xinrui
    Jiang, Xiaojuan
    Luo, Xinggang
    Zhang, Zhongliang
    Ji, Pengli
    EXPERT SYSTEMS WITH APPLICATIONS, 2025, 278
  • [7] A 2-stage method for a field service routing problem with stochastic travel and service times
    Binart, S.
    Dejax, P.
    Gendreau, M.
    Semet, F.
    COMPUTERS & OPERATIONS RESEARCH, 2016, 65 : 64 - 75
  • [8] Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times
    Tsang, Man Yiu
    Shehadeh, Karmel S.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 307 (01) : 48 - 63
  • [9] The orienteering problem with stochastic profits
    Ilhan, Taylan
    Iravani, Seyed M. R.
    Daskin, Mark S.
    IIE TRANSACTIONS, 2008, 40 (04) : 406 - 421
  • [10] On Modeling Stochastic Travel and Service Times in Vehicle Routing
    Gomez, Andres
    Marino, Ricardo
    Akhavan-Tabatabaei, Raha
    Medaglia, Andres L.
    Mendoza, Jorge E.
    TRANSPORTATION SCIENCE, 2016, 50 (02) : 627 - 641
12345