CN112883496B - Dynamic reliability optimization method for fleet system based on tabu search - Google Patents

Dynamic reliability optimization method for fleet system based on tabu search Download PDF

Info

Publication number
CN112883496B
CN112883496B CN202110291800.3A CN202110291800A CN112883496B CN 112883496 B CN112883496 B CN 112883496B CN 202110291800 A CN202110291800 A CN 202110291800A CN 112883496 B CN112883496 B CN 112883496B
Authority
CN
China
Prior art keywords
fleet
reliability
solution
node
function
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202110291800.3A
Other languages
Chinese (zh)
Other versions
CN112883496A (en
Inventor
潘正强
刘天宇
张然
徐东
张扬
金光
范俊
杨妮娜
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
National University of Defense Technology
Original Assignee
National University of Defense Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by National University of Defense Technology filed Critical National University of Defense Technology
Priority to CN202110291800.3A priority Critical patent/CN112883496B/en
Publication of CN112883496A publication Critical patent/CN112883496A/en
Application granted granted Critical
Publication of CN112883496B publication Critical patent/CN112883496B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/10—Geometric CAD
    • G06F30/15—Vehicle, aircraft or watercraft design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/20—Design optimisation, verification or simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316—Sequencing of tasks or work
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00—Details relating to CAD techniques
    • G06F2111/04—Constraint-based CAD
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2119/00—Details relating to the type or aim of the analysis or the optimisation
    • G06F2119/02—Reliability analysis or reliability optimisation; Failure analysis, e.g. worst case scenario performance, failure mode and effects analysis [FMEA]

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Geometry (AREA)
  • General Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Computer Hardware Design (AREA)
  • Evolutionary Computation (AREA)
  • General Engineering & Computer Science (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • Development Economics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Computational Mathematics (AREA)
  • Automation & Control Theory (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

A dynamic reliability optimization method for a fleet system based on tabu search comprises the following steps: and giving a fleet system and an initial fleet function distribution scheme of the fleet system, and determining constraint conditions of the function distribution of each ship in the fleet system. When part of ship functions in the fleet system are in fault, the reliability of the fleet system is dynamically optimized by using a tabu search algorithm on the premise of meeting all the ship function distribution constraint conditions, and a new ship function distribution scheme is obtained. And dynamically optimizing the reliability of the fleet system by a tabu search algorithm, so that the reliability of the fleet system of the new ship function distribution scheme is high, and the adjustment amplitude of the new ship function distribution scheme is as small as possible compared with the initial fleet function distribution scheme.

Description

Dynamic reliability optimization method for fleet system based on tabu search
Technical Field
The invention relates to the technical field of reliability optimization, in particular to a dynamic reliability optimization method for a fleet system based on tabu search.
Background
A fleet is generally a combat system consisting of multiple ships. During the working process, the combat system needs to undertake various tasks such as navigation, positioning, commanding, communication, combat and the like. These tasks are typically performed in a sequential and logical relationship. Each task also requires multiple capabilities to be cooperatively realized according to a certain sequence and logical relationship. The capability is provided by a single ship with corresponding function or a plurality of ships with corresponding functions.
According to the inherent design of ships and the task requirements of fleets, the specific functions of some ships can only be used for specific (unique) tasks; some ships may have multiple functions, such as positioning, air-to-air striking and potential striking, but the multiple functions cannot be used simultaneously, that is, mutual exclusion relationship exists among the multiple functions. In addition, there is a binding relationship between certain capabilities that must be provided by the same ship.
Therefore, before the fleet works formally, a plan must be made on the execution sequence and the cooperation mode of each function of each ship. In fact, however, in the course of performing tasks, there is a risk that part or all of the functions of the ships are damaged and damaged, and it is necessary to quickly and accurately adjust the execution sequence of each function of each ship in the ship system. The dynamic reliability optimization of the fleet system is an optimization method for real-time adjustment of a set of ship execution strategies. The method is established on the basis of a plan, and in the adjusting process, on one hand, the ship functions are redistributed to realize that a fleet system works in the best reliability state, and on the other hand, the amplitude before and after adjustment is ensured to be as small as possible.
Aiming at the problem of dynamic reliability optimization of a fleet system, the existing method has the following conditions:
(1) and the manual operation method adjusts the ship function distribution scheme based on personal subjective experience and understanding of the ship tasks. The method has very high requirements on the thinking logical ability of a decision maker, depends on personal subjective experience and judgment on the situation, and has the following defects: the optimization result highly depends on personal experience, and an optimal adjustment scheme is difficult to find; with the increase of the complexity of a fleet system, the number of components and nodes is increased, the adjustment time is too long, the efficiency is low, and real-time adjustment is difficult.
(2) The method based on the plan and the uncertainty decision theory designs and adjusts the plan in advance based on a certain criterion by predicting the fault event which can happen in the future. The method requires that all possible fault event sets are listed in advance, and the operation difficulty of the complex task system with the characteristics of randomness, dynamics, unpredictability and the like is very high.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides a dynamic optimization method for the reliability of a fleet system based on tabu search.
In order to achieve the technical purpose, the invention adopts the following specific technical scheme:
the dynamic reliability optimization method of the fleet system based on tabu search comprises the following steps:
s1: and constructing a reliable topological structure of the fleet system according to the given fleet system and the initial fleet function allocation scheme of the fleet system.
S2: and determining constraint conditions of the ship function distribution of each capacity node in the reliable topological structure of the fleet system.
S3: and when part of ship functions in the fleet system are failed, dynamically optimizing the reliability of the fleet system by using a tabu search algorithm on the premise of meeting constraint conditions to obtain a new ship function allocation scheme.
Further, in the present invention S1, the given fleet system is composed of a plurality of ships of different types, each ship has a plurality of different functions, and the function is denoted by xijThe jth function of the ith ship; r isijFor its reliability, the value range is [0,1 ]]Is a known item; cijIs equal to xijMutually exclusive sets of ship functions, i.e. CijFunction of (1) and xijAnd cannot operate simultaneously.
Further, in S1 of the present invention, given an initial fleet function allocation scheme of a fleet system, the fleet system undertakes multiple tasks, each task corresponds to a task module, each task module includes multiple capabilities, and one capability corresponds to one capability node; for any capacity node of any task module, the capacity node has corresponding capacity, the capacity is realized by one or more ships in a fleet system, all ships or ship combinations capable of realizing the capacity corresponding to the capacity node form a feasible solution set of the capacity node, and the reliability of all feasible solutions of the capacity node is known.
The capability nodes in the task modules are connected according to the logic relationship set in the initial fleet function distribution scheme to form a reliability topological structure of the task modules, and the task modules are connected according to the logic relationship set in the initial fleet function distribution scheme to form a reliability topological structure of the fleet system.
Further, in S2 of the present invention, the constraint conditions include:
the first constraint is: the ship's single function cannot be provided for multiple capability nodes, xijAt most, occurs once in a fleet system reliability topology.
The second constraint is: if xijIf the function occurs in the reliable topological structure of the fleet system, the function mutually exclusive with the function cannot occur in the reliable topological structure of the fleet system.
The third constraint: if the capability node has a capability node bound with the capability node, the functions under the mutually bound capability nodes must be provided by the same ship.
Further, in the invention, in S3, a taboo search algorithm is used to perform dynamic optimization of the reliability of the fleet system, so as to obtain a new ship function allocation scheme, which includes:
s3.1. the reliable topological structure of the warship team system has M task modules, and the reliable topological structure of the mth task module comprises NmA capability node, the feasible solution set of the nth capability node of the mth task module is SmnWherein M1, 2, Nm(ii) a And setting the maximum iteration times G, generating the quantity Ca by the neighborhood solution in each iteration, and determining the function distribution scheme of the fleet before the fault.
S3.2, initializing a tabu table 1 and a tabu table 2, and setting the numerical values of elements in the tabu table to be 0;
Figure GDA0003577358990000041
s3.3 randomly generating an initial task Module sequence A0And capability node ordering sequence for each task module
Figure GDA0003577358990000042
S3.4 generating default taboo lengths of the taboo table 1 and the taboo table 2, L1And L2。
S3.5 task Module based ordering A0And capability node ordering sequence of each task module
Figure GDA0003577358990000043
And generating a group of fleet function distribution schemes, taking the distribution schemes as a current solution and a historical optimal solution, and calculating the reliability of the fleet system of the fleet function distribution schemes and the adjustment amplitude of the fleet function distribution schemes and the fleet function distribution schemes before faults.
S3.6 given task module sequencing A corresponding to the current solution and capability node sequencing sequence B in each task module1，B2，…，BMAnd generating Ca group neighborhood feasible solutions as candidate solutions, wherein each candidate solution corresponds to one group of fleet function distribution schemes, and calculating the fleet system reliability of the fleet function distribution schemes corresponding to each group of candidate solutions and the adjustment amplitude between each candidate solution and the fleet function distribution scheme before the fault.
S3.7, if the solution with the highest reliability of the fleet system in the candidate solutions is higher than the reliability of the fleet system in the historical optimal solution or the solution with the highest reliability of the fleet system in the candidate solutions is equal to the reliability of the fleet system in the historical optimal solution and the adjustment amplitude of the solution is lower than the adjustment amplitude corresponding to the historical optimal solution, selecting the candidate solution and enabling the candidate solution to update the current solution and the historical optimal solution; otherwise, selecting a solution with the highest reliability of the fleet system from the non-tabu objects of the candidate solutions, and enabling the solution to update the current solution and the historical optimal solution, wherein the non-tabu objects are solutions of which the corresponding elements of the tabu table 1 and the tabu table 2 in the candidate solutions are not all zero.
S3.8, updating the tabu table, and enabling the corresponding elements currently solved in the tabu table 1 and the tabu table 2 to be respectively restored to the default tabu length L1And L2And the value of the remaining non-0 elements is decremented by 1.
S3.9 repeats S3.6 to S3.8 until the number of iterations reaches the maximum number of iterations G.
And S3.10, outputting the current historical optimal solution, namely a new ship function distribution scheme.
In the invention, the reliability of the fleet system of the fleet function distribution scheme is expressed as a function of the reliability of each capability node, wherein the reliability of the fleet system is obtained by calculating the reliability of each task module according to the logic connection relation set in the fleet function distribution scheme, and the reliability of each task module is obtained by calculating the reliability of each capability node according to the logic connection relation set in the fleet function distribution scheme.
In the present invention, the amplitude D is adjustedvThe calculation method of (2) is as follows:
Figure GDA0003577358990000051
if the distribution result of the nth capability node of the mth task module in the generated fleet function distribution scheme is the same as that of the fleet function distribution scheme before the fault, ImnNot greater than 0, otherwise Imn＝1。
Further, the present invention S3.5 comprises:
s3.5.1 setting m equal to 1;
s3.5.2 where n is 1;
s3.5.3 selecting the task module ranked at m-th in task module sequence A, selecting the capability node ranked at n-th in the task module, selecting the feasible solution with highest reliability from the feasible solution set available for the capability node, marking the ship function x used by the feasible solutionijAll the nodes are in an occupied state, and the reliability of the capacity node is calculated; if the capability node has no available feasible solution, marking the failure of the capability node, and the reliability is zero;
s3.5.4 if N is less than or equal to NmN is n +1, the step S3.5.3 is returned, otherwise, the next step is carried out;
s3.5.5, if M is less than or equal to M and M is M +1, returning to step S3.5.2, otherwise, ending, outputting the current solution, namely the historical optimal solution, and calculating the reliability of the fleet system of the fleet function allocation scheme corresponding to the current solution and the adjustment range of the fleet function allocation scheme and the fleet function allocation scheme before failure.
Further, the present invention S3.6 comprises:
s3.6.1 let ca be 1;
s3.6.2 randomly selecting two task module sequence number exchange positions from task module sequence A, and recording the result as A';
s3.6.3 sort the sequence B from the capability nodes of each task module1，B2，…，BNRandomly selecting a capability node sequencing sequence Bp，1≤p≤M；
S3.6.4 sorting sequence B from capability nodespRandomly selecting two node serial number exchange positions in the network, and recording the result as B'p；
S3.6.5 given A' and B1，…，Bp-1，B′p，Bp+1，…，BMGenerating a group of ship function distribution schemes as a group of neighborhood feasible solutions;
s3.6.6 if Ca < Ca, Ca +1, return to step S3.6.2; otherwise, ending, and outputting the Ca group neighborhood feasible solution as a candidate solution.
Further, the present invention S3.8 comprises:
s3.8.1 recording the sequence numbers of two task modules participating in random exchange in the current solution corresponding S3.6.2 as m respectively1And m2Let 1 be equal to or less than m1＜m2≤M；
S3.8.2, recording the sequence number of the randomly selected task module in S3.6.3 corresponding to the current solution as p, wherein p is more than or equal to 1 and less than or equal to M;
s3.8.3 taboo Table 1 requires a return to the default taboo length L1Is the m-th element1Line m2A column element; tabu table 2 requires a return to the default tabu length L2Is the p-th column element.
According to the method, the initial fleet function distribution scheme of the fleet system and the fleet system is given, and the constraint condition of the function distribution of each ship in the fleet system is determined. When part of ship functions in the fleet system are in fault, the reliability of the fleet system is dynamically optimized by using a tabu search algorithm on the premise of meeting all the ship function distribution constraint conditions, and a new ship function distribution scheme is obtained. And dynamically optimizing the reliability of the fleet system by a tabu search algorithm, so that the reliability of the fleet system of the new ship function distribution scheme is high, and the adjustment amplitude of the new ship function distribution scheme is as small as possible compared with the initial fleet function distribution scheme. The beneficial effects of the invention are also shown in the following aspects:
(1) the invention has the advantages of high-performance calculation by means of a computer, higher calculation efficiency far exceeding the traditional manual operation mode, more complex fleet system structure, more task modules and capability nodes and more ships, and more obvious advantages.
(2) In the calculation process, a plurality of parallel optimal ship function distribution schemes can be recorded and finally output and provided for decision makers to perform comparative analysis, which is difficult to achieve manually.
(3) Compared with manual operation, the searched function distribution scheme of the fleet system ship is generally better, and is particularly reflected in higher system reliability and smaller difference degree before and after adjustment.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the structures shown in the drawings without creative efforts.
FIG. 1 is a flow chart of an embodiment;
FIG. 2 is a block diagram of a fleet system reliability topology, according to an embodiment;
FIG. 3 is a block diagram of a numbered fleet system reliability topology in one embodiment;
FIG. 4 is a flow chart of S3.5 in an embodiment;
fig. 5 is a flow chart of S3.6 in an embodiment.
Detailed Description
In order to make the technical scheme and advantages of the present invention more clearly understood, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Referring to fig. 1, an embodiment of the present invention provides a method for dynamically optimizing reliability of a fleet system based on tabu search, including the following steps:
s1: and constructing a reliable topological structure of the fleet system according to the given fleet system and the initial fleet function allocation scheme of the fleet system.
A fleet system is a system consisting of multiple vessels. During the working process, the system needs to undertake various tasks such as navigation, positioning, commanding, communication, fighting and the like. These tasks are typically performed in a set order and logical relationship. Before the fleet system works formally, a plan must be made for the execution sequence and the cooperation mode of each ship function, namely an initial fleet function allocation scheme of the fleet system is given. In fact, however, in the process of performing tasks, the fleet system has a risk of damage and damage to part or all of the functions of the ship, and the execution sequence of each function of each ship in the fleet system needs to be adjusted quickly and accurately. The dynamic reliability optimization of the fleet system is an optimization method for real-time adjustment of a set of ship execution strategies. The method is established on the basis of an initial fleet function distribution scheme of a fleet system, and in the adjustment process, on one hand, the functions of the warships are redistributed to realize that the fleet system works in the best reliability state, and on the other hand, the amplitude before and after adjustment is ensured to be as small as possible.
The fleet system is composed of a plurality of ships of different types, and can be abstracted into a complex system, wherein each ship is a system component, and different components have a plurality of different functions. Given fleetThe system is composed of a plurality of ships of different types, and each ship has a plurality of different functions, and x is recordedijThe jth function of the ith ship; r isijFor its reliability, the value range is [0,1 ]]Is a known item; cijIs equal to xijMutually exclusive sets of ship functions, i.e. CijFunction of (1) and xijAnd cannot operate simultaneously.
Each task of a series of tasks borne by the fleet system corresponds to one task module, and the tasks such as formation navigation, command control, air defense combat, anti-diving combat and the like are the task modules of the fleet system. Given an initial fleet function distribution scheme of the fleet system, the task modules are connected according to a logic relationship (such as series connection, parallel connection, voting, connection and the like) set in the initial fleet function distribution scheme to form a fleet system reliability topological structure. Fig. 2 is a block diagram illustrating a reliability topology of a fleet system according to an embodiment of the present invention. Each task module has multiple capabilities, one capability corresponds to one capability node, and the capability nodes are connected according to the logic relationship (such as series connection, parallel connection, voting, connection and the like) set in the initial fleet function distribution scheme to form a reliability topological structure of each task module. Each capability may be provided by a single ship with a corresponding function, or by multiple ships with corresponding functions. The capacity node has corresponding capacity, the capacity is realized by one or more ships in a fleet system, and all ships or ships capable of realizing the capacity corresponding to the capacity node are combined to form a feasible solution set of the capacity node. When a certain capacity node requires to have the jth function, the function can be provided by a single A-type ship (serial number of the ship is recorded as i) or M B-type ships (serial number of the ship is recorded as i) according to the specification1，i2，…，iM) Commonly provided, then recorded
Figure GDA0003577358990000091
Is a feasible solution set for the capability node. The reliability of the capability nodes corresponding to the two feasible solutions is rijAnd
Figure GDA0003577358990000101
if the fleet system fails to distribute the ship functions to the capability node according to the specified requirements, the capability cannot be normally exerted, and the reliability of the capability node is 0. In addition, according to task requirements, binding relationships exist among certain capacity nodes, namely functions under the capacity nodes are required to be provided by the same ship.
And the reliability of the fleet system of the fleet function allocation scheme is expressed as a function of the reliability of each capability node, wherein the reliability of the fleet system is calculated by the reliability of each task module according to the logical connection relationship set in the fleet function allocation scheme, and the reliability of each task module is calculated by the reliability of each capability node according to the logical connection relationship set in the fleet function allocation scheme.
S2: and determining constraint conditions of the ship function distribution of each capacity node in the reliable topological structure of the fleet system.
In the process of executing tasks, when part or all of the functions of the ship are damaged, the fleet system is quickly adjusted on the current basis, and the functions of the ship are redistributed to achieve the purpose that the reliability of the fleet system is the highest, and the amplitude before and after adjustment is as small as possible. In the above optimization process, the constraints to be considered include:
the first constraint is: the ship's single function cannot be provided for multiple capability nodes, xijAt most, the method appears once in a reliable topological structure of a fleet system;
the second constraint is: if xijIf the function occurs in the reliable topological structure of the fleet system, the mutually exclusive functions cannot occur in the reliable topological structure of the fleet system;
the third constraint: if the capability node has a capability node bound with the capability node, the functions under the mutually bound capability nodes must be provided by the same ship.
S3: and when part of ship functions in the fleet system are failed, dynamically optimizing the reliability of the fleet system by using a tabu search algorithm on the premise of meeting constraint conditions to obtain a new ship function allocation scheme.
S3.1. the reliable topological structure of the warship team system has M task modelsThe reliability topological structure of the mth task module comprises NmA feasible solution set of the nth capability node of the mth task module is SmnWherein M1, 2, Nm(ii) a Setting the maximum iteration times G, generating the quantity Ca by using a neighborhood solution in each iteration, and determining a fleet function allocation scheme before a fault;
s3.2, initializing a tabu table 1 and a tabu table 2, and setting the numerical values of elements in the tabu table to be 0;
Figure GDA0003577358990000111
s3.3 randomly generating an initial task Module sequence A0And capability node ordering sequence for each task module
Figure GDA0003577358990000112
S3.4, the default taboo lengths of the taboo table 1 and the taboo table 2 are generated and are respectively L1And L2；
The definition is as follows: l is1And L2Respectively, the default taboo length. Obviously, the number of elements in Table 1 is
Figure GDA0003577358990000113
The number of elements in table 2 is contraindicated as M. The default taboo length is usually set to 0.5 times (rounded) of the number of taboo table elements, i.e., the number of taboo table elements
Figure GDA0003577358990000114
S3.5 ordering A based on task modules0And capability node ordering sequence of each task module
Figure GDA0003577358990000115
Generating a group of fleet function distribution schemes, taking the distribution schemes as a current solution and a historical optimal solution, and calculating the fleet system reliability of the fleet function distribution schemes and the fleet system reliabilityAdjusting the range of the team function distribution scheme and the range of the team function distribution scheme before the fault;
s3.6 given task module sequencing A corresponding to the current solution and capability node sequencing sequence B in each task module1，B2，…，BMGenerating Ca group neighborhood feasible solutions as candidate solutions, wherein each candidate solution corresponds to a group of fleet function distribution schemes respectively, and calculating the fleet system reliability of the fleet function distribution schemes corresponding to each group of candidate solutions and the adjustment amplitude between each candidate solution and the fleet function distribution scheme before the fault;
s3.7, if the solution with the highest reliability of the fleet system in the candidate solutions is higher than the reliability of the fleet system in the historical optimal solution or the solution with the highest reliability of the fleet system in the candidate solutions is equal to the reliability of the fleet system in the historical optimal solution and the adjustment amplitude of the solution is lower than the adjustment amplitude corresponding to the historical optimal solution, selecting the candidate solution and enabling the candidate solution to update the current solution and the historical optimal solution; otherwise, selecting a solution with the highest reliability of the fleet system from the non-tabu objects of the candidate solutions, and updating the current solution and the historical optimal solution, wherein the non-tabu objects are solutions of which the corresponding elements of the tabu table 1 and the tabu table 2 in the candidate solutions are not all zero;
s3.8, updating the tabu table, and enabling the corresponding elements currently solved in the tabu table 1 and the tabu table 2 to be respectively restored to the default tabu length L1And L2And the value of the other elements which are not 0 is reduced by 1;
s3.8.1 recording the sequence numbers of two task modules participating in random exchange in the current solution corresponding S3.6.2 as m respectively1And m2Let 1 be equal to or less than m1＜m2≤M；
S3.8.2, recording the sequence number of the randomly selected task module in S3.6.3 corresponding to the current solution as p, wherein p is more than or equal to 1 and less than or equal to M;
s3.8.3 taboo Table 1 shows the default taboo length L required to be restored1Is the m-th element1Line m2A column element; tabu table 2 requires a return to the default tabu length L2Is the p-th column element.
S3.9, repeating S3.6 to S3.8 until the iteration number reaches the maximum iteration number G;
and S3.10, outputting the current historical optimal solution, namely a new ship function distribution scheme.
Fig. 4 is a flowchart of S3.5 in an embodiment, including:
s3.5.1 setting m equal to 1;
s3.5.2 where n is 1;
s3.5.3 selecting the m-th task module in task module sequence A, selecting the n-th ability node in the task module, selecting the feasible solution with the highest reliability from the feasible solution set available for the ability node, marking the ship function x used by the feasible solutionijAll the nodes are in an occupied state, and the reliability of the capacity node is calculated; if the capability node has no available feasible solution, marking the failure of the capability node, and the reliability is zero;
s3.5.4 if N is less than or equal to NmN is n +1, the step S3.5.3 is returned, otherwise, the next step is carried out;
s3.5.5, if M is less than or equal to M and M is M +1, returning to step S3.5.2, otherwise, ending, outputting the current solution, and calculating the reliability of the fleet system of the fleet function allocation scheme corresponding to the current solution and the adjustment amplitude of the fleet function allocation scheme and the fleet function allocation scheme before the fault.
Fig. 5 is a flowchart of S3.6 in an embodiment, including:
s3.6.1 let ca be 1;
s3.6.2 randomly selecting two task module sequence number exchange positions from the task module sequence A, and recording the result as A';
s3.6.3 sort the sequence B from the capability nodes of each task module1，B2，…，BNRandomly selecting a capability node sequencing sequence Bp，1≤p≤M；
S3.6.4 sorting sequence B from capability nodespRandomly selecting two node serial number exchange positions in the network, and recording the result as B'p；
S3.6.5 given A' and B1，…，Bp-1，B′p，Bp+1，…，BMGenerating a group of ship function distribution schemes as a group of neighborhood feasible solutions;
s3.6.6 if Ca is less than Ca, Ca +1, return to step S3.6.2; otherwise, ending, and outputting the Ca group neighborhood feasible solution as a candidate solution.
Referring to fig. 3, a block diagram of a numbered fleet system reliability topology according to an embodiment of the present invention is shown; the fleet system consists of 9 ships and warships, and the numbers are 1 to 9, wherein the number 1 is an A-type ship, the numbers 2 to 5 are B-type ships, the numbers 6 and 7 are C-type ships, and the numbers 8 and 9 are D-type ships. Different types of ships have different functions, as shown in table 1, where √ denotes that there is a corresponding function, and x denotes that the component does not have a corresponding function. Take ship No. 1 as an example, which has 6 functions, x respectively11(navigation), x12(location, x)13(command) x14(communication), x15(search for null), x17(for submarine search), the rest of the ships and so on.
TABLE 1A team naval vessel function List
Figure GDA0003577358990000141
In the process of executing the task, the fleet system needs to be decomposed into a plurality of task modules according to specific task requirements to form a reliability topological structure of the fleet system formed by the task modules, as shown in fig. 3, only 4 representative task modules are given as an example. The anti-ship combat and anti-submarine combat task modules are connected in parallel and then connected in series with the command control and air defense combat task modules as a whole. The internal capacity nodes of the command control and anti-submarine operation task module are of a series-parallel combined structure, the internal capacity nodes of the anti-ship operation task module are of a voting structure, and the internal capacity nodes of the air defense operation task module are of a sum structure.
In order to dynamically optimize the reliability of the fleet system, the system block diagrams need to be numbered, as shown in fig. 3. For example, the task module 1 is a "command and control" task module. Wherein, the nodes (1,1) and the nodes (1,3) correspond to the command capability, and the nodes (1,2) and the nodes (1,4) correspond to the communication capability. The nodes (1,1) and the nodes (1,2) are in binding relation, and the nodes (1,3) and the nodes (1,4) are in binding relation. That is, the ship providing the "command" function for the node (1,1) and the ship providing the "communication" function for the node (1,2) must be the same ship, and the branch can work normally.
Taking task module 3 as an example, it is an "anti-diving combat" task module. Wherein, the node (3,1) and the node (3,2) correspond to the 'hit to potentially' capability, and the node (3,3) corresponds to the 'search to potentially' capability. The node capabilities of the nodes (3,1) and (3,2) can be provided by 1D-shaped ship or by a combination of 2C-shaped ships. That is, although both the D-type ship and the C-type ship have the "counter-strike" function, the counter-strike capability of 1D-type ship is equivalent to that of 2C-type ships. In this case, the numbers of the ships corresponding to the C-type ships are 6 and 7, and the numbers of the ships corresponding to the D-type ships are 8 and 9, so that the feasible solution set S of the nodes (3 and 1) and the nodes (3 and 2) is set31And S32Are all { (x)68)，(x78)，(x88，x98) }; the capability of the nodes (3,3) can be provided by any ship with the function of 'search for potential', so that the feasible solution set S is provided33＝{(x17)，(x67)，(x77)，(x87)，(x97)}。
During the execution of tasks of the fleet system, each node is distributed with corresponding ship (namely component) functions, and the system is ensured to work normally with high reliability. For example, x providing a function for a node (3,1) at a time68(8 th function of No. 6 ship) fails (or all functions of ship 6 fail), at the moment, on the premise of meeting constraint conditions, a taboo search algorithm is utilized to dynamically optimize the reliability of the fleet system, the component function distribution scheme of each node is dynamically adjusted, and a new ship function distribution scheme is obtained to ensure the highest reliability of the system. The taboo search algorithm in the S3 is used for dynamically optimizing the reliability of the fleet system, and the optimization result is that x needs to be calculated78Reassigned to a node (3,1) instead of x68But due to x78Previously occupied by nodes (3,2), so that (x) is required88，x98) Is allocated to a node (3,2) in place of x78. Through the repeated adjustment, the reliability of the fleet system is restored to the highest level again. If there are multiple system reliability adjustments in parallel with highest level of reliabilityThe scheme is selected to have the smallest variation compared with the pre-adjustment distribution scheme, because the larger the system adjustment amplitude is, the higher the required cost is and the larger the risk is.
In summary, although the present invention has been described with reference to the preferred embodiments, it should be understood that various changes and modifications can be made by those skilled in the art without departing from the spirit and scope of the invention.

