IDEAS home Printed from https://ideas.repec.org/a/taf/nmcmxx/v26y2020i1p80-118.html
   My bibliography  Save this article

Selective generalized travelling salesman problem

Author

Listed:
  • Tusan Derya
  • Esra Dinler
  • Barış Keçeci

Abstract

This paper introduces the Selective Generalized Traveling Salesman Problem (SGTSP). In SGTSP, the goal is to determine the maximum profitable tour within the given threshold of the tour’s duration, which consists of a subset of clusters and a subset of nodes in each cluster visited on the tour. This problem is a combination of cluster and node selection and determining the shortest path between the selected nodes. We propose eight mixed integer programming (MIP) formulations for SGTSP. All of the given MIP formulations are completely new, which is one of the major novelties of the study. The performance of the proposed formulations is evaluated on a set of test instances by conducting 4608 experimental runs. Overall, 4138 out of 4608 (~90%) test instances were solved optimally by using all formulations.

Suggested Citation

  • Tusan Derya & Esra Dinler & Barış Keçeci, 2020. "Selective generalized travelling salesman problem," Mathematical and Computer Modelling of Dynamical Systems, Taylor & Francis Journals, vol. 26(1), pages 80-118, January.
    • Handle: RePEc:taf:nmcmxx:v:26:y:2020:i:1:p:80-118
    DOI: 10.1080/13873954.2019.1705496
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/13873954.2019.1705496
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/13873954.2019.1705496?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    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:taf:nmcmxx:v:26:y:2020:i:1:p:80-118. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/NMCM20 .

    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.