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
来源：
OPTIMIZATION LETTERS | 2013年 / 7卷 / 07期
关键词：
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 条
  • [21] A Hybrid Heuristic for the Team Orienteering Problem
    Bouchakhchoukha, Adel
    Menouer, Tarek
    Sukhija, Nitin
    2017 IEEE SMARTWORLD, UBIQUITOUS INTELLIGENCE & COMPUTING, ADVANCED & TRUSTED COMPUTED, SCALABLE COMPUTING & COMMUNICATIONS, CLOUD & BIG DATA COMPUTING, INTERNET OF PEOPLE AND SMART CITY INNOVATION (SMARTWORLD/SCALCOM/UIC/ATC/CBDCOM/IOP/SCI), 2017,
  • [22] A memetic algorithm for the team orienteering problem
    Hermann Bouly
    Duc-Cuong Dang
    Aziz Moukrim
    4OR, 2010, 8 : 49 - 70
  • [23] A memetic algorithm for the Team Orienteering Problem
    Bouly, Hermann
    Dang, Duc-Cuong
    Moukrim, Aziz
    APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2008, 4974 : 649 - 658
  • [24] Algorithm Selection for the Team Orienteering Problem
    Misir, Mustafa
    Gunawan, Aldy
    Vansteenwegen, Pieter
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, EVOCOP 2022, 2022, 13222 : 33 - 45
  • [25] A memetic algorithm for the team orienteering problem
    Bouly, Hermann
    Dang, Duc-Cuong
    Moukrim, Aziz
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2010, 8 (01): : 49 - 70
  • [26] Approximation Algorithms for the Team Orienteering Problem
    Xu, Wenzheng
    Xu, Zichuan
    Peng, Jian
    Liang, Weifa
    Liu, Tang
    Jia, Xiaohua
    Das, Sajal K.
    IEEE INFOCOM 2020 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, 2020, : 1389 - 1398
  • [27] A matheuristic for the Team Orienteering Arc Routing Problem
    Archetti, Claudia
    Corberan, Angel
    Plana, Isaac
    Maria Sanchis, Jose
    Grazia Speranza, M.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 245 (02) : 392 - 401
  • [28] Solving the team orienteering problem with cutting planes
    El-Hajj, Racha
    Dang, Duc-Cuong
    Moukrim, Aziz
    COMPUTERS & OPERATIONS RESEARCH, 2016, 74 : 21 - 30
  • [29] Ants can solve the team orienteering problem
    Ke, Liangjun
    Archetti, Claudia
    Feng, Zuren
    COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 54 (03) : 648 - 665
  • [30] A SIMHEURISTIC APPROACH FOR THE STOCHASTIC TEAM ORIENTEERING PROBLEM
    Panadero, Javier
    de Armas, Jesica
    Currie, Christine S. M.
    Juan, Angel A.
    2017 WINTER SIMULATION CONFERENCE (WSC), 2017, : 3208 - 3217
12345