Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dingshui Zhang

dblp:223/3197 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 61% Optimization for machine learning · 30% Multi-agent systems · 9%

Topics — the 3 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning
combinatorial optimization
0.312018
Large-Scale Order Dispatch in On-Demand Ride-Hailing Platforms: A Learning and Planning Approach · KDD 2018
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning
large-scale planning
0.312018
Large-Scale Order Dispatch in On-Demand Ride-Hailing Platforms: A Learning and Planning Approach · KDD 2018
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning
order dispatching
0.312018
Large-Scale Order Dispatch in On-Demand Ride-Hailing Platforms: A Learning and Planning Approach · KDD 2018

Methods — techniques the papers use, named apart from their topics

spatiotemporal quantization · 0.3reinforcement learning · 0.3combinatorial optimization · 0.3
YearPublicationVenuePosition
2018 Large-Scale Order Dispatch in On-Demand Ride-Hailing Platforms: A Learning and Planning Approach
abstract
We present a novel order dispatch algorithm in large-scale on-demand ride-hailing platforms. While traditional order dispatch approaches usually focus on immediate customer satisfaction, the proposed algorithm is designed to provide a more efficient way to optimize resource utilization and user experience in a global and more farsighted view. In particular, we model order dispatch as a large-scale sequential decision-making problem, where the decision of assigning an order to a driver is determined by a centralized algorithm in a coordinated way. The problem is solved in a learning and planning manner: 1) based on historical data, we first summarize demand and supply patterns into a spatiotemporal quantization, each of which indicates the expected value of a driver being in a particular state; 2) a planning step is conducted in real-time, where each driver-order-pair is valued in consideration of both immediate rewards and future gains, and then dispatch is solved using a combinatorial optimizing algorithm. Through extensive offline experiments and online AB tests, the proposed approach delivers remarkable improvement on the platform's efficiency and has been successfully deployed in the production system of Didi Chuxing.
Zhixin Li 0006, Qingwen Guan, Dingshui Zhang, Qiang Li 0024, Junxiao Nan, Wei Bian 0003, Jieping Ye
KDD4