Layout plan generation system, layout plan generation method, and layout plan generation program

Abstract

This arrangement plan generation system comprises: a dimension acquisition unit that acquires dimension information pertaining to objects being arranged; an arrangement period acquisition unit that acquires arrangement period information pertaining to the objects being arranged; an occupancy information configuration unit that, on the basis of the dimension information and the arrangement period information, configures (n+1)-dimensional occupancy information representing a space and a period in which the objects being arranged occupy an (n+1)-dimensional virtual space defined by n-dimensional spatial axes and a time axis; an arrangement unit that, on the basis of arrangement space information and the occupancy information pertaining to the objects being arranged, arranges the objects being arranged, through use of a prescribed algorithm, within an (n+1)-dimensional virtual arrangement space composed of the n-dimensional spatial and time axis; and an output unit that outputs arrangement information representing the virtual arrangement space where the objects being arranged are arranged.

Description

[Technical Field]

[0001] The present disclosure relates to a layout plan generation system, a layout plan generation method, and a layout plan generation program that optimize the layout of a layout object in a layout space for a certain period of time. [Background technology]

[0002] Products, parts, materials, etc. may be stored in storage areas for a certain period of time. Because the products to be stored change over time, the products must be appropriately allocated to the storage areas in accordance with the changes over time. Conventionally, allocation schedules for arranging products in storage areas have been created manually. A technology for creating a shipping plan for loading products to be transported into a ship's hold is also known as a technology for dealing with a similar problem (see, for example, Patent Document 1). This technology classifies products to be transported into product groups, creates packaging for the products to be transported, and creates a product group allocation plan based on the shape and size of the product group's packaging in a planar view and the shape and size of the ship's hold bottom. When arranging the products, a method for solving a polygon packing problem, in which multiple polygons are packed into a single rectangle without overlapping each other, is used. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Japanese Patent Application Laid-Open No. 2011-207614 Summary of the Invention [Problem to be solved by the invention]

[0004] Manually creating a layout plan for arranging objects such as products in a specified layout space for a certain period of time is extremely difficult and time-consuming. Furthermore, when the layout space is the site of a factory or the like, manual layout planning has limitations on efficiency, and there are cases where the layout space is insufficient. In such cases, temporary renting of a site other than the factory or the like is required, resulting in high rental costs and transportation costs for the products, etc. Furthermore, existing methods for solving the so-called rectangle packing problem, in which rectangles corresponding to the shape of products, etc. are packed into a rectangle corresponding to the shape of the layout space, can solve static layouts at a certain point in time, but cannot solve dynamic layout problems in which objects change over time.

[0005] Therefore, one aspect of the present disclosure aims to easily obtain an arrangement plan for efficiently arranging, in an arrangement space, arrangement objects that change over time. [Means for solving the problem]

[0006] In order to solve the above problem, a placement plan generation system according to one aspect of the present disclosure is a placement plan generation system that generates a placement plan for placement objects to be placed in a placement space for a certain period of time, and includes: a dimension acquisition unit that acquires dimensional information representing at least the size of each placement object in n-dimensional space (n is an integer greater than or equal to 1); a placement period acquisition unit that acquires placement period information representing the placement period for placing the placement object in the placement space; an occupancy information configuration unit that configures (n+1)-dimensional occupancy information representing the space and period occupied by the placement object in an (n+1)-dimensional virtual space defined by n-dimensional spatial axes and time axes based on the dimensional information and the placement period information; a placement unit that arranges the placement objects in an (n+1)-dimensional virtual placement space consisting of n-dimensional spatial and time axes of the placement space using a predetermined algorithm that optimizes the placement of (n+1)-dimensional objects in the (n+1)-dimensional space based on the occupancy information of each placement object and placement space information including the shape and dimensions of the placement space in the n-dimensional space; and an output unit that outputs placement information representing the virtual placement space in which the placement objects are placed.

[0007] In order to solve the above problem, a placement plan generation method according to one aspect of the present disclosure is a placement plan generation method in a placement plan generation system that generates a placement plan for placement objects to be placed in a placement space for a certain period of time, and includes: a dimension acquisition step of acquiring dimensional information representing at least the size of each placement object in n-dimensional space (n is an integer greater than or equal to 1); a placement period acquisition step of acquiring placement period information representing the placement period for placing the placement object in the placement space; an occupancy information configuration step of configuring (n+1)-dimensional occupancy information representing the space and period occupied by the placement object in an (n+1)-dimensional virtual space defined by n-dimensional spatial axes and time axes based on the dimensional information and the placement period information; a placement step of arranging the placement objects in an (n+1)-dimensional virtual placement space consisting of n-dimensional spatial and time axes of the placement space using a predetermined algorithm that optimizes the placement of (n+1)-dimensional objects in the (n+1)-dimensional space based on the occupancy information of each placement object and placement space information including the shape and dimensions of the placement space in the n-dimensional space; and an output step of outputting placement information representing the virtual placement space in which the placement objects have been placed.

