Juegos de rutas con flota homogénea y agentes con múltiples objetivos

Abstract

Routing games model situations in which a company must satisfy the transport demands of several customers located in different places, travelling along the route with less transport costs. The aim of these games is to allocate the total transport costs generated by the optimal configuration of routes among the customers. In this paper, we consider situations where a company could collect or deliver several objects for each customer. In order to minimize the cost of the final configuration of routes, the company can visit each customer with various vehicles instead of assuming a situation where each customer is visited by a single vehicle, like in the clasic capacited vehicle routing problem. We formulate the division problem of the cost from different cooperative games. We study different allocation sets based on stability notions, and analyze the conditions assuring the existence of allocations on these sets.