Optimizing matching time intervals for ride-hailing services using reinforcement learning

标题
Optimizing matching time intervals for ride-hailing services using reinforcement learning
作者
关键词
Ride-hailing service, Online matching, Reinforcement learning, Policy gradient method
出版物
出版商
Elsevier BV
发表日期
2021-06-17
DOI
10.1016/j.trc.2021.103239

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search