Delivery Schedule Revision Using Fixed and Flexible Stops
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing delivery schedule revision methods do not adapt to the operational systems of companies, leading to inefficiencies when unscheduled tasks arise during delivery tasks.
Innovation Solution
An information processing method that regenerates a trip schedule by acquiring a first trip schedule, determining a fixed part based on the moving unit's attributes, and generating a second trip schedule without changing the fixed part, ensuring adaptability to the company's operational system.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a delivery schedule is revised to include unscheduled delivery tasks, then the delivery schedule can adapt to new tasks, but the operational system constraints of the company may be violated
Solution Approach 1:
The trip schedule is segmented into fixed parts and flexible parts based on moving unit attributes. Fixed parts (destinations that cannot be changed) are identified and protected, while flexible parts can be adjusted to accommodate unscheduled tasks. This segmentation allows the schedule to adapt to new tasks without violating operational constraints.
Solution Approach 2:
The system dynamically determines which destinations are fixed and which are flexible based on the attributes of the moving unit. This dynamic classification allows the schedule to be adaptable while respecting operational constraints specific to different vehicle types and their capabilities.
2Productivity
If the trip schedule is completely regenerated to accommodate new destinations, then responsiveness to changes is improved, but the complexity of schedule regeneration increases
Solution Approach 1:
The fixed part of the trip schedule is extracted and separated from the flexible part. By identifying and isolating destinations that cannot be changed, the system only needs to regenerate the flexible portions of the schedule, significantly reducing the complexity of schedule regeneration while maintaining responsiveness to changes.
Solution Approach 2:
Instead of completely regenerating the entire trip schedule, the system performs partial regeneration only on the flexible parts that can accommodate new destinations. This partial action approach reduces computational complexity while still achieving the desired responsiveness to changes.
3Reliability
If fixed parts are determined based on moving unit attributes, then operational system compliance is improved, but the time required for schedule regeneration increases
Solution Approach 1:
The system performs preliminary determination of fixed parts based on moving unit attributes before actual schedule regeneration. By pre-identifying which destinations are fixed and which are flexible, the system avoids time-consuming trial-and-error during the regeneration process, reducing overall regeneration time while ensuring operational compliance.
Data Source
AI summary
An information processing method causes a computer to execute acquiring a first delivery schedule generated based on a plurality of first destinations and a moving unit for providing delivery or service based on the first destinations, acquiring an attribute of the moving unit, acquiring a plurality of second destinations obtained from a revision in the first destinations after generating of the first delivery schedule, determining a fixed part regarding a destination that is not allowed to be changed on the first delivery schedule of the moving unit, in accordance with the attribute of the moving unit, and generating a second delivery schedule in accordance with the moving unit and the second destinations, without changing the fixed part.