[0008] In order to solve the above problem, a placement plan generation program according to one aspect of the present disclosure is a placement plan generation program that causes a computer to function as a placement plan generation system that generates a placement plan for placement objects to be placed in a placement space for a certain period of time, and causes the computer to realize: a dimension acquisition function that acquires dimensional information representing at least the size of each placement object in n-dimensional space (n is an integer greater than or equal to 1); a placement period acquisition function that acquires placement period information representing the placement period for placing the placement object in the placement space; an occupancy information configuration function that configures (n+1)-dimensional occupancy information representing the space and period occupied by the placement object in an (n+1)-dimensional virtual space defined by n-dimensional spatial axes and time axes based on the dimensional information and the placement period information; a placement function that arranges the placement objects in an (n+1)-dimensional virtual placement space consisting of n-dimensional spatial and time axes of the placement space using a predetermined algorithm that optimizes the placement of (n+1)-dimensional objects in the (n+1)-dimensional space based on the occupancy information of each placement object and placement space information including the shape and dimensions of the placement space in the n-dimensional space; and an output function that outputs placement information representing the virtual placement space in which the placement objects are arranged.

[0009] According to the above aspect, occupancy information is generated based on dimensional information and placement period information of a placement object. The occupancy information is information representing a virtual placement object expanded one-dimensionally by adding a time axis to the dimensional information. Therefore, the occupancy information represents not only the space occupied by the placement object in the placement space, but also the time for which the space is occupied, as a size along the time axis in an (n+1)-dimensional virtual space including the time axis. Then, by arranging the placement object in the virtual placement space using a predetermined algorithm, it is possible to easily generate a placement plan that takes into account changes in the placement object over time, as a packing problem of arranging the virtual placement object represented in (n+1) dimensions by the occupancy information in the virtual placement space expanded to (n+1) dimensions by adding a time axis to the placement space, which is an n-dimensional space.

[0010] In the layout plan generation system according to another aspect, the layout unit may perform layout of the layout objects according to a predetermined algorithm, with no degree of freedom with respect to the time axis in the virtual layout space.

[0011] According to the above aspect, it is possible to obtain an appropriate placement plan for placing placement objects with fixed placement periods in placement spaces.

[0012] In another aspect of the layout plan generation system, when placing one placement object in a virtual layout space in which one or more placement objects are placed, the placement unit may place the one placement object in a space excluding the space occupied by placement objects that have already been placed in the virtual layout space corresponding to the placement period of the one placement object, using a predetermined algorithm that optimizes the placement of n-dimensional objects in an n-dimensional space, with the number of dimensions in the predetermined algorithm reduced by one.

[0013] According to the above aspect, the generation of a placement plan for placing one placement object can be reduced to the problem of placing one placement object in a virtual placement space, taking into account the virtual space occupied by placement objects that have already been placed in the virtual placement space for a period corresponding to the placement period of the one placement object. Therefore, a predetermined algorithm for optimizing the placement of n-dimensional objects in an n-dimensional space can be applied to solve the problem, making it possible to easily generate a placement plan.

[0014] In another aspect of the layout plan generation system, the dimension acquisition unit acquires dimension information representing the size of each placement object in two-dimensional space, the occupancy information construction unit constructs three-dimensional occupancy information representing the space and period occupied by the placement object in a three-dimensional virtual space defined by two-dimensional spatial axes and a time axis, and the placement unit may place the placement objects in a three-dimensional virtual placement space consisting of the two-dimensional spatial and time axes of the placement space using a predetermined algorithm that optimizes the placement of three-dimensional objects in the three-dimensional space, based on the occupancy information of each placement object and placement space information including the shape and dimensions of the placement space in two-dimensional space.

[0015] According to the above aspect, it is possible to easily generate an arrangement plan for efficiently arranging arrangement objects in a planar arrangement space.

[0016] In the layout plan generation system according to another aspect, the predetermined algorithm may be an algorithm for solving a packing problem, and may be any one of a Bottom-Left algorithm, a Best-Fit algorithm, a Next-Fit algorithm, and a Sequence-Pair algorithm.

[0017] According to the above aspect, by applying any of the listed algorithms, it is possible to generate a suitable placement plan that can efficiently place placement objects in a placement space. [Effects of the Invention]

[0018] According to one aspect of the present disclosure, it is possible to easily obtain an arrangement plan for efficiently arranging, in an arrangement space, arrangement objects that change over time. [Brief explanation of the drawings]

[0019] [Figure 1] FIG. 2 is a block diagram showing the functional configuration of a layout plan generation system and a layout plan generation device. [Figure 2] FIG. 2 is a diagram illustrating a hardware configuration of a layout plan generating device. [Figure 3] FIG. 10 is a diagram schematically illustrating an example of placement space information. [Figure 4] 10A and 10B are diagrams schematically showing examples of dimension information and placement period information of placement objects, and examples of occupancy information. [Figure 5] 10A and 10B are diagrams illustrating a layout process for arranging a virtual layout object represented by occupancy information in a virtual layout space. [Figure 6] 10 is a diagram schematically illustrating a placement process for placing a placement object in a virtual placement space corresponding to a placement period of the placement object. FIG. [Figure 7] FIG. 1 is a diagram for explaining in outline the Bottom-Left method, which is an example of a predetermined algorithm. [Figure 8] 10 is a flowchart showing the processing content of a placement plan generating method. [Figure 9] 10 is a flowchart showing the processing content of a placement plan generating method. DETAILED DESCRIPTION OF THE INVENTION

