Um Leilão à Prova de Estratégia para o Compartilhamento de Viagens Dinâmico com Múltiplos Passageiros
Resumo
Sistemas de compartilhamento de viagens dinâmico designam passageiros a motoristas em curto prazo. Neste artigo, propomos um leilão que seleciona passageiros a serem servidos e define preços que estes devem pagar, de maneira justa para motoristas e passageiros, provendo lucro para a empresa.
Referências
Cordeau, J.-f. (2003). A Branch-and-Cut Algorithm for the Dial-a-Ride Problem. Operations Research, 54:573–586.
Furuhata, M., Dessouky, M., Ordonez, F., Brunet, M.-E., Wang, X., and Koenig, S. (2013). Ridesharing: The state-of-the-art and future directions. Transportation Research Part B: Methodological, 57:28–46.
Kamar, E. and Horvitz, E. (2009). Collaboration and Shared Plans in the Open World: Studies of Ridesharing. In Proceedings of the 21th International Joint Conference on Artificial Intelligence, pages 187–194.
Kleiner, A., Nebel, B., and Ziparo, V. A. (2011). A Mechanism for Dynamic Ride Sharing Based on Parallel Auctions. In Proceedings of the 22th International Joint Conference on Artificial Intelligence, pages 266–272.
Vickrey, W. (1961). Counterspeculation, Auctions, and Competitive Sealed Tenders. The Journal of Finance, 16(1):8–37.
Furuhata, M., Dessouky, M., Ordonez, F., Brunet, M.-E., Wang, X., and Koenig, S. (2013). Ridesharing: The state-of-the-art and future directions. Transportation Research Part B: Methodological, 57:28–46.
Kamar, E. and Horvitz, E. (2009). Collaboration and Shared Plans in the Open World: Studies of Ridesharing. In Proceedings of the 21th International Joint Conference on Artificial Intelligence, pages 187–194.
Kleiner, A., Nebel, B., and Ziparo, V. A. (2011). A Mechanism for Dynamic Ride Sharing Based on Parallel Auctions. In Proceedings of the 22th International Joint Conference on Artificial Intelligence, pages 266–272.
Vickrey, W. (1961). Counterspeculation, Auctions, and Competitive Sealed Tenders. The Journal of Finance, 16(1):8–37.
Publicado
04/07/2016
Como Citar
SCHWARZSTEIN, Leonardo Y.; MIYAZAWA, Flávio K.; SCHOUERY, Rafael C. S..
Um Leilão à Prova de Estratégia para o Compartilhamento de Viagens Dinâmico com Múltiplos Passageiros. In: ENCONTRO DE TEORIA DA COMPUTAÇÃO (ETC), 1. , 2016, Porto Alegre.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2016
.
p. 856-859.
ISSN 2595-6116.
DOI: https://doi.org/10.5753/etc.2016.9843.
