Application of Matching Theory to Dispatching System at Daily Delivery

本文研究了匹配理论在调度问题的快速算法设计中的应用 系统将由Daily Delivery Services在真实的世界环境中使用。每日送货服务是一个 按需城市配送公司，为个人和企业提供服务。调度单位 该公司负责将任务分配给其可用的驾驶员车队（内部称为 “个人购物者”），以便及时处理请求。此过程在 时刻.这个过程可以使用匹配理论自动完成。具体地，调度可以是 使用决策支持系统。该决策支持系统可以提供信息和建议 如何分配司机的工作，使公司的资源得到更有效的利用。为了实现这一点， 我们建议研究匹配理论是否可以应用于设计推荐系统， 派遣司机。这项研究的结果将在一份报告中提交给开发团队， 每日送货。

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.