| dc.description.abstract | The traveling salesman problem and its variants are among the most studied problems in the literature on transportation and logistics. In one of these variants known as the profitable tour problem [2], a profit-maximizing carrier decides whether to visit a particular customer with respect to the prize the customer offers for being visited and traveling cost associated with the visit, all in the context of other customers. The purpose of this paper is to define the profitable tour game, a cooperative version of the profitable tour problem, and to derive its properties. We are particularly interested in prize allocations that create incentives for the carrier to visit all relevant customers.
Applications of the profitable tour game might include for example situations in shipping where a carrier is able to serve demands of several customers with a single vehicle. Whether it comes to delivery or pickup of goods, the customers might need to induce the carrier to visit them by offering sufficient rewards. Subsequently, negotiation with other customers in the same position could lead to better prizes while the carrier's visit would remain guaranteed. This knowledge could also be utilized by the carrier by offering specifically tailored discounts on multiple orders from the same area or by evaluating and pricing of new customers. | nb_NO |
