Transportation Plan Load Insertion and Schedule Deletion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current transportation planning systems face challenges in efficiently inserting loads into and deleting schedules from transportation plans without disrupting the overall network's ability to transport loads, particularly when drivers are absent or when loads need to be rerouted.
Innovation Solution
The system identifies available capacity in existing schedules to create potential paths for load insertion and determines whether schedules can be deleted by reassigning loads to other schedules, using a combination of direct, indirect modifications, and added movements to optimize route efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If a schedule is deleted from the transportation plan to accommodate driver absence, then the transportation plan needs to be updated, but this may disrupt the carrier's ability to transport loads through the network
Solution Approach 1:
The system automatically detects when a schedule deletion would cause transportation failures by monitoring whether alternative schedules exist for each load. The feedback mechanism identifies schedules that can be safely deleted versus those that would disrupt the network, allowing operators to make informed decisions that maintain reliability while achieving schedule deletion goals
Solution Approach 2:
Before deleting a schedule, the system performs preliminary analysis to identify alternative schedules that can accommodate each load. By pre-calculating replacement options and verifying that alternative paths exist, the system ensures that schedule deletion will not compromise transportation reliability, thus resolving the contradiction between ease of operation and network reliability
2Productivity
If loads are reassigned to different schedules to delete a schedule, then the schedule can be removed, but this requires identifying and modifying multiple transportation movements
Solution Approach 1:
The system segments the transportation plan into individual loads and schedules, allowing selective reassignment of specific loads to alternative schedules. By breaking down the complex reassignment problem into discrete load-level decisions, the system simplifies the overall process of deleting schedules while maintaining productivity through targeted, granular modifications rather than system-wide changes
Solution Approach 2:
The system acts as an intermediary by automatically identifying and proposing alternative schedule assignments for loads that would be affected by schedule deletion. This intermediary function manages the complexity of reassigning multiple transportation movements by providing pre-calculated replacement options, reducing the operational burden on users while achieving efficient schedule deletion
3Adaptability or versatility
If the system provides multiple potential solutions for load insertion, then the user has more options, but this increases the time required to process load insertion requests
Solution Approach 1:
The system applies partial action by providing a limited set of the most relevant potential solutions rather than exhaustively listing all possible assignments. By presenting only the top alternative schedules that offer viable options for load insertion, the system maintains adaptability and versatility while significantly reducing processing time compared to generating complete solution sets
Solution Approach 2:
The system applies local quality by tailoring the number and type of alternative solutions presented based on the specific context of each load insertion request. For high-priority or time-sensitive loads, fewer but more optimized solutions are provided, while less critical loads may receive more comprehensive options, thus balancing adaptability with processing efficiency across different scenarios
Data Source
AI summary
Methods, systems, apparatus, and computer program products are provided. In an example embodiment, a method is provided comprising receiving input identifying load information corresponding to a load to be inserted into a transportation plan. The transportation plan comprises a plurality of transportation schedules, each schedule comprising a plurality of transportation movements. The method further comprises identifying an available movement network comprising portions of transportation schedules having open capacity, each portion of a transportation schedule having open capacity being a potential leg of a path from the origin location to the destination location; determining potential solutions for transporting the load from the origin location to the destination location by combining one or more legs to determine a path of open capacity movements from the origin location to at least part way to the destination location; and providing one or more potential solutions for display via a user interface.