[0020] Hereinafter, embodiments of the present disclosure will be described in detail with reference to the accompanying drawings. In the description of the drawings, the same or equivalent elements are designated by the same reference numerals, and redundant description will be omitted.

[0021] 1 is a block diagram showing the functional configuration of a layout plan generation system and a layout plan generation device according to this embodiment. The layout plan generation system 1 of this embodiment is configured to include a layout plan generation device 10. The layout plan generation system 1 generates a layout plan for layout objects to be placed in a layout space for a certain period of time.

[0022] As shown in Fig. 1, the layout plan generating device 10 is configured by a computer including a processor 101, and functionally comprises a layout space information acquisition unit 11, a dimension acquisition unit 12, a layout period acquisition unit 13, an occupancy information configuration unit 14, a layout unit 15, and an output unit 16. Each of these functional units 11 to 16 is realized by loading a program P1 (layout plan generating program) into the processor 101, which will be described with reference to Fig. 2, and executing the program. Each functional unit will be described later. In this embodiment, each of the functional units 11 to 16 is configured in the layout plan generating device 10, but they may also be configured in a distributed manner across multiple computers.

[0023] The layout plan generating device 10 also includes storage means such as a placement space information storage unit 17, a placement target object information storage unit 18, and a placement information storage unit 19. In the example shown in Fig. 1, these storage units 17 to 19 are configured in the layout plan generating device 10, but they may also be configured in other devices that are configured to be accessible from the layout plan generating device 10. Each storage unit will be described later.

[0024] FIG. 2 is a diagram showing an example of the hardware configuration of the placement plan generating device 10, and shows a computer 100 that functions as the placement plan generating device 10.

[0025] As an example, the computer 100 includes a processor 101, a main memory unit 102, an auxiliary memory unit 103, and a communication unit 104 as hardware components.

[0026] The processor 101 is a computing device that executes an operating system and application programs. Examples of processors include a central processing unit (CPU) and a graphics processing unit (GPU), but the type of processor 101 is not limited to these. For example, the processor 101 may be a combination of dedicated circuits. The dedicated circuits may be programmable circuits such as field-programmable gate arrays (FPGAs), or other types of circuits.

[0027] The main memory unit 102 is a device that stores programs for realizing the placement plan generation device 10 or the placement plan generation system 1, calculation results output from the processor 101, etc. The main memory unit 102 is configured by, for example, at least one of a ROM (Read Only Memory) and a RAM (Random Access Memory).

[0028] The auxiliary storage unit 103 is generally a device capable of storing a larger amount of data than the main storage unit 102. The auxiliary storage unit 103 is configured by a non-volatile storage medium such as a hard disk or a flash memory. The auxiliary storage unit 103 stores a program P1 for causing the computer 100 to function as the placement plan generation device 10 or the placement plan generation system 1, and various data. In this embodiment, a placement plan generation program for realizing the placement plan generation device 10 or the placement plan generation system 1 is implemented as the program P1. Furthermore, when the storage units 17 to 19 are included in the placement plan generation device 10, the storage units 17 to 19 may be configured in any of the main storage unit 102, the auxiliary storage unit 103, or other storage elements.

[0029] The communication unit 104 is a device that executes data communication with other computers via a communication network, and is configured by, for example, a network card or a wireless communication module.

[0030] Each functional element of the placement plan generation device 10 is realized by loading a corresponding program P1 onto the processor 101 or the main memory unit 102 and causing the processor 101 to execute the program. The program P1 includes code for realizing each functional element of the placement plan generation device 10. The processor 101 operates the communication unit 104 in accordance with the program P1, and executes reading and writing of data from and to the main memory unit 102 or the auxiliary memory unit 103. Through such processing, each functional element of the placement plan generation device 10 or the placement plan generation system 1 is realized.

[0031] The program P1 may be provided by being fixedly recorded on a tangible recording medium such as a CD-ROM, a DVD-ROM, a semiconductor memory, etc. Alternatively, the program P1 may be provided via a communications network as a data signal superimposed on a carrier wave.

[0032] 1 again, the functional units and storage units of the layout plan generating device 10 will be described. Note that in an example of the layout plan generating device 10 of this embodiment described below, a layout plan is generated for arranging layout objects in a layout space that is a two-dimensional plane without overlapping in the height direction. However, the number of dimensions of the layout space and the layout objects to be arranged are not limited.

[0033] The placement space information acquisition unit 11 acquires placement space information including the shape and dimensions in n-dimensional space (n is an integer equal to or greater than 1) of the placement space in which the placement object is to be placed. In this embodiment, as described above, the placement space information acquisition unit 11 acquires placement space information including the dimensions in two-dimensional space of the placement space, which is a two-dimensional plane.

