Cold Chain Distribution Route Optimization with Time Constraints

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing cold chain distribution solutions cannot effectively handle scenarios with strict time window constraints, on-route duration constraints, single-vehicle distribution, and no returning to the distribution center, which are common in cold chain city distribution.

Innovation Solution

A route determination method that involves receiving location information of customer points and a distribution center, determining initial planned routes that meet scenario constraints, and iteratively updating these routes to minimize total transportation cost, ensuring that customer points meet time window and on-route duration constraints without returning to the distribution center.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If existing cold chain distribution solutions are used, then general distribution needs can be met, but they cannot handle scenarios with strict time window constraints, on-route duration constraints, single-vehicle distribution, and no returning to distribution center

Engineering Contradiction:

Improveadaptability to cold chain distribution scenariosVSAvoidconstraint satisfaction

Core Design Contradiction:

Adaptability or versatilityVSReliability

Solution Approach 1:

The patent transforms the cold chain distribution problem into a constrained optimization problem by defining specific parameters including time window constraints, on-route duration constraints, single-vehicle distribution constraints, and no-return-to-distribution-center constraints. The system dynamically adjusts routing parameters to satisfy all constraints while minimizing transportation cost, making the solution adaptable to cold chain scenarios.

Inventive Principle:

Principle #35Parameter changes

Solution Approach 2:

The patent replaces traditional mechanical routing methods with an automated computational system that uses algorithms to determine optimal distribution routes. The system receives location information and automatically processes multiple constraints to generate target distribution routes, substituting manual or simple mechanical routing approaches with intelligent computational optimization.

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

2Productivity

If traditional routing methods are used, then route planning can be completed, but transportation cost cannot be minimized under multiple constraints

Engineering Contradiction:

Improvedistribution efficiencyVSAvoidtransportation cost

Core Design Contradiction:

ProductivityVSLoss of energy

Solution Approach 1:

The patent implements an iterative optimization process where the system calculates total transportation cost for each initial planned route, then performs destructive operations on the route and recalculates costs. This feedback loop continues until the route with minimum transportation cost is found, ensuring optimal distribution efficiency while minimizing energy loss.

Inventive Principle:

Principle #23Feedback

Solution Approach 2:

The patent employs dynamic route optimization by iteratively adjusting and updating distribution routes based on cost calculations. The system dynamically modifies routing sequences and configurations to achieve the lowest possible transportation cost while satisfying all cold chain distribution constraints.

Inventive Principle:

Principle #15Dynamics

3Quantity of substance

If multiple routes are planned to cover all customer points, then coverage is improved, but route complexity and calculation difficulty increase

Engineering Contradiction:

Improvecustomer point coverageVSAvoidroute planning complexity

Core Design Contradiction:

Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent segments the customer points into different groups that can be served by different distribution routes. The system divides the overall distribution problem into multiple sub-routes, each optimized independently while ensuring all customer points are covered. This segmentation reduces the complexity of planning a single comprehensive route.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent approaches the routing problem from multiple dimensions by considering not only spatial distance but also time window constraints, on-route duration, and vehicle capacity constraints. By adding these additional dimensional constraints to the optimization, the system manages complexity through structured multi-dimensional parameter consideration.

Inventive Principle:

Principle #17Another dimension (Dimensionality change)

Data Source

PatentUS12305998B2Route determination method, apparatus, server and storage medium for cold chain distribution

Publication Date: 2025.05.20 BEIJING JINGDONG ZHENSHI INFORMATION TECH CO LTD

AI summary

A route determination method, apparatus, server, and storage medium for cold chain distribution, and the method includes: receiving a route determination request from a terminal device, where the route determination request includes: location information of each customer point in a set of customer points to be distributed and location information of a distribution center (21); determining at least one target distribution route according to the location information of each customer point in the set of customer points to be distributed, the location information of the distribution center, scenario constraints and transportation cost constraints (22); and pushing the at least one target distribution route to the terminal device (23). In this method, the target distribution route determined under the scenario constraints and the transportation cost constraints can meet the distribution time-effect and transportation cost constraints, thereby reducing the transportation cost on the basis of improving the user satisfaction.