Application of Matching Theory to Dispatching System at Daily Delivery

研究了匹配理论在设计快速调度算法和启发式算法中的应用 每日递送服务在真实环境中使用的系统。每日递送服务是一种 按需城市快递公司，为个人和企业提供服务。北京交通大学调度单位 该公司负责将任务分配给他们可用的司机车队(内部称为 “个人购物者”)，以便及时处理请求。此过程在 时刻。这一过程可以使用匹配理论自动完成。具体地说，调度可以是 使用决策支持系统完成。该决策支持系统可以提供信息和建议 如何将工作分配给司机，以便更有效地利用公司的资源。要做到这一点， 我们建议研究匹配理论是否可以应用于设计一个推荐系统 派司机过来。这项研究的结果将以报告的形式提交给开发团队，网址为 每天送货。

We study the application of Matching Theory in designing fast algorithms and/or heuristics for a dispatching system to be used in a real world environment by Daily Delivery Services. Daily Delivery Services is an on-demand urban delivery company providing service to individuals and businesses. The dispatching unit of the company is responsible for assigning tasks to their available fleet of drivers (internally referred to as "personal shoppers") so that requests are addressed in a timely manner. This process is done manually at the moment. This process may be done automatically using matching theory. Specifically, the dispatching can be done using a decision support system. This decision support system can provide information and suggestions on how to assign jobs to drivers so that the company's resources are used more efficiently. To accomplish this, we propose to study whether matching theory can be applied in designing a recommendation system for dispatching the drivers. The findings of this research will be presented in a report to the development team at Daily Delivery.