IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-58405-3_13.html
   My bibliography  Save this book chapter

Variants and Applications of the Covering Tour Problem: A Literature Review

In: Operations Research Proceedings 2023

Author

Listed:
  • Fatma Ben Amor

    (Faculty of Economics and Management Sciences
    MODILS: Laboratory of Modeling and Optimization for Decisional Industrial and Logistic Systems)

  • Manel Kammoun

    (Faculty of Economics and Management Sciences
    MODILS: Laboratory of Modeling and Optimization for Decisional Industrial and Logistic Systems)

  • Taicir Loukil

    (Faculty of Economics and Management Sciences
    MODILS: Laboratory of Modeling and Optimization for Decisional Industrial and Logistic Systems)

Abstract

The Covering Tour Problem (CTP) is considered as a generalization of the Traveling Salesman Problem in which not all nodes must be visited. The main concept of the CTP is that some nodes must be visited by the vehicles whereas some other nodes have to be covered. If a node is located within a predetermined covering distance of its next visited node, it is said to be covered. The interest in this subject has recently increased, both theoretically and practically. Multiple researchers have been interested in the CTP for real-life applications, such as humanitarian logistics, regional development, urban patrolling, and healthcare management. To the best of our knowledge, no work has considered reviewing the covering tour problem. For this reason, we will introduce in this work, the CTP and its different variants. The main objective is to examine the existent literature to highlight the studies that have already been done and to identify any gaps and promising areas for further studies.

Suggested Citation

  • Fatma Ben Amor & Manel Kammoun & Taicir Loukil, 2025. "Variants and Applications of the Covering Tour Problem: A Literature Review," Lecture Notes in Operations Research, in: Guido Voigt & Malte Fliedner & Knut Haase & Wolfgang Brüggemann & Kai Hoberg & Joern Meissner (ed.), Operations Research Proceedings 2023, chapter 0, pages 97-105, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-58405-3_13
    DOI: 10.1007/978-3-031-58405-3_13
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:lnopch:978-3-031-58405-3_13. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.