Algorithms for Future Mobility Society-Reference-Cited by-同舟云学术

Algorithms for Future Mobility Society

Published:2024 Issue: Volume: Page:173-185
ISSN:
Container-title:Advanced Mathematical Science for Mobility Society
language:en
Short-container-title:

Author:

Kawase Yasushi,Makino Kazuhisa,Sumita Hanna

Abstract

AbstractIn this chapter, we focus on combinatorial optimization problems related to mobility societies. We briefly explain the main existing approaches for solving basic optimization problems and the advanced frameworks that capture realistic problems: online optimization and mechanism design. In relation to these topics, we introduce our results obtained from a joint project between Kyoto University and Toyota Motor Corporation.

Publisher

Springer Nature Singapore

Link

https://link.springer.com/content/pdf/10.1007/978-981-99-9772-5_9

Reference48 articles.

1. G. Aggarwal, S. Gollapudi, Raghavender, A.K. Sinop, Sketch-based algorithms for approximate shortest paths in road networks, in Proceedings of the Web Conference 2021 (2021), pp. 3918–3929

2. Y. Amano, A. Igarashi, Y. Kawase, K. Makino, H. Ono, Fair ride allocation on a line, in Proceedings of the 15th International Symposium on Algorithmic Game Theory (2022), pp. 421–435

3. S. Arora, Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)

4. N. Ascheuer, S.O. Krumke, J. Rambau, Online dial-a-ride problems: minimizing the completion time, in Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science (2000), pp. 639–650

5. H. Aziz, H. Moulin, F. Sandomirskiy, A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation. Oper. Res. Lett. 48(5), 573–578 (2020)