IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v45y1997i3p378-394.html
   My bibliography  Save this article

A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem

Author

Listed:
  • Matteo Fischetti

    (University of Padova, Italy)

  • Juan José Salazar González

    (University of La Laguna, Spain)

  • Paolo Toth

    (University of Bologna, Italy)

Abstract

We consider a variant of the classical symmetric Traveling Salesman Problem in which the nodes are partitioned into clusters and the salesman has to visit at least one node for each cluster. This NP -hard problem is known in the literature as the symmetric Generalized Traveling Salesman Problem (GTSP), and finds practical applications in routing, scheduling and location-routing. In a companion paper (Fischetti et al. [Fischetti, M., J. J. Salazar, P. Toth. 1995. The symmetric generalized traveling salesman polytope. Networks 26 113–123.]) we modeled GTSP as an integer linear program, and studied the facial structure of two polytopes associated with the problem. Here we propose exact and heuristic separation procedures for some classes of facet-defining inequalities, which are used within a branch-and-cut algorithm for the exact solution of GTSP. Heuristic procedures are also described. Extensive computational results for instances taken from the literature and involving up to 442 nodes are reported.

Suggested Citation

  • Matteo Fischetti & Juan José Salazar González & Paolo Toth, 1997. "A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem," Operations Research, INFORMS, vol. 45(3), pages 378-394, June.
    • Handle: RePEc:inm:oropre:v:45:y:1997:i:3:p:378-394
    DOI: 10.1287/opre.45.3.378
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.45.3.378
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.45.3.378?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
    ---><---

    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:inm:oropre:v:45:y:1997:i:3:p:378-394. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.