SYSTEM FOR DYNAMIC ESTIMATED TIME OF ARRIVAL PREDICTIVE UPDATES

    公开(公告)号:US20210264275A1

    公开(公告)日:2021-08-26

    申请号:US17314487

    申请日:2021-05-07

    Applicant: DoorDash, Inc.

    Abstract: Described are systems and processes for generating dynamic estimated time of arrival predictive updates for delivery of perishable goods. In one aspect a system is configured for generating dynamic estimated time of arrival (ETA) predictive updates between a series of successive events for real-time delivery of orders. For each order, a plurality of delivery events and corresponding timestamps are received from devices operated by customers, restaurants, and couriers. Based on the timestamps, the system generates a plurality of ETA time predictions for one or more of the delivery events with trained predictive models that use weighted factors including historical restaurant data and historical courier performance. As additional timestamps are received for a delivery event, the trained predictive models dynamically update the ETA time predictions for successive events. The predictive models may be continuously trained by updating the weighted factors based on the received timestamps.

    System and method for dynamic pairing function optimization

    公开(公告)号:US11276028B2

    公开(公告)日:2022-03-15

    申请号:US17007463

    申请日:2020-08-31

    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

    公开(公告)号:US20190164126A1

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

    申请号: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.

    System and method for dynamic pairing function optimization

    公开(公告)号:US11922366B2

    公开(公告)日:2024-03-05

    申请号: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 for dynamic estimated time of arrival predictive updates

    公开(公告)号:US11755906B2

    公开(公告)日:2023-09-12

    申请号:US17314487

    申请日:2021-05-07

    Applicant: DoorDash, Inc.

    Abstract: Described are systems and processes for generating dynamic estimated time of arrival predictive updates for delivery of perishable goods. In one aspect a system is configured for generating dynamic estimated time of arrival (ETA) predictive updates between a series of successive events for real-time delivery of orders. For each order, a plurality of delivery events and corresponding timestamps are received from devices operated by customers, restaurants, and couriers. Based on the timestamps, the system generates a plurality of ETA time predictions for one or more of the delivery events with trained predictive models that use weighted factors including historical restaurant data and historical courier performance. As additional timestamps are received for a delivery event, the trained predictive models dynamically update the ETA time predictions for successive events. The predictive models may be continuously trained by updating the weighted factors based on the received timestamps.

    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.

    System for dynamic estimated time of arrival predictive updates

    公开(公告)号:US11037055B2

    公开(公告)日:2021-06-15

    申请号:US15798207

    申请日:2017-10-30

    Applicant: DoorDash, Inc.

    Abstract: Described are systems and processes for generating dynamic estimated time of arrival predictive updates for delivery of perishable goods. In one aspect a system is configured for generating dynamic estimated time of arrival (ETA) predictive updates between a series of successive events for real-time delivery of orders. For each order, a plurality of delivery events and corresponding timestamps are received from devices operated by customers, restaurants, and couriers. Based on the timestamps, the system generates a plurality of ETA time predictions for one or more of the delivery events with trained predictive models that use weighted factors including historical restaurant data and historical courier performance. As additional timestamps are received for a delivery event, the trained predictive models dynamically update the ETA time predictions for successive events. The predictive models may be continuously trained by updating the weighted factors based on the received timestamps.

    SYSTEM FOR DYNAMIC ESTIMATED TIME OF ARRIVAL PREDICTIVE UPDATES

    公开(公告)号:US20190130260A1

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

    申请号:US15798207

    申请日:2017-10-30

    Applicant: DoorDash, Inc.

    Abstract: Described are systems and processes for generating dynamic estimated time of arrival predictive updates for delivery of perishable goods. In one aspect a system is configured for generating dynamic estimated time of arrival (ETA) predictive updates between a series of successive events for real-time delivery of orders. For each order, a plurality of delivery events and corresponding timestamps are received from devices operated by customers, restaurants, and couriers. Based on the timestamps, the system generates a plurality of ETA time predictions for one or more of the delivery events with trained predictive models that use weighted factors including historical restaurant data and historical courier performance. As additional timestamps are received for a delivery event, the trained predictive models dynamically update the ETA time predictions for successive events. The predictive models may be continuously trained by updating the weighted factors based on the received timestamps.

Patent Agency Ranking