[0034] FIG. 3 is a diagram schematically illustrating an example of placement space information. As shown in FIG. 3, the placement space information rs has a two-dimensional planar (xy plane) shape and includes dimensions (97 m, 17 m) along the x-axis and y-axis, respectively. The placement space information may be stored in advance in the placement space information storage unit 17, for example. That is, the placement space information storage unit 17 is a storage means that stores placement space information. In this case, the placement space information acquisition unit 11 acquires the placement space information from the placement space information storage unit 17.

[0035] The dimension acquisition unit 12 acquires dimension information representing the size of each placement object in n-dimensional space. The dimension information may be information representing dimensions along each of n coordinate axes set in n-dimensional space, or may be information representing the size and shape of the placement object. In this embodiment, n=2, and the dimension acquisition unit 12 acquires dimension information representing the dimensions of the placement object in two-dimensional space. Furthermore, if the placement object is actually a three-dimensional object, the dimension information may be information representing the shape and dimensions of the object when placed on a plane.

[0036] The placement period acquisition unit 13 acquires placement period information that indicates a placement period during which the placement object is to be placed in the placement space.

[0037] The dimension information and placement period information may be stored in advance as placement object information in the placement object information storage unit 18. That is, the placement object information storage unit 18 is a storage means that stores placement object information including the dimension information and the placement period information. The dimension acquisition unit 12 and the placement period acquisition unit 13 acquire the dimension information and the placement period information from the placement object information storage unit 18 as placement object information.

[0038] The occupancy information composition unit 14 composes (n+1)-dimensional occupancy information representing the space and period occupied by the placement object in an (n+1)-dimensional virtual space defined by n-dimensional spatial axes and a time axis, based on the dimension information and placement period information. In this embodiment, n=2, and the occupancy information composition unit 14 composes three-dimensional occupancy information representing the space and period occupied by the placement object in a three-dimensional virtual space defined by two-dimensional spatial axes and a one-dimensional time axis.

[0039] The occupancy information is information representing a virtual placement object that is expanded one-dimensionally by adding placement period information along the time axis to the dimensional information. Therefore, the occupancy information represents not only the space that the placement object occupies in the placement space, but also the time that the object occupies that space as a size along the time axis in an (n+1)-dimensional virtual space that includes the time axis.

[0040] 4 is a diagram schematically showing an example of dimension information and placement period information of a placement object, as well as an example of occupancy information. As shown in FIG. 4, the dimension acquisition unit 12 acquires dimension information sz. The dimension information sz represents the dimensions (5 m x 5 m) of the placement object along the x-axis and y-axis in two-dimensional space (xy plane).

[0041] Furthermore, the placement period acquisition unit 13 acquires placement period information dt. The placement period information dt includes the start and end dates (2022 / 10 / 1-2022 / 11 / 1) of the period during which the placement object is placed in the placement space.

[0042] The occupancy information composition unit 14 composes the occupancy information oc based on the dimension information sz and the placement period information dt. As illustrated in Fig. 4, the occupancy information oc represents the space and time occupied by a placement object in a three-dimensional virtual space consisting of an x-axis, a y-axis and a time axis in a two-dimensional space (xy plane) as a three-dimensional virtual placement object. The length along the time axis t in the occupancy information oc represents the placement period from the start time dt1 to the end time dt2 during which the placement object is placed in the placement space.

[0043] The placement unit 15 places the placement objects in an (n+1)-dimensional virtual placement space consisting of the n-dimensional space and time axis of the placement space, using a predetermined algorithm that optimizes the placement of (n+1)-dimensional objects in an (n+1)-dimensional space, based on the occupancy information and placement space information of each placement object.

[0044] In this embodiment, n=2, and the placement unit 15 places virtual three-dimensional placement objects represented by occupancy information in a three-dimensional virtual placement space consisting of a two-dimensional space and a one-dimensional time axis of the placement space, using a predetermined algorithm that optimizes the placement of three-dimensional objects in three-dimensional space.

[0045] The predetermined algorithm may be, for example, a well-known algorithm for solving a so-called packing problem, in which rectangular objects are packed into a rectangular space. Known algorithms for solving packing problems include the Bottom-Left method, the Best-Fit method, the Next-Fit method, and the Sequence-Pair method. Furthermore, algorithms for solving three-dimensional packing problems that are three-dimensional extensions of these algorithms are known, such as the Deepest-Bottom-Left method, which is a three-dimensional extension of the Bottom-Left method.

[0046] 5 is a diagram schematically illustrating a placement process for placing a virtual placement object represented by occupancy information in a virtual placement space. The placement unit 15 places a virtual placement object vo1(vo) in a three-dimensional virtual placement space vs consisting of a two-dimensional space of the placement space and a time axis (t) using a predetermined algorithm. The virtual placement object vo is expressed as a three-dimensional object consisting of a planar shape of the placement object in the xy plane and a size along the time axis (t) corresponding to the placement period. Specifically, in the example shown in FIG. 5, the placement unit 15 places a virtual placement object vo1 in the virtual placement space vs in which a virtual placement object vo0(vo) has already been placed, using a predetermined algorithm.

