The capacitated team orienteering problem with incomplete service

被引:14
|
作者
Archetti, Claudia [1 ]
Bianchessi, Nicola [2 ]
Speranza, M. Grazia [1 ]
机构
[1] Univ Brescia, Dept Quantitat Methods, Brescia, Italy
[2] Univ Brescia, Dept Informat Engn, Brescia, Italy
关键词
Capacitated Team Orienteering Problem; Incomplete service; Split deliveries; Exact algorithms; TIME WINDOWS; SEARCH;
D O I
10.1007/s11590-012-0559-4
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper we study the capacitated version of the Team Orienteering Problem (TOP), that is the Capacitated TOP (CTOP) and the impact of relaxing the assumption that a customer, if served, must be completely served. We prove that the profit collected by the CTOP with Incomplete Service (CTOP-IS) may be as large as twice the profit collected by the CTOP. A computational study is also performed to evaluate the average increase of the profit due to allowing incomplete service. The results show that the increase of the profit strongly depends on the specific instance. On the tested instances the profit increase ranges between 0 and 50 %. We complete the computational study with the increase of the profit of the CTOP due to split deliveries, that is multiple visits to the same customer, and to split deliveries combined with incomplete service.
引用
收藏
页码:1405 / 1417
页数:13
相关论文
共 50 条
  • [1] The capacitated team orienteering problem with incomplete service
    Claudia Archetti
    Nicola Bianchessi
    M. Grazia Speranza
    [J]. Optimization Letters, 2013, 7 : 1405 - 1417
  • [2] The Split Delivery Capacitated Team Orienteering Problem
    Archetti, C.
    Bianchessi, N.
    Speranza, M. G.
    Hertz, A.
    [J]. NETWORKS, 2014, 63 (01) : 16 - 33
  • [3] An adaptive heuristic for the Capacitated Team Orienteering Problem
    Ben-Said, Asma
    El-Hajj, Racha
    Moukrim, Aziz
    [J]. IFAC PAPERSONLINE, 2016, 49 (12): : 1662 - 1666
  • [4] THE CAPACITATED TEAM ORIENTEERING PROBLEM: BEE COLONY OPTIMIZATION
    Drenovac, Dragana
    Nedeljkovic, Ranko R.
    [J]. PROCEEDINGS OF THE 2ND LOGISTICS INTERNATIONAL CONFERENCE, 2015, : 43 - 48
  • [5] A variable space search heuristic for the Capacitated Team Orienteering Problem
    Ben-Said, Asma
    El-Hajj, Racha
    Moukrim, Aziz
    [J]. JOURNAL OF HEURISTICS, 2019, 25 (02) : 273 - 303
  • [6] Exact Algorithm for the Capacitated Team Orienteering Problem with Time Windows
    Park, Junhyuk
    Lee, Jongsung
    Ahn, SeHwan
    Bae, Jungryul
    Tae, Hyunchul
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2017, 2017
  • [7] A variable space search heuristic for the Capacitated Team Orienteering Problem
    Asma Ben-Said
    Racha El-Hajj
    Aziz Moukrim
    [J]. Journal of Heuristics, 2019, 25 : 273 - 303
  • [8] The Capacitated Orienteering Problem
    Bock, Adrian
    Sanita, Laura
    [J]. DISCRETE APPLIED MATHEMATICS, 2015, 195 : 31 - 42
  • [9] The Capacitated Team Orienteering Problem: An online optimization framework with predictions of unknown accuracy
    Shiri, Davood
    Akbari, Vahid
    Hassanzadeh, Ali
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2024, 185
  • [10] The capacitated team orienteering and profitable tour problems
    Archetti, C.
    Feillet, D.
    Hertz, A.
    Speranza, M. G.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2009, 60 (06) : 831 - 842