Claims (9)

1. The dynamic reliability optimization method of the fleet system based on tabu search is characterized by comprising the following steps of:
s1: constructing a reliable topological structure of the fleet system according to the initial fleet function allocation scheme of the given fleet system and the fleet system;
s2: determining constraint conditions of ship function distribution of each capacity node in a reliable topological structure of a fleet system;
s3: when part of ship functions in the fleet system are in fault, dynamically optimizing the reliability of the fleet system by using a tabu search algorithm on the premise of meeting constraint conditions to obtain a new ship function allocation scheme, wherein the method comprises the following steps:
s3.1. the reliable topological structure of the warship team system has M task modules, and the reliable topological structure of the mth task module comprises NmA feasible solution set of the nth capability node of the mth task module is SmnWherein M1, 2, Nm(ii) a Setting the maximum iteration times G, generating the quantity Ca by using a neighborhood solution in each iteration, and determining a fleet function allocation scheme before a fault;
s3.2, initializing a tabu table 1 and a tabu table 2, and setting the numerical values of elements in the tabu table to be 0;
Figure FDA0003577358980000011
s3.3 randomly generating an initial task Module sequence A0And capability node ordering sequence for each task module
Figure FDA0003577358980000012
S3.4 generating default taboo lengths of the taboo table 1 and the taboo table 2, L1And L2；
S3.5 ordering A based on task modules0And capability node sequencing sequence of each task module
Figure FDA0003577358980000021
Generating a group of fleet function distribution schemes, taking the distribution schemes as a current solution and a historical optimal solution, and calculating the fleet system reliability of the fleet function distribution schemes and the adjustment amplitude of the fleet function distribution schemes and the fleet function distribution schemes before failure;
s3.6 given task module sequencing A corresponding to the current solution and capability node sequencing sequence B in each task module1，B2，…，BMGenerating Ca group neighborhood feasible solutions as candidate solutions, wherein each candidate solution corresponds to a group of fleet function distribution schemes respectively, and calculating the fleet system reliability of the fleet function distribution schemes corresponding to each group of candidate solutions and the adjustment amplitude between each candidate solution and the fleet function distribution scheme before the fault;
s3.7, if the solution with the highest reliability of the fleet system in the candidate solutions is higher than the reliability of the fleet system in the historical optimal solution or the solution with the highest reliability of the fleet system in the candidate solutions is equal to the reliability of the fleet system in the historical optimal solution and the adjustment amplitude of the solution is lower than the adjustment amplitude corresponding to the historical optimal solution, selecting the candidate solution and enabling the candidate solution to update the current solution and the historical optimal solution; otherwise, selecting a solution with the highest reliability of the fleet system from the non-tabu objects of the candidate solutions, and updating the current solution and the historical optimal solution, wherein the non-tabu objects are solutions of which the corresponding elements of the tabu table 1 and the tabu table 2 in the candidate solutions are not all zero;
s3.8, updating the taboo table, and enabling the corresponding elements currently solved in the taboo table 1 and the taboo table 2 to be respectively restored to the default taboo length L1And L2And the rest are not 0 elementsSubtracting 1 from the numerical value;
s3.9, repeating S3.6 to S3.8 until the iteration number reaches the maximum iteration number G;
and S3.10, outputting the current historical optimal solution, namely a new ship function distribution scheme.
2. The dynamic fleet system reliability optimization method based on tabu search of claim 1, wherein: the given fleet system consists of a plurality of ships of different types, each ship has a plurality of different functions, and x is recordedijThe jth function of the ith ship; r isijFor its reliability, the value range is [0,1 ]]Is a known item; cijIs equal to xijMutually exclusive sets of ship functions, i.e. CijFunction of (1) and xijAnd cannot operate simultaneously.
3. The dynamic fleet system reliability optimization method based on tabu search of claim 2, wherein: the method comprises the steps that an initial fleet function distribution scheme of a fleet system is given, the fleet system serves as a plurality of tasks, each task corresponds to a task module, each task module comprises a plurality of capabilities, and one capability corresponds to a capability node; for any capacity node of any task module, the capacity node has corresponding capacity, the capacity is realized by one or more ships in a fleet system, all ships or ship combinations capable of realizing the capacity corresponding to the capacity node form a feasible solution set of the capacity node, and the reliability of all feasible solutions of the capacity node is known;
the capability nodes in the task modules are connected according to the logic relationship set in the initial fleet function distribution scheme to form a reliability topological structure of the task modules, and the task modules are connected according to the logic relationship set in the initial fleet function distribution scheme to form a reliability topological structure of the fleet system.
4. The dynamic reliability optimization method for the fleet based on tabu search according to claim 3, wherein: the constraint conditions include:
the first constraint is: the ship's single function cannot be provided for multiple capability nodes, xijAt most, the method appears once in a reliable topological structure of a fleet system;
the second constraint is: if xijIf the function occurs in the reliable topological structure of the fleet system, the mutually exclusive functions cannot occur in the reliable topological structure of the fleet system;
the third constraint: if the capability node has a capability node bound with the capability node, the functions under the mutually bound capability nodes must be provided by the same ship.
5. The dynamic reliability optimization method for the fleet based on tabu search according to any one of claims 1 to 4, wherein the reliability of the fleet system in the fleet function allocation scheme is expressed as a function of the reliability of each capability node, wherein the reliability of the fleet system is calculated from the reliability of each task module according to the logical connection relationship set in the fleet function allocation scheme, and the reliability of each task module is calculated from the reliability of each capability node according to the logical connection relationship set in the fleet function allocation scheme.
6. The dynamic optimization method for the reliability of the fleet based on tabu search as set forth in claim 1, wherein the amplitude D is adjustedvThe calculation method of (2) is as follows:
Figure FDA0003577358980000041
if the distribution result of the nth capability node of the mth task module in the generated fleet function distribution scheme is the same as the distribution result of the functional nodes of the fleet before the fault, Imn0, otherwise Imn＝1。
7. The method for dynamically optimizing reliability of a fleet based on tabu search according to claim 1,2, 3, 4 or 6, wherein S3.5 comprises:
s3.5.1 making m equal to 1;
s3.5.2 making n equal to 1;
s3.5.3 selecting the task module ranked at m-th in task module sequence A, selecting the capability node ranked at n-th in the task module, selecting the feasible solution with highest reliability from the feasible solution set available for the capability node, marking the ship function x used by the feasible solutionijAll the nodes are in an occupied state, and the reliability of the capacity node is calculated; if the capability node has no available feasible solution, marking the failure of the capability node, and the reliability is zero;
s3.5.4 if N is less than or equal to NmN is n +1, the step S3.5.3 is returned, otherwise, the next step is carried out;
s3.5.5, if M is less than or equal to M and M is M +1, returning to step S3.5.2, otherwise, ending, outputting the current solution, and calculating the reliability of the fleet system of the fleet function allocation scheme corresponding to the current solution and the adjustment amplitude of the fleet function allocation scheme and the fleet function allocation scheme before the fault.
8. The method for dynamically optimizing reliability of a fleet based on tabu search according to claim 1,2, 3, 4 or 6, wherein S3.6 comprises:
s3.6.1 let ca be 1;
s3.6.2 randomly selecting two task module sequence number exchange positions from the task module sequence A, and recording the result as A':
s3.6.3 sort the sequence B from the capability nodes of each task module1，B2，…，BNRandomly selecting a capability node sequencing sequence Bp，1≤p≤M；
S3.6.4 sorting sequence B from capability nodespRandomly selecting two node serial number exchange positions in the network, and recording the result as B'p；
S3.6.5 specifies A' and B1，…，Bp-1，B′p，Bp+1，…，BMGenerating a group of ship function distribution schemes as a group of neighborhood feasible solutions;
s3.6.6 if Ca is less than Ca, Ca +1, return to step S3.6.2; otherwise, ending, and outputting the Ca group neighborhood feasible solution as a candidate solution.
9. The method for dynamically optimizing reliability of a fleet based on tabu search according to claim 1,2, 3, 4 or 6, wherein S3.8 comprises:
s3.8.1 recording the sequence numbers of two task modules participating in random exchange in the current solution corresponding S3.6.2 as m respectively1And m2Let 1 be equal to or less than m1＜m2≤M；
S3.8.2, recording the sequence number of the randomly selected task module in S3.6.3 corresponding to the current solution as p, wherein p is more than or equal to 1 and less than or equal to M;
s3.8.3 taboo Table 1 shows the default taboo length L required to be restored1Is the m-th element1Line m2A column element; tabu table 2 requires a return to the default tabu length L2Is the p-th column element.
CN202110291800.3A 2021-03-18 2021-03-18 Dynamic reliability optimization method for fleet system based on tabu search Active CN112883496B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110291800.3A CN112883496B (en) 2021-03-18 2021-03-18 Dynamic reliability optimization method for fleet system based on tabu search

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110291800.3A CN112883496B (en) 2021-03-18 2021-03-18 Dynamic reliability optimization method for fleet system based on tabu search