[0047] In addition, when the period for placing the placement object in the placement space is fixed to the placement period indicated in the placement period information, that is, when there is no room to change the placement period of the placement object in question depending on the placement status of other placement objects, the placement unit 15 may perform placement using a predetermined algorithm for solving the three-dimensional packing problem, with no degree of freedom for the time axis of the virtual placement object vo1.

[0048] On the other hand, if there is room to change the period for placing the placement object in the placement space, the placement unit 15 may set the degree of freedom for the time axis of the virtual placement object vo1 according to the room for changing the placement period, and perform the placement using a predetermined algorithm for solving the three-dimensional packing problem.

[0049] Furthermore, when placing one placement object in a virtual placement space in which one or more placement objects have been placed, the placement unit 15 may place the one placement object in a space in the virtual placement space corresponding to the placement period of the one placement object, excluding the space occupied by the placement object that has already been placed, by using a predetermined algorithm that optimizes the placement of n-dimensional objects in an n-dimensional space in which the number of dimensions in the above-mentioned predetermined algorithm is reduced by one, with the restriction that the space cannot be placed.

[0050] In this embodiment, n=2, and a predetermined algorithm that optimizes the placement of two-dimensional objects in two-dimensional space is used to place one placement object in a virtual placement space corresponding to the placement period of the one placement object, with the constraint that the space excluding the space occupied by the placement object that has already been placed is an unplaceable space.

[0051] 6 is a diagram showing a schematic diagram of a placement process for placing a placement object in a virtual placement space corresponding to the placement period of the placement object. In the example shown in FIG. 6, a virtual placement object vo16 is placed in the virtual placement space vs in which virtual placement objects vo11, vo12, vo13, vo14, and vo15 have already been placed.

[0052] The placement unit 15 extracts the virtual placement space vs for a period equivalent to the placement period dt6 of the virtual placement object vo16 as the virtual placement space vs6. Since the placement periods of the placed virtual placement objects vo12, vo13, and vo14 overlap with the virtual period vt6 in the virtual placement space vs6, the placement unit 15 places the virtual placement object vo16 in the virtual placement space vs6 other than the placeable space, with the constraint that the space occupied by the placed virtual placement objects vo12, vo13, and vo14 in the virtual placement space vs6 is a placeable space. As shown in the figure, the placement unit 15 can place the virtual placement object vo16 in the virtual placement space vs6 using a predetermined algorithm that optimizes the placement of two-dimensional objects in a two-dimensional space.

[0053] 6, the generation of a placement plan for placing one placement object can be reduced to the problem of placing the one placement object in the virtual placement space, taking into account the virtual space occupied by the placement object that has already been placed in the virtual placement space for a period corresponding to the placement period of the one placement object. Therefore, a known algorithm for optimizing the placement of two-dimensional objects in a two-dimensional space can be applied to solve the packing problem of placing one placement object in the virtual placement space, making it possible to easily generate a placement plan.

[0054] 7 is a diagram that schematically illustrates the Bottom-Left method for arranging (packing) objects in a two-dimensional space. The Bottom-Left method is generally an algorithm for arranging multiple rectangular objects in a rectangular space. In the Bottom-Left method, an object is placed at the lowest position among the positions that can be placed in the space, and if there are multiple positions that can be placed at the lowest position (if not limited to one position), the object is placed at the leftmost position among those positions.

[0055] 7 illustrates an example in which objects ob1 to ob4 are placed in a space sp, as shown in step ST1. In step ST2, object ob1 is placed at the bottom left end, which is the lowest position among the positions in the space sp that can be placed and the leftmost position among those positions.

[0056] In step ST3, the object ob2 is placed at a position where its left end abuts on the object ob1, which is the leftmost position among the positions where its bottom end abuts on the bottom end of the space sp.

[0057] In step ST4, object ob3 is placed at a position where its left end abuts the left end of space sp, among positions where its bottom end abuts the top end of object ob2.

[0058] In step ST4, the object ob4 is placed at a position where the left end thereof contacts the left end of the space sp, among the positions where the bottom end thereof contacts the top end of the object ob1.

[0059] 1, the output unit 16 outputs placement information representing a virtual placement space in which placement objects are placed. The placement information includes at least the position in the virtual placement space where each placement object is placed. The placement information may further include the placement period of each placement object in the virtual placement space.

[0060] There are no limitations on the manner in which the output unit 16 outputs the placement information. The output unit 16 may store the placement information in the placement information storage unit 19. That is, the placement information storage unit 19 is a storage means for storing the placement information.

[0061] The output unit 16 may also display the arrangement information on a predetermined display means such as a display, etc. The output unit 16 may also transmit the arrangement information to another computer such as a terminal.

[0062] Next, an example of the operation of the placement plan generating system 1 of this embodiment will be described with reference to Fig. 8. Fig. 8 is a flowchart showing the processing content of the placement plan generating method performed in the placement plan generating system 1.

[0063] In step S1, the placement space information acquisition unit 11 acquires placement space information including the shape and dimensions in an n-dimensional space (n is an integer of 1 or more) of the placement space.

