Planning device, planning method, and program
The planning device and method address the imbalance of ship's center of gravity by calculating cargo loading ranges to maintain balance and optimize gantry crane operations, enhancing safety and efficiency in cargo shipping plans.
Patent Information
- Application Number
- JP2022141219
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2022-09-06
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2042-09-06
AI Technical Summary
Existing methods for creating shipping plans for cargo on ships do not adequately consider the balance of the ship's center of gravity, which affects safety and efficiency.
A planning device and method that includes constraint expressions and optimization calculations to determine cargo loading ranges that maintain the ship's center of gravity within a predetermined range, using a constraint definition unit, objective function definition, and optimization calculation unit to minimize the objective function while satisfying constraints.
Creates a loading plan that balances the ship's center of gravity, optimizing cargo placement to enhance safety and efficiency, and improves gantry crane operation efficiency.
Smart Images

Figure 0007588625000001 
Figure 0007588625000002 
Figure 0007588625000003
Abstract
Description
[Technical field]
[0001] The present disclosure relates to a planning device, a planning method, and a program. [Background technology]
[0002] At ports, cargo such as containers is loaded onto ships using gantry cranes. In order to efficiently arrange cargo in the limited space of a ship, it is necessary to create a stowage plan that determines which cargo should be stored in which area of the ship, taking into account various conditions, and various methods have been proposed in the past. For example, Patent Document 1 discloses a method of creating a stowage plan using mathematical programming. Patent Document 2 discloses a method of creating a desirable stowage plan by modeling the structure of the cargo storage area of a ship using a graph structure of nodes and arcs, creating an initial solution for cargo loading using this model, and repeatedly improving the initial solution from the perspective of being able to load all cargo and being able to unload the target cargo when necessary.
[0003] Incidentally, the position of the ship's center of gravity changes depending on the distribution of the cargo being loaded. If the position of the ship's center of gravity is not properly managed, it will affect safety and efficiency. Therefore, it is necessary to create a shipping plan taking into account the balance of the ship's center of gravity when cargo is loaded onto the ship. Patent Documents 1 and 2 are silent on this point.
[0004] In addition, when creating an actual stowage plan, before making a strict plan on which cargo will be loaded in which area, a so-called "stowage allocation" is carried out to plan the rough area for loading cargo to the same destination for each cargo destination. Since the stowage plan, which determines the specific cargo placement, is made using the results of the stowage allocation plan, it is necessary to create a plan that takes into account the ship's center of gravity balance at the stowage allocation planning stage. [Prior art documents] [Patent documents]
[0005] [Patent Document 1] JP 2001-247219 A [Patent Document 2] JP 2003-173366 A Summary of the Invention [Problem to be solved by the invention]
[0006] What is needed is a method for creating a stowage plan that takes into account the ship's center of gravity balance.
[0007] The present disclosure provides a planning device, a planning method, and a program that can solve the above problems. [Means for solving the problem]
[0008] The planning device disclosed herein includes a data acquisition unit that acquires the position of the center of gravity of a ship, the number and weight of cargo to be loaded onto the ship by destination, and position information of vacant space on the ship in which the cargo can be loaded, a constraint condition definition unit that sets as constraint conditions a constraint equation that constrains the distance between the position of the center of gravity of the ship and a desired position of the center of gravity to be within a specified range, a constraint equation that conditions that all of the cargo is loaded, and a constraint equation that limits the number and weight of the cargo to be loaded into the vacant space within the specified range to below their upper limit values, and a weighted sum of a first calculation formula for calculating the longitudinal distance between the center of gravity position of the vessel, which indicates the predetermined range in the longitudinal direction of the vessel, and the desired center of gravity position, and a second calculation formula for calculating the transverse distance between the center of gravity position of the vessel, which indicates the predetermined range in the transverse direction of the vessel, and the desired center of gravity position, and an optimization calculation unit that calculates, for each destination, the range of vacant space in which to load the cargo so as to minimize the objective function while satisfying the constraint conditions.
[0009] The planning method disclosed herein is a planning method executed by a computer, comprising the steps of: the computer acquiring the position of the center of gravity of a ship, the number and weight of cargo to be loaded onto the ship by destination, and position information of vacant space on the ship in which the cargo can be loaded; the computer setting, as constraint conditions, a constraint equation that constrains the distance between the position of the center of gravity of the ship and a desired position of the center of gravity to be within a specified range; a constraint equation that conditions that all of the cargo is loaded; and a constraint equation that limits the number and weight of the cargo to be loaded into the vacant space within the specified range to below their upper limit values; a weighted sum of a first formula for calculating the longitudinal distance between the center of gravity position of the ship, which indicates the predetermined range in the longitudinal direction of the ship, and the desired center of gravity position, and a second formula for calculating the transverse distance between the center of gravity position of the ship, which indicates the predetermined range in the transverse direction of the ship, and the desired center of gravity position. as an objective function; and the computer calculates, for each of the transport destinations, a range of the vacant space in which the cargo is to be loaded that minimizes the objective function while satisfying the constraint conditions.
[0010] The program disclosed herein also includes a step of acquiring the position of the center of gravity of a ship, the number and weight of cargo to be loaded onto the ship by destination, and position information of vacant space on the ship in which cargo can be loaded; a step of setting, as constraint conditions, a constraint equation that constrains the distance between the position of the center of gravity of the ship and a desired position of the center of gravity to be within a predetermined range, a constraint equation that conditions that all of the cargo is loaded, and a constraint equation that limits the number and weight of the cargo to be loaded into the vacant space within the predetermined range to below their upper limit values; a weighted sum of a first formula for calculating the longitudinal distance between the center of gravity position of the ship, which indicates the predetermined range in the longitudinal direction of the ship, and the desired center of gravity position, and a second formula for calculating the transverse distance between the center of gravity position of the ship, which indicates the predetermined range in the transverse direction of the ship, and the desired center of gravity position. as an objective function; and calculating, for each of the transport destinations, the range of the vacant space in which the cargo is to be loaded that minimizes the objective function while satisfying the constraint conditions. Effect of the Invention
[0011] According to the above-mentioned planning device, planning method, and program, it is possible to create a loading frame allocation plan (a loading range plan for each cargo destination) that takes into account the center of gravity balance of the hull. [Brief description of the drawings]
[0012] [Figure 1]FIG. 1 is a block diagram illustrating an example of a planning device according to an embodiment. [Figure 2A] FIG. 1 is a first diagram illustrating a cargo loading area in a hull. [Figure 2B] FIG. 2 is a second diagram illustrating the cargo loading area in the hull. [Diagram 3] FIG. 11 is a diagram illustrating an example of input information of the plan creation process according to the embodiment. [Figure 4] FIG. 11 is a diagram illustrating an example of variables in a plan creation process according to the embodiment. [Figure 5A] FIG. 2 is a first diagram showing an example of constraint conditions for the plan creation process according to the embodiment. [Figure 5B] FIG. 11 is a second diagram showing an example of constraint conditions for the plan creation process according to the embodiment. [Figure 6] FIG. 11 is a diagram illustrating an example of an objective function of the plan creation process according to the embodiment. [Figure 7] 11 is a flowchart illustrating an example of a plan creation process according to the embodiment. [Figure 8] FIG. 2 is a diagram illustrating an example of a hardware configuration of a planning device according to an embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0013] <Embodiment> The stacking frame planning method of the present disclosure will be described below with reference to the drawings. (overview) Fig. 1 is a block diagram showing an example of a planning device according to an embodiment. Fig. 2A and Fig. 2B are a first diagram and a second diagram, respectively, illustrating a cargo loading area in a ship hull. The planning device 10 is configured by a computer, and calculates in which area of the ship 1 the cargo should be loaded, depending on the destination of the cargo. For example, in a transportation plan in which the ship 1 loads cargo at port A, sails to ports B, C, and D in that order, and unloads a portion of the cargo loaded at port A at each of ports B to D, while loading different cargo at ports B to D and transporting it to another port, the cargo bound for port B is generally loaded in a certain area (e.g., area H1 shown in Figs. 2A and 2B), and the cargo bound for port C is loaded in another area (e.g., area H2 shown in Figs. 2A and 2B). The planning device 10 calculates the loading area of the cargo for each destination.
[0014] FIG. 2A shows a plan view of the ship 1. Each rectangular cell shown in FIG. 2A is a unit space for loading cargo. Except for special cargo that cannot be accommodated in a container due to its size, shape, or nature, cargo is generally loaded into containers, so the following description will be given assuming that containers are loaded into each cell. Each cell can load one container. The front-rear direction of the ship 1 is called a bay, and the left-right direction of the ship 1 is called a row. If the bay direction and row direction are each divided into cell sizes and a certain cell is used as a reference, the horizontal position of each cell can be expressed by the number of cells from the reference cell. For example, if the cell at the top left of FIG. 2A is used as a reference and each cell is expressed as (row number, bay number) (the row number indicates the number of cells in the row direction from the reference cell. The same applies to bays and tiers described later), the reference top left cell can be expressed as (1, 1), and the top right cell can be expressed as (7, 1). Additionally, the cell one cell below (behind) the top left cell can be expressed as (1, 2).
[0015] FIG. 2B shows a cross-sectional view of ship 1. The rectangular area shown in FIG. 2B is the cell described in FIG. 2A. The vertical direction of ship 1 is called a tier. If the cargo loading area is divided into cells of different sizes in the tier direction and a certain cell is taken as the reference, the vertical position of each cell can be expressed by its position (tier number) from the reference cell. The position (location) of each cell can be expressed by the above bay number, row number, and tier number. For example, if FIG. 2B is a cross-sectional view of the first bay and the bottom cell is taken as the reference in the tier direction (tier number = 1), the location of the cell at the top left of FIG. 2B can be expressed as (1, 1, 6), and the location of the cell at the top right of FIG. 2B can be expressed as (7, 1, 6).
[0016] For example, the planning device 10 calculates the loading range of cargo to be loaded at port A, which is defined by row number and bay number, whether cargo should be loaded within that range, and if so, how many cargo pieces should be loaded (vertically), for each destination, taking into consideration how the cargo should be arranged to maintain the center of gravity balance of the hull within an appropriate range.
[0017] (composition) As shown in FIG. 1, the planning device 10 includes a data acquisition unit 11, an input reception unit 12, a control unit 13, an output unit 14, and a storage unit 15. The data acquisition unit 11 acquires information necessary for creating a loading frame allocation plan, such as the structure of the ship 1, the cargo already loaded, the cargo destination, and the cargo weight, and stores the acquired information in the memory unit 15. It also has the function of formatting the acquired information so that it can be used in the optimization calculations described below. The input receiving unit 12 receives instruction information for instructing the execution of processing, etc., which is input using an input device such as a keyboard, a mouse, a touch panel, etc. The input receiving unit 12 outputs the received instruction information, etc., to the control unit 13.
[0018] The control unit 13 controls the execution of a process for planning loading slot allocation for each transport destination of cargo to be loaded onto the ship 1. The control unit 13 includes a constraint condition definition unit 131, an objective function definition unit 132, and an optimization calculation unit 133. The constraint condition definition unit 131 has the function of defining constraint conditions, such as cells (empty space) in which cargo can be loaded, the loadable weight per cell, and the center of gravity of the ship 1 being within an appropriate range, based on the information acquired by the data acquisition unit 11. The objective function definition unit 132 has a function to define an objective function that includes items such as maximizing the work efficiency of loading equipment such as gantry cranes used to load cargo onto the ship 1, and optimizing the balance of the ship 1, based on the information acquired by the data acquisition unit 11. The optimization calculation unit 133 has a function of optimizing the objective function defined in the objective function definition unit 132 while observing the constraint conditions defined in the constraint condition definition unit 131. The optimization calculation unit 133 is, for example, a mathematical optimization solver.
[0019] The output unit 14 outputs various information, such as the created stacking plan, to a display device or an electronic file. The storage unit 15 stores the information acquired by the data acquisition unit, data being processed, and the like.
[0020] (Information required to create a loading plan) FIG. 3 shows an example of input information for the plan creation process according to the embodiment. The data acquisition unit 11 acquires the information shown in FIG. 3 as input information required for creating a stowage frame allocation plan. For example, the data acquisition unit 11 acquires the number of the bay (CBC) located at the center in the fore-aft direction of the ship 1, the number of empty cells in the tier direction owned by row number r of bay number b (CT br ), the number of containers to be loaded with port d as the destination (CL d ), the upper limit of container weight that can be loaded in Bay number b and Row number r (CWM br ), and the average weight of containers destined for port d (CWA d ), the weight of the container already loaded in Bay number b, Row number r, Tier number t (CWS brt ), the upper limit of the number of Rows that can be used for containers destined for port d among the Rows owned by Bay number b (CRL bd), the upper limit of the number of destination ports for containers loaded in Bay number b and Row number r (CDL bd ), the upper limit of the number of bays that can hold containers destined for port d (CBL d ), and a value indicating how far forward the center of gravity of vessel 1 should be placed from the center to ensure visibility (CB bias ) The data acquisition unit 11 stores this information in the storage unit 15 as input information.
[0021] (variable) 4 shows an example of variables in the plan creation process according to the embodiment. The optimization calculation unit 133 performs optimization calculation of the stacking frame allocation plan, which will be described later, to calculate the variables VX brd , V.Y. brd , V.Y. db Calculate the optimal value of variable VX brd represents the number of containers destined for port d and loaded in row number r of bay number b. brd is a variable that indicates whether or not a container destined for port d is loaded in row number r of bay number b. db is a variable indicating whether or not a container destined for port d is loaded in bay number b.
[0022] In addition, although not shown, variables OB1 to OB4 related to the center of gravity balance of the vessel 1 are prepared. OB1 is a variable that represents the distance from the ideal vessel 1 center of gravity position to the position of the center of gravity when the center of gravity is shifted forward. OB2 is a variable that represents the distance from the ideal vessel 1 center of gravity position to the position of the center of gravity when the center of gravity is shifted backward. OB3 is a variable that represents the distance from the ideal vessel 1 center of gravity position to the position of the center of gravity when the center of gravity is shifted leftward. OB4 is a variable that represents the distance from the ideal vessel 1 center of gravity position to the position of the center of gravity when the center of gravity is shifted rightward.
[0023] (constraint conditions) 5A and 5B show examples of constraint conditions for the plan creation process according to the embodiment. The constraint condition definition unit 131 sets the constraint conditions shown in FIGS. 5A and 5B before the optimization calculation unit 133 performs optimization calculation for the stacking frame allocation plan.
[0024] For example, the following constraints (1) to (4) are set as constraints regarding the structure of the ship 1. (1) An upper limit is set for the number of rows in each bay. This constraint can be expressed by the constraint equation (a1) in FIG. 5A. brd and the variable VY bd This defines the relationship. (2) An upper limit is set for the number of tiers in each bay and each row. This constraint condition can be expressed by the constraint equation (a2) in FIG. 5A. brd and the variable VY brd This defines the relationship. (3) In each bay and row, the number of containers bound for a particular port cannot exceed the number of available tiers. This constraint can be expressed by the constraint formula (a3) in Figure 5A. (4) Containers cannot be loaded in each bay or row exceeding a certain weight limit. This constraint can be expressed by the constraint formula (a4) in FIG. 5A.
[0025] For example, based on the experience of a planner of the loading frame planning, the following constraints (5) to (7) are set. (5) Containers bound for one port are loaded into at most a certain number of bays. This constraint can be expressed by constraint formula (a5) in Figure 5A. (6) Containers bound for one port are loaded into at most a certain number of rows in one bay. This constraint can be expressed by constraint formula (a6) in Figure 5A. (7) Each bay and each row can only carry a certain number of containers bound for a particular port. This constraint can be expressed by the constraint formula (a7) in Figure 5A.
[0026] For example, the following constraint condition (8) is set as a requirement regarding containers to be loaded onto ship 1. (8) For all ports of call d, all containers to be loaded are loaded onto ship 1. This constraint condition can be expressed by constraint formula (a8) in FIG. 5B.
[0027] For example, regarding the center of gravity balance of the vessel 1, the following constraint conditions (9) to (12) are set. (9) The distance by which the center of gravity shifts forward from the center in the longitudinal direction (the number of containers) does not exceed the variable OB1. This constraint condition can be expressed by the constraint formula (a9) in FIG. 5B. (10) The distance that the center of gravity shifts backward from the center in the fore-and-aft direction (the number of containers) does not exceed the variable OB2. This constraint condition can be expressed by the constraint formula (a10) in FIG. 5B. (11) The distance by which the center of gravity shifts leftward from the center in the lateral direction (the number of containers) does not exceed the variable OB3. This constraint condition can be expressed by the constraint formula (a11) in FIG. 5B. (12) The distance by which the center of gravity shifts to the right from the center in the lateral direction (the number of containers) does not exceed variable OB4. This constraint condition can be expressed by constraint formula (a12) in FIG. 5B. The variables OB1 to OB4 are optimized using an objective function, which will be described later.
[0028] (Objective function) An example of an objective function of the plan creation process according to the embodiment is shown in Fig. 6. The objective function definition unit 132 sets an objective function constituted by the formulas (b1) to (b3) shown in Fig. 6, prior to the optimization calculation of the stacking frame allocation plan by the optimization calculation unit 133. The objective function is set, for example, by the following formula (c1). Objective function: (b1) + (b2) + (b3) (c1)
[0029] Equation (b1) is a formula for improving the efficiency of gantry cranes (logistics machinery). Ship 1 is moored with the side of its hull alongside land, and the gantry crane loads containers onto ship 1 while moving in the fore-aft direction (bay direction) of ship 1. Here, it is desirable to minimize the movement of the gantry crane in the bay direction as much as possible from the standpoint of power energy and travel time. The relationship between the actual amount of movement of the gantry crane and the number of bays used depends on how many gantry cranes are used for loading and unloading work, but it is thought that reducing the number of bays used will contribute to reducing the amount of movement of the gantry crane. Equation (b1) is expressed by the weight W b and the number of Bays used (variable VY bd ) The goal is to minimize the number of bays used by performing optimization calculations that minimize the objective function.
[0030] Formula (b2) is a formula for moving the center of gravity in the front-rear direction as close as possible to the ideal center of gravity position. Formula (b3) is a formula for moving the center of gravity in the left-right direction as close as possible to the ideal center of gravity position. However, the weight W b1 , W b2 , W b3 By appropriately setting the center of gravity, the center of gravity can be adjusted to a desired position.
[0031] The optimization calculation unit 133 calculates the variables VX such that the value of the objective function represented by the formula (c1) is minimized. brd , V.Y. brd , V.Y. bd Calculate.
[0032] (operation) Next, the flow of the process for creating a stacking plan in this embodiment will be described. FIG. 7 is a flowchart illustrating an example of a plan creation process according to the embodiment. First, the data acquisition unit 11 acquires various data and weighting coefficients Wb, W b1 , W b2 , W b3 Input data such as the value of W is obtained (step S1). b1 , W b2 , W b3Each value is appropriately set from the viewpoints of maintaining the center of gravity balance of the boat 1, ensuring visibility, and facilitating acceleration. The data acquisition unit 11 writes and stores the acquired various data in the storage unit 15.
[0033] Next, the user performs an operation to instruct the planning device 10 to create a stacking frame allocation plan. The input reception unit 12 receives this instruction operation and instructs the control unit 13 to execute a stacking frame allocation plan creation process. Then, the control unit 13 executes the following process using the constraint condition definition unit 131, the objective function definition unit 132, and the optimization calculation unit 133. First, the constraint condition definition unit 131 sets the constraint conditions (step S2). The constraint condition definition unit 131 sets the constraint expressions exemplified in Fig. 5A and Fig. 5B as the constraint conditions. Next, the objective function definition unit 132 sets an objective function (step S3). The objective function definition unit 132 uses the weighting coefficient W b , W b1 , W b2 , W b3 is read from the storage unit 15 and used to set the objective function.
[0034] Next, the optimization calculation unit 133 performs calculations to optimize the stacking frame allocation plan (step S4). Here, the optimization calculation unit 133 is a solver that solves an optimization problem. The optimization calculation unit 133 solves an optimization problem formulated by the constraint conditions set in step S2 and the objective function set in step S3, and calculates a variable VX that minimizes the value of the objective function set in step S3 while satisfying the constraint conditions set in step S2. brd , variable VY brd , variable VY db For example, the weighting factor W b If is 0, the center of gravity is the variable VX such that equation (b2) + equation (b3) in Figure 6 is minimized. brd , variable VY brd , variable VY db Calculate.
[0035] Next, the output unit 14 outputs the created plan (step S5). For example, the output unit 14 displays the range in which the containers should be loaded (range of bays and rows) on the image of the ship hull exemplified in Fig. 2A and Fig. 2B.
[0036] (effect) As described above, according to this embodiment, a loading frame arrangement plan can be created that takes into account the balance of the center of gravity of the hull. Furthermore, in addition to optimizing the balance of the center of gravity of the hull, a loading frame arrangement plan can be created that improves the efficiency of the operation of the gantry crane.
[0037] FIG. 8 is a diagram illustrating an example of a hardware configuration of the planning device according to the embodiment. The computer 900 includes a CPU 901 , a main memory device 902 , an auxiliary memory device 903 , an input / output interface 904 , and a communication interface 905 . The planning device 10 described above is implemented in a computer 900. Each of the above-mentioned functions is stored in the auxiliary storage device 903 in the form of a program. The CPU 901 reads the program from the auxiliary storage device 903, loads it in the main storage device 902, and executes the above-mentioned processing in accordance with the program. The CPU 901 also reserves a storage area in the main storage device 902 in accordance with the program. The CPU 901 also reserves a storage area in the auxiliary storage device 903 for storing data being processed in accordance with the program.
[0038] In addition, a program for realizing all or part of the functions of the planning device 10 may be recorded in a computer-readable recording medium, and the program recorded in the recording medium may be read into a computer system and executed to perform processing by each functional unit. The term "computer system" as used herein includes hardware such as an OS and peripheral devices. In addition, if a WWW system is used, the term "computer system" also includes a homepage providing environment (or display environment). In addition, the term "computer-readable recording medium" refers to a portable medium such as a CD, DVD, or USB, and a storage device such as a hard disk built into a computer system. In addition, when the program is distributed to the computer 900 through a communication line, the computer 900 that receives the program may expand the program in the main storage device 902 and execute the above processing. In addition, the above program may be for realizing part of the above-mentioned functions, and may further be capable of realizing the above-mentioned functions in combination with a program already recorded in the computer system.
[0039] As described above, several embodiments according to the present disclosure have been described, but all of these embodiments are presented as examples and are not intended to limit the scope of the invention. These embodiments can be implemented in various other forms, and various omissions, substitutions, and modifications can be made without departing from the gist of the invention. These embodiments and their modifications are included in the scope of the invention and its equivalents as described in the claims, as well as in the scope and gist of the invention.
[0040] <Additional Notes> The planning device, the planning method, and the program described in each embodiment can be understood, for example, as follows.
[0041] (1) The planning device 10 of the first aspect includes a data acquisition unit that acquires the position of the center of gravity of a ship, the number and weight of cargo to be loaded onto the ship by destination, and location information of vacant space on the ship where the cargo can be loaded, a constraint condition definition unit that sets as constraint conditions a constraint equation that constrains the distance between the position of the center of gravity of the ship and a desired center of gravity position to be within a predetermined range, a constraint equation that conditions that all of the cargo is loaded, and a constraint equation that limits the number and weight of the cargo to be loaded in the vacant space within the predetermined range to below their upper limit values, an objective function definition unit that sets the size of the predetermined range as an objective function, and an optimization calculation unit that calculates the range of the vacant space in which to load the cargo by destination so as to minimize the objective function while satisfying the constraint conditions. This makes it possible to create a loading plan that takes into account the ship's center of gravity balance.
[0042] (2) A planning device 10 according to a second aspect is the planning device of (1), wherein the objective function definition unit further sets, as an objective function, the size of the fore-aft range on the ship occupied by the vacant space for loading the cargo for each transport destination. This makes it possible to narrow the area of the empty space in which cargo can be loaded. By narrowing the area of the empty space to be loaded, the travel range of the gantry crane can be narrowed, making loading and unloading operations more efficient.
[0043] (3) A planning device 10 according to a third aspect is the planning device of (1) to (2), and the constraint condition definition unit further sets as the constraint conditions a constraint equation that limits the longitudinal range of the ship occupied by the vacant space for loading the cargo of one of the transport destinations, a constraint equation that limits the lateral range of the ship occupied by the vacant space for loading the cargo of one of the transport destinations, and a constraint equation that limits the number of transport destinations that can be loaded into a specified range of the vacant space. By incorporating the knowledge gained from experienced planners into the constraints, an optimal plan can be created.
[0044] (4) The planning device 10 of the fourth aspect is a planning device of (1) to (3), wherein the vacant space is defined by the fore-aft position, the lateral position, and the up-down position of the ship, and the optimization calculation unit calculates the number of cargoes to be loaded within the range of the vacant space defined by the fore-aft position and the lateral position of the ship. This makes it possible to calculate how many cargoes will be loaded into the area defined by the bay and row, rather than determining which specific cargoes will be loaded into each cell defined by the bay, row, and tier.
[0045] (5) A planning device 10 according to a fifth aspect is a planning device according to (1) to (4), wherein the constraint equation constraining the distance between the center of gravity position of the ship and a desired center of gravity position to be within a predetermined range includes a constraint equation constraining the distance by which the center of gravity position of the ship shifts forward from the desired center of gravity position to be within a predetermined first range, a constraint equation constraining the distance by which the center of gravity position of the ship shifts aft from the desired center of gravity position to be within a predetermined second range, a constraint equation constraining the distance by which the center of gravity position of the ship shifts leftward from the desired center of gravity position to be within a predetermined third range, and a constraint equation constraining the distance by which the center of gravity position of the ship shifts rightward from the desired center of gravity position to be within a predetermined fourth range, and the objective function calculates the size of the predetermined range based on the first range, the second range, the third range, and the fourth range. This makes it possible to create a stacking frame plan that adjusts for forward, rearward, and left-right shifts in the center of gravity balance.
[0046] (6) A planning method according to a sixth aspect includes the steps of acquiring the position of the center of gravity of a ship, the number and weight of cargo to be loaded onto the ship by destination, and location information of vacant space on the ship where the cargo can be loaded; setting as constraint conditions a constraint equation that constrains the distance between the position of the center of gravity of the ship and the desired center of gravity position to be within a specified range, a constraint equation that conditions that all of the cargo is loaded, and a constraint equation that limits the number and weight of the cargo to be loaded in the vacant space within the specified range to below their upper limit values; setting the size of the specified range as an objective function; and calculating the range of the vacant space in which to load the cargo by destination so as to minimize the objective function while satisfying the constraint conditions.
[0047] (7) The program of the seventh aspect causes a computer 900 to execute the steps of acquiring the position of the center of gravity of a ship, the number and weight of cargo to be loaded onto the ship by destination, and location information of vacant space on the ship where the cargo can be loaded; setting as constraint conditions a constraint equation that constrains the distance between the position of the center of gravity of the ship and the desired center of gravity position to be within a specified range, a constraint equation that conditions that all of the cargo is loaded, and a constraint equation that limits the number and weight of the cargo to be loaded in the vacant space within the specified range to below their upper limit values; setting the size of the specified range as an objective function; and calculating the range of the vacant space in which to load the cargo by destination so as to minimize the objective function while satisfying the constraint conditions. [Explanation of symbols]
[0048] 1...ship 10. Planning device 11 Data acquisition section 12 Input reception section 13. Control section 131...constraint definition part 132...Objective function definition part 133 Optimization Calculation Section 14 Output section 15...Storage section 900...Computer 901···CPU 902...Main memory 903...Auxiliary storage device 904 Input / Output Interface 905 Communication Interface
Claims
1. a data acquisition unit that acquires a center of gravity position of a ship, the number and weight of cargo to be loaded on the ship by destination, and location information of vacant space on the ship where cargo can be loaded; a constraint condition definition unit which sets, as constraint conditions, a constraint equation which constrains the distance between the center of gravity of the ship and a desired center of gravity to be within a specified range, a constraint equation which conditions that all of the cargo be loaded, and a constraint equation which limits the number and weight of the cargo to be loaded in the vacant space within a specified range to be equal to or less than their upper limit values; an objective function definition unit that sets, as an objective function, a weighted sum of a first calculation formula that calculates a distance in the longitudinal direction between the center of gravity position of the vessel, which indicates the predetermined range in the longitudinal direction of the vessel, and the desired center of gravity position, and a second calculation formula that calculates a distance in the transverse direction between the center of gravity position of the vessel, which indicates the predetermined range in the transverse direction of the vessel, and the desired center of gravity position; an optimization calculation unit that calculates, for each of the transportation destinations, a range of the vacant space in which the cargo is loaded that minimizes the objective function while satisfying the constraint conditions; A planning device comprising:
2. the objective function definition unit sets, as the objective function, a weighted sum of a third formula for calculating a range in the longitudinal direction of the ship occupied by the vacant space for loading the cargo for each transport destination, the first formula, and the second formula; The planning device of claim 1 .
3. the constraint condition definition unit further sets, as the constraint conditions, a constraint equation that limits a range in the forward-rearward direction of the ship that is occupied by the vacant space for loading the cargo of one of the transport destinations, a constraint equation that limits a range in the left-right direction of the ship that is occupied by the vacant space for loading the cargo of one of the transport destinations, and a constraint equation that limits the number of the transport destinations that can be loaded into a specified range of the vacant space; A planning device according to claim 1 or 2.
4. The vacant space is defined by a longitudinal position, a transverse position, and a vertical position of the vessel, the optimization calculation unit calculates the number of cargoes to be loaded into a range of the vacant space defined by a longitudinal position and a transverse position of the ship; A planning device according to claim 1 or 2.
5. the constraint equations that constrain the distance between the center of gravity position of the vessel and the desired center of gravity position to be within a predetermined range include a constraint equation that constrains the distance by which the center of gravity position of the vessel shifts forward from the desired center of gravity position to be within a predetermined first range, a constraint equation that constrains the distance by which the center of gravity position of the vessel shifts rearward from the desired center of gravity position to be within a predetermined second range, a constraint equation that constrains the distance by which the center of gravity position of the vessel shifts leftward from the desired center of gravity position to be within a predetermined third range, and a constraint equation that constrains the distance by which the center of gravity position of the vessel shifts rightward from the desired center of gravity position to be within a predetermined fourth range, the first calculation formula calculates the predetermined range in the longitudinal direction of the vessel based on the first range and the second range, and the second calculation formula calculates the predetermined range in the transverse direction of the vessel based on the third range and the fourth range. A planning device according to claim 1 or 2.
6. 1. A computer-implemented planning method comprising: The computer acquires a center of gravity position of the ship, the number and weight of cargo to be loaded on the ship by destination, and location information of vacant space on the ship where cargo can be loaded; A step in which the computer sets, as constraint conditions, a constraint equation that constrains the distance between the center of gravity of the ship and a desired center of gravity to be within a specified range, a constraint equation that conditions loading all of the cargo, and a constraint equation that limits the number and weight of the cargo to be loaded into the vacant space within a specified range to less than or equal to their upper limits; A step in which the computer sets, as an objective function, a weighted sum of a first calculation formula for calculating a longitudinal distance between the position of the center of gravity of the vessel, which indicates the predetermined range in the longitudinal direction of the vessel, and the desired position of the center of gravity, and a second calculation formula for calculating a transverse distance between the position of the center of gravity of the vessel, which indicates the predetermined range in the transverse direction of the vessel, and the desired position of the center of gravity, with respect to the predetermined range; A step in which the computer calculates, for each of the transportation destinations, a range of the vacant space in which the cargo is loaded that minimizes the objective function while satisfying the constraint conditions; A planning method having the following features:
7. On the computer, Acquiring a center of gravity position of a ship, the number and weight of cargo to be loaded on the ship by destination, and location information of vacant space on the ship where cargo can be loaded; a step of setting, as constraint conditions, a constraint equation that constrains the distance between the center of gravity of the ship and a desired center of gravity to be within a specified range, a constraint equation that conditions loading all of the cargo for each destination, and a constraint equation that limits the number and weight of the cargo to be loaded in the vacant space within a specified range to below their upper limit values; a step of setting, as an objective function, a weighted sum of a first equation for calculating a longitudinal distance between the center of gravity position of the vessel, which indicates the predetermined range in the longitudinal direction of the vessel, and the desired center of gravity position, and a second equation for calculating a transverse distance between the center of gravity position of the vessel, which indicates the predetermined range in the transverse direction of the vessel, and the desired center of gravity position; calculating, for each of the transport destinations, a range of the vacant space in which the cargo is loaded that minimizes the objective function while satisfying the constraints; A program that executes the following.
Citation Information
Patent Citations
Loading plan preparing method
JP1985077035A
Automatic preparation system for stowage plan in ship
JP1993002573A
Method and device for planning and preparing inboard loading position
JP1998305929A
Shipping schedule formation method
JP2001247219A
Cargo assignment system
JP2003173366A