Publications (2)

Publication Number Publication Date
CN112883496A CN112883496A (en) 2021-06-01
CN112883496B true CN112883496B (en) 2022-05-24

Family

ID=76041266

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110291800.3A Active CN112883496B (en) 2021-03-18 2021-03-18 Dynamic reliability optimization method for fleet system based on tabu search

Country Status (1)

Country Link
CN (1) CN112883496B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7418690B1 (en) * 2005-04-29 2008-08-26 Altera Corporation Local searching techniques for technology mapping
CN102880667A (en) * 2012-09-04 2013-01-16 北京航空航天大学 Test task scheduling method based on critical paths and tabu search
CN103280817A (en) * 2013-05-24 2013-09-04 武汉大学 Reactive balance area determining method based on tabu search
CN107392402A (en) * 2017-09-11 2017-11-24 合肥工业大学 Production and transport coordinated dispatching method and system based on modified Tabu search algorithm
CN112100233A (en) * 2020-07-29 2020-12-18 范峥 Flight time linking method and system based on tabu search algorithm

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140257767A1 (en) * 2013-03-09 2014-09-11 Bigwood Technology, Inc. PSO-Guided Trust-Tech Methods for Global Unconstrained Optimization

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7418690B1 (en) * 2005-04-29 2008-08-26 Altera Corporation Local searching techniques for technology mapping
CN102880667A (en) * 2012-09-04 2013-01-16 北京航空航天大学 Test task scheduling method based on critical paths and tabu search
CN103280817A (en) * 2013-05-24 2013-09-04 武汉大学 Reactive balance area determining method based on tabu search
CN107392402A (en) * 2017-09-11 2017-11-24 合肥工业大学 Production and transport coordinated dispatching method and system based on modified Tabu search algorithm
CN112100233A (en) * 2020-07-29 2020-12-18 范峥 Flight time linking method and system based on tabu search algorithm

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
基于神经网络的船舶主动力装置系统可靠性优化分配;安卫等;《中国造船》;20030325(第01期);第59-64页 *
船舶系统可靠性指标分配的多目标优化方法;朱学康等;《舰船科学技术》;20090715(第07期);第116-118页 *

