Title:
METHOD FOR DETERMINING A PLAN FOR ARRANGING CONTENTS IN A CONTAINER
Document Type and Number:
WIPO Patent Application WO/2024/089265
Kind Code:
A1
Abstract:
The invention relates to a method (200; 300; 400; 500) for determining a plan for arranging a plurality of contents in a container, which is carried out by computer (10) and comprises the following steps: • prior to the virtual arrangement, determining the maximum dimensions of the container depending on the dimensions of the contents to be arranged; • among the contents to be arranged in the container, virtually arranging (203) first contents at a predetermined position of the container; • in order to virtually arrange one of the remaining contents in the container: • determining (204) dimensions and coordinates of a plurality of remaining empty spaces of the container, which are separate from one another and respectively shaped as rectangular cuboids; • determining possible positions of the remaining contents in each empty space; • determining (207) respective distances between a predetermined vertex of the container and respective vertices of the remaining contents in each possible position; • depending on the determined distances, selecting one of the possible positions as a virtual arrangement of the remaining contents in the container; • repeating (208, 209) the preceding arrangement steps successively for each of the other remaining contents to be arranged virtually in the container so as to determine a plan for arranging all the contents in the container.
Inventors:
CHARFI MANEL (FR)
FIETTE JULIEN (FR)
FRANCOIS YANNICK (FR)
FIETTE JULIEN (FR)
FRANCOIS YANNICK (FR)
Application Number:
PCT/EP2023/080119
Publication Date:
May 02, 2024
Filing Date:
October 27, 2023
Export Citation:
Assignee:
ITINSELL X (FR)
International Classes:
B65B5/10; B65B5/12; B65B57/00; G06F16/2457; G06Q10/04; G06Q10/083; G06Q10/087; B65G1/137
Foreign References:
| US20220122031A1 | 2022-04-21 | |||
| US20160176562A1 | 2016-06-23 | |||
| US20180127118A1 | 2018-05-10 | |||
| GB2524952A | 2015-10-14 |
Other References:
GONÇALVES JOSÉ FERNANDO ET AL: "A biased random key genetic algorithm for 2D and 3D bin packing problems", INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, vol. 145, no. 2, 18 April 2013 (2013-04-18), NL, pages 500 - 510, XP093069631, ISSN: 0925-5273, DOI: 10.1016/j.ijpe.2013.04.019
"GONÇALVES, José Fernando et RESENDE, Mauricio GC. A biased random key genetic algorithm for 2D and 3D bin packing problems.", INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, vol. 145, no. 2, 2013, pages 500 - 510
LAI, K. K.CHAN, JIMMY WM.: "Developing a simulated annealing algorithm for the cutting stock problem.", COMPUTERS & INDUSTRIAL ENGINEERING, vol. 32, no. 1, 1997, pages 115 - 127, XP002539335, DOI: 10.1016/S0360-8352(96)00205-7
"GONÇALVES, José Fernando et RESENDE, Mauricio GC. A biased random key genetic algorithm for 2D and 3D bin packing problems.", INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, vol. 145, no. 2, 2013, pages 500 - 510
LAI, K. K.CHAN, JIMMY WM.: "Developing a simulated annealing algorithm for the cutting stock problem.", COMPUTERS & INDUSTRIAL ENGINEERING, vol. 32, no. 1, 1997, pages 115 - 127, XP002539335, DOI: 10.1016/S0360-8352(96)00205-7
Attorney, Agent or Firm:
LLR (FR)
Download PDF:
Previous Patent: EXPANDED THERMOPLASTIC POLYURETHANE FOR SPECIAL MOLDING PROCESS
Next Patent: METHOD AND DEVICE FOR RECYCLING LITHIUM-ION BATTERIES
Next Patent: METHOD AND DEVICE FOR RECYCLING LITHIUM-ION BATTERIES