Method, system and device for optimizing arrangement of cigarette cartons and computer storage medium
By optimizing the layout of cigarette cartons through preset arrangement rules and variation evaluation parameters, the problems of unreasonable and unstable cigarette carton stacking were solved, a scientific cigarette carton placement scheme was achieved, and the rationality and stability of stacking were improved.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- SHANGHAI TOBACCO GROUP CO LTD
- Filing Date
- 2021-11-29
- Publication Date
- 2026-07-31
AI Technical Summary
The lack of scientific support and standardized regulations in existing technologies has led to inconsistent cigarette carton stacking methods, unreasonable stacking techniques, and low stacking stability.
The cigarette boxes are initially simulated and arranged using preset layout rules. The layout is then optimized by evaluating variation parameters to avoid repeated instances where the occupancy rate of the scraped plates remains unchanged, thus ensuring the rationality and stability of the cigarette box placement.
The scientifically based cigarette box stacking scheme with the highest area occupancy was calculated, improving the rationality and stability of cigarette box stacking.
Smart Images
Figure CN116227640B_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the technical field of cigarette case software processing, and relates to an optimization method and system, in particular to an optimization method, system, device and computer storage medium for arranging cigarette cases. Background Art
[0002] With the continuous expansion of the product line of tobacco groups, the external dimensions of cigarette cases are increasing day by day. When stacking, they are often placed based on experience, resulting in inconsistent stacking methods, unreasonable stacking methods, and low stacking stability, lacking scientific support and standardized regulations.
[0003] Therefore, how to provide an optimization method, system, device and computer storage medium for arranging cigarette cases to solve the defects of the prior art such as lack of scientific support and standardized regulations, resulting in inconsistent cigarette case stacking methods, unreasonable stacking methods, and low stacking stability has actually become a technical problem that needs to be solved urgently by those skilled in the art. Summary of the Invention
[0004] In view of the above-mentioned disadvantages of the prior art, the purpose of the present invention is to provide an optimization method, system, device and computer storage medium for arranging cigarette cases, which are used to solve the problems of the prior art such as lack of scientific support and standardized regulations, resulting in inconsistent cigarette case stacking methods, unreasonable stacking methods, and low stacking stability.
[0005] To achieve the above object and other related objects, on the one hand, the present invention provides an optimization method for arranging cigarette cases, including: receiving the size of a cigarette case and the size of a pallet; performing an initial simulation arrangement of such cigarette cases on the pallet using a preset arrangement rule, and defining the initial simulation arrangement of the cigarette cases as the parental arrangement and calculating the evaluation parameter of whether the initial simulation arrangement can mutate; where N cigarette cases are arranged on the pallet after the initial simulation arrangement; N is less than or equal to the maximum number of cigarette cases under this preset arrangement rule; selecting the i-th cigarette case from the initial simulation arrangement, and performing arrangement mutation from the i-th cigarette case to the j-th cigarette case; where 1 ≤ i < j, and j is less than N; calculating the evaluation parameter of whether the arrangement can mutate corresponding to the arrangement after mutating one cigarette case; where each arrangement mutation of the cigarette case is defined as the filial arrangement; checking whether there are consecutive events of no improvement in the pallet occupancy rate during the arrangement mutation process; if so, outputting the cigarette case arrangement corresponding to the non-improved pallet occupancy rate, and taking the output result as the optimization result of the cigarette case arrangement; if not, starting from the (j + 1)-th cigarette case, and transferring to the calculation step of the evaluation parameter of whether the arrangement can mutate corresponding to the arrangement after mutating one cigarette case.
[0006] In an embodiment of the present invention, the evaluation parameter of whether the arrangement can mutate corresponding to the arrangement after mutating one cigarette case adopts the pallet occupancy rate corresponding to the arrangement after mutating one cigarette case.
[0007] In one embodiment of the present invention, before the step of finding whether there are consecutive events of no improvement in the pallet occupancy rate during the layout variation process, the optimization method for the layout of cigarette cartons further includes: finding whether there is a parent layout change event during the layout variation process; if so, then turning to the step of finding whether there are consecutive events of no improvement in the pallet occupancy rate during the layout variation process; if not, then continuing the layout variation.
[0008] In one embodiment of the present invention, the step of finding whether there is a parent layout change event during the layout variation process includes: during the layout variation process from the i-th cigarette carton to the i1-th cigarette carton, comparing one by one the pallet occupancy rate generated after variation from the i-th cigarette carton to the i1-th cigarette carton with the pallet occupancy rate of the initial simulated layout; i1 < j; if the pallet occupancy rate after varying the i1-th cigarette carton is greater than the pallet occupancy rate of the initial simulated layout, it means that a parent layout change event occurs.
[0009] In one embodiment of the present invention, when a parent layout change event occurs, the optimization method for the layout of cigarette cartons further includes positioning the layout of the i1-th cigarette carton after variation as the new parent layout and abandoning the initial simulated layout.
[0010] In one embodiment of the present invention, the step of finding whether there are consecutive events of no improvement in the pallet occupancy rate during the layout variation process includes: when the pallet occupancy rate after varying the i1-th cigarette carton is greater than the pallet occupancy rate of the initial simulated layout, judging whether the pallet occupancy rate generated after variation from the i1-th cigarette carton to the j-th cigarette carton consecutively appears greater than the pallet occupancy rate of the initial simulated layout, and the consecutive appearances of being greater than the pallet occupancy rate of the initial simulated layout are the same; if so, it means that a no improvement event occurs; if not, then continuing the layout variation with the layout of the i1-th cigarette carton as the new parent layout.
[0011] In one embodiment of the present invention, the preset layout rules need to meet the preset conditions: any cigarette carton cannot exceed the boundary of the pallet; there should be no overlap between cigarette cartons; when a cigarette carton varies, the boundary of the cigarette carton needs to be parallel to the boundary of the pallet.
[0012] On the other hand, the present invention provides an optimization system for arranging cigarette cartons, including: a data receiving module for receiving the size of a cigarette carton and the size of a pallet; a simulation arrangement module for initially simulating the arrangement of such cigarette cartons on the pallet by using a preset arrangement rule, and defining the initial simulated arrangement of the cigarette cartons as the parental arrangement and calculating the evaluation parameter of whether the initial simulated arrangement can be mutated; wherein, after the initial simulated arrangement, N cigarette cartons are arranged on the pallet; N is less than or equal to the maximum number of cigarette cartons under this preset arrangement rule; a simulation mutation module for selecting the i-th cigarette carton from the initial simulated arrangement and performing arrangement mutation from the i-th cigarette carton to the j-th cigarette carton; wherein, 1 ≤ i < j, and j is less than N; a calculation module for calculating the evaluation parameter of whether the mutation of a cigarette carton can be mutated corresponding thereto; wherein, each arrangement mutation of the cigarette cartons is defined as the filial arrangement; a processing module for checking whether there are consecutive non-improved events of the pallet occupancy rate during the arrangement mutation process; if so, outputting the carton arrangement corresponding to the non-improved pallet occupancy rate, and taking the output result as the optimization result of the cigarette carton arrangement; if not, starting from the (j + 1)-th cigarette carton and calling the calculation module.
[0013] On another aspect, the present invention provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the optimization method for arranging cigarette cartons is implemented.
[0014] On the last aspect, the present invention provides an optimization device for arranging cigarette cartons, which is characterized by including: a processor and a memory; the memory is used for storing a computer program, and the processor is used for executing the computer program stored in the memory, so that the optimization device for arranging cigarette cartons executes the optimization method for arranging cigarette cartons.
[0015] As described above, the optimization method, system, device and computer storage medium for arranging cigarette cartons according to the present invention have the following beneficial effects:
[0016] The optimization method, system, device and computer storage medium for arranging cigarette cartons according to the present invention design a cigarette stacking arrangement scheme that can calculate the highest area occupancy rate with scientific basis and the most reasonable placement, making the carton stacking method more reasonable and the stacking stability higher. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] Figure 1 It shows a flow schematic diagram of the optimization method for arranging cigarette cartons according to the present invention in an embodiment.
[0018] Figure 2 It shows an example diagram of the initial simulated arrangement of cigarette cartons.
[0019] Figure 3The diagram shown is a schematic representation of the principle structure of the optimized cigarette box layout system of the present invention in one embodiment.
[0020] Component designation explanation
[0021] 1. Optimization system for cigarette box layout
[0022] 31 Data Receiving Module
[0023] 32 Simulation Layout Module
[0024] 33 Simulation Mutation Module
[0025] 34 Calculation Module
[0026] 35 Processing Modules
[0027] Steps S11 to S16 Detailed Implementation
[0028] The following specific examples illustrate the implementation of the present invention. Those skilled in the art can easily understand other advantages and effects of the present invention from the content disclosed in this specification. The present invention can also be implemented or applied through other different specific embodiments, and various details in this specification can also be modified or changed based on different viewpoints and applications without departing from the spirit of the present invention. It should be noted that, unless otherwise specified, the following embodiments and features described therein can be combined with each other.
[0029] It should be noted that the illustrations provided in the following embodiments are only schematic representations of the basic concept of the present invention. Therefore, the drawings only show the components related to the present invention and are not drawn according to the actual number, shape and size of the components in the actual implementation. In the actual implementation, the form, quantity and proportion of each component can be arbitrarily changed, and the layout of the components may also be more complex.
[0030] Example 1
[0031] This embodiment provides a method for optimizing the arrangement of cigarette boxes, including:
[0032] Receive the dimensions of a cigarette box and the dimensions of a shovel plate;
[0033] Using a preset layout rule, the cigarette boxes of this type are initially simulated and arranged on the shovel plate. The initial simulated layout of the cigarette boxes is defined as the parent layout and the parameters for evaluating the variability of the initial simulated layout are calculated. After the initial simulated layout, the shovel plate has N cigarette boxes arranged. N is less than or equal to the maximum number of cigarette boxes under this preset layout rule.
[0034] Select the i-th cigarette carton from the initial simulated layout, and perform layout mutation starting from the i-th cigarette carton to the j-th cigarette carton; where 1 ≤ i < j, and j is less than N;
[0035] Calculate the mutation evaluation parameter corresponding to the first mutated cigarette carton; where each layout mutation of the cigarette carton is defined as the offspring layout;
[0036] Check whether there are consecutive events of no improvement in the pallet occupancy rate during the layout mutation process; if so, output the carton layout corresponding to the non-improved pallet occupancy rate, and use this output result as the optimization result of the cigarette carton layout; if not, start from the (j + 1)-th cigarette carton and transfer to the calculation step of the mutation evaluation parameter corresponding to the first mutated cigarette carton.
[0037] The following will describe in detail the optimization method for the cigarette carton layout provided in this embodiment with reference to the drawings. Please refer to Figure 1 , which shows the flowchart of the optimization method for the cigarette carton layout in an embodiment. As Figure 1 shown, the optimization method for the cigarette carton layout specifically includes the following steps:
[0038] S11, Receive the size of a cigarette carton and the size of the pallet. The size of the cigarette carton includes the width and height of the carton. The size of the pallet includes the width and height of the pallet.
[0039] S12, Using a preset layout rule, perform an initial simulated layout of this type of cigarette carton on the pallet, and define the initial simulated layout of the cigarette carton as the parent layout and calculate the mutation evaluation parameter of the initial simulated layout; where N cigarette cartons are arranged on the pallet after the initial simulated layout; N is less than or equal to the maximum number of cigarette cartons under this preset layout rule. Please refer to Figure 2 , which shows an example diagram of the initial simulated layout of the cigarette carton.
[0040] In this embodiment, if it is assumed that the width of the pallet is W and n cartons {p1, p2,... p n} need to be placed, x i and y i are respectively the abscissa and ordinate of the lower left corner after the i-th carton p i (1 ≤ i ≤ n) is placed on the cigarette carton pallet, w i and h i are respectively the width and height of the carton when it is placed, and H used is the height of the highest horizontal line in the outer contour formed by the carton placement result. If the area utilization rate U of the carton placement is defined as the ratio of the sum of the areas of all cartons to the area of the pallet used, the carton placement problem can be described as: calculating the optimal placement plan of the cartons to maximize the pallet utilization rate, that is: Furthermore, the preset layout rules must meet preset conditions:
[0041] That is, no tobacco box can exceed the boundary of the shovel plate;
[0042] With y i <y j <y i +h i They cannot be established simultaneously, meaning that the cigarette boxes cannot overlap;
[0043] When the smoke box is modified, the boundary of the smoke box must be parallel to the boundary of the shovel plate.
[0044] The preset layout rules include a placement strategy based on the lowest horizontal line rule. The placement strategy based on the lowest horizontal line rule includes:
[0045] Step 1: Initialize the set of horizontal contour lines of the shovel plate, which contains only one horizontal contour line, namely the bottom boundary of the shovel plate, and is the lowest horizontal line in the set.
[0046] Step 2: In the given sequence of cigarette boxes, for the i-th cigarette box P to be placed... i Find the horizontal line with the lowest current height in the current set of horizontal outlines, and determine whether the width of the horizontal line is sufficient to fit the cigarette box P. i If it can be placed, position the cigarette box on the left side of the horizontal line and proceed to step 4; otherwise, skip to the next step.
[0047] Step 3, for P in the smoke box sequence i For all unplaced tobacco boxes, determine if their width is within the current lowest horizontal line. For tobacco boxes that can fit, prioritize placing those with a width matching the lowest horizontal line (if multiple boxes meet this condition, select the tallest). Then swap this tobacco box with tobacco box P. i The position of the tobacco box in the sequence is determined (i.e., the order of their placement is swapped), and the process proceeds to the next step. If no suitable tobacco box can be found on the current lowest horizontal line, the height of the current lowest horizontal line is raised to the adjacent horizontal outline line with the closest height, merging the two horizontal lines. The set of horizontal outline lines for the shovel plate is updated, and then the process jumps to step 2 to continue.
[0048] Step 4: Update the horizontal outline set of the shovel plate according to the position and size of the newly placed cigarette box.
[0049] Step 5: If there are still cigarette boxes in the sequence that have not been placed, proceed to step 2 to continue processing; if all cigarette boxes have been placed, end the algorithm. At this time, the amount of shovel used is determined by the horizontal line with the largest height in the set of horizontal contour lines.
[0050] In this embodiment, the parameter for evaluating the variability of the initial simulated layout uses the pallet board occupancy rate f(S1) = A of the initial simulated layout T / (W·H used (S1)), where S1 is the initial simulated layout, A T is the sum of the areas of all cigarette boxes in the initial simulated layout, W is the width of the pallet board, and H used (S1) is the height of the highest horizontal line in the initial simulated layout.
[0051] S13. Select the i-th cigarette box from the initial simulated layout, and perform layout variation starting from the i-th cigarette box to the j-th cigarette box. Among them, 1 ≤ i < j, and j is less than N. In practical applications, two variation operations are used for layout variation: exchange variation and rotation variation. The exchange variation exchanges the positions of the genes at two random positions in a randomly selected parent solution, thereby obtaining a new layout order. The rotation variation is used to adjust the placement angle when placing the cigarette boxes to obtain a new solution.
[0052] S14. Calculate the parameter for evaluating the variability corresponding to after varying one cigarette box; among them, each layout variation of the cigarette box is defined as the offspring layout.
[0053] In this embodiment, the parameter for evaluating the variability corresponding to after varying one cigarette box uses the pallet board occupancy rate corresponding to after varying one cigarette box.
[0054] S15. Check whether a parent layout change event occurs during the layout variation process; if so, go to S16; if not, go to S13 to continue the layout variation.
[0055] The specific steps of S15 are as follows:
[0056] During the layout variation process from the i-th cigarette box to the i1-th cigarette box, compare the pallet board occupancy rate generated after variation from the i-th cigarette box to the i1-th cigarette box with the pallet board occupancy rate of the initial simulated layout one by one; i1 < j;
[0057] If the pallet board occupancy rate after varying the i1-th cigarette box is greater than the pallet board occupancy rate of the initial simulated layout, it indicates that a parent layout change event has occurred.
[0058] S16: When a parent layout change event occurs, the layout of the mutated i1th cigarette box is positioned as the new parent layout, the initial simulated layout is abandoned, and during the mutation process from the i1th to the jth cigarette box, it is checked whether there are multiple consecutive events where the scraper occupancy rate does not improve. If so, S17 is executed, that is, the cigarette box layout corresponding to the unimproved scraper occupancy rate is output, and this output result is used as the optimization result of the cigarette box layout. If not, starting from the (j+1)th cigarette box, the process returns to S14, and the calculation steps of the mutation evaluation parameters corresponding to the mutation of one cigarette box are continued. In this embodiment, the optimization result of the cigarette box layout is to maximize the scraper area utilization rate.
[0059] In this embodiment, the step of checking whether there are multiple consecutive events where the occupancy rate of the scraper does not improve during the variation process from the i1th cigarette box to the jth cigarette box includes:
[0060] If the shovel occupancy rate after the mutation of the i1th cigarette box is greater than the shovel occupancy rate of the initial simulated layout, determine whether the shovel occupancy rate generated after the mutation from the i1th cigarette box to the jth cigarette box has been greater than the shovel occupancy rate of the initial simulated layout multiple times consecutively, and whether the shovel occupancy rate greater than the shovel occupancy rate of the initial simulated layout is the same for multiple consecutive times; if yes, it means that no improvement event has occurred; if no, then take the cigarette box layout of the i1th cigarette box as the new parent layout, go to S13, and continue to perform layout mutation.
[0061] For example, multiple consecutive times is three consecutive times, f(S) j+2 )=f(S j+3 )=f(S j+4 When ), it indicates that no improvement event has occurred.
[0062] The cigarette box layout optimization method described in this embodiment designs a cigarette stacking scheme that can calculate the highest area occupancy and the most reasonable placement based on scientific evidence, making the cigarette box stacking method more reasonable and the stacking stability higher.
[0063] This embodiment also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the following... Figure 1 The method for optimizing the layout of cigarette boxes.
[0064] At any possible level of technical detail, this application can be a system, method, and / or computer program product. A computer program product may include a computer-readable storage medium having computer-readable program instructions loaded thereon for causing a processor to implement various aspects of this application.
[0065] Computer-readable storage media can be tangible devices capable of holding and storing instructions for use by an instruction execution device. Computer-readable storage media can be, for example, (but not limited to) electrical storage devices, magnetic storage devices, optical storage devices, electromagnetic storage devices, semiconductor storage devices, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of computer-readable storage media include: portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), static random access memory (SRAM), portable compact disc read-only memory (CD-ROM), digital multifunction disc (DVD), memory sticks, floppy disks, mechanical encoding devices, such as punch cards or recessed protrusions storing instructions thereon, and any suitable combination of the foregoing. The computer-readable storage media used herein are not to be construed as transient signals themselves, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through waveguides or other transmission media (e.g., light pulses through fiber optic cables), or electrical signals transmitted through wires.
[0066] The computer-readable program described herein can be downloaded from a computer-readable storage medium to various computing / processing devices, or downloaded via a network, such as the Internet, local area network, wide area network, and / or wireless network, to an external computer or external storage device. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers, and / or edge servers. A network adapter card or network interface in each computing / processing device receives computer-readable program instructions from the network and forwards these instructions to a computer-readable storage medium in the respective computing / processing device. The computer program instructions used to perform the operations of this application may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, status setting data, integrated circuit configuration data, or source code or object code written in any combination of one or more programming languages, including object-oriented programming languages such as Smalltalk, C++, etc., and procedural programming languages such as "C" or similar programming languages. Computer-readable program instructions may execute entirely on a user's computer, partially on a user's computer, as a standalone software package, partially on a user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer via any type of network—including a local area network (LAN) or a wide area network (WAN)—or may be connected to an external computer (e.g., via the Internet using an Internet service provider). In some embodiments, electronic circuitry, such as programmable logic circuitry, field-programmable gate arrays (FPGAs), or programmable logic arrays (PLAs), is personalized by utilizing state information from the computer-readable program instructions. This electronic circuitry can execute the computer-readable program instructions to implement various aspects of this application.
[0067] Example 2
[0068] This embodiment provides an optimization system for cigarette box layout, including:
[0069] The data receiving module is used to receive the dimensions of a cigarette box and the dimensions of the shovel plate.
[0070] The simulation layout module is used to perform an initial simulated layout of the cigarette boxes on the shovel plate using a preset layout rule, and to define the initial simulated layout of the cigarette boxes as the parent layout and to calculate the variability evaluation parameters of the initial simulated layout; wherein, after the initial simulated layout, the shovel plate has N cigarette boxes arranged; N is less than or equal to the maximum number of cigarette boxes under this preset layout rule;
[0071] A simulation mutation module, configured to select the i-th cigarette carton from the initial simulation arrangement, and perform arrangement mutation starting from the i-th cigarette carton to the j-th cigarette carton; wherein, 1 ≤ i < j, and j is less than N;
[0072] A calculation module, configured to calculate the mutation evaluation parameter corresponding to a cigarette carton after mutation; wherein, each arrangement mutation of the cigarette cartons is defined as an offspring arrangement;
[0073] A processing module, configured to check whether there are consecutive non-improved events of the pallet occupancy rate during the arrangement mutation process; if so, output the cigarette carton arrangement corresponding to the non-improved pallet occupancy rate, and use the output result as the optimization result of the cigarette carton arrangement; if not, start from the (j + 1)-th cigarette carton and call the calculation module.
[0074] The following will describe in detail the optimization system for cigarette carton arrangement provided in this embodiment with reference to the drawings. Please refer to Figure 3 , which shows the schematic principle structure of the optimization system for cigarette carton arrangement in an embodiment. As Figure 3 shown, the optimization system 3 for cigarette carton arrangement includes: a data receiving module 31, a simulation arrangement module 32, a simulation mutation module 33, a calculation module 34, and a processing module 35.
[0075] The data receiving module 31 is configured to receive the size of a cigarette carton and the size of a pallet. The size of the cigarette carton includes the width and height of the carton. The size of the pallet includes the width and height of the pallet.
[0076] The simulation arrangement module 32 is configured to perform an initial simulation arrangement of such cigarette cartons on the pallet using a preset arrangement rule, and define the initial simulation arrangement of the cigarette cartons as a parent arrangement and calculate the mutation evaluation parameter of the initial simulation arrangement; wherein, N cigarette cartons are arranged on the pallet after the initial simulation arrangement; N is less than or equal to the maximum number of cigarette cartons under this preset arrangement rule.
[0077] The simulation mutation module 33 is configured to select the i-th cigarette carton from the initial simulation arrangement, and perform arrangement mutation starting from the i-th cigarette carton to the j-th cigarette carton. Among them, 1 ≤ i < j, and j is less than N. In practical applications, two mutation operations are used for arrangement mutation: exchange mutation and rotation mutation. Exchange mutation exchanges the positions of genes at two random positions in a randomly selected parent solution, thereby obtaining a new arrangement order. Rotation mutation is used to adjust the placement angle when placing the cartons to obtain a new solution.
[0078] The calculation module 34 is configured to calculate the mutation evaluation parameter corresponding to a cigarette carton after mutation; wherein, each arrangement mutation of the cigarette cartons is defined as an offspring arrangement.
[0079] In this embodiment, the can-variation evaluation parameter corresponding to the variation of a cigarette carton uses the pallet occupancy rate corresponding to the variation of a cigarette carton.
[0080] The processing module 35 is used to find out whether a parent layout change event occurs during the layout variation process; if so, when the parent layout change event occurs, the optimization method for the layout of cigarette cartons further includes positioning the layout of the i1-th cigarette carton after variation as the new parent layout, abandoning the initial simulated layout, and during the variation process from the i1-th cigarette carton to the j-th cigarette carton, finding out whether there are consecutive non-improved events of the pallet occupancy rate during the layout variation process; if so, outputting the child layout corresponding to the non-improved pallet occupancy rate and using the output result as the optimization result of the layout of cigarette cartons; if not, starting from the (j + 1)-th cigarette carton and calling the calculation module 34 to continue to vary the can-variation evaluation parameter corresponding to a cigarette carton after variation; if not, continue to call the simulation variation module 33 for layout variation.
[0081] The process by which the processing module 35 finds out whether a parent layout change event occurs during the layout variation process includes:
[0082] During the layout variation process from the i-th cigarette carton to the i1-th cigarette carton, the processing module 35 compares the pallet occupancy rate generated after variation from the i-th cigarette carton to the i1-th cigarette carton with the pallet occupancy rate of the initial simulated layout one by one; i1 < j; if the pallet occupancy rate after varying the i1-th cigarette carton is greater than the pallet occupancy rate of the initial simulated layout, it indicates that a parent layout change event has occurred.
[0083] It should be noted that the division of the various modules in the above system is merely a logical functional division. In actual implementation, they can be fully or partially integrated into a single physical entity, or they can be physically separated. Furthermore, these modules can be implemented entirely in software via processing element calls, entirely in hardware, or partially in software calls via processing element calls, with some modules implemented in hardware. For example, module x can be a separate processing element or integrated into a chip within the system. Additionally, module x can be stored as program code in the system's memory, invoked and executed by a processing element. The implementation of other modules is similar. These modules can be fully or partially integrated together or implemented independently. The processing element mentioned here can be an integrated circuit with signal processing capabilities. During implementation, each step of the above method or each of the above modules can be completed through integrated logic circuits in the processor element or through software instructions. These modules can be one or more integrated circuits configured to implement the above methods, such as one or more Application Specific Integrated Circuits (ASICs), one or more Digital Signal Processors (DSPs), one or more Field Programmable Gate Arrays (FPGAs), etc. When a module is implemented through processing element scheduler code, the processing element can be a general-purpose processor, such as a Central Processing Unit (CPU) or other processor capable of calling program code. These modules can be integrated together to form a System-on-a-Chip (SOC).
[0084] Example 3
[0085] This embodiment provides a device for optimizing the layout of cigarette cartons. The device includes a processor, a memory, a transceiver, a communication interface, and / or a system bus. The memory and the communication interface are connected to the processor and the transceiver via the system bus and communicate with each other. The memory stores computer programs, the communication interface communicates with other devices, and the processor and the transceiver run the computer programs to enable the device to execute the steps of the optimization method for cigarette carton layout as described in Embodiment 1.
[0086] The system bus mentioned above can be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. This system bus can be divided into address bus, data bus, control bus, etc. For ease of representation, only one thick line is used in the diagram, but this does not indicate that there is only one bus or one type of bus. The communication interface is used to enable communication between the database access device and other devices (such as clients, read-write libraries, and read-only libraries). Memory may include Random Access Memory (RAM) and may also include non-volatile memory, such as at least one disk drive.
[0087] The processors mentioned above can be general-purpose processors, including central processing units (CPUs), network processors (NPs), etc.; they can also be digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.
[0088] The scope of protection of the optimized cigarette box arrangement method described in this invention is not limited to the execution order of the steps listed in this embodiment. Any solution achieved by adding, subtracting, or replacing steps in the prior art based on the principles of this invention is included within the scope of protection of this invention.
[0089] The present invention also provides an optimization system for cigarette box layout. The optimization system can implement the optimization method for cigarette box layout described in the present invention. However, the implementation device of the optimization method for cigarette box layout described in the present invention includes, but is not limited to, the structure of the optimization system for cigarette box layout listed in this embodiment. All structural modifications and substitutions of the prior art made according to the principle of the present invention are included within the protection scope of the present invention.
[0090] In summary, the method, system, equipment, and computer storage medium for optimizing cigarette box layout described in this invention design a scientifically sound cigarette stacking scheme that maximizes area occupancy and achieves the most reasonable placement, resulting in a more rational and stable cigarette box stacking method. Therefore, this invention effectively overcomes the various shortcomings of existing technologies and possesses high industrial applicability.
[0091] The above embodiments are merely illustrative of the principles and effects of the present invention and are not intended to limit the invention. Any person skilled in the art can modify or alter the above embodiments without departing from the spirit and scope of the present invention. Therefore, all equivalent modifications or alterations made by those skilled in the art without departing from the spirit and technical concept disclosed in the present invention should still be covered by the claims of the present invention.
Claims
1. A method for optimizing the arrangement of cigarette cartons, characterized in that, Comprising: Receiving the size of a cigarette carton and the size of a pallet; Adopting a preset layout rule to conduct an initial simulation layout of this type of cigarette carton on the pallet, and defining the initial simulation layout of the cigarette carton as the parental layout and calculating the mutation evaluation parameter of whether the initial simulation layout can mutate; wherein, after the initial simulation layout, N cigarette cartons are arranged on the pallet; N is less than or equal to the maximum number of cigarette cartons under this preset layout rule; the preset layout rule adopts a placement strategy based on the lowest horizontal line rule; the placement strategy based on the lowest horizontal line rule includes: initializing the set of horizontal contour lines of the pallet; in the given cigarette carton sequence, for the currently to-be-placed cigarette carton, finding the horizontal line with the lowest current height in the current set of horizontal contour lines, and judging whether the width of this horizontal line is sufficient to place this cigarette carton; if it can be placed, placing this cigarette carton靠左 on this horizontal line and updating the set of horizontal contour lines; if it cannot be placed, searching for the cigarette cartons that can be placed on the current lowest horizontal line among the subsequent unplaced cigarette cartons, preferentially selecting the cigarette cartons with the same width as the lowest horizontal line for placement and exchanging their positions with the current cigarette carton in the sequence, and if no placeable cigarette cartons are found, raising the height of the current lowest horizontal line and updating the set of horizontal contour lines; selecting the i-th cigarette carton from the initial simulation layout, and conducting layout mutation from the i-th cigarette carton to the j-th cigarette carton; wherein, 1≤i<j, and j is less than N; the layout mutation includes exchange mutation and rotation mutation, the exchange mutation is to exchange the positions of the cigarette cartons at two random positions in the parental layout, and the rotation mutation is to adjust the placement angle when placing the cigarette cartons; Calculating the mutation evaluation parameter corresponding to a mutated cigarette carton; wherein, each layout mutation of the cigarette carton is defined as the filial layout; the mutation evaluation parameter corresponding to a mutated cigarette carton adopts the pallet occupancy rate corresponding to the mutated cigarette carton; Searching whether there are consecutive multiple events of no improvement in the pallet occupancy rate during the layout mutation process; if so, outputting the cigarette carton layout corresponding to the non-improved pallet occupancy rate and taking this output result as the optimized result of the cigarette carton layout; if not, starting from the (j + 1)-th cigarette carton and transferring to the calculation step of the mutation evaluation parameter corresponding to a mutated cigarette carton; To check if a parent layout change event occurs during the layout mutation process: Starting from the i-th cigarette box to the i1-th cigarette box, the shovel occupancy rate generated after each mutation is compared with the shovel occupancy rate of the current parent layout, where i1 < j. If the shovel occupancy rate after mutating the i1-th cigarette box is greater than the shovel occupancy rate of the current parent layout, it indicates that a parent layout change event has occurred. When a parent layout change event occurs, the cigarette box layout of the mutated i1-th cigarette box is positioned as the new parent layout, and the initial simulated layout is abandoned. Furthermore, during the layout mutation process from the i1-th to the j-th cigarette box, it is checked whether there are multiple consecutive events where the shovel occupancy rate does not improve. Multiple consecutive events where the shovel occupancy rate does not improve refer to multiple consecutive mutations resulting in the same shovel occupancy rate that does not exceed the shovel occupancy rate of the current parent layout.
2. The method of claim 1, wherein, Before the step of checking whether there are multiple consecutive events where the occupancy rate of the scraper does not improve during the layout variation process, the optimization method for the cigarette box layout also includes: Check if any parent layout change events occur during the layout mutation process; if so, proceed to the step of checking if multiple consecutive events of no improvement in plate occupancy occur during the layout mutation process; if not, continue with the layout mutation.
3. The method of claim 1, wherein, The steps for determining whether there are multiple consecutive events where the shovel occupancy rate does not improve during the layout mutation process include: if the shovel occupancy rate after the mutation of the i1th cigarette box is greater than the shovel occupancy rate of the initial simulated layout, determine whether the shovel occupancy rate generated after the mutation of the i1th cigarette box to the jth cigarette box is greater than the shovel occupancy rate of the initial simulated layout multiple times consecutively, and whether the shovel occupancy rate greater than the shovel occupancy rate of the initial simulated layout is the same for multiple consecutive times; if so, it indicates that no improvement event has occurred; if not, the layout of the i1th cigarette box is used as the new parent layout to continue the layout mutation.
4. The method of claim 1, wherein, The preset layout rules must meet the following preset conditions: no tobacco box can exceed the boundary of the shovel plate; tobacco boxes cannot overlap; when tobacco boxes are modified, the boundary of the tobacco box must be parallel to the boundary of the shovel plate.
5. An optimization system for cigarette box layout, characterized in that, include: The data receiving module is used to receive the dimensions of a cigarette box and the dimensions of the shovel plate. The simulation layout module is used to perform an initial simulation layout of this type of cigarette carton on the shovel plate according to a preset layout rule, and define the initial simulation layout of the cigarette carton as the parental layout and calculate the mutation evaluation parameter of the initial simulation layout; wherein, after the initial simulation layout, N cigarette cartons are arranged on the shovel plate; N is less than or equal to the maximum number of cigarette cartons under this preset layout rule; the preset layout rule adopts a placement strategy based on the lowest horizontal line rule; the placement strategy based on the lowest horizontal line rule includes: initializing the set of horizontal contour lines of the shovel plate; in a given cigarette carton sequence, for the currently to-be-placed cigarette carton, find the horizontal line with the lowest height in the current set of horizontal contour lines, and judge whether the width of this horizontal line is sufficient to place this cigarette carton; if it can be placed, place this cigarette carton on the left side of this horizontal line and update the set of horizontal contour lines; if it cannot be placed, search for a cigarette carton that can be placed on the current lowest horizontal line among the subsequent unplaced cigarette cartons, preferentially select a cigarette carton with the same width as the lowest horizontal line for placement and exchange its position with the current cigarette carton in the sequence, if no placeable cigarette carton is found, then increase the height of the current lowest horizontal line and update the set of horizontal contour lines; The simulation mutation module is used to select the i-th cigarette carton from the initial simulation layout and perform layout mutation from the i-th cigarette carton to the j-th cigarette carton; wherein, 1≤i<j, and j is less than N; the layout mutation includes exchange mutation and rotation mutation, the exchange mutation is to exchange the positions of the cigarette cartons at two random positions in the parental layout, and the rotation mutation is to adjust the placement angle when placing the cigarette carton; The calculation module is used to calculate the mutation evaluation parameter corresponding to a cigarette carton after mutation; wherein, each layout mutation of the cigarette carton is defined as the filial layout; the mutation evaluation parameter corresponding to a cigarette carton after mutation adopts the shovel plate occupancy rate corresponding to a cigarette carton after mutation; The processing module is used to check whether there are consecutive events of no improvement in the shovel plate occupancy rate during the layout mutation process; if so, output the cigarette carton layout corresponding to the unimproved shovel plate occupancy rate, and use this output result as the optimization result of the cigarette carton layout; if not, start from the (j + 1)-th cigarette carton and call the calculation module; To check if a parent layout change event occurs during the layout mutation process: Starting from the i-th cigarette box to the i1-th cigarette box, the shovel occupancy rate generated after each mutation is compared with the shovel occupancy rate of the current parent layout, where i1 < j. If the shovel occupancy rate after mutating the i1-th cigarette box is greater than the shovel occupancy rate of the current parent layout, it indicates that a parent layout change event has occurred. When a parent layout change event occurs, the cigarette box layout of the mutated i1-th cigarette box is positioned as the new parent layout, and the initial simulated layout is abandoned. Furthermore, during the layout mutation process from the i1-th to the j-th cigarette box, it is checked whether there are multiple consecutive events where the shovel occupancy rate does not improve. Multiple consecutive events where the shovel occupancy rate does not improve refer to multiple consecutive mutations resulting in the same shovel occupancy rate that does not exceed the shovel occupancy rate of the current parent layout.
6. A computer-readable storage medium having stored thereon a computer program, characterized in that, When executed by a processor, the program implements the method for optimizing the cigarette box layout as described in any one of claims 1 to 4.
7. A device for optimizing the arrangement of cigarette cartons, characterized in that it comprises: include: Processor and memory; The memory is used to store a computer program, and the processor is used to execute the computer program stored in the memory to cause the cigarette box layout optimization device to perform the cigarette box layout optimization method as described in any one of claims 1 to 4.