Juegos de rutas con flota homogenea y agentes con multiples objetos

  1. D.V. Borrero 1
  1. 1 Universidad Pablo de Olavide
    info

    Universidad Pablo de Olavide

    Sevilla, España

    ROR https://ror.org/02z749649

Revista:
Rect@: Revista Electrónica de Comunicaciones y Trabajos de ASEPUMA

ISSN: 1575-605X

Any de publicació: 2016

Volum: 17

Número: 2

Pàgines: 149-165

Tipus: Article

DIALNET GOOGLE SCHOLAR lock_openDialnet editor

Altres publicacions en: Rect@: Revista Electrónica de Comunicaciones y Trabajos de ASEPUMA

Resum

Routing games model situations in which a company must satisfy the transport demands of several customers located in di erent 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 con guration 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 nal con guration 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 di erent cooperative games. We study di erent allocation sets based on stability notions, and analyze the conditions assuring the existence of allocations on these sets.

€ Mostra el finançament

Informació de finançament

Esta investigación ha sido financiada en parte por la Consejería de Innovación, Ciencia y Empresa de la Junta de Andalucía, proyecto P11-SEJ-7782, y por el Ministerio de Economía y Competitividad, proyecto ECO2015-68856-P (MINECO/FEDER).

Finançadors

Referències bibliogràfiques

  • G.B. Dantzig and R.H. Ramser, “The Truck Dispatching Problem”, Management Science. 6 (1959) 80– 91.
  • T.K. Ralphs, L. Kopman, W.R. Pulleyblank and L.E. Trotter, “On the capacited vehicle routing problem”, Mathematical Programming. 94 (2003) 343 – 359.
  • M. G¨othe-Lundgren, K. J¨ornsten and P. V¨arbrand, “On the nucleolus of the basic vehicle routing game”, Mathematical Programming. 72 (1996) 83 – 100.
  • J.A.M. Potters, I.J. Curiel and S.H. Tijs, “Traveling salesman games”, Mathematical Programming. 53 (1992) 199–211.
  • J. Derks and J. Kuipers, “On the core of routing games”, International Journal of Game Theory. 26 (1997) 193 – 205.
  • D. Yengin, “Characterizing the Shaple value in fixed-route traveling salesman problems with appointments”, International Journal of Game Theory. 41 (2012) 271 – 299.
  • S. Engevall, M. G¨othe-Lundgren and P. V¨arbrand, “The heterogeneous vehicle-routing game”, Transportation Science. 38 (1) (2004) 71 – 85.
  • M.L. Balinsky and R.E. Quandt, “On an integer program for a delivery problem”, Operations Research. 12 (1964) 300 – 304.
  • L.S. Shapley, “A value for n-person games”, Annals of Mathematics Studies. 28 (1953) 307 – 317.
  • D. Schmeidler, “The nucleolus of a characteristic function game”, SIAM Journal of Applied Mathematics. 16 (1969) 1163 –1170.
  • A. Kopelowitz, “Computation of the kernels of simple games and the nucleolus of n person games”. Research Memorandum. N◦ 31, Department of Mathematics. The Hebrew University of Jerusalem (1967).
Fuente de los datos: Dialnet