[0064] In step S2, variable i is set to 0 (zero). In the following step S3, it is determined whether variable i is less than a predetermined number k. Variable i is the number of placement objects that have been processed for placement. The predetermined number k is the number of placement objects to be placed. If it is determined that variable i is less than the predetermined number k, the process proceeds to step S4. On the other hand, if it is not determined that variable i is less than the predetermined number k, the process proceeds to step S10.

[0065] In step S4, the dimension acquisition unit 12 acquires dimension information of the i-th placement object, and the placement period acquisition unit 13 acquires placement period information of the i-th placement object.

[0066] In step S5, the occupancy information construction unit 14 constructs (n+1)-dimensional occupancy information representing the space and period occupied by the placement object in an (n+1)-dimensional virtual space defined by an n-dimensional spatial axis and a 1-dimensional time axis, based on the dimensional information and placement period information.

[0067] In step S6, the placement unit 15 attempts to place the placement object in the virtual placement space using a predetermined algorithm based on the occupancy information and placement space information of the placement object.

[0068] In step S7, the placement unit 15 determines whether placement is possible. If it is determined that placement is possible, the process proceeds to step S8. On the other hand, if it is not determined that placement is possible, the process proceeds to step S9.

[0069] In step S8, the placement unit 15 places the placement object in the virtual placement space. In step S9, the variable i is incremented, and the process returns to step S3.

[0070] When the process proceeds from step S3 to step S10, the output unit 16 outputs arrangement information representing the virtual arrangement space in which the arrangement object is arranged.

[0071] Next, another example of the operation of the layout plan generating system 1 of this embodiment will be described with reference to Fig. 9. Fig. 9 is a flowchart showing the processing contents of another example of the layout plan generating method performed in the layout plan generating system 1.

[0072] In step S21, the placement space information acquisition unit 11 acquires placement space information including the shape and dimensions in an n-dimensional space (n is an integer of 1 or more) of the placement space.

[0073] In step S22, variable i is set to 0 (zero). In the following step S23, it is determined whether variable i is less than a predetermined number k. Variable i is the number of placement objects that have been processed for placement. The predetermined number k is the number of placement objects to be placed. If it is determined that variable i is less than the predetermined number k, the process proceeds to step S24. On the other hand, if it is not determined that variable i is less than the predetermined number k, the process proceeds to step S31.

[0074] In step S24, the dimension acquisition unit 12 acquires dimension information of the i-th placement object, and the placement period acquisition unit 13 acquires placement period information of the i-th placement object.

[0075] In step S25, the occupancy information construction unit 14 constructs (n+1)-dimensional occupancy information representing the space and period occupied by the placement object in an (n+1)-dimensional virtual space defined by an n-dimensional spatial axis and a 1-dimensional time axis, based on the dimension information and placement period information.

[0076] In step S26, the placement unit 15 extracts the virtual placement space for the period corresponding to the placement period of the i-th placement object, together with information on the space occupied by the placement objects that have already been placed during that period.

[0077] In step S27, the placement unit 15 attempts to place the placement object in the virtual placement space extracted in step S26 using a predetermined algorithm, with the constraint that the space occupied by the placed placement object in the virtual placement space is an unplaceable space.

[0078] In step S28, the placement unit 15 determines whether placement is possible. If it is determined that placement is possible, the process proceeds to step S29. On the other hand, if it is not determined that placement is possible, the process proceeds to step S30.

[0079] In step S29, the placement unit 15 places the placement object in the virtual placement space. In step S30, the variable i is incremented, and the process returns to step S23.

[0080] When the process proceeds from step S23 to step S31, the output unit 16 outputs arrangement information representing the virtual arrangement space in which the arrangement object is arranged.

[0081] According to the above-described placement plan generation system 1, placement plan generation device 10, placement plan generation method, and placement plan generation program of the present embodiment, occupancy information is generated based on dimensional information and placement period information of placement objects. The occupancy information is information representing a virtual placement object expanded one-dimensionally by adding a time axis to the dimensional information. Therefore, the occupancy information represents not only the space occupied by the placement object in the placement space, but also the time the space is occupied by the placement object as a size along the time axis in an (n+1)-dimensional virtual space including the time axis. Then, by arranging the placement objects in the virtual placement space using a predetermined algorithm, it is possible to easily generate a placement plan that takes into account changes in the placement objects over time, as a packing problem in which virtual placement objects represented in (n+1) dimensions by the occupancy information are placed in the virtual placement space expanded to (n+1) dimensions by adding a time axis to the placement space, which is an n-dimensional space.

[0082] The present disclosure has been described in detail above based on the embodiments. However, the present disclosure is not limited to the above embodiments. Various modifications of the present disclosure are possible without departing from the spirit and scope of the present disclosure.

[0083] In this embodiment, an example has been shown in which n=2 is used to generate an arrangement plan for arranging arrangement targets in an arrangement space that is a two-dimensional plane without overlapping in the vertical direction, but n is not limited to 2. For example, when n=1 is used to arrange rod-shaped objects in a long, thin rack, the arrangement plan generation system 1 of this embodiment can be applied to the problem of arranging an arrangement target having a one-dimensional size in an arrangement space that is expressed in one dimension. Furthermore, n=3, 4, and so on may also be used.

