Delivery Plan Creation Support Program Reducing Calculation Complexity

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The existing methods for creating delivery plans face significant challenges in optimizing calculation costs, particularly as the number of delivery points increases, leading to an enormous number of combinations that are difficult to analyze and optimize effectively.

Innovation Solution

A delivery plan creation support program and method that selects a relay point and delivery destinations based on cost calculations, dividing points into groups for direct and relay point deliveries, reducing the number of combinations and thereby lowering calculation costs.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If the number of delivery points increases to cover more destinations, then the delivery coverage is improved, but the number of path combinations increases enormously making optimization difficult

Engineering Contradiction:
Improvedelivery coverageVSAvoidcalculation complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent segments the delivery network by identifying relay points that divide the system into multiple sub-networks. Each relay point acts as a segmentation node that separates delivery destinations into different groups, allowing independent optimization of each segment rather than treating the entire network as one complex system.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces relay points as intermediary nodes between the central depot and final delivery destinations. These intermediaries facilitate the transfer of goods and enable the system to handle larger numbers of destinations by breaking down the direct delivery paths into multi-hop routes through the relay points.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Measurement precision

If all possible delivery path combinations are analyzed to find the optimum solution, then the optimization precision is improved, but the calculation cost increases enormously

Engineering Contradiction:
Improveoptimization precisionVSAvoidcalculation cost
Core Design Contradiction:
Measurement precisionVSLoss of energy

Solution Approach 1:

The patent performs preliminary identification and selection of relay points before conducting full path optimization. By pre-determining which nodes should function as relay points based on initial criteria, the system reduces the search space for subsequent optimization, avoiding the need to evaluate all possible path combinations while still achieving near-optimal solutions.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent applies partial optimization by focusing computational resources on optimizing paths through identified relay points rather than uniformly optimizing all possible paths. This selective approach achieves sufficient optimization precision for the most critical routes while reducing overall calculation costs by excluding less important path variations from exhaustive analysis.

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS11544660B2Non-transitory computer-readable storage medium for storing delivery plan creation support program, delivery plan creation support method, and information processing apparatus
Publication Date: 2023.01.03 FUJITSU LTD
  • US11544660B2 patent drawing
  • US11544660B2 patent drawing
  • US11544660B2 patent drawing

AI summary

A method includes: for each of a delivery source and each of plural delivery destinations to which goods are delivered, receiving distance information indicating a distance between points, delivery amount information indicating a total delivery amount of the goods to each of the plural delivery destinations, and maximum delivery amount information indicating a maximum delivery amount per delivery; calculating a first cost to deliver the goods for the total delivery amount from the delivery source to each of the plural delivery destinations while setting the maximum delivery amount indicated by the maximum delivery amount information; calculating a second cost to deliver the goods for the total delivery amount from the delivery source to each of the delivery destinations; executing selection processing for selecting a delivery destination by using the first cost and the second cost; and creating a delivery plan by using a result of the selection processing.