SYSTEM AND METHOD FOR DYNAMIC PAIRING FUNCTION OPTIMIZATION

    公开(公告)号:US20220156696A1

    公开(公告)日:2022-05-19

    申请号:US17649926

    申请日:2022-02-03

    Applicant: DoorDash, Inc.

    Abstract: Provided are systems and processes for optimizing assignments of deliveries for perishable goods. In one aspect, a method is provided for pairing a set of created orders with a set of available couriers. The set of created orders may include orders confirmed by the merchant and the set of available couriers include couriers that are online with an active status. Feasible pairings are generated between each courier and each created order. Infeasible pairings are eliminated based on factors such as transportation mode. Possible routes for each pairing are generated and scored based on weighted factors. The scores are optimized to achieve a set of routes with a maximum score. The routes are then offered to the corresponding courier if the courier will arrive at or after the created order is completed by the merchant. A neural network may be implemented to recognize the optimal score for a given duration.

    System and method for dynamic pairing function optimization

    公开(公告)号:US10810536B2

    公开(公告)日:2020-10-20

    申请号:US15826736

    申请日:2017-11-30

    Applicant: DoorDash, Inc.

    Abstract: Provided are systems and processes for optimizing assignments of deliveries for perishable goods. In one aspect, a method is provided for pairing a set of created orders with a set of available couriers. The set of created orders may include orders confirmed by the merchant and the set of available couriers include couriers that are online with an active status. Feasible pairings are generated between each courier and each created order. Infeasible pairings are eliminated based on factors such as transportation mode. Possible routes for each pairing are generated and scored based on weighted factors. The scores are optimized to achieve a set of routes with a maximum score. The routes are then offered to the corresponding courier if the courier will arrive at or after the created order is completed by the merchant. A neural network may be implemented to recognize the optimal score for a given duration.

    DEPOT DISPATCH PROTOCOL FOR AGGREGATING ON-DEMAND DELIVERIES

    公开(公告)号:US20190130354A1

    公开(公告)日:2019-05-02

    申请号:US15798219

    申请日:2017-10-30

    Applicant: DoorDash, Inc.

    Abstract: Provided are various mechanisms and processes for optimizing real-time, on-demand deliveries of perishable goods. In one aspect, a method is provided for aggregating on-demand deliveries using a depot dispatch protocol. The method comprises dispatching runners to pick up on-demand orders for drop off at a depot where the orders are aggregated and batched based on optimized delivery routes and destination proximities. Batches of orders are then assigned to couriers who may arrive at the depot to receive the batched orders without having to navigate through areas of high congestion. Such delivery routing system may be implemented alongside a delivery tracking system for generating estimated time of arrival predictive updates for real-time delivery of perishable goods.

Patent Agency Ranking