[0084] The following is a summary of the present disclosure. [1] An arrangement plan generation system for generating an arrangement plan for an arrangement object to be arranged in an arrangement space for a certain period of time, a dimension acquisition unit that acquires dimension information representing at least the size of each placement object in an n-dimensional space (n is an integer equal to or greater than 1); an arrangement period acquisition unit that acquires arrangement period information indicating an arrangement period during which the arrangement object is to be arranged in the arrangement space; an occupancy information configuration unit that configures (n+1)-dimensional occupancy information representing the space and period that the placement object occupies in an (n+1)-dimensional virtual space defined by n-dimensional spatial axes and time axes based on the dimension information and the placement period information; a placement unit that places the placement objects in an (n+1)-dimensional virtual placement space consisting of n-dimensional space and time axes of the placement space, using a predetermined algorithm that optimizes the placement of (n+1)-dimensional objects in the (n+1)-dimensional space, based on the occupancy information of each placement object and placement space information including the shape and dimensions of the placement space in the n-dimensional space; an output unit that outputs arrangement information representing the virtual arrangement space in which the arrangement object is arranged; A layout plan generation system comprising: [2] the placement unit performs placement of the placement object according to the predetermined algorithm, with no degree of freedom with respect to a time axis in the virtual placement space. The layout plan generation system according to [1]. [3] the placement unit, when placing one placement object in the virtual placement space in which one or more placement objects have been placed, places the one placement object in a space excluding a space occupied by the placement object that has already been placed in the virtual placement space corresponding to a placement period of the one placement object, by a predetermined algorithm that optimizes the placement of n-dimensional objects in an n-dimensional space, with the number of dimensions in the predetermined algorithm reduced by one; [2] The layout plan generation system according to [2]. [4] the dimension acquisition unit acquires the dimension information representing the size of each placement object in two-dimensional space; the occupancy information constructing unit constructs three-dimensional occupancy information representing a space and a period of time that the placement object occupies in a three-dimensional virtual space defined by a two-dimensional spatial axis and a time axis; the placement unit places the placement objects in a three-dimensional virtual placement space consisting of the two-dimensional space and time axis of the placement space, using a predetermined algorithm that optimizes the placement of three-dimensional objects in a three-dimensional space, based on the occupancy information of each placement object and placement space information including the shape and dimensions of the placement space in the two-dimensional space; [1] or [2]. The layout plan generation system. [5] the predetermined algorithm is an algorithm for solving a packing problem, and is one of a Bottom-Left algorithm, a Best-Fit algorithm, a Next-Fit algorithm, and a Sequence-Pair algorithm; The layout plan generation system according to any one of [1] to [4]. [6] 1. A layout plan generation method in a layout plan generation system that generates a layout plan for a layout object to be placed in a layout space for a certain period of time, comprising: a dimension acquisition step of acquiring dimension information representing at least the size of each placement object in an n-dimensional space (n is an integer equal to or greater than 1); an arrangement period acquisition step of acquiring arrangement period information indicating an arrangement period during which the arrangement object is to be arranged in the arrangement space; an occupancy information construction step of constructing (n+1)-dimensional occupancy information representing the space and period occupied by the placement object in an (n+1)-dimensional virtual space defined by n-dimensional spatial axes and time axes based on the dimension information and the placement period information; a placement step of placing the placement objects in an (n+1)-dimensional virtual placement space consisting of n-dimensional space and time axes of the placement space, using a predetermined algorithm that optimizes the placement of (n+1)-dimensional objects in an (n+1)-dimensional space, based on the occupancy information of each placement object and placement space information including the shape and dimensions of the placement space in the n-dimensional space; an output step of outputting arrangement information representing the virtual arrangement space in which the arrangement object is arranged; A layout plan generation method having the following. [7] A placement plan generation program for causing a computer to function as a placement plan generation system that generates a placement plan for placement objects to be placed in a placement space for a certain period of time, The computer, a dimension acquisition function for acquiring dimension information representing at least the size of each placement object in n-dimensional space (n is an integer equal to or greater than 1); an arrangement period acquisition function that acquires arrangement period information indicating an arrangement period during which the arrangement object is to be arranged in the arrangement space; an occupancy information construction function that constructs (n+1)-dimensional occupancy information representing the space and period that the placement object occupies in an (n+1)-dimensional virtual space defined by n-dimensional spatial axes and time axes based on the dimension information and the placement period information; a placement function that places the placement objects in an (n+1)-dimensional virtual placement space consisting of the n-dimensional space and time axes of the placement space, using a predetermined algorithm that optimizes the placement of (n+1)-dimensional objects in the (n+1)-dimensional space, based on the occupancy information of each placement object and placement space information including the shape and dimensions of the placement space in the n-dimensional space; an output function for outputting arrangement information representing the virtual arrangement space in which the arrangement object is arranged; A layout plan generation program that realizes this. [Explanation of symbols]

[0085] 1. Layout plan generation system 10. Layout plan generator 11. Placement space information acquisition unit 12 Dimension acquisition section 13 Placement period acquisition department 14 Occupancy information component 15 Placement section 16 Output section 17 Placement space information storage unit 18. Placement object information storage unit 19 Location information storage unit P1 Program

