IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this paper

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

Listed author(s):
  • 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.

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

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

Paper provided by Department of Applied Mathematics, Università Ca' Foscari Venezia in its series Working Papers with number 173.

in new window

Length: 16 pages
Date of creation: Nov 2008
Handle: RePEc:vnm:wpaper:173
Contact details of provider: Postal:
Dorsoduro, 3825/E, 30123 Venezia

Phone: ++39 041 2346910-6911
Fax: ++ 39 041 5221756
Web page:

More information through EDIRC

No references listed on IDEAS
You can help add them by filling out this form.

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

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)

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.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.