Trailer Assignment Optimization for Railway Freight Dispatch
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Dispatchers face challenges in determining the most efficient routes for transporting goods, as existing methods are time-consuming and inefficient due to the numerous factors and variables involved, leading to increased fuel consumption, manpower waste, and prolonged delivery times.
Innovation Solution
A transport dispatch system (TDS) that aggregates requests from multiple railway stations, calculates optimal shipping routes based on metrics like mean time to wait (MTW), and optimizes trailer assignments to minimize the number of vehicles and fuel usage, using a user interface to display and modify routes and constraints.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If manual methods are used to determine transport routes and vehicle assignments, then dispatchers can make decisions based on experience and judgment, but the process becomes extraordinarily time-consuming and inefficient due to the number of factors and variables that must be considered
Solution Approach 1:
The patent replaces the manual mechanical decision-making process with an automated computer-based system that uses algorithms to calculate optimal routes and vehicle assignments. The system automatically processes multiple factors and variables (delivery locations, vehicle types, fuel efficiency, capacity constraints) without human intervention, transforming the time-consuming manual calculation into rapid automated computation.
Solution Approach 2:
The patent introduces a computer system as an intermediary between the dispatcher and the transport optimization problem. This intermediary automatically processes the complex calculations of route selection and vehicle assignment, presenting optimized solutions to the dispatcher without requiring manual analysis of all possible combinations.
2Reliability
If more transport vehicles are used to ensure adequate capacity and coverage, then delivery reliability and customer service improve, but fuel consumption increases and transportation costs rise
Solution Approach 1:
The patent changes the parameters of vehicle selection by optimizing the matching between vehicle characteristics (capacity, type, fuel efficiency) and delivery requirements (location, quantity, timing). The system evaluates multiple vehicle options and selects combinations that minimize fuel consumption while maintaining adequate delivery capacity and reliability.
Solution Approach 2:
The patent makes the transport system more universal by enabling vehicles to be optimally assigned to multiple different delivery scenarios. The system analyzes which vehicles can serve multiple delivery locations efficiently, allowing a single vehicle to perform multiple functions across different routes and time periods, thereby reducing the total number of vehicles needed.
3Productivity
If optimized routes and vehicle assignments are implemented, then fuel efficiency and productivity improve, but the complexity of calculating and managing the optimal combinations increases significantly
Solution Approach 1:
The patent segments the complex optimization problem into manageable components: route selection, vehicle type selection, capacity matching, and fuel efficiency evaluation. The computer system processes these segments separately and combines them to produce the optimized transport plan, making the overall complex task tractable through systematic decomposition.
Data Source
AI summary
Various embodiments for a transport dispatch system for trailer assignment are described herein. An embodiment operates by determining the total quantity of goods to be shipped to the plurality of railway stations, the total quantity of goods comprising a plurality of different materials. A plurality of different types of shipping containers for transporting the different materials are determined. A command to identify the trailer assignment for shipping the total quantity of goods to the plurality of railway stations is received. The trailer assignment for shipping the total quantity of goods to the plurality of railway stations using a fewest number of the shipping containers is computed. The trailer assignment indicating the fewest number of shipping containers that can be used to ship the plurality of different materials to the plurality of railway stations is provided.