CN106304109B - A kind of generation method of the shortwave broadcasting resource scheduling scheme based on local search - Google Patents
A kind of generation method of the shortwave broadcasting resource scheduling scheme based on local search Download PDFInfo
- Publication number
- CN106304109B CN106304109B CN201610608433.4A CN201610608433A CN106304109B CN 106304109 B CN106304109 B CN 106304109B CN 201610608433 A CN201610608433 A CN 201610608433A CN 106304109 B CN106304109 B CN 106304109B
- Authority
- CN
- China
- Prior art keywords
- equipment
- scheduling scheme
- local search
- raw data
- shortwave broadcasting
- 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.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/22—Traffic simulation tools or models
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/08—Testing, supervising or monitoring using real traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
Abstract
The generation method of the invention discloses a kind of shortwave broadcasting resource scheduling scheme based on local search, input is the raw data set of shortwave broadcasting resource, including transmitting equipment, launch mission, the coverage effect mapping for emitting equipment, output is shortwave broadcasting resource scheduling scheme, step: 1) defines raw data set；2) raw data set is initialized according to the definition of step 1；3) according to the raw data set generating device conflict relationship in step 2；4) greedy algorithm Fast Construction initial schedule scheme set is passed through based on the device conflict relationship in the raw data set and step 3) in step 2)；5) local searching strategy is defined；6) pass through local search algorithm Optimization Steps 4) in initial schedule scheme set.If current scheduling scheme is excellent enough or after successive ignition, it can not find in neighbouring solution space when more preferably being solved than current solution, obtain final scheduling scheme set.
Description
Technical field
The generation method of the present invention relates to a kind of shortwave broadcasting resource scheduling scheme based on local search, belongs to software work
Journey technical field.
Background technique
Currently, the strength position of China's short wavelength emissions is at the forefront in the world, possess the powerful tens of seats of shortwave broadcasting transmitting station,
It is distributed in national 19 provinces, cities and autonomous regions.But to the overall planning for the broadcast resource being distributed throughout the country and scientific and effective utilization
Etc. still have bottleneck, lack the shortwave broadcasting resource scheduling algorithm an of global optimization, be unable to fully allotment and effectively benefit
With a large amount of shortwave broadcasting resources in all parts of the country are distributed in, the effect of shortwave broadcasting resource is efficiently played.Only by automatic
Change, intelligentized technological means, science rationally, is quickly and efficiently planned as a whole to deploy upper tuber of stemona short-wave transmitter, nearly thousand secondary shortwave
Antenna and short frequency resource, the broadcast nerve of a covering covering the whole world that " the Tibet-Xinjiang Project " can just built up and monitoring net play maximum
Effect.It is distributed in high-power short-wave broadcast transmitter in all parts of the country for unified management, unified allocation of resources and making full use of, improves
Quick-reaction capability improves coverage effect and broadcast quality, rapid development and adjustment broadcasting frequency, program and equipment distribution side
Case needs to study and establishes broadcast scheduling mathematical model, researches and develops a kind of Optimization scheduling algorithm for capableing of rapid solving.
The final goal of shortwave broadcasting scheduling of resource is to establish the mathematical model of broadcast program and transmission resources distribution, is used
Newest combined optimization technique is researched and developed a kind of shortwave broadcasting priority scheduling of resource algorithm for capableing of rapid solving, is made full use of, closes
Reason allotment transmission resources in all parts of the country, with least transmission resources, it is ensured that broadcasting-quality is in global optimum's state.And it is directed to
Given broadcast coverage areas, the case where meeting the constraint conditions such as field strength, reliability, number of frequencies and coverage effect requirement
Under, using least transmission resources, rapid development goes out the broadcast program and transmission resources scheduling scheme of each target area, so that
Whole allocation plan is the solution of global optimum, to obtain the broadcast scheduling scheme of global optimum.
Scheduling problem can be modeled as a cum rights bigraph (bipartite graph), and the collection of broadcast program is combined into point set P, and the collection for emitting equipment is combined into
Point set D.Wherein:
1. having side e between point p ∈ P and point d ∈ D, can be emitted by transmitting equipment and if only if corresponding broadcast program.Side e
Weight w indicate launching effect.
2. the set C=that conflicts { di, dj } | equipment di conflicts with dj }
3. the cum rights bipartite graph G={ P D, E, W, C } of belt restraining, wherein weight function W:E- > R+.
Obviously, scheduling problem is that (NPC is a subclass of decision problem in NP to a NPC, they are in following meanings
It is most difficult to, i.e., can be solved if one of which is proved to polynomial time deterministic algorithm, all problems in NP
Can be solved with polynomial time deterministic algorithm) problem.It proves as follows:
Firstly, for a Bipartite Matching problem with conflict constraint, after finding its solution, it is easy to multinomial
Examine whether it is strictly to solve, therefore the problem is np problem in the formula time, will be proven below it is NPC.
Known independent set problem is NPC, and an independent set problem specification is below Bipartite Matching problem by we.
To a k independent set problem, it is Map by seal involved in problem, constructs constraint bigraph (bipartite graph) of equal value therewith
It is as follows with problem:
Bigraph (bipartite graph): left half vertex set X include Map in whole vertex, any one node of right half vertex set Y and
The side whole vertex Jun You in X is connected.
Constraint in X: the vertex for having side connected in figure Map cannot be assigned simultaneously.
Problem: a complete distribution is asked?
Such specification is obviously polynomial time, so the Bipartite Matching problem with conflict constraint is NPC, band
The bigraph (bipartite graph) maximum matching problem of constraint is NP hardly possible.
There are two main classes: Complete Algorithm and non-fully algorithm for the method for solution np hard problem at present.Wherein Complete Algorithm energy
Enough accurate solutions, but usually there is exponential time complexity, it is only applicable to small-scale example.Non-fully algorithm can only approximation ask
Solution, time complexity is low, can solve extensive example.The latter can be divided into approximate algorithm and heuritic approach again, wherein the former energy
Enough degrees of approximation for calculating solution, actual effect is often poor, and the latter is the algorithm constructed based on intuitive or experience, in acceptable flower
To the solution to go wrong under expense (calculating time, occupied space).Quickly and effectively, practical, the experience of designer is relied on larger.
It is unpractical using Complete Algorithm in conjunction with the feature of broadcast resource scheduling problem according to analysis above-mentioned.At this
In the case of kind, the present invention takes local search algorithm to solve the problems, such as the generation of shortwave broadcasting resource scheduling scheme.
Summary of the invention
It is an object of the invention to improve the formation efficiency of shortwave broadcasting resource scheduling scheme, one kind is provided and is searched based on part
The generation method of the shortwave broadcasting resource scheduling scheme of rope algorithm, this method are turned by carrying out mathematical modeling to shortwave broadcasting resource
The matching problem of cum rights bigraph (bipartite graph) is turned to, then passes through the local search approach rapid solving problem.
In order to achieve the object of the present invention, the technical solution of use is summarized as follows:
A kind of generation method of the shortwave broadcasting resource scheduling scheme based on local search, inputs as shortwave broadcasting resource
Raw data set is exported including transmitting equipment, launch mission, the coverage effect for emitting equipment as shortwave broadcasting scheduling of resource side
Case, it is characterised in that the following steps are included:
1) raw data set is defined；
2) raw data set is initialized according to the definition of step 1；
3) according to the raw data set generating device conflict relationship in step 2；
4) greedy algorithm Fast Construction initial schedule scheme set is passed through based on the raw data set in step 2；
5) local searching strategy is defined；
6) pass through the initial schedule scheme set in local search algorithm Optimization Steps 4.After successive ignition, neighbouring solution is empty
Between in can not find when more preferably being solved than current solution, obtain final scheduling scheme set.
The step (1), specifically includes the following steps:
(1-1) definition transmitting equipment D, transmitting equipment is a triple, including antenna, transmitter, line switching:
D={ antenna, transmitter, line switching }；
(1-2) defines launch mission M, and launch mission is a four-tuple, including programme information, service area, start time
And finish time:
M={ programme information, service area, start time, finish time }；
(1-3) defines monitoring point S, and monitoring point is a triple, including number, sub-district in service area, area:
S={ service area is numbered in area, sub-district }；
(1-4) definition covering element E1, covering element be a four-tuple, including transmitting equipment, monitoring point, frequency range, when
It carves:
E1={ transmitting equipment, monitoring point, frequency range, moment }；
(1-5) defines coverage effect E2, and coverage effect is a binary group, including field strength, reliability:
E2={ field strength, reliability }；
(1-6) defines coverage effect mapping, and coverage effect mapping is to cover elements combination to the part of coverage effect set
Mapping；
The step (3), specifically includes the following steps:
The specific rules of (3-1) device conflict relationship C are as follows:
Wherein, D indicates transmitting equipment, and t indicates that the transmitter that equipment uses, a indicate the antenna that equipment uses, and s expression is set
The standby switch used.For any two equipment Di and Dj, there is following conflict rule:
Conflict rule 1:
Ti=tj, i.e. equipment use identical transmitter；
Conflict rule 2:
Ai=aj, i.e. equipment use identical antenna；
Conflict rule 3:
Si=sj, i.e. equipment use identical switch；
The step (4), specifically includes the following steps:
(4-1) defines scheduling scheme P, and scheduling scheme is a triplet sets, and each triple includes launch mission, hair
Jet device, frequency:
P={ launch mission emits equipment, frequency }；
Wherein, each launch mission must an at least scheduling scheme；
(4-2) defines the conflict relationship of launch mission, it is assumed that i and j is two launch missions, at the beginning of b expression task
It carving, e indicates the finish time of task, there is following conflict rule:
Conflict rule 1:
bj≤bi<ej
Conflict rule 2:
bi≤bj<ei
(4-3) is for launch mission M1 and M2, if M1 and M2 has conflict, for M1 ∈ P1 and M2 ∈ P2, P1
Frequency range and P2 frequency range cannot identical and P1 equipment and the equipment of P2 cannot exist and conflict；
(4-4) definition can cover, if transmitting equipment Mr. Yu moment frequency range is in the field strength and reliability point of certain monitoring point
When not reaching the threshold value of setting, then the transmitting equipment can cover this monitoring point；
(4-5) defines coverage rate, and each launch mission needs the monitoring point sum C covered are as follows: monitoring point in service area
Quantity * (finish time-start time+1).Selecting certain transmitting equipment that can add up the point sum of covering is AP, then coverage rate=
AP/C；
(4-6) defines Greedy strategy, and the coverage rate of each launch mission must reach the threshold value of setting.For each hair
Task is penetrated, it is preferential to choose the highest equipment of coverage rate.
The step (5), specifically includes the following steps:
(5-1) defines local searching strategy, in search process, selects one in the neighbouring solution space currently solved always
Optimal solution is as next solution, until reaching a locally optimal solution.
The step (6), specifically includes the following steps:
(6-1) terminates local search if current solution meets coverage rate threshold requirement；Conversely, judging current search step number
Whether it is greater than preset search step threshold, if it is terminates to search for；Otherwise it executes (6-2)；
(6-2) selects a transmitting equipment from scheduling scheme, and removes and the equipment scheme from scheduling scheme set
Relevant scheduling scheme；
(6-3) executes local search optimization and currently solves.Terminate local search if searching for failure；Otherwise current search walks
Number plus one executes (6-1).
Compared with currently existing scheme formulating method, the invention has the following advantages that
(1) present invention generates scheduling scheme by carrying out modeling module local search algorithm to shortwave broadcasting resource, subtracts
The time for cost of developing programs is lacked.
(2) present invention chooses transmitting equipment so that whole coverage effect is optimal when generating scheduling scheme for principle, improves
Whole coverage effect.
(3) present invention has fully considered the coverage effect of each transmitting equipment when generating scheduling scheme and based on this selection
Emit equipment, reducing needs number of devices to be used.
Detailed description of the invention
Fig. 1 is the overview flow chart of the realization of the method for the present invention in embodiment；
Fig. 2 is the flow chart of the local search of the realization of the method for the present invention in embodiment.
Specific embodiment
The main terms used in this specification and symbol is described below:
(1) emit the monitoring point equipment & launch mission &
It is transmitting equipment by the triple that antenna, transmitter, switch form.
It is launch mission by the four-tuple that programme information, service area, start time, finish time form.
It is monitoring point by the triple numbered in service area, area, sub-district forms.
(2) & coverage rate is covered
Emit equipment with the operation of certain frequency and when the field strength and reliability of certain monitoring point reach threshold value at a certain moment, the equipment
This monitoring point can be covered at this moment.
To Mr. Yu's scheduling scheme, the monitoring point quantity and launch mission for emitting the covered launch mission of equipment need coating
The ratio of the monitoring point quantity of lid is coverage rate.
(3) scheduling scheme
To each launch mission, all at least need to select a transmitting equipment and frequency.By launch mission, transmitting equipment,
The triple of frequency composition is scheduling scheme.
A kind of generation method of shortwave broadcasting resource scheduling scheme based on local search proposed by the present invention, utilizes part
Searching algorithm quickly generates the scheduling scheme set for meeting given coverage rate threshold value.
Shortwave broadcasting resource scheduling scheme to provided by the invention based on local search combined with specific embodiments below
Generation method is described in detail.For using one section of simple code as program to be measured, illustrate workflow of the invention, C
Language codes are described as follows:
Wherein, the MAX_STEP variable that the second line code defines indicates the maximum step number of local search, is set as here
100.The greedy_construct () function representation of the third line constructs initial solution using Greedy strategy, if initial solution meets
It is required that then terminating program, fourth line is otherwise executed to the 6th row.The step of fourth line indicates the step number of current search, is initialized as
1.Fifth line is a circulation, and local_search () indicates to optimize current solution using local searching strategy, and MAX_STEP is office
The maximum step number of portion's search, step indicate the execution number of current local search.If current search step number is less than maximum step number
And local search can optimize current solution and then execute the 6th line code, i.e., current step number adds one, until local search cannot be excellent again
Changing current solution or searching for when step number has reached maximum step number terminates.
The specific implementation process of the generation method of shortwave broadcasting resource scheduling scheme based on local search of the invention is such as
Under, as shown in Figure 1:
(1) raw data set of shortwave broadcasting resource is defined；
(2) raw data set is initialized according to the definition in step (1)；
(3) according to the raw data set generating device conflict relationship of step (2)；
(4) initial schedule scheme set is gone out based on greedy algorithm Fast Construction；
(5) local searching strategy is defined；
(6) for the initial schedule scheme set constructed in step (4), according to local search plan defined in step (5)
Slightly carry out the optimization of scheme.If Current protocols set, which meets in certain threshold requirement or neighbouring solution space, can not find than current
Solution more preferably solves, and Current protocols collection is combined into final scheduling scheme set.Wherein, step (6) specific implementation process is as follows, such as
Shown in Fig. 2:
C language code is described as follows:
Second row is one and loops to determine, executed if meeting condition the third line to the 7th row code.is_all_
Covered () function judges whether current solution meets the threshold value of setting, if current solution is unsatisfactory for threshold value and local search step number
Less than the maximum step number of setting, then executing circulation.
The third line pick_device () chooses a transmitting equipment from scheduling scheme set.
Fourth line close_device () removes scheme relevant to the equipment from scheduling scheme set.
Fifth line executes local search optimization and currently solves, and terminates program if local search failure, otherwise searches for step number
Add and returns to the second row together and looped to determine.
To sum up, the present invention is by proposing the generation method of shortwave broadcasting resource scheduling scheme based on local search a kind of,
A feasible scheduling scheme set can be quickly generated under conditions of meeting coverage rate threshold value, and improves whole covering
Rate.
Above-mentioned only with preferred embodiment, the present invention will be described, and therefore, it does not limit interest fields of the invention, therefore,
In the case where not departing from inventive concept, all equivalence changes carried out by with description of the invention and accompanying drawing content, reason are same
It is contained in scope of the presently claimed invention.
Claims (5)
1. a kind of generation method of the shortwave broadcasting resource scheduling scheme based on local search, it is characterised in that: input as shortwave
The raw data set of broadcast resource is exported including transmitting equipment, launch mission, the coverage effect for emitting equipment as shortwave broadcasting
Scheduling scheme set, comprising the following steps:
(1) raw data set of shortwave broadcasting resource is defined；
(2) raw data set is initialized；
(3) according to the raw data set generating device conflict relationship of initialization；
(4) initial schedule scheme set is gone out based on greedy algorithm Fast Construction；
(5) local searching strategy is defined；
(6) for the initial schedule scheme set constructed in step (4), according to local searching strategy defined in step (5) into
The optimization of row scheme；If Current protocols set meets the threshold requirement of setting or can not find than current solution more in solution space
Excellent solution, then Current protocols collection is combined into final shortwave broadcasting scheduling scheme set；
The step (4), specifically includes the following steps:
(4-1) defines scheduling scheme P, and scheduling scheme is a triplet sets, wherein each triple includes launch mission, hair
Jet device, frequency:
P={ launch mission emits equipment, frequency }；
Wherein each launch mission must at least one corresponding transmitting equipment and frequency；
(4-2) defines the conflict relationship of launch mission, it is assumed that and i and j is two launch missions, at the beginning of b expression task, e
There is following conflict rule in the finish time of expression task:
Conflict rule 1:
bj≤bi<ej
Conflict rule 2:
bi≤bj<ei
(4-3) is for launch mission M1 and M2, if M1 and M2 has conflict, for the frequency of M1 ∈ P1 and M2 ∈ P2, P1
Rate and the frequency of P2 cannot identical and P1 equipment cannot exist with the equipment of P2 and conflict；
(4-4) definition can cover, if transmitting equipment A Mr. Yu's moment T with certain frequency range F certain monitoring point S field strength and reliability
When respectively reaching threshold value, then monitoring point S can be covered by emitting equipment A in moment T；
(4-5) defines coverage rate, and each launch mission needs the monitoring point sum C covered are as follows: the quantity * of monitoring point in service area
(finish time-start time+1), selecting certain transmitting equipment that can add up the point sum of covering is AP, then coverage rate=AP/C；
(4-6) defines Greedy strategy, and the coverage rate of each launch mission must reach the threshold value of setting；Each transmitting is appointed
Business, preferentially chooses the highest equipment of coverage rate in the equipment that coverage rate meets threshold value.
2. the generation method of the shortwave broadcasting resource scheduling scheme according to claim 1 based on local search, feature
Be: the step (1), define shortwave broadcasting resource raw data set specifically includes the following steps:
(1-1) definition transmitting equipment D, transmitting equipment is a triple, including antenna, transmitter, line switching:
D={ antenna, transmitter, line switching }；
(1-2) defines launch mission M, and launch mission is a four-tuple, including programme information, service area, start time and knot
The beam moment:
M={ programme information, service area, start time, finish time }；
(1-3) defines monitoring point S, and monitoring point is a triple, including number, sub-district in service area, area:
S={ service area is numbered in area, sub-district }；
(1-4) definition covering element E1, covering element is a four-tuple, including transmitting equipment, monitoring point, frequency range, moment:
E1={ transmitting equipment, monitoring point, frequency range, moment }；
(1-5) defines coverage effect E2, coverage effect is a binary group, including field strength, reliability:
E2={ field strength, reliability }；
(1-6) defines coverage effect mapping, and coverage effect mapping is the part mapping for covering elements combination to coverage effect set.
3. the generation method of the shortwave broadcasting resource scheduling scheme according to claim 1 based on local search, feature
It is: the step (3), specifically includes the following steps:
The specific rules of (3-1) device conflict relationship C are as follows:
Wherein, D indicates transmitting equipment, and t indicates that the transmitter that equipment uses, a indicate that the antenna that equipment uses, s indicate that equipment makes
Switch；For any two equipment DiAnd Dj, there is following conflict rule:
Conflict rule 1:
ti=tj, i.e., equipment use identical transmitter；
Conflict rule 2:
ai=aj, i.e., equipment use identical antenna；
Conflict rule 3:
si=sj, i.e., equipment use identical switch.
4. the generation method of the shortwave broadcasting resource scheduling scheme according to claim 1 based on local search, feature
Be: the step (5) solves currently in search process always specifically includes the following steps: defining local searching strategy
Neighbouring solution space in select an optimal solution as next solution, until reaching a locally optimal solution.
5. the generation method of the shortwave broadcasting resource scheduling scheme according to claim 1 based on local search, feature
It is: the step (6), specifically includes the following steps:
(6-1) terminates local search if current solution meets coverage rate threshold requirement；Conversely, whether judging current search step number
Greater than preset search step threshold, if it is terminate to search for；Otherwise it executes (6-2)；
(6-2) selects a transmitting equipment from scheduling scheme, and removal is related to the equipment scheme from scheduling scheme set
Scheduling scheme；
(6-3) executes local search optimization and currently solves, and terminates local search if searching for failure；Otherwise current search step number adds
One, it executes (6-1).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610608433.4A CN106304109B (en) | 2016-07-28 | 2016-07-28 | A kind of generation method of the shortwave broadcasting resource scheduling scheme based on local search |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610608433.4A CN106304109B (en) | 2016-07-28 | 2016-07-28 | A kind of generation method of the shortwave broadcasting resource scheduling scheme based on local search |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106304109A CN106304109A (en) | 2017-01-04 |
| CN106304109B true CN106304109B (en) | 2019-09-17 |
Family
ID=57663093
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610608433.4A Expired - Fee Related CN106304109B (en) | 2016-07-28 | 2016-07-28 | A kind of generation method of the shortwave broadcasting resource scheduling scheme based on local search |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106304109B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109946592B (en) * | 2019-04-16 | 2020-07-10 | 合肥工业大学 | Self-adaptive calculation method for asynchronous test period in Automatic Test Equipment (ATE) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007027608A3 (en) * | 2005-08-30 | 2007-08-30 | Google Inc | Local search |
| CN102117441A (en) * | 2010-11-29 | 2011-07-06 | 中山大学 | Intelligent logistics distribution and delivery based on discrete particle swarm optimization algorithm |
| CN102970089A (en) * | 2012-11-20 | 2013-03-13 | 国家广播电影电视总局监管中心 | Emergency broadcast system and linkage method thereof |
| CN103593703A (en) * | 2013-11-26 | 2014-02-19 | 上海电机学院 | Neural network optimizing system and method based on genetic algorithms |
| CN105792369A (en) * | 2016-02-29 | 2016-07-20 | 中国人民解放军国防信息学院 | Interactive short wave broadcast resource scheduling method |
-
2016
- 2016-07-28 CN CN201610608433.4A patent/CN106304109B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007027608A3 (en) * | 2005-08-30 | 2007-08-30 | Google Inc | Local search |
| CN102117441A (en) * | 2010-11-29 | 2011-07-06 | 中山大学 | Intelligent logistics distribution and delivery based on discrete particle swarm optimization algorithm |
| CN102970089A (en) * | 2012-11-20 | 2013-03-13 | 国家广播电影电视总局监管中心 | Emergency broadcast system and linkage method thereof |
| CN103593703A (en) * | 2013-11-26 | 2014-02-19 | 上海电机学院 | Neural network optimizing system and method based on genetic algorithms |
| CN105792369A (en) * | 2016-02-29 | 2016-07-20 | 中国人民解放军国防信息学院 | Interactive short wave broadcast resource scheduling method |
Non-Patent Citations (6)
| Title |
|---|
| A hybrid search algorithm with heuristics for resource allocation problem;Zne-Jung Lee;《Information Sciences》;20040713;155-167 * |
| New Modeling Approach to the Frequency Assignment Problem in Broadcasting;Lhassane Idoumghar;《IEEE TRANSACTIONS ON BROADCASTING》;20021230;第48卷(第4期);293-298 * |
| Tabu Search for Frequency Assignment in Mobile Radio Networks;JIN-KAO HAO;《Journal of Heuristics》;Kluwer Academic Publishers;19981231(第4期);47-62 * |
| 独立任务分配的贪婪随机自适应搜索过程;蔡荣英;《计算机工程与设计》;20061130;第27卷(第21期);4036-4038 * |
| 短波广播智能调度系统软件架构设计与实现;杨敏敏;《广播与电视技术》;20070430;112-116 * |
| 短波广播频率调度优化算法研究;黄晓兵;《广播与电视技术》;20100731;129-132 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106304109A (en) | 2017-01-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhu et al. | Learning-based computation offloading approaches in UAVs-assisted edge computing | |
| CN107070534B (en) | A kind of the dynamic preemptive type method for scheduling task and system of repeater satellite load balancing | |
| Yi et al. | Optimality of treating interference as noise: A combinatorial perspective | |
| CN107045667B (en) | Measurement and control data transmission integrated station network resource scheduling method | |
| CN109669768A (en) | A kind of resource allocation and method for scheduling task towards side cloud combination framework | |
| Zhang et al. | Guidance-solution based ant colony optimization for satellite control resource scheduling problem | |
| CN110166114A (en) | A kind of satellite navigation system time-varying inter-satellite link network topology planning method | |
| Riedler et al. | An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem | |
| Dai et al. | Dynamic scheduling for emergency tasks in space data relay network | |
| Qin et al. | Service-aware resource orchestration in ultra-dense LEO satellite-terrestrial integrated 6G: A service function chain approach | |
| CN106304109B (en) | A kind of generation method of the shortwave broadcasting resource scheduling scheme based on local search | |
| Feng et al. | Multi-path and multi-hop task offloading in mobile ad hoc networks | |
| Tiourine et al. | Local search algorithms for the radio link frequency assignment problem | |
| Kuai et al. | Fair virtual network function mapping and scheduling using proximal policy optimization | |
| Liu et al. | RFID: Towards low latency and reliable DAG task scheduling over dynamic vehicular clouds | |
| Engin et al. | A new memetic global and local search algorithm for solving hybrid flow shop with multiprocessor task scheduling problem | |
| Wei et al. | OCVC: An overlapping-enabled cooperative vehicular fog computing protocol | |
| Gao et al. | Fast adaptive task offloading and resource allocation via multiagent reinforcement learning in heterogeneous vehicular fog computing | |
| CN108199763B (en) | Repeater satellite method for scheduling task and system | |
| Corrao et al. | Ground station activity planning through a multi-algorithm optimisation approach | |
| Mejri et al. | A survey on network design problems: main variants and resolution approaches | |
| Chlebus et al. | Distributed communication in bare-bones wireless networks | |
| Yan et al. | Multicommodity flow modeling for the data transmission scheduling problem in navigation satellite systems | |
| CN104080088A (en) | Method and device of channel allocation | |
| Gao et al. | Graph coloring inspired approximate algorithm for wireless energy redistribution in WSNs |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190917 |