CN112685883A - Guarantee operation scheduling method for shipboard aircraft - Google Patents
Guarantee operation scheduling method for shipboard aircraft Download PDFInfo
- Publication number
- CN112685883A CN112685883A CN202011543440.3A CN202011543440A CN112685883A CN 112685883 A CN112685883 A CN 112685883A CN 202011543440 A CN202011543440 A CN 202011543440A CN 112685883 A CN112685883 A CN 112685883A
- Authority
- CN
- China
- Prior art keywords
- guarantee
- time
- order
- resource
- aircraft
- 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.)
- Granted
Links
Images
Abstract
The invention relates to the technical field of shipboard aircraft guarantee operation scheduling, in particular to a shipboard aircraft guarantee operation scheduling method, which comprises the following steps: step one, collecting data: collecting the shipboard aircraft guarantee operation requests and the idle guarantee battle positions in a period of time, and dividing the shipboard aircraft guarantee operation requests and the idle guarantee battle positions according to the time window requirements; step two, matching in a time window: matching the guarantee operation and the guarantee battle position in the same time window by using a greedy strategy or a Hungarian strategy; step three, scheduling: instructing the carrier-based aircraft to get to a proper guarantee battle position to complete guarantee operation according to the matching result; and step four, repeating the steps until all the shipboard aircraft protection operations are completed. The method can effectively schedule the deck resources, realize the high-efficiency guarantee of the operation of the carrier-based aircraft, and can well optimize the effectiveness of operation scheduling.
Description
Technical Field
The invention relates to the technical field of shipboard aircraft guarantee operation scheduling, in particular to a shipboard aircraft guarantee operation scheduling method.
Background
The carrier-based aircraft guarantee operation scheduling refers to reasonably arranging guarantee operation sequences required by carrier-based aircraft under the premise of limited time, space and resource constraints and efficiently completing operation guarantee of the carrier-based aircraft. Under a real operation environment, the carrier-based aircraft out-of-rack frequency determines the continuous operation capability of an aircraft carrier, and the carrier-based aircraft guarantee operation scheduling efficiency is a main factor influencing the carrier-based aircraft out-of-rack frequency. In the process of guaranteeing the carrier-based aircraft, the high dynamics of the environment on the aircraft carrier deck, the compactness of the carrier-based aircraft group guarantee operation, the mismatching of the carrier-based aircraft guarantee resources, different carrier-based aircraft need different guarantee resources, the characteristics of huge search solution space for the best matching of the carrier-based aircraft guarantee operation and the like require that each group of carrier-based aircraft to be guaranteed must be reasonably scheduled and planned for the guarantee process. The carrier-based aircraft to be ensured must complete operations such as landing, moving, ensuring, taking off and the like according to a plan within a specified time, wherein the operations comprise operations such as sliding, stopping, refueling, detecting, re-arming, refitting and the like. At the same time, performing the security operations requires the command center to allocate a limited and potentially conflicting set of resources to it, such as deck lifts, ejectors, landing strips, ground vehicles, tank trucks, loader trucks, and deck workers, etc. On an aircraft carrier platform, a deck is divided into a plurality of guarantee battle position areas, the resources all belong to corresponding guarantee battle positions, one guarantee battle position can have a plurality of resources, but the resources can be only used by one carrier-based aircraft at the same time, namely if the carrier-based aircraft executes guarantee operation, the carrier-based aircraft should be firstly moved to the guarantee battle position with the resources required by the operation. But these plans take into account sudden failures that may occur, such as airborne emergencies (fuel or hydraulic leaks, damaged bodies, malfunctioning instruments), equipment failures (malfunctioning ejectors, damaged tank wagons) and random service times (maintenance times, refueling times).
The research of ensuring operation scheduling of carrier-based aircraft of aircraft carrier is earlier carried out abroad, and is subject to three stages of manual experience scheduling, computer-aided scheduling and intelligent decision-making optimization scheduling, and is developing towards the direction of automation and intellectualization along with the development of computer science at present, for example, Michini and Ryan of MIT collaboratively develop a carrier-based aircraft deck operation planning decision support System DCAP (knock operation course of action plan) and a 'Ship integrated touch System' (DSIMS) based on touch screen control technology and developed on the basis of DCAP. In recent years, a large amount of research work is carried out in the field by domestic scholars, and common methods aiming at the problem are an intelligent particle swarm algorithm, a genetic algorithm, a simulated annealing algorithm, a tabu search algorithm, a modeling simulation method, an optimization method, a reverse reinforcement learning method based on an expert scheme and the like. However, the above method mostly takes static scheduling for guaranteeing the predictability of the operation as a research basis, but in an actual combat scene, the guarantee operation scheduling policy often needs to be dynamically adjusted in time according to a real-time environment, and the above method relies on the design of a cost model too much without accepting real-time feedback of the environment in actual operation, so that the execution effect of the final scheduling policy is difficult to meet the requirements of the real-time scene.
Disclosure of Invention
The invention provides a guarantee operation scheduling method for a shipboard aircraft, which aims to solve the problems in the method.
The invention discloses a shipboard aircraft guarantee operation scheduling method, which adopts the following technical scheme:
a dynamic scheduling method for guarantee operation of a shipboard aircraft comprises the following steps:
step one, collecting data: collecting the shipboard aircraft guarantee operation requests and the idle guarantee battle positions in a period of time, and dividing the shipboard aircraft guarantee operation requests and the idle guarantee battle positions according to the time window requirements;
step two, matching in a time window: matching the guarantee operation and the guarantee battle position in the same time window by using a greedy strategy or a game theory strategy;
step three, scheduling: instructing the carrier-based aircraft to get to a proper guarantee battle position to complete guarantee operation according to the matching result;
and step four, repeating the steps until all the shipboard aircraft protection operations are completed.
In the first step: firstly, modeling a problem, modeling a shipboard aircraft guarantee operation scheduling problem into a bipartite graph, and respectively forming a shipboard aircraft guarantee operation demand order and an idle guarantee battle position resource into two groups of unrelated and sequential sets;
for the ship-based aircraft guarantee operation demand order, the order is expressed as six-element group o ═ id, Si,Toc,Tod,Tdd,OtypeWhere id is the identity of the shipboard aircraft on the surface of the vessel where warranty work is required, SiFor each id corresponding to the geographical position (i.e. ship surface coordinate), T of the carrier-based aircraftocTime of occurrence of guarantee work demand for the carrier-based aircraft, TodIs the working time of the order, TddThe cut-off time required for the order, OtypeThe type of job required for the order;
for a guaranteed battle position resource, a set of guaranteed station position resources is represented as a quadruplet r ═ id, Sj,Cj,Rtype>. id is the resource identification of each station, SjFor each station resource's geographic location (i.e., ship surface coordinates), CjFor the capacity of each site resource, RtypeThe type of guarantee resources that can be provided for the station;
the collected data is divided according to a fixed time window.
In the second step, the operation process is a process that an order stream composed of different orders is continuously matched with a site, the site continuously guarantees the operation orders, the basis for matching between the site and the orders is a weight between two values, and the weight is determined by the following formula: qi (Qi)j＝|(|Tdd-t|)/(|Si-Sj|) | where | Tdd-t | represents the time difference between the cut-off time of the order and the current time, | Si-SjI represents the distance of the order from the site, and the weight value represents that the weight value is smaller as the cutoff time of the order is closer to the current time.
In the second step, after the data in the first step are collected under a greedy strategy, in the first step, in the order and the battle position divided according to the time window, according to the time-meeting requirement sumThe order and the battle station are calculated by using a weight formula according with other conditions to obtain a weight Q between the order and the battle stationijGenerating a weight matrix;
secondly, checking whether the operation type required by the order is in the operation types provided by the sites, taking the minimum value of the weight of the order-site which accords with the operation type to represent the minimum loss in the guarantee process, and if the site corresponding to the weight is occupied, selecting the minimum value of the rest weights;
thirdly, reserving orders which are not matched in the time window and entering the next time window for matching; the station which is successfully matched is set to be occupied, and then the time of the order is given to the station, which indicates that the station is occupied by the order;
and (3) judging the occupied station each time: if the duration of the occupied resource is not 0, continuously reducing the time according to a fixed step length of delta t until the duration is 0;
judging the resource capacity of the site, if the capacity is not 0, reducing the resource capacity to indicate that the resource capacity is ensured for one time, if the duration time of the resource capacity is 0, setting the resource capacity as unoccupied, deleting the resource capacity from an occupied set, and entering the third step for matching;
and after the matching is finished, entering the third step.
In the second step, after the data in the first step are collected under the Hungarian strategy, firstly, whether the operation type required by the order is in the operation types provided by the site is checked, and in the order and the battle position which are divided according to the time window, the weight Q between the order and the battle position is calculated by using a weight formula according to the time requirement and other conditionsijGenerating a weight matrix;
secondly, taking the weight matrix as input, solving a global optimal weight combination through a Hungary algorithm, and calculating a minimum weight;
thirdly, reserving orders which are not matched in the time window and entering the next time window for matching; setting the successfully matched resource as occupied, and assigning the time of the order to the resource to indicate that the resource is occupied by the order;
and (3) judging the resources occupied each time: if the duration of the occupied resource is not 0, continuously reducing the time of the occupied resource according to a fixed time window until the duration is 0;
judging the resource capacity of the site, if the capacity is not 0, reducing the resource capacity to indicate that the resource capacity is ensured for one time, if the duration time of the resource capacity is 0, setting the resource capacity as unoccupied, deleting the resource capacity from an occupied set, and entering the next time window for matching;
and after the matching is finished, entering the third step.
The invention has the beneficial effects that: 1. the method can effectively divide the matching relation according to the idle guarantee station position in the current time window and the comprehensive attributes of guarantee operation requirements, thereby effectively scheduling the deck resources and realizing the efficient guarantee of the operation of the carrier-based aircraft.
2. Two efficient and ordered shipboard aircraft guarantee operation scheduling algorithms based on batches are provided, real-time performance and high efficiency are considered, and the effectiveness of operation scheduling can be well optimized.
3. Modeling the real-time scheduling problem of the guaranteed operation as a matching problem of the task flow, and solving the problem by a combined optimization and graph theory method.
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, and 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 these drawings without creative efforts.
Fig. 1 is a flowchart of a specific embodiment of a guarantee operation scheduling method for a shipboard aircraft according to the present invention;
FIG. 2 is a flow chart of a matching algorithm under a greedy strategy;
FIG. 3 is a flow chart of a matching algorithm under the Hungarian strategy;
FIG. 4 is a schematic diagram of a simulation scenario of the present embodiment;
FIG. 5 is a diagram illustrating a dependency diagram of demand attributes of a guarantee job according to this embodiment;
FIG. 6 is a detailed view of the guaranteed battlefield of the present embodiment;
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
According to the embodiment of the shipboard aircraft guarantee operation scheduling method, 10 simulation scenes for guaranteeing battle positions are mainly constructed according to the scheduling process of shipboard aircraft guarantee operation on an actual aircraft carrier, and the specific scene is shown in fig. 4, wherein the reference numerals 0, 2, 3, 5 and 7 represent idle guarantee station positions, and the reference numerals 1, 4, 6, 8 and 9 represent occupied guarantee station positions. At the moment, 4 stations are occupied to ensure the operation of the carrier-based aircraft, and the rest 6 stations are in an idle state, and the simulation environment sets the following constraint conditions according to the requirements of a real environment:
1. and (3) time constraint: once any guarantee operation starts, the middle part cannot be interrupted; any security operation must be initiated after its predecessor is completed.
2. And (3) space constraint: when the idle guarantee station exists, the carrier-based aircraft can be parked; only one carrier-based aircraft can be parked at the same guarantee battle station at the same time.
3. Resource constraint: one guarantee battle station can only provide limited kinds of guarantee resources; one resource at the same battle station at the same time can be used by only one operation order belonging to one shipboard aircraft guarantee operation.
Suppose that in a certain time, a total of 8 carrier-based aircraft need to be triggered to execute operations, each carrier-based aircraft needs to complete guarantee operations, each guarantee operation has a dependency relationship as shown in fig. 5, and a plurality of guarantee battle positions can provide guarantee resources. At this time, 10 security battle positions on the aircraft carrier can normally provide security services, and the available security resources are shown in fig. 6.
Fig. 1 shows an overall flowchart of the method for scheduling guarantee operations of a carrier-based aircraft, which comprises the following steps:
step one 101, collecting data: collecting the shipboard aircraft guarantee operation requests and the idle guarantee battle positions in a period of time, and dividing the shipboard aircraft guarantee operation requests and the idle guarantee battle positions according to the time window requirements;
step two 102, matching in a time window: matching the guarantee operation and the guarantee battle position in the same time window by using a greedy strategy;
step three 103, scheduling: instructing the carrier-based aircraft to get to a proper guarantee battle position to complete guarantee operation according to the matching result;
and step four 104, repeating the steps until all the shipboard aircraft protection operations are completed.
In step one 101, the following are specifically set:
firstly, modeling is carried out on the problem of the guarantee operation scheduling of the shipboard aircraft into a bipartite graph, and the shipboard aircraft guarantee operation demand order and the idle guarantee battle position resources are respectively formed into two groups which are not related to each other and have a certain sequence.
For the ship-based aircraft protection work demand order, the order can be expressed as a six-tuple o ═ id, Si,Toc,Tod,Tdd,OtypeThe order is an identification of the shipboard aircraft guarantee operation, which represents specific attributes of the shipboard aircraft in the shipboard aircraft guarantee operation and corresponding operation attributes needing to be completed, wherein id is the identification of the shipboard aircraft needing to be guaranteed on the ship surface, and SiFor each id corresponding to the geographical position (i.e. ship surface coordinate), T of the carrier-based aircraftocTime of occurrence of guarantee work demand for the carrier-based aircraft, TodIs the working time of the order, TddThe cut-off time required for the order, OtypeThe type of job required for the order.
For a guaranteed battle site resource, a set of guaranteed station site resources may be represented as a four-tuple r ═ id, Sj,Cj,Rtype>. id is the resource identification of each station, SjFor each geographical location of the site resource (i.e. for each siteShip surface coordinates), CjFor the capacity of each site resource, RtypeThe type of guaranteed resources that can be provided for a station.
For ease of calculation, the collected data is divided by a fixed time window.
Step two 102 specifically comprises the following steps:
for the operation process, the order flow composed of different orders is continuously matched with the site, and the site continuously guarantees the process of operating the orders. Therefore, the basis for matching between the site and the order is a weight between two values, and the weight is determined by the following formula:
Qij＝|(|Tdd-t|)/(|Si-Sj|)|
wherein | Tdd-t | represents the time difference between the cut-off time of the order and the current time, | Si-SjI represents the distance of the order from the site, and the weight value represents that the weight value is smaller as the cutoff time of the order is closer to the current time.
As shown in FIG. 2, when the greedy matching algorithm of the greedy strategy is adopted, in the first step 201, in the order and the battle position divided according to the time window, the weight Q between the order and the battle position is calculated by using the weight formula according to the time requirement and other conditionsijAnd generating a weight matrix.
In the second step 202, it is checked whether the job type required by the order is in the job types that can be provided by the sites, the minimum value of the order-site weight value that matches the job type is taken to represent the minimum loss in the guarantee process, and if the site corresponding to the weight value is occupied, the minimum value of the remaining weight values is selected.
In the third step 203, the order which is not matched in the time window is reserved and enters the next time window for matching; the station with the successful matching is set to be occupied, and then the time of the order is given to the station, which indicates that the station is occupied by the order.
And (3) judging the occupied station each time: if the duration of the occupied resource is not 0, the time is continuously reduced by a fixed step of delta t until the duration is 0.
And (3) judging the resource capacity of the station, if the capacity is not 0, reducing the resource capacity to indicate that the resource capacity is ensured for one time, if the duration is 0, setting the resource capacity as unoccupied, deleting the resource capacity from an occupied set, and entering the third step 203 for matching.
After the matching is finished, the process proceeds to step three 103.
Step three 103 specifically comprises the following steps:
and scheduling the carrier-based aircraft according to the matching result output in the second step 102, namely sequentially indicating the carrier-based aircraft to go to the matched guarantee battle station for operation.
In step four 104, the method specifically comprises the following steps:
if all the guarantee operations of all the shipboard aircraft are completely executed through the third step 103, finishing the scheduling; if the remaining guarantee operations are not completed, repeating the first step 101 to the fourth step 104 until all the guarantee operations of all the carrier-based aircraft are completed.
In another embodiment of the present embodiment, as shown in fig. 3, in the same manner as the above, only the hungarian policy different from the greedy policy is adopted in step two 102, which is detailed as follows:
when the greedy matching algorithm of the hungarian strategy is adopted, in a first step 301, whether the operation type required by the order is in the operation types provided by the site is checked, and in the order and the battle position divided according to the time window, the weight Q between the order and the battle position is calculated by using a weight formula according to the time requirement and other conditionsijAnd generating a weight matrix.
In the second step 302, the weight matrix is used as input, the global optimal weight combination is solved through the Hungarian algorithm, and the minimum weight is calculated.
In the third step 303, the order which is not matched in the time window is reserved and enters the next time window for matching; and setting the resource which is successfully matched as occupied, and then assigning the time of the order to the resource to indicate that the resource is occupied by the order.
And (3) judging the resources occupied each time: if the duration of the occupied resource is not 0, the time is continuously reduced by a fixed time window until the duration is 0.
And judging the resource capacity of the site, if the capacity is not 0, reducing the resource capacity to indicate that the resource capacity is ensured for one time, if the duration time is 0, setting the resource capacity as unoccupied, and deleting the resource capacity from an occupied set to enter the next time window for matching.
After the matching is finished, the process proceeds to step three 103.
In conclusion, the invention discloses a self-adaptive shipboard aircraft guarantee operation scheduling method. The method mainly comprises the following steps: firstly, collecting a shipboard aircraft guarantee operation request and idle guarantee battle position information in a period of time, and distinguishing the shipboard aircraft guarantee operation request and the idle guarantee battle position information by dividing a time window; secondly, matching the shipboard aircraft guarantee operation demand order and the idle guarantee battlefield in the same time window by a greedy strategy or a Hungary strategy; then, indicating the carrier-based aircraft to go to a corresponding guarantee battle position according to the matching result, and finishing guarantee operation; and finally, repeating the steps until all the shipboard aircrafts complete the guarantee operation. The method can be used for guaranteeing the reasonable division of the operation request sequence by using the intelligent agent with the self-adaptive division time window in the shipboard aircraft guarantee operation scheduling, thereby effectively scheduling the deck resources and realizing the high-efficiency guarantee of the shipboard aircraft operation.
The present invention brings the following effects:
1. the method can effectively divide the matching relation according to the idle guarantee station position in the current time window and the comprehensive attributes of guarantee operation requirements, thereby effectively scheduling the deck resources and realizing the efficient guarantee of the operation of the carrier-based aircraft.
2. Two efficient and ordered shipboard aircraft guarantee operation scheduling algorithms based on batches are provided, real-time performance and high efficiency are considered, and the effectiveness of operation scheduling can be well optimized.
3. Modeling the real-time scheduling problem of the guaranteed operation as a matching problem of the task flow, and solving the problem by a combined optimization and graph theory method.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (4)
1. A dynamic scheduling method for guarantee operation of a shipboard aircraft is characterized by comprising the following steps:
step one, collecting data: collecting the shipboard aircraft guarantee operation requests and the idle guarantee battle positions in a period of time, and dividing the shipboard aircraft guarantee operation requests and the idle guarantee battle positions according to the time window requirements;
step two, matching in a time window: matching the guarantee operation and the guarantee battle position in the same time window by using a greedy strategy or a Hungarian strategy;
step three, scheduling: instructing the carrier-based aircraft to get to a proper guarantee battle position to complete guarantee operation according to the matching result;
and step four, repeating the steps until all the shipboard aircraft protection operations are completed.
2. The dynamic scheduling method for the guarantee operations of the shipboard aircraft according to claim 1, wherein in the first step: firstly, modeling a problem, modeling a shipboard aircraft guarantee operation scheduling problem into a bipartite graph, and respectively forming a shipboard aircraft guarantee operation demand order and an idle guarantee battle position resource into two groups of unrelated and sequential sets;
for the ship-based aircraft guarantee operation demand order, the order is expressed as six-element group o ═ id, Si,Toc,Tod,Tdd,OtypeWhere id is the identity of the shipboard aircraft on the surface of the vessel where warranty work is required, SiFor each id corresponding to the geographical position (i.e. ship surface coordinate), T of the carrier-based aircraftocTime of occurrence of guarantee work demand for the carrier-based aircraft, TodIs the working time of the order, TddThe cut-off time required for the order, OtypeThe type of job required for the order;
for a guaranteed battle position resource, a set of guaranteed station position resources is represented as a quadruplet r ═ id, Sj,Cj,Rtype>. id is the resource identification of each station, SjFor each station resource's geographic location (i.e., ship surface coordinates), CjFor the capacity of each site resource, RtypeThe type of guarantee resources that can be provided for the station;
the collected data is divided according to a fixed time window.
3. The dynamic scheduling method for the guarantee operations of the carrier-based aircraft according to claim 2, wherein in the second step: the operation process is that an order stream consisting of different orders is continuously matched with a site, the site continuously guarantees the process of operating the orders, the basis for matching between the site and the orders is a weight between two values, and the weight is determined by the following formula: qi (Qi)j＝|(|Tdd-t|)/(|Si-Sj|) | where | Tdd-t | represents the time difference between the cut-off time of the order and the current time, | Si-SjI represents the distance between the order and the site, and the weight value represents that the weight value is smaller when the cutoff time of the order is closer to the current time;
under a greedy strategy, after the data in the first step are collected, in the first step, in the order and the battle position divided according to the time window, the weight Q between the order and the battle position is calculated by using a weight formula according to the time requirement and other conditionsijGenerating a weight matrix;
secondly, checking whether the operation type required by the order is in the operation types provided by the sites, taking the minimum value of the weight of the order-site which accords with the operation type to represent the minimum loss in the guarantee process, and if the site corresponding to the weight is occupied, selecting the minimum value of the rest weights;
thirdly, reserving orders which are not matched in the time window and entering the next time window for matching; the station which is successfully matched is set to be occupied, and then the time of the order is given to the station, which indicates that the station is occupied by the order;
and (3) judging the occupied station each time: if the duration of the occupied resource is not 0, continuously reducing the time according to a fixed step length of delta t until the duration is 0;
judging the resource capacity of the site, if the capacity is not 0, reducing the resource capacity to indicate that the resource capacity is ensured for one time, if the duration time of the resource capacity is 0, setting the resource capacity as unoccupied, deleting the resource capacity from an occupied set, and entering the third step for matching;
and after the matching is finished, entering the third step.
4. The dynamic scheduling method for the guarantee operations of the carrier-based aircraft according to claim 2, wherein in the second step: the operation process is that an order stream consisting of different orders is continuously matched with a site, the site continuously guarantees the process of operating the orders, the basis for matching between the site and the orders is a weight between two values, and the weight is determined by the following formula: qij＝|(|Tdd-t|)/(|Si-Sj|) | where | Tdd-t | represents the time difference between the cut-off time of the order and the current time, | Si-SjI represents the distance between the order and the site, and the weight value represents that the weight value is smaller when the cutoff time of the order is closer to the current time;
under the Hungarian strategy, after the data in the first step are collected, firstly, whether the operation types required by the orders are in the operation types capable of being provided by the site is checked, in the orders and the battle positions divided according to the time window, the orders and the battle positions are calculated according to the weight formula according to the time requirement and other conditionsijGenerating a weight matrix;
secondly, taking the weight matrix as input, solving a global optimal weight combination through a Hungary algorithm, and calculating a minimum weight;
thirdly, reserving orders which are not matched in the time window and entering the next time window for matching; setting the successfully matched resource as occupied, and assigning the time of the order to the resource to indicate that the resource is occupied by the order;
and (3) judging the resources occupied each time: if the duration of the occupied resource is not 0, continuously reducing the time of the occupied resource according to a fixed time window until the duration is 0;
judging the resource capacity of the site, if the capacity is not 0, reducing the resource capacity to indicate that the resource capacity is ensured for one time, if the duration time of the resource capacity is 0, setting the resource capacity as unoccupied, deleting the resource capacity from an occupied set, and entering the next time window for matching;
and after the matching is finished, entering the third step.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011543440.3A CN112685883B (en) | 2020-12-23 | 2020-12-23 | Guarantee operation scheduling method for shipboard aircraft |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011543440.3A CN112685883B (en) | 2020-12-23 | 2020-12-23 | Guarantee operation scheduling method for shipboard aircraft |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112685883A true CN112685883A (en) | 2021-04-20 |
| CN112685883B CN112685883B (en) | 2022-12-02 |
Family
ID=75451346
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011543440.3A Active CN112685883B (en) | 2020-12-23 | 2020-12-23 | Guarantee operation scheduling method for shipboard aircraft |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112685883B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114595958A (en) * | 2022-02-28 | 2022-06-07 | 哈尔滨理工大学 | Shipboard aircraft guarantee operator scheduling method for emergency |
| CN117494919A (en) * | 2023-11-13 | 2024-02-02 | 广州力生机器人技术有限公司 | Path planning method and device based on multi-robot collaborative stacking operation |
| CN117494919B (en) * | 2023-11-13 | 2024-04-19 | 广州力生机器人技术有限公司 | Path planning method and device based on multi-robot collaborative stacking operation |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5093794A (en) * | 1989-08-22 | 1992-03-03 | United Technologies Corporation | Job scheduling system |
| US20020123814A1 (en) * | 2001-03-05 | 2002-09-05 | Dell Products L.P. | Method, system and facility for controlling resource allocation within a manufacturing environment |
| CN104598994A (en) * | 2015-01-23 | 2015-05-06 | 广东易富网络科技有限公司 | Related logistics transportation optimized dispatching method with time-varying time window |
| CN105825013A (en) * | 2016-03-16 | 2016-08-03 | 中国船舶工业系统工程研究院 | Aviation command guaranty optimization method based on discrete event system |
| CN107193655A (en) * | 2017-05-17 | 2017-09-22 | 南京大学 | A kind of fair resource dispatching method towards big data processing based on utility function |
| CN108241530A (en) * | 2016-12-23 | 2018-07-03 | 西北大学 | A kind of streaming computing bipartite graph method for scheduling task based on Storm |
| CN110781614A (en) * | 2019-12-06 | 2020-02-11 | 北京工业大学 | Shipboard aircraft tripping recovery online scheduling method based on deep reinforcement learning |
| CN111967642A (en) * | 2020-07-10 | 2020-11-20 | 北京航空航天大学 | Resource constraint type dynamic ship scheduling method and scheduling platform based on time window strategy |
-
2020
- 2020-12-23 CN CN202011543440.3A patent/CN112685883B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5093794A (en) * | 1989-08-22 | 1992-03-03 | United Technologies Corporation | Job scheduling system |
| US20020123814A1 (en) * | 2001-03-05 | 2002-09-05 | Dell Products L.P. | Method, system and facility for controlling resource allocation within a manufacturing environment |
| CN104598994A (en) * | 2015-01-23 | 2015-05-06 | 广东易富网络科技有限公司 | Related logistics transportation optimized dispatching method with time-varying time window |
| CN105825013A (en) * | 2016-03-16 | 2016-08-03 | 中国船舶工业系统工程研究院 | Aviation command guaranty optimization method based on discrete event system |
| CN108241530A (en) * | 2016-12-23 | 2018-07-03 | 西北大学 | A kind of streaming computing bipartite graph method for scheduling task based on Storm |
| CN107193655A (en) * | 2017-05-17 | 2017-09-22 | 南京大学 | A kind of fair resource dispatching method towards big data processing based on utility function |
| CN110781614A (en) * | 2019-12-06 | 2020-02-11 | 北京工业大学 | Shipboard aircraft tripping recovery online scheduling method based on deep reinforcement learning |
| CN111967642A (en) * | 2020-07-10 | 2020-11-20 | 北京航空航天大学 | Resource constraint type dynamic ship scheduling method and scheduling platform based on time window strategy |
Non-Patent Citations (4)
| Title |
|---|
| LI, XIN;ZHAO, YANHENG;LI, YIBIN;JU, LEI;JIA, ZHIPING: "An improved energy-efficient scheduling for precedence constrained tasks in multiprocessor clusters", 《LECTURE NOTES IN COMPUTER SCIENCE》 * |
| 于连飞等: "保障时间不确定情况下的舰载机航保资源调度", 《火力与指挥控制》 * |
| 司维超等: "基于多种群协作混沌智能算法的舰载机出动调度", 《计算机应用研究》 * |
| 苏析超等: "混合差分进化算法在舰载机出动调度中的应用", 《计算机仿真》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114595958A (en) * | 2022-02-28 | 2022-06-07 | 哈尔滨理工大学 | Shipboard aircraft guarantee operator scheduling method for emergency |
| CN117494919A (en) * | 2023-11-13 | 2024-02-02 | 广州力生机器人技术有限公司 | Path planning method and device based on multi-robot collaborative stacking operation |
| CN117494919B (en) * | 2023-11-13 | 2024-04-19 | 广州力生机器人技术有限公司 | Path planning method and device based on multi-robot collaborative stacking operation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112685883B (en) | 2022-12-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Park et al. | A scheduling method for berth and quay cranes | |
| CN109724612A (en) | A kind of AGV paths planning method and equipment based on topological map | |
| CN104408589A (en) | AGV optimization scheduling method based on mixed particle swarm optimization | |
| Reddy et al. | Flexible manufacturing systems modelling and performance evaluation using AutoMod | |
| Stoughton et al. | Direct construction of optimal generation mix | |
| CN112685883B (en) | Guarantee operation scheduling method for shipboard aircraft | |
| Yan et al. | Model-based research for aiding decision-making during the design and operation of multi-load automated guided vehicle systems | |
| Guo et al. | Multi-period coordinated optimization on berth allocation and yard assignment in container terminals based on truck route | |
| Sun et al. | AGV-based vehicle transportation in automated container terminals: A survey | |
| Vincent et al. | An improved immunoglobulin-based artificial immune system for the aircraft scheduling problem with alternate aircrafts | |
| CN112633562B (en) | Airport stand intelligent scheduling method | |
| CN112396298B (en) | Unmanned helicopter multi-machine collaborative task planning method | |
| Wang et al. | Research on location selection strategy for airlines spare parts central warehouse based on METRIC | |
| Shang et al. | Collaborative path planning of multiple carrier-based aircraft based on multi-agent reinforcement learning | |
| Zhao et al. | Trajectory predictions with details in a robotic twin-crane system | |
| Vianna et al. | Aircraft line maintenance planning based on PHM data and resources availability using large neighborhood search | |
| Xu et al. | Dynamic spare point application based coordination strategy for multi-AGV systems in a WIP warehouse environment | |
| CN113222497B (en) | Method for selecting address of aviation material sharing center library based on METRIC | |
| CN116027739A (en) | Cluster warehouse-in and warehouse-out transportation collaborative scheduling optimization method, device and equipment | |
| CN113868955A (en) | Modeling method of aviation equipment support system | |
| US11426871B1 (en) | Automated robotic floor map generation | |
| CN110569543B (en) | Complex system self-adaption method and system supporting mapping dimension lifting | |
| Zhou et al. | Research on block storage yard scheduling according to grid method | |
| Mi et al. | Smart Port and System Simulation/Emulation | |
| Арутюнян et al. | MATHEMATICAL TOOLS FOR SOLVING PRACTICAL PROBLEMS OF CONSTRUCTION USING CONSTRUCTION LOGISTICS APPROACHES |
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 |