Automated Box Packing Algorithm for Volume Optimization

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing methods for optimizing the positioning of items in boxes fail to minimize unoccupied volume, ensure item stability, and reduce computation time, often requiring manual placement and not accounting for varying box sizes or item restrictions.

Innovation Solution

A method and system that use a computerized control unit with algorithms to select the optimal box size, determine the order and rotation of items, and calculate contact surface areas to minimize empty space, while allowing for flexible box selection and automated assembly and positioning, using geometric and dimensional data to ensure stable item placement.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Manufacturing precision

If exact computation methods are used to determine the best-fit order of items in boxes, then the optimization of box volume is improved, but the computational time and complexity increase significantly

Engineering Contradiction:

Improvebox volume optimizationVSAvoidcomputational time

Core Design Contradiction:

Manufacturing precisionVSLoss of time

Solution Approach 1:

The patent changes the approach from exact computation to heuristic algorithms that use simplified parameters and rules of thumb to achieve acceptable solutions in reasonable times. The system uses heuristics such as first-fit decreasing, best-fit decreasing, and simulated annealing to optimize box packing without requiring exhaustive computational search.

Inventive Principle:

Principle #35Parameter changes

Solution Approach 2:

The patent employs approximation algorithms that provide sufficiently good solutions quickly rather than seeking perfect solutions. These heuristic methods use simple computational rules that can be executed rapidly, sacrificing some optimization precision for significant time savings.

Inventive Principle:

Principle #27Cheap short-living objects (Disposable)

2Loss of time

If heuristic algorithms are used to reduce computational time, then the computation time is reduced, but the solution optimality deteriorates

Engineering Contradiction:

Improvecomputational timeVSAvoidsolution optimality

Core Design Contradiction:

Loss of timeVSManufacturing precision

Solution Approach 1:

The patent implements feedback mechanisms where the system evaluates the quality of packing solutions and adjusts the heuristic parameters accordingly. The algorithm continuously monitors the packing density and computational cost, modifying its search strategy to find better solutions within time constraints.

Inventive Principle:

Principle #23Feedback

Solution Approach 2:

The patent uses dynamic heuristic algorithms that adapt their behavior during execution. The search strategy changes based on the current state of the packing problem, switching between different heuristic rules and adjustment mechanisms to balance solution quality with computational time requirements.

Inventive Principle:

Principle #15Dynamics

3Ease of manufacture

If boxes of the same size are used in the packing solution, then the simplicity of the packing process is improved, but the ability to minimize unoccupied volume deteriorates

Engineering Contradiction:

Improvepacking process simplicityVSAvoidunoccupied volume

Core Design Contradiction:

Ease of manufactureVSVolume of stationary object

Solution Approach 1:

The patent allows box sizes to be dynamic and adaptive rather than fixed. The system determines optimal box sizes based on the specific packing problem, using algorithms that adjust box dimensions to minimize wasted space while maintaining practical manufacturing considerations.

Inventive Principle:

Principle #15Dynamics

4Adaptability or versatility

If manual placement of items in boxes is required, then the flexibility in item arrangement is improved, but the productivity and automation level deteriorate

Engineering Contradiction:

Improveitem arrangement flexibilityVSAvoidautomation level

Core Design Contradiction:

Adaptability or versatilityVSProductivity

Solution Approach 1:

The patent implements automated packing systems that self-organize the placement of items in boxes. The computer-controlled systems automatically determine optimal positions for items based on the packing algorithm, eliminating the need for manual intervention while maintaining high flexibility in arrangement.

Inventive Principle:

Principle #25Self-service

Solution Approach 2:

The patent replaces manual mechanical placement operations with automated computer-controlled systems. The algorithmic approach substitutes human decision-making with computational processes that automatically calculate and execute optimal packing arrangements.

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

Data Source

PatentUS11620591B2Method and system for optimized positioning of items in at least one box

Publication Date: 2023.04.04 PANOTEC SRL

AI summary

A method for positioning items in a box includes providing a list of items, a list of boxes, dimensional data for each item, position-restricting data for each item, a system for assembling the boxes, a system for placing each item into a main box, a control unit connected having an algorithm for selecting the box and how the items are introduced into the box; and applying the algorithm to select a main box having a minimum size sufficient to contain the items and minimize empty space, and to determine order of introduction, position and rotation of the items; and applying the algorithm to the placing system. Applying the algorithm includes calculating the contact surface areas of each item to maintain the contact surface area above a minimum threshold, thereby ensuring stable positioning and reducing the volume of the filler. A system for positioning items in a box.