Cost-Based Vehicle Routing Using Machine Learning

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current vehicle routing systems do not effectively consider the total cost of routes, including direct and indirect costs, to provide the most cost-effective navigation for electric and hybrid vehicles, which can lead to inefficient energy consumption and increased maintenance costs.

Innovation Solution

A method for determining navigation routes based on predicted total cost, incorporating direct and indirect cost factors such as energy consumption, vehicle maintenance, and third-party expenses, using a combination of direct cost information and machine learning models trained with actual cost data from multiple vehicles to calculate composite route scores.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of energy

If traditional routing systems only consider direct costs (fuel, tolls), then the routing calculation is simple and fast, but the total cost is not optimized and energy consumption increases

Engineering Contradiction:
Improveenergy consumptionVSAvoidrouting system complexity
Core Design Contradiction:
Loss of energyVSDevice complexity

Solution Approach 1:

The patent segments the routing cost into multiple components: direct costs (fuel, tolls) and indirect costs (maintenance, third-party expenses). By dividing the cost structure into segments and evaluating each separately using machine learning models, the system achieves comprehensive cost optimization without excessive complexity. Each cost segment is modeled independently and then aggregated to determine the total route cost.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies preliminary action by training machine learning models in advance with historical cost data from multiple vehicles. These pre-trained models enable the routing system to quickly estimate indirect costs for different route segments without performing complex calculations in real-time. The preliminary training phase stores learned patterns that are then reused during route planning, reducing computational complexity while improving energy cost optimization.

Inventive Principle:
Principle #10Preliminary action

2Loss of energy

If routing systems use machine learning models to predict indirect costs, then total cost optimization improves, but computational complexity and data processing requirements increase

Engineering Contradiction:
Improvetotal costVSAvoidcomputational complexity
Core Design Contradiction:
Loss of energyVSDevice complexity

Solution Approach 1:

The patent performs preliminary action by training machine learning models offline using historical cost data from multiple vehicles. The trained models are then deployed to predict indirect costs for route segments during navigation. This separation of training and inference phases allows complex learning to occur beforehand, while real-time route planning uses simpler predictions, reducing computational complexity during actual use while still achieving total cost optimization.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent applies partial action by using machine learning models only for predicting indirect costs (maintenance, third-party expenses) rather than attempting to model all route attributes. Direct costs are calculated using traditional methods, while ML models supplement only the uncertain indirect portions. This partial application of complex technology achieves total cost optimization without unnecessarily increasing computational complexity across the entire system.

Inventive Principle:
Principle #16Partial or excessive action

3Measurement precision

If the system collects and processes actual cost data from multiple vehicles, then prediction accuracy improves, but data processing time and system complexity increase

Engineering Contradiction:
Improvecost prediction accuracyVSAvoiddata processing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent applies preliminary action by collecting and processing actual cost data from multiple vehicles in advance to train machine learning models offline. Once trained, the models can quickly predict indirect costs for new routes without requiring real-time access to raw data or complex processing. This preliminary data processing phase separates bulk data handling from real-time prediction, improving accuracy while minimizing data processing time during actual route planning.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent uses copying by creating trained machine learning model representations that capture patterns from historical multi-vehicle cost data. Instead of processing raw data from multiple vehicles during each routing calculation, the system copies the learned patterns into pre-trained models that can be rapidly applied to predict costs for individual routes. This copying approach preserves the accuracy benefits of multi-vehicle data while eliminating the time cost of processing that data in real-time.

Inventive Principle:
Principle #26Copying

Data Source

PatentUS12181296B2Cost-based vehicle routing
Publication Date: 2024.12.31 TOYOTA MOTOR NORTH AMERICA INC
  • US12181296B2 patent drawing
  • US12181296B2 patent drawing
  • US12181296B2 patent drawing

AI summary

Systems and methods are provided for determining navigation routing of a vehicle based on predicted total cost of possible routes, including: receiving information identifying a destination for a vehicle; determining two or more possible routes from a origination to the destination; determining a plurality of cost factors for a plurality of the determined possible routes, wherein the cost factors comprise direct cost information for the plurality of determined possible routes and indirect cost information for the plurality of determined possible routes; calculating a total cost for each of the plurality of determined possible routes using the cost factors; and presenting to the user a lowest-total-cost route from among the plurality of determined possible routes.