IDEAS home Printed from
   My bibliography  Save this paper

A new algorithm for the 2-period Balanced Traveling Salesman Problem in Euclidean graphs


  • Tatiana Bassetto

    () (Department of Applied Mathematics, University of Venice)

  • Francesco Mason

    () (Department of Applied Mathematics, University of Venice)


In a previous paper, we proposed two heuristic algorithms for the euclidean 2-period Balanced Travelling Salesman Problem (2B-TSP). In this problem, which arises from a similar one introduced by Butler et al., a certain number of customers must be visited at minimum total cost over a period of two days: some customers must be visited daily, and the others on alternate days (even or odd days). Moreover, the number of customers visited in every tour must be ‘balanced’, i.e. it must be the same or, alternatively, the difference between the maximum and the minimum number of visited customers must be less than a given threshold: this kind of constraint does not appear explicitly in the paper by Butler. In this paper a third algorithm is presented which overcomes some inadequacy of the algorithm A2 we proposed in the previous paper. The new algorithm’s performance is then analyzed, with respect particularly with the first proposed algorithm.

Suggested Citation

  • Tatiana Bassetto & Francesco Mason, 2008. "A new algorithm for the 2-period Balanced Traveling Salesman Problem in Euclidean graphs," Working Papers 173, Department of Applied Mathematics, Università Ca' Foscari Venezia.
  • Handle: RePEc:vnm:wpaper:173

    Download full text from publisher

    File URL:
    File Function: First version, 2008
    Download Restriction: no

    More about this item


    period routing problem; period travelling salesman problem; logistic; heuristic algorithms;

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    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:vnm:wpaper:173. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Marco LiCalzi). General contact details of provider: .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.