The multiple travelling salesperson problem with hotel selection

Marco Castro, Kenneth Sörensen, Peter Goos () and Pieter Vansteenwegen

Working Papers from University of Antwerp, Faculty of Business and Economics

Abstract: In this paper, the multiple travelling salesperson problem with hotel selection (m-TSPHS) is presented. This combinatorial optimisation problem is a generalisation of both the travelling salesperson problem with hotel selection (TSPHS) and the multiple travelling salesperson problem (m-TSP). As in the TSPHS, a tour is split into trips whose duration does not exceed a certain travel time, the objective of the m-TSPHS is to design a collection of tours, one for each available salesperson, while minimising the total travel costs. A set-partitioning formulation is presented as well as an efficient solution method together with a number of benchmark instances in order to evaluate the algorithm. Experimental results show that the proposed method is able to keep average gaps with respect to optimal solutions below 1:5%.

Pages: 21 pages
Date: 2014-12
New Economics Papers: this item is included in nep-tre
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://repository.uantwerpen.be/docman/irua/e5409d/6102a007.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ant:wpaper:2014030

Access Statistics for this paper

More papers in Working Papers from University of Antwerp, Faculty of Business and Economics Contact information at EDIRC.
Bibliographic data for series maintained by Joeri Nys ().