Claims

1. An arrangement plan generation system for generating an arrangement plan for an arrangement object to be arranged in an arrangement space for a certain period of time, a dimension acquisition unit that acquires dimension information representing at least the size of each placement object in an n-dimensional space (n is an integer of 1 or more); an arrangement period acquisition unit that acquires arrangement period information indicating an arrangement period during which the arrangement object is to be arranged in the arrangement space; an occupancy information constructing unit that constructs (n+1)-dimensional occupancy information representing a space and a period that the placement object occupies in an (n+1)-dimensional virtual space defined by n-dimensional spatial axes and a time axis, based on the dimension information and the placement period information; a placement unit that places the placement objects in an (n+1)-dimensional virtual placement space consisting of n-dimensional space and time axes of the placement space, using a predetermined algorithm that optimizes the placement of (n+1)-dimensional objects in the (n+1)-dimensional space, based on the occupancy information of each placement object and placement space information including the shape and dimensions of the placement space in the n-dimensional space; an output unit that outputs arrangement information representing the virtual arrangement space in which the arrangement object is arranged, the placement unit performs placement of the placement object according to the predetermined algorithm, with no degree of freedom with respect to a time axis in the virtual placement space. Layout plan generation system.

2. When arranging one placement object in the virtual placement space in which one or more placement objects have been arranged, the arrangement unit arranges the one placement object in a space excluding a space occupied by the placement object that has already been arranged in the virtual placement space corresponding to a placement period of the one placement object, by a predetermined algorithm that optimizes the arrangement of n-dimensional objects in an n-dimensional space, with the number of dimensions in the predetermined algorithm reduced by one. The layout plan generation system according to claim 1 .

3. the dimension acquisition unit acquires the dimension information representing the size of each placement object in a two-dimensional space; the occupancy information constructing unit constructs three-dimensional occupancy information representing a space and a period of time that the placement object occupies in a three-dimensional virtual space defined by a two-dimensional spatial axis and a time axis; the placement unit places the placement objects in a three-dimensional virtual placement space consisting of the two-dimensional space and time axis of the placement space, using a predetermined algorithm that optimizes the placement of three-dimensional objects in a three-dimensional space, based on the occupancy information of each placement object and placement space information including the shape and dimensions of the placement space in the two-dimensional space; The layout plan generation system according to claim 1 .

4. The predetermined algorithm is an algorithm for solving a packing problem, and is one of a Bottom-Left algorithm, a Best-Fit algorithm, a Next-Fit algorithm, and a Sequence-Pair algorithm. The layout plan generation system according to claim 1 .

5. 1. A layout plan generation method in a layout plan generation system that generates a layout plan for a layout object to be placed in a layout space for a certain period of time, comprising: a dimension acquisition step of acquiring dimension information representing at least the size of each placement object in an n-dimensional space (n is an integer of 1 or more); an arrangement period acquisition step of acquiring arrangement period information indicating an arrangement period during which the arrangement object is to be arranged in the arrangement space; an occupancy information construction step of constructing (n+1)-dimensional occupancy information representing the space and period occupied by the placement object in an (n+1)-dimensional virtual space defined by n-dimensional spatial axes and a time axis, based on the dimension information and the placement period information; a placement step of placing the placement objects in an (n+1)-dimensional virtual placement space consisting of n-dimensional space and time axes of the placement space, using a predetermined algorithm that optimizes the placement of (n+1)-dimensional objects in an (n+1)-dimensional space, based on the occupancy information of each placement object and placement space information including the shape and dimensions of the placement space in the n-dimensional space; an output step of outputting arrangement information representing the virtual arrangement space in which the arrangement object is arranged, In the arranging step, the arrangement of the objects to be arranged is performed according to the predetermined algorithm, with no degree of freedom with respect to a time axis in the virtual arrangement space. A method for generating layout plans.

6. A placement plan generation program for causing a computer to function as a placement plan generation system that generates a placement plan for placement objects to be placed in a placement space for a certain period of time, The computer, a dimension acquisition function for acquiring dimension information representing at least the size of each placement object in an n-dimensional space (n is an integer of 1 or more); an arrangement period acquisition function that acquires arrangement period information indicating an arrangement period during which the arrangement object is to be arranged in the arrangement space; an occupancy information construction function that constructs (n+1)-dimensional occupancy information representing the space and period that the placement object occupies in an (n+1)-dimensional virtual space defined by n-dimensional spatial axes and time axes based on the dimension information and the placement period information; a placement function that places the placement objects in an (n+1)-dimensional virtual placement space consisting of n-dimensional space and time axes of the placement space, using a predetermined algorithm that optimizes the placement of (n+1)-dimensional objects in the (n+1)-dimensional space, based on the occupancy information of each placement object and placement space information including the shape and dimensions of the placement space in the n-dimensional space; an output function for outputting placement information representing the virtual placement space in which the placement object is placed, the placement function performs placement of the placement object according to the predetermined algorithm, with no degree of freedom with respect to the time axis in the virtual placement space; Layout plan generator.

Images