Overlapping Delivery Windows Scheduling System
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional delivery systems lack flexibility in allowing consumers to choose delivery times and are inefficient due to sequential time windows, leading to increased labor and delivery costs, as well as consumer frustration.
Innovation Solution
A method and system that offer overlapping time windows, allowing consumers to choose from multiple time slots, including sequential and overlapping windows, with a scheduling engine determining the most cost-effective delivery times and optimizing routes using an on-line program and routing engine.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If sequential time windows are used for delivery, then delivery scheduling is simplified, but consumer flexibility and delivery efficiency deteriorate
Solution Approach 1:
The patent transforms static sequential time windows into dynamic overlapping time windows. Each delivery is assigned multiple possible time windows that overlap with each other, allowing the system to adapt to consumer availability while maintaining scheduling efficiency through algorithmic optimization.
Solution Approach 2:
The patent changes the fundamental parameter of time window structure from sequential to overlapping. This parameter change allows consumers to choose from multiple overlapping windows, increasing flexibility while the scheduling algorithm maintains operational simplicity by selecting optimal windows based on driver routes.
2Device complexity
If sequential time windows are used for delivery, then route planning is simpler, but labor and delivery costs increase
Solution Approach 1:
The system uses dynamic overlapping time windows that allow route optimization algorithms to plan more efficient delivery sequences. Drivers can be scheduled to deliver multiple items within overlapping windows, reducing total travel time and increasing delivery capacity without excessive complexity.
Solution Approach 2:
The scheduling algorithm performs preliminary optimization by pre-calculating optimal delivery sequences within overlapping time windows. This allows drivers to follow efficient pre-planned routes, reducing actual delivery time and costs while the system manages complexity through automated computation.
3Productivity
If consumers must wait for the next available time window, then delivery scheduling is more efficient, but consumer convenience deteriorates
Solution Approach 1:
Overlapping time windows provide consumers with multiple choice options within a flexible timeframe. If a consumer is unavailable for one window, they can choose another overlapping window without waiting for the next sequential window, improving convenience while the system maintains scheduling efficiency through algorithmic selection.
Solution Approach 2:
The system offers more time window options to consumers than strictly necessary (excessive action). This provides consumers with greater flexibility and choice, allowing them to select convenient delivery times without requiring the system to optimize every possible scenario, thus maintaining scheduling efficiency.
4Adaptability or versatility
If drivers travel to locations outside current time windows, then delivery coverage is expanded, but travel time and costs increase
Solution Approach 1:
Overlapping time windows allow drivers to efficiently service multiple locations by planning routes that leverage window overlaps. Drivers can deliver to locations that would traditionally require returning later by scheduling deliveries within overlapping windows, expanding effective coverage without proportionally increasing travel time.
Solution Approach 2:
The patent merges multiple delivery opportunities into overlapping time windows, allowing drivers to combine deliveries that would traditionally require separate trips. By consolidating deliveries within overlapping windows, the system expands delivery coverage while reducing total travel time and costs.
Data Source
AI summary
A method and system for obtaining desired times from intended recipients of items is provided. The method provides each recipient with a plurality of time windows that overlap with one another in time from which the recipient may choose a time for delivery of an item and receives choices made by recipients from the plurality of overlapping windows. One aspect of the invention includes applying predetermined parameters to the time windows to determine which time windows to offer to the recipients as available times from which the recipient may choose a time for delivery. Such parameters may include, among others, which time windows have associated with them the least cost of service in making the delivery, whether the cost of delivering within a time window is less than a monetary threshold, and whether a maximum number of orders to be delivered within one time window has been reached.