Optimization strategy generation method for local space arrangement of cruise ship

Abstract

The invention relates to the technical field of ship internal arrangement, in particular to an optimization strategy generation method for local space arrangement of a cruise ship. The method comprises the following steps of: converting a space accessibility relation into a computable structure formed by a unit-level actual geometric state from an overall parameter constraint, and performing path extraction on an accessibility unit section by taking a node weight and a connected edge as input by utilizing a Dijkstra algorithm, so that continuity judgment has serialized and comparable characteristics; after difference and angle quantization processing is carried out on space corresponding relations between nodes in the block connection chain and control points and between supporting nodes and functional anchor points, exchange and replacement actions are executed by utilizing a genetic algorithm, so that sequence screening is controlled by three types of elements including a space distance sequence, a turning angle sequence and an offset sequence; and the sequence result is converted from an abstract adjacency relation to a sequence driven by a real space partial sequence.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of ship interior arrangement, in particular to a method for generating an optimization strategy of local space arrangement of a cruise ship. BACKGROUND

[0002] The technical field of ship interior arrangement takes the limited space of a ship body as a constraint, establishes a layout rule system around four types of quantitative indexes of safety performance, space utilization efficiency, streamline organization and function synergy, takes the limited space of a ship body as a constraint condition, takes the upper limit of evacuation distance, the lower limit of passage width, the adjacency matrix of functional units, the upper limit of area utilization rate, the lower limit of streamline average length and the lower limit of maintenance passage width as control parameters, and constructs cabin arrangement rules, functional area combination rules and traffic path organization rules.

[0003] A method for generating an optimization strategy of space arrangement of a cruise ship aims to establish an executable layout strategy set under the conditions of ship body size, cabin number, functional demand matrix and multiple engineering constraints, quantitatively set the cabin combination relationship, functional area adjacency threshold, evacuation path length threshold, traffic path length threshold, service coverage threshold and area utilization rate threshold, and generate a strategy meeting the requirements of safety, streamline organization and space utilization, so as to provide structured rules directly applicable for subsequent layout solving and overall plan compilation.

[0004] The prior art takes limited space as a constraint and constructs a layout rule system with multiple quantitative indexes when arranging a ship interior, but relies on overall parameterized constraints in actual processing and lacks unit-level connectivity verification, so that local connected blocked areas are difficult to be accurately identified at the rule level, leading to potential incoherent sections in path organization, and when constructing functional area combination rules based on adjacency matrix and area utilization rate, only abstract relationships are usually processed, without checking real geometry fitting and boundary continuity, so that area combination may not match the actual geometry, and in the traffic path organization rules, the lower limits of evacuation path length and passage width are taken as control conditions, but the node-level direction sequence, turning amount and offset continuity are not serialized, so that path direction changes may produce unstable sections. SUMMARY

[0005] The present application aims to solve the shortcomings in the prior art and provides a method for generating an optimization strategy of local space arrangement of a cruise ship.

[0006] To achieve the above-mentioned purpose, the present application adopts the following technical scheme: a method for generating an optimization strategy of local space arrangement of a cruise ship, comprising the following steps: S1: based on the bulkhead contour of the cabin center line, cabin section reference line and design drawing, the boundary position, structural interference and interconnection conditions of the passable unit inside the cabin section are checked in each grid, and the Dijkstra algorithm is used to extract the unit section with continuous accessibility as the basic passable framework, and the cabin passable structure set is arranged; S2: in the passable band range formed by the cabin passable structure set, along the personnel flow direction, the unit chain that can be used as continuous path is screened out by combing the adjacent unit trend and connection order, and the block connection chain group is generated; S3: based on the block connection chain group, the spatial correspondence between each node in the chain group and the cabin control point, service support node and regional function anchor point is checked item by item, and the distance difference, turning amount and along-path offset between nodes are sequenced and compared, the genetic algorithm is used, the exchange and replacement actions are performed in the block arrangement as the iteration unit in the comparison process, and the sequence priority arrangement set is generated by screening according to the relative order in the node group; S4: according to the sequence priority arrangement set, the adjacent blocks of guest room units and functional cabin sections are classified according to the outer contour and distance, the block groups with continuous numbering and boundary fitting are merged, and the continuous region combination body is obtained; S5: based on the continuous region combination body, the arrangement sequence and pointing relationship of each combination body in the cabin section are determined by combining the cabin path node and regional edge connection order, the result is written into the arrangement record to form the arrangement entry set.