Also Published As

Publication number Publication date
CN112883496A (en) 2021-06-01

Similar Documents

Publication Publication Date Title
US7707580B2 (en) Parallel computing method, parallel computing program and computer
CN109242290B (en) Automatic generation method for unmanned aerial vehicle group action scheme
CN112883496B (en) Dynamic reliability optimization method for fleet system based on tabu search
CN115016537A (en) Heterogeneous unmanned aerial vehicle configuration and mission planning joint optimization method under SEDA scene
CN113962481B (en) Resource allocation method and device for emergency materials and server
CN112835719B (en) Method and device for task processing, many-core system and computer readable medium
CN103577588A (en) Implement method for distributed transactions in cloud data base
CN110838993B (en) Subband switched path planning method and system
CN112685883A (en) Guarantee operation scheduling method for shipboard aircraft
CN110597199A (en) Helicopter weapon scheduling method and system based on optimal model of shooting vector
Tavakkoli-Moghaddam et al. A new mathematical model for a redundancy allocation problem with mixing components redundant and choice of redundancy strategies
Jansen et al. An approach for an operational vulnerability assessment for naval ships using a Markov model
CN114399181A (en) Method for optimizing intelligent process of guaranteeing ship-borne aircraft fleet
CN106126343A (en) MapReduce data balancing method based on increment type partitioning strategies
CN110059806A (en) A kind of multistage weighted network community structure detection method based on power-law function
CN116112490B (en) Low-complexity extensible Bayesian-busy-court fault-tolerant method and device and storage medium
CN116029406A (en) Multi-stage task equipment selective maintenance decision and task allocation combined optimization method
CN113222318B (en) Distributed on-satellite autonomous task planning method, system and storage medium
Zhang et al. Research on the construction method of ship formation action system
CN116069060A (en) Unmanned aerial vehicle formation reconstruction method and system based on minimum cost maximum flow algorithm
CN115277452A (en) ResNet self-adaptive acceleration calculation method based on edge-end cooperation and application
CN117930852A (en) Task allocation method for heterogeneous multi-target multi-unmanned boat based on distributed auction algorithm
Mohamed An interactive Bi-criteria heuristic algorithm for the coherent system assembly
CN117793717A (en) Unmanned plane cluster task allocation method based on game negotiation under attack condition
Wei et al. Effectiveness evaluation of ship-borne communication equipment on FAHP based ADC

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant