Delivery Assignment Reallocation Using Real-Time Order Progress

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current delivery systems face challenges in optimizing the assignment of tasks to agents due to uncertainties in the time taken by shoppers to collect items and delivery agents to reach stores, leading to sub-optimal assignments by the time drivers arrive.

Innovation Solution

The online shopping concierge system continually or periodically performs optimal re-allocation of orders based on real-time data, updating allocations among delivery agents as they arrive and orders are prepared, to ensure current optimal delivery assignments.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If the online shopping concierge service assigns deliveries to drivers before drivers arrive at stores, then initial assignment can be made, but the assignment becomes sub-optimal due to uncertainties in shopper collection time and driver arrival time

Engineering Contradiction:
Improvedelivery assignment efficiencyVSAvoidassignment optimality
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The system implements dynamic re-allocation of delivery assignments based on real-time data. Instead of static pre-arranged assignments, the system continuously updates driver assignments as drivers approach stores and shoppers prepare orders, ensuring assignments remain optimal despite uncertainties in timing

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The system uses real-time feedback from driver location data and shopper order preparation status to continuously optimize assignments. This feedback loop allows the system to detect when assignments become sub-optimal and re-allocate deliveries before drivers arrive, preventing wasted wait time

Inventive Principle:
Principle #23Feedback

2Reliability

If the system performs system-wide optimization in response to a delivery agent arriving at a store, then optimal assignment can be achieved, but the computational process is time-consuming and creates lag

Engineering Contradiction:
Improveassignment optimalityVSAvoidassignment lag time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system performs preliminary optimization by proactively re-allocating deliveries before drivers arrive at stores. Using real-time tracking data, the system anticipates arrival times and re-assigns orders in advance, so that when drivers arrive, assignments are already optimized without requiring time-consuming computations at the moment of arrival

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

Instead of performing full system-wide optimization in response to each driver arrival, the system performs partial optimization focused only on deliveries relevant to arriving drivers. This selective approach achieves necessary optimality without the computational overhead of complete system re-optimization

Inventive Principle:
Principle #16Partial or excessive action

3Speed

If a delivery agent arrives early at the store, then the agent is ready to deliver, but the agent must wait if the order is not ready, reducing efficiency

Engineering Contradiction:
Improvedriver arrival speedVSAvoiddriver wait time
Core Design Contradiction:
SpeedVSLoss of time

Solution Approach 1:

The system dynamically adjusts delivery assignments based on real-time status of both driver arrival and order preparation. When a driver is assigned to an order that isn't ready, the system automatically re-allocates that delivery to another driver whose assigned order is ready, eliminating wait time while maintaining efficient utilization of driver availability

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS20250111782A1Optimizing task assignments in a delivery system
Publication Date: 2025.04.03 MAPLEBEAR INC
  • US20250111782A1 patent drawing
  • US20250111782A1 patent drawing
  • US20250111782A1 patent drawing

AI summary

A method for optimizing delivery assignments in an online system. The system processes delivery orders from user devices, associates the orders with available delivery agents, and allocates them based on real-time data such as inventory availability at different warehouses, delivery agent locations, and order preparation progress. The system dynamically updates order allocations by periodically reallocating orders to different delivery agents based on travel progress, order preparation progress, warehouse proximity, and inventory availability at various warehouses.