[0007] As a further scheme of the application, the cabin passable structure set includes passable grid units, grid connection edges and passable continuous chain sections, the block connection chain group includes block node sequence, block connection edge group and block trend identification group, the sequence priority arrangement set includes node arrangement sequence, node distance difference group and node turning distribution group, the continuous region combination body includes continuous block group, block boundary line group and block number chain, and the arrangement entry set includes arrangement entry record group, path node correspondence group and block index sequence group.

[0008] As a further scheme of the application, the specific steps for generating the cabin passable structure set are as follows: Based on the bulkhead contour of the cabin center line, cabin section reference line and design drawing, the boundary line position of the passable unit is checked in each grid, and the distance between the unit and the adjacent structure is compared, and it is judged whether the unit connection edge exists or not, and the unit boundary checking set is generated; Based on the unit boundary checking set, the contact side length between each unit is compared in sequence, and the center point connection direction between adjacent units is checked, and the units with incomplete contact are removed, the units maintaining continuity are combined into sections, and the continuous unit section group is generated; Based on the continuous unit segment group, a Dijkstra algorithm is used to arrange the direction consistency of the segments and to remove the direction jump segments, and a through segment is constructed according to the segment serial number chain, the through segment is formed into a passable framework, and a cabin segment passable structure set is generated.

[0009] As a further scheme of the application, the Dijkstra algorithm first marks the segment endpoints as nodes and forms a connected edge with the segment based on the continuous unit segment group, and then selects a starting node and sets an initial distance, places all nodes into an unmarked set, repeatedly selects a node with the minimum distance from the set, calculates the cumulative weight of the adjacent nodes via the node, updates the record when the cumulative value is small, marks the predecessor and removes the processed node, traces back from the target node to the starting node according to the predecessor relationship of the target node to generate a node sequence, and arranges the through segment to form a cabin segment passable structure set.

[0010] As a further scheme of the application, the specific steps for generating the block connection chain group are: Based on the passable band range formed by the cabin segment passable structure set, the displacement direction of the center points between adjacent passable units is checked segment by segment, and the advancing direction is judged in combination with the butt joint condition of the unit edge line, and a continuous chain segment is constructed according to the units with consistent sequence connection direction to generate a direction continuous unit sequence. Based on the direction continuous unit sequence, the fitting edges of adjacent units in the sequence are viewed and the fitting length is recorded, and in the viewing process, it is identified whether the connection of the fitting segment is interrupted, and the unit combination is integrated in a chain arrangement that maintains stable fitting to generate a block connection chain group.

[0011] As a further scheme of the application, the specific steps for generating the sequence priority arrangement set are: Based on the block connection chain group, the spatial distance between the chain group nodes and the cabin control points is checked, and the horizontal offset between the nodes and the service support nodes is checked, and the relative orientation relationship between the nodes and the regional function anchor points is supplemented to generate a node spatial correspondence set. Based on the node spatial correspondence set, the distance difference between the nodes is compared and the turning angle amount of adjacent nodes is counted, and the continuity of the direction offset along the path is checked, and the node sequence that satisfies the spatial order after arrangement is solidified as an intermediate sequence to generate a node sequence arrangement set. Based on the node sequence arrangement set, a genetic algorithm is used to perform exchange and replacement actions in turn according to the block arrangement as an iteration unit, and in the execution process, sequence combinations that maintain relative order stability within the node group are screened, and the sequence combinations that meet the conditions are integrated into an arrangement list to generate a sequence priority arrangement set.

[0012] As a further scheme of the present application, the genetic algorithm first sets each node sequence as an iterable unit based on the node sequence set, records the evaluation value formed by the difference in distance between nodes and the turning angle value for each sequence as an initial sequence set, then generates new sequences in a fixed position fragment exchange manner and forms variable sequences in a local position replacement manner in iteration, compares the evaluation value of the new sequence with the evaluation value of the original sequence one by one, replaces the original sequence with the new sequence when the evaluation value is lower, and keeps the corresponding node order record, and after multiple rounds of iteration, the sequence combination with relatively stable order and lower evaluation value is screened from all the retained sequences to form a sequence priority arrangement set.

[0013] As a further scheme of the present application, the specific steps for generating the continuous region combination are: Based on the sequence priority arrangement set, the close line segments between the outer contours of the area blocks and the room unit contours are compared in sections, the proximity judgment is performed in combination with the distance difference between the functional cabins and the blocks, the blocks with clear proximity relationship are grouped according to the contact density, and the boundary adjacent block group is generated. Based on the boundary adjacent block group, the mutual difference value of the block numbers is consulted and the number continuity is checked, the number jump block is removed during the consultation, and the region segment is arranged according to the block combination corresponding to the continuous number to generate the continuous region combination.

[0014] As a further scheme of the present application, the specific steps for generating the arrangement item set are: Based on the continuous region combination, the arrangement direction of the nodes of the outer edge line of the combination is combed in sections and the direction sequence is recorded, the order difference between the nodes is compared during the combing process, the direction of the extension of the outer edge line along the cabin segment is compiled into a sequence framework, and the combination arrangement basis is generated. Based on the combination arrangement basis, the corresponding relationship between the combination sequence number and the cabin path node sequence number is arranged one by one and the mutual position is fixed, the sequence of the path nodes is written into the item during the arrangement, and the item content is summarized according to the cabin segment arrangement direction to generate the arrangement item set.

[0015] As a further scheme of the present application, the sequence of the path nodes written into the item, after arranging the sequence numbers of the cabin path nodes, the node sequence numbers obtained by the arrangement are sequentially listed in the record unit according to the actual travel order, the record unit sequentially adds the node identifier, the section index where the node is located, and the position number of the node in the sequence one by one according to the node sequence number order, the above record units are arranged in sequence to form a linear item structure, and the item completely presents the arrangement sequence relationship of the path nodes.

[0016] Compared with the prior art, the present application has the advantages and positive effects that: In the application, the spatial accessibility relationship is changed from overall parameter constraint to calculable structure composed of actual geometric state of unit level by point-by-point judgment of unit boundary, interference term and connectivity condition in a discrete manner, and the path of accessible unit section is extracted by using Dijkstra algorithm with node weight and connected edge as input, so that the continuity judgment has the characteristics of serialization and comparability. In the application, the spatial correspondence between the nodes in the block connection chain and the control points, support nodes and functional anchor points is subjected to difference processing and angular quantization, and then genetic algorithm is used to perform exchange and replacement actions, so that the sequence screening is controlled by three types of elements, i.e., spatial distance sequence, turning angle sequence and offset sequence, and the sequence result is changed from abstract adjacency relationship to sequence driven by real spatial partial order. In the application, the geometric proximity is used as the quantization input in block classification, so that the boundary of the continuous region is determined by the geometric proximity, and in the final arrangement, the region combination is inserted into the cabin section sequence with the path node sequence as a reference, so that the arrangement item is controlled by the path direction and the edge connection sequence, and gains are obtained in cabin internal space organization, path continuity judgment, region combination stability and arrangement direction consistency. BRIEF DESCRIPTION OF DRAWINGS

[0017] Figure 1 It is a schematic diagram of the main steps of the application. DETAILED DESCRIPTION

[0018] In order to make the purpose, technical scheme and advantages of the application clearer, the application will be further described in detail below in combination with the drawings and examples. It should be understood that the specific examples described herein are only used to explain the application and do not limit the application.

[0019] Example one, please refer to Figure 1 The application provides a technical scheme: a method for generating an optimization strategy of a local space arrangement of a cruise ship, comprising the following steps: S1: based on the cabin center line, the cabin reference line and the cabin wall contour of the design drawing, the boundary position, structural interference and connectivity condition of the passable unit in the cabin are checked, and the Dijkstra algorithm is used to extract the unit section with continuous accessibility as the basic passable framework, and the cabin passable structure set is arranged; S2: in the passable structure set formed by the cabin, the adjacent unit trend and connection order are combed along the personnel flow direction, the unit chain that can be used as a continuous path is screened out, and the block connection chain group is generated; S3: Based on the block connection chain group, the spatial correspondence between each node in the chain group and the cabin control point, service support node and regional function anchor point is checked item by item, and the distance difference, turning amount and along-path offset between nodes are serialized and compared. Genetic algorithm is used. In the comparison process, the block arrangement is used as the iteration unit to perform exchange and replacement actions, and the relative order in the node group is screened to generate a sequence priority arrangement set; S4: According to the sequence priority arrangement set, the blocks adjacent to the guest room unit and the functional cabin section are classified according to the outer contour and the distance. The block groups with continuous numbering and boundary fitting are merged to obtain a continuous region combination body; S5: Based on the continuous region combination body, the arrangement sequence and the connection sequence of the cabin path nodes and the region edges are determined to determine the arrangement sequence and the pointing relationship of each combination body in the cabin section. The result is written into a layout record to form a layout item set.

[0020] The cabin passable structure set includes passable grid units, grid connection edges, and passable continuous chain segments. The block connection chain group includes block node sequences, block connection edge groups, and block direction identification groups. The sequence priority arrangement set includes node arrangement sequences, node distance difference groups, and node turning distribution groups. The continuous region combination body includes continuous block groups, block boundary line groups, and block number chains. The layout item set includes layout item record groups, path node correspondence groups, and block index sequence groups.

[0021] The specific steps for generating the cabin passable structure set are as follows: Based on the cabin center line, the cabin reference line and the cabin wall contour of the design drawing, the boundary line position of the passable unit is checked and the distance between the unit and the adjacent structure is compared. It is also determined whether the connecting edge of the unit is blocked to generate a unit boundary verification set; Based on the unit boundary verification set, the contact side length between each unit is compared in sequence, and the center point connection direction between adjacent units is checked. At the same time, units with incomplete contact are removed, and units that maintain continuity are combined into sections to generate a continuous unit section group; Based on the continuous unit section group, the Dijkstra algorithm is used to arrange the direction consistency of the section and remove the direction jump section. At the same time, the through section is constructed according to the section serial number chain, and the through section is formed into a passable skeleton to generate the cabin passable structure set; Based on the cabin centerline, cabin section reference line and design drawing bulkhead contour, the homogeneous coordinate transformation method is used to convert the drawing point set to the cabin section coordinate set. The scanning line grid division method is used to generate 50mm grid and number. The unit boundary is checked by the boundary judgment command. The command input cabin bulkhead line segment set and the tolerance is 5mm. 20 sampling points are generated for each segment. The unit and structure spacing is checked by the spacing checking command. The command samples by 10mm step and takes 400mm as the threshold. The unit connected side is checked by the connected side judgment command and takes 1mm as the intersection tolerance. The record is written into the set to generate the unit boundary checking set; Based on the unit boundary checking set, the side contact comparison command is used to compare the multiple unit contact sides. The command samples by 5mm step and takes 50% of the unit side length as the overlap threshold. The direction comparison command is used to compare the center point direction and generates direction levels by 10 degrees step. The incomplete contact unit is removed by the unit removal command and takes 1 complete side as the number threshold. The continuous unit section group is combined by the section group combination command and takes 100mm as the maximum center point distance. The combination result is written into the set to generate the continuous unit section group. Based on the continuous unit section group, the node and undirected edge are established by the section graph construction command and recorded to the adjacency table. The node sequence is generated by the Dijkstra algorithm path calculation command. The direction consistency arrangement command is used to remove the direction jump segment and takes 45 degrees as the included angle threshold. The chain table is connected by the through section chain construction command and recorded to the linked list. The skeleton polyline centerline is generated by the skeleton polyline generation command to form the passable skeleton and generate the cabin section passable structure set.

[0022] The Dijkstra algorithm is based on the continuous unit section group. The section endpoints are marked as nodes and the section forms a connected edge with the length turning amount congestion weight superimposed weight value. Then the starting node is selected and the initial distance is set. All nodes are placed in the unmarked set. Then the node with the minimum distance is repeatedly selected from the set and the cumulative weight value of its adjacent nodes is calculated. When the cumulative value is small, the record is updated and the predecessor is marked and the processed node is removed. According to the predecessor relationship of the target node, the node sequence is generated from the target node to the starting node to form the cabin section passable structure set; The Dijkstra algorithm is according to the formula:

[0023] Wherein: represents the minimum passage value obtained by synthesizing the passage cost of multiple candidate through sections in the cruise ship space layout optimization process, represents the candidate through section path composed of multiple continuous unit sections in the cabin section, representing a set of multiple candidate through-section path, representing a candidate through-section path containing the number of unit sections, representing the serial number of the unit section, representing the actual geometric length of the unit section, representing the difference in directional angle between the unit section and its previous unit section, representing the directional curvature consistency index of the unit section, representing the safety level penalty factor of the unit section, representing the congestion risk coefficient of the unit section, representing the length cost weight coefficient acting on the length parameter , representing the directional jump cost weight coefficient acting on the directional jump parameter , representing the weight coefficient acting on the directional curvature consistency index , representing the weight coefficient acting on the safety level penalty factor , representing the weight coefficient acting on the congestion risk coefficient ; Execution process: first, in the cabin section, a set of multiple continuous unit sections is constructed according to the serial number chain , in the set , for each candidate through-section path , the length of the unit section in the path is read in sequence , the difference in directional angle between the unit section and the previous unit section is calculated , the directional curvature consistency index is calculated based on the stability of the directional change of the unit section and multiple unit sections before and after it , the safety level penalty factor is calculated according to the cabin clearance, obstacle clearance and evacuation level , the congestion risk coefficient is determined according to the historical traffic flow and cabin function , the length cost weight , the directional jump cost weight , the directional curvature consistency weight , the safety level penalty weight , and the congestion risk weight respectively multiplied by the corresponding parameters to form a unit section passage cost item, and then the candidate through section path inside the to The passage cost items are added to obtain a path comprehensive passage cost, and the comprehensive passage cost values of all candidate through section paths in the set The minimum comprehensive passage cost value is obtained by performing operations on the comprehensive passage cost values, and the final through section path in the cruise ship cabin section passable structure set is determined to generate an optimized strategy output result.

[0024] The specific steps for generating the block connection chain group are as follows: Based on the passage band range formed by the cabin section passable structure set, the displacement direction of the center points between adjacent passage units is checked, the advancing direction is judged in combination with the docking condition of the unit edge line, and the unit sequence with consistent sequence connection direction is constructed to generate a direction continuous unit sequence; Based on the direction continuous unit sequence, the fitting edges of adjacent units in the sequence are viewed and the fitting length is recorded, and in the viewing process, whether the connection of the fitting section is interrupted is identified, and the unit combination is integrated in the chain arrangement that keeps fitting stable to generate a block connection chain group; Based on the passage band range formed by the cabin section passable structure set, the displacement direction of the center points between adjacent passage units is checked using the direction analysis command, which inputs two center point coordinates and a direction step of 10 degrees and outputs a direction level, and the unit edge line is sampled using the edge line matching command at a step of 5 mm and recorded with a matching tolerance of 1 mm. The chain segment construction command is used to add the units with similar direction levels and continuous docking to the chain segment in sequence and write them into the chain segment record table to generate a direction continuous unit sequence; Based on the direction continuous unit sequence, the fitting edges of adjacent units in the sequence are viewed and the fitting length is recorded, and in the viewing process, whether the connection of the fitting section is interrupted is identified, and the unit combination is integrated in the chain arrangement that keeps fitting stable to generate a block connection chain group;

[0025] The specific steps for generating the sequence priority arrangement set are as follows: Based on the block connection chain group, the spatial distance between the chain group nodes and the engine room control points is checked, and the horizontal offset between the nodes and the service support nodes is checked, and the relative orientation relationship between the nodes and the regional function anchor points is supplemented to generate a node space correspondence set; Based on the node space correspondence set, the distance difference between the nodes is compared and the turning angle amount of adjacent nodes is counted, and the continuity of the direction offset along the path is checked, and the node sequence that satisfies the spatial order after arrangement is solidified as an intermediate sequence to generate a node sequence arrangement set. Based on the node sequence arrangement set, genetic algorithm is adopted, and the block arrangement is arranged as an iteration unit to execute the exchange and replacement actions in turn, and in the execution process, the sequence combination that maintains the relative order stability in the node group is screened, the sequence combination that meets the conditions is collected as the arrangement list, and the sequence priority arrangement set is generated; Based on the block connection chain group, the distance between the chain group nodes and the cabin control points is checked by the space distance checking command, the node coordinate table and the control point coordinate table are input, the distance value is taken item by item according to the node index, and the value is recorded, the horizontal offset between the node and the service support node is taken by the horizontal offset checking command in the single-axis difference mode, and the offset is written into the offset record, the relative orientation between the node and the regional function anchor point is quantized by the orientation comparison command in 10-degree steps, and the quantized number is recorded, and the multiple distance records and orientation numbers are written into the node corresponding record table to generate the node space corresponding set; Based on the node space corresponding set, the multiple distances between the nodes are taken in sequence by the node distance comparison command to generate the difference value sequence, the adjacent node turning angle amount is taken by the angle amount calculation command in the adjacent node connection angle mode, and the number is quantized in 5-degree steps, the along-the-way direction offset is checked in sequence by the direction continuity checking command, the non-continuous segment is marked, and the nodes that meet the sequence condition after adjustment are written into the sequence solidification table to generate the node sequence arrangement set; Based on the node sequence arrangement set, genetic algorithm is adopted to execute the action by taking the block arrangement as an iteration unit, the block sequence, the iteration number 100, the population size 50, the crossover probability 0.6 and the mutation probability 0.1 are input, the exchange action is executed in the double-point exchange mode in the iteration, the replacement action is executed in the sequence replacement mode, the sequence generated in each iteration is screened by the sequence stability screening command according to the condition that the node direction level difference is less than 10 degrees, and the combination is written into the arrangement list structure to generate the sequence priority arrangement set.

[0026] Firstly, based on the node sequence arrangement set, each node sequence is set as an iterable unit and as an initial sequence set, and the evaluation quantity formed by the distance difference between the nodes and the turning angle amount is recorded for each sequence, then in the iteration, the new sequence is generated in the fixed position fragment exchange mode, and the variable sequence is formed in the local position replacement mode, the evaluation quantity of the new sequence and the original sequence evaluation quantity are compared one by one, and when the evaluation quantity is lower, the new sequence replaces the original sequence and the corresponding node order record is retained, and after multiple iterations, the sequence combination that is relatively stable in sequence and has a lower evaluation quantity is screened from all the retained sequences, the sequence combination is arranged as the arrangement list to form the sequence priority arrangement set; Genetic algorithm, according to the formula:

[0027] Among them: This represents the evaluation value obtained after comprehensively evaluating the sequence perturbation of the node arrangement scheme during the generation of the cruise ship space layout optimization strategy. This represents a node sequence arrangement scheme generated based on a node sequence set and through block swapping and replacement operations. This represents the number of blocks obtained by dividing the node sequence set. Represents a block The internal set of node pairs needs to maintain a relatively stable order. This indicates the number of the first node in the node pair used for order determination. This indicates the number of the second node in the node pair used for order determination. Represents a block The order stability weight coefficient, Represents node pairs In the arrangement scheme An indicator function for whether the relative order is violated, when the node Arrangement position precedes node The value is zero when the node The arrangement position lags behind the node The value is one. Represents a block The order stability amplification factor, Represents node pairs Adjacency expectation tag, This represents the node priority weight coefficient. Represents a node The order of priority levels This represents the penalty coefficient for expected spacing deviation. In the permutation scheme Middle node With nodes The difference in the position of the serial number, Represents node pairs Reference spacing; Execution process: First, a node sequence set is created, and then the sequence is divided according to preset boundaries. Each block is defined, and the set of node pairs within each block that must maintain a relatively stable order is determined. Then, in the iterative process of the genetic algorithm, for each permutation scheme... Iterate through all blocks in sequence and in the blocks Internal read node pair Location index to calculate indicator function Determine if node pairs are in Whether the relative order in the data is disrupted, then read the order stability weight coefficient. And determine the order stability amplification factor based on the historical order stability. And read the adjacent expected mark according to the adjacency rule And get the node The priority level At the same time, read the expected distance deviation penalty coefficient γ in the calculation process and calculate the actual position difference of the node in π And the reference distance The difference is the distance deviation term. After the above parameter reading is completed, the comprehensive sequence disturbance cost of the node pair is formed, the sum of all node pairs in the block is summed to obtain the block sequence disturbance cost, and the sum of all blocks is continued to obtain the comprehensive sequence disturbance evaluation value of the arrangement scheme , and as fitness, according to the execution selection action and then implement the cross and replacement action, make the iterative process gradually converge to the node sequence with lower sequence disturbance evaluation value, and make the node sequence maintain relative order stability in multiple blocks, form the sequence priority arrangement set and be used to generate the optimization strategy of cruise ship space arrangement.

[0028] The specific steps of generating the continuous region combination are: Based on the sequence priority arrangement set, compare the close line segments between the cruise ship block outline and the guest room unit outline in sections, and perform proximity judgment combining the distance difference between the functional cabin section and the block, and group the blocks with clear proximity relationship according to the contact density to generate the boundary adjacent block group; Based on the boundary adjacent block group, check the mutual difference value of the block number and determine the number continuity, and eliminate the number jump block during the check, and arrange the region fragments according to the block combination corresponding to the continuous number to generate the continuous region combination; Based on the sequence priority arrangement set, compare the close line segments between the cruise ship block outline and the guest room unit outline using the close line segment comparison command, input two outline segment sets and a sampling interval of 5mm, and record the close segments under the condition that the distance between the corresponding sampling points is less than 1mm, and use the distance difference checking command to take the distance value according to the node coordinate difference value between the functional cabin section and the block, and write it into the distance table, and use the proximity judgment command to generate the proximity level according to the close segment length threshold of 50%, and record the level number, and use the block grouping command to group the blocks with clear proximity relationship according to the condition that the proximity levels are the same, and write it into the grouping record structure, to generate the boundary adjacent block group; Based on the boundary adjacent block group, use the number difference value checking command to record the difference value according to the adjacent block number subtraction method, and use the jump marker command to eliminate the number group with a difference value greater than 1, and use the region fragment arrangement command to add the fragment according to the grouping order for the number continuous block, and write the block number sequence into the fragment set to generate the continuous region combination.

[0029] The specific steps of generating the arrangement item set are: Based on the continuous region combination, the arrangement direction of the outer edge line nodes of the combination is combed section by section and the direction sequence is recorded, and the order difference between the nodes is compared during the combing, and the direction in which the outer edge line extends along the cabin section is compiled into a sequence framework to generate the arrangement basis of the combination; Based on the arrangement basis of the combination, the corresponding relationship between the combination sequence number and the cabin path node sequence number is arranged item by item and the mutual position is fixed, and the order of the path nodes is written into the item during the arrangement, and the item content is summarized according to the arrangement direction of the cabin section to generate the arrangement item set; Based on the continuous region combination, the arrangement direction of the outer edge line nodes of the combination is combed section by section and the direction sequence is recorded, and the order difference between the nodes is compared during the combing, and the direction in which the outer edge line extends along the cabin section is compiled into a sequence framework to generate the arrangement basis of the combination; Based on the arrangement basis of the combination, the corresponding relationship between the combination sequence number and the cabin path node sequence number is arranged item by item and the mutual position is fixed, and the order of the path nodes is written into the item during the arrangement, and the item content is summarized according to the arrangement direction of the cabin section to generate the arrangement item set.

[0030] The order of the path nodes is written into the item, after the sequence number of the cabin path nodes is arranged, the node sequence number obtained by the arrangement is sequentially listed in the record unit according to the actual travel order, the record unit sequentially adds the node identifier, the section index where the node is located, and the position number of the node in the sequence item by item according to the node sequence number order, and the above record unit is composed into a linear item structure through the order arrangement, so that the item completely presents the arrangement order relationship of the path nodes.

[0031] The above is only a preferred embodiment of the present application, and does not limit the present application in other forms, any skilled person in the art can change or modify the above disclosed technical content to equivalent embodiments applied to other fields, but any simple modification, equivalent change and modification made according to the technical essence of the present application to the above embodiments without departing from the technical solution content of the present application still belongs to the protection scope of the technical solution of the present application.

Claims

1. A method for generating an optimization strategy for the spatial arrangement of a cruise ship, characterized in that The method comprises the following steps: S1: based on the cabin center line, the cabin section reference line and the cabin wall contour of the design drawing, the boundary position of the passable unit inside the cabin section, the structural interference and the interconnection condition are checked in each grid, and the Dijkstra algorithm is used to extract the unit section with continuous accessibility as the basic passable framework, and the passable structure set of the cabin section is arranged; S2: in the passable structure set formed by the cabin section, the unit chain that can be used as a continuous path is screened out by combing the adjacent unit trend and the connection order along the personnel flow direction, and the block connection chain group is generated; S3: based on the block connection chain group, the spatial correspondence between each node in the chain group and the cabin control point, the service support node and the regional function anchor point is checked item by item, and the distance difference, the turning amount and the along-path offset between nodes are sequenced and compared, the genetic algorithm is used, the exchange and replacement actions are performed in the block arrangement as the iteration unit in the comparison process, and the sequence priority arrangement set is generated by screening according to the relative order in the node group; S4: according to the sequence priority arrangement set, the adjacent blocks of the guest room unit and the functional cabin section are classified according to the outer contour and the distance, the block groups with continuous numbering and boundary fitting are merged, and the continuous region combination body is obtained; S5: based on the continuous region combination body, the arrangement order of the cabin path node and the regional edge is determined, the result is written into the arrangement record to form the arrangement entry set.

2. The method of claim 1, wherein, The passable structure set of the cabin section includes passable grid units, grid connection edges and passable continuous chain sections, the block connection chain group includes block node sequences, block connection edge groups and block trend identification groups, the sequence priority arrangement set includes node arrangement sequences, node distance difference groups and node turning distribution groups, the continuous region combination body includes continuous block groups, block boundary line groups and block number chains, and the arrangement entry set includes arrangement entry record groups, path node corresponding groups and block index sequence groups.

3. The method of claim 1, wherein the optimization strategy is generated based on a cruise ship layout. The specific steps for generating the passable structure set of the cabin section are as follows: Based on the cabin center line, the cabin section reference line and the cabin wall contour of the design drawing, the boundary line position of the passable unit is checked in each grid, and the distance between the unit and the adjacent structural part is compared, and it is judged whether the continuous side of the unit exists. The block is generated by checking the set; Based on the unit boundary checking set, the contact side length between each unit is compared in sequence, the center point connection direction between adjacent units is checked, and the units with incomplete contact are removed, the units maintaining continuity are combined into sections, and the continuous unit section group is generated; Based on the continuous unit section group, the Dijkstra algorithm is used to arrange the direction consistency of the section and remove the direction jump section, and the through section is constructed according to the section serial number chain, the through section is formed into a passable framework, and the passable structure set of the cabin section is generated.

4. The method of claim 3, wherein, The Dijkstra algorithm firstly marks section endpoints as nodes and forms connected edges with sections based on the continuous unit section group, and assigns weights superimposed by length turning amount congestion weight, then selects a starting node and sets an initial distance, puts all nodes into an unmarked set, repeatedly selects a node with minimum distance from the set, calculates cumulative weights of adjacent nodes via the node, updates records when cumulative values are smaller, marks predecessors and removes processed nodes, generates a node sequence by backtracking from a target node to a starting node according to a predecessor relationship of the target node, and arranges through sections to form a cabin segment passable structure set.

5. The method of claim 1, wherein, The specific steps for generating the block connection chain group are: Based on the passable structure set formed by the cabin segment passable structure set, the displacement direction of the center point between adjacent passable units is checked section by section, and the advancing direction is judged in combination with the butt joint condition of the unit edge line, and continuous chain sections are constructed according to the consistent sequence connection direction, and a directionally continuous unit sequence is generated; Based on the directionally continuous unit sequence, the abutting edges of adjacent units in the sequence are viewed and the abutting lengths are recorded, and in the viewing process, it is identified whether the connection of the abutting section is interrupted, and the unit combination is integrated according to the chain arrangement in which the abutment remains stable, and a block connection chain group is generated.

6. The method of claim 1, wherein the optimization strategy is generated based on a cruise ship layout. The specific steps for generating the sequence priority arrangement set are: Based on the block connection chain group, the spatial distance between the chain group nodes and the cabin control points is checked, and the horizontal offset between the nodes and the service support nodes is checked, and the relative orientation relationship between the nodes and the regional function anchor points is supplemented, and a node spatial correspondence set is generated; Based on the node spatial correspondence set, the distance difference between the nodes is compared, and the turning angle amount of adjacent nodes is counted, and the continuity of the direction offset along the path is checked, and the node sequence that satisfies the spatial order after arrangement is solidified as an intermediate sequence, and a node sequence arrangement set is generated; Based on the node sequence arrangement set, a genetic algorithm is used, the block arrangement is taken as an iterative unit, and exchange and replacement actions are performed in turn, and in the action execution process, sequence combinations that maintain relative order stability in the node group are screened, sequence combinations that meet the conditions are collected into an arrangement list, and a sequence priority arrangement set is generated.

7. The method of claim 6, wherein the optimization strategy is generated based on a cruise ship layout. The genetic algorithm firstly sets each node sequence as an iterative unit based on the node sequence arrangement set, and takes the initial sequence set as a sequence record, and records the evaluation amount formed by the distance difference between the nodes and the turning angle amount, then generates new sequences in a fixed position fragment exchange manner in iteration, and forms variable sequences in a local position replacement manner, compares the evaluation amount of the new sequence with the evaluation amount of the original sequence one by one, and when the evaluation amount is lower, the new sequence replaces the original sequence and the corresponding node order record is retained, and after multiple iterations, sequence combinations with relatively stable order and lower evaluation amount are screened from all retained sequences, the sequence combinations are arranged into an arrangement list to form a sequence priority arrangement set.

8. The method of claim 1, wherein the optimization strategy is generated based on a cruise ship layout. The specific steps for generating the continuous region combination body are: Based on the sequence priority set, the close line segments between the outer profile of the volume block and the guest room unit profile are arranged section by section, the close degree is judged in combination with the spacing difference between the functional cabin section and the block, the blocks with clear close relationship are grouped according to the contact density, and a boundary adjacent block group is generated; Based on the boundary adjacent block group, the mutual difference value of the block number is consulted, the number continuity is checked, the number jump block is removed during the consultation, the block combination is arranged according to the continuous number, the area segment is arranged, and a continuous area combination body is generated.

9. The method of claim 1, wherein, The specific steps for generating the arrangement item set are: Based on the continuous area combination body, the arrangement direction of the outer edge line node of the combination body is combed section by section, the direction sequence is recorded, the order difference value between the nodes is compared during the combing process, the direction of the outer edge line along the cabin section is compiled into a sequence framework, and a combination body arrangement basis is generated; Based on the combination body arrangement basis, the corresponding relationship between the combination body serial number and the cabin path node serial number is arranged item by item, the mutual position is fixed, the order of the path nodes is written into the item during the arrangement, the item content is summarized according to the cabin section arrangement direction, and an arrangement item set is generated.

10. The method of claim 9, wherein the optimization strategy is generated based on a cruise ship layout. The order of the path nodes is written into the item. After the cabin path nodes are arranged in sequence, the node serial numbers obtained by the arrangement are sequentially listed in the record unit according to the actual travel order. The record unit sequentially adds the node identifier, the section index where the node is located, and the position number of the node in the sequence item by item according to the node serial number order. The above record units are arranged in sequence to form a linear item structure, so that the item completely presents the arrangement order relationship of the path nodes.

Images