Tatiana Bassetto () (Department of Applied Mathematics, University of Venice) Francesco Mason () (Department of Applied Mathematics, University of Venice)
Additional information is available for the following
registered author(s):
In the 2-period Balanced Traveling Salesman Problem (2B-TSP), the customers must be visited over a period of two days: some 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. The salesman's objective is to minimize the total distance travelled over the two tours. Although this problem may be viewed as a particular case of the Period Traveling Salesman Problem, in the 2-period Balanced TSP the assumptions allow for emphasizing on routing aspects, more than on the assignment of the customers to the various days of the period. The paper proposes two heuristic algorithms particularly suited for the case of Euclidean distances between the customers. Computational experiences and a comparison between the two algorithms are also given.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Publisher Info
Paper provided by Department of Applied Mathematics, University of Venice in its series Working Papers with number
154.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: