CN108133281A - An Optimization Method for Location-Selection is paid in the electricity charge based on improved nearest neighbor classifier propagation algorithm - Google Patents
An Optimization Method for Location-Selection is paid in the electricity charge based on improved nearest neighbor classifier propagation algorithm Download PDFInfo
- Publication number
- CN108133281A CN108133281A CN201711269050.XA CN201711269050A CN108133281A CN 108133281 A CN108133281 A CN 108133281A CN 201711269050 A CN201711269050 A CN 201711269050A CN 108133281 A CN108133281 A CN 108133281A
- Authority
- CN
- China
- Prior art keywords
- paid
- electricity charge
- taiwan area
- location
- selection
- 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.)
- Pending
Links
- 230000005611 electricity Effects 0.000 title claims abstract description 89
- 238000000034 method Methods 0.000 title claims abstract description 27
- 238000005457 optimization Methods 0.000 title claims abstract description 27
- 238000011160 research Methods 0.000 claims description 11
- 230000002068 genetic effect Effects 0.000 claims description 3
- 238000005259 measurement Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 5
- 230000008859 change Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 108091064702 1 family Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
Classifications
-
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Public Health (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Water Supply & Treatment (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of electricity charge based on neighbour's propagation algorithm to pay an Optimization Method for Location-Selection, the statistics and number of electricity consumption number of users are carried out in the addressing overall region drafted in electric company, the taiwan area of different user customer quantity range in overall region is clustered using neighbour's propagation algorithm, determine cluster representative point, the taiwan area that longitude and latitude, taiwan area title and each cluster of each cluster representative point include is obtained, obtains initial candidate payment point；Selection set covering model, which is paid the initial electricity charge, carries out a double optimization, to determine final to pay a position.The present invention can pay an addressing to the electricity charge in target area and optimize and determine, dot address is paid in the electricity charge for obtaining comparing science.
Description
Technical field
The present invention relates to a kind of electricity charge based on neighbour's propagation algorithm to pay an Optimization Method for Location-Selection.
Background technology
With payment channel building diversification, way to pay dues diversification development, business office of original electric power mechanism payment
" single to pay dues " pattern is broken, but in real life, the head when payment of electric power mechanism is still users' electricity payment
Select mode, whens indivedual business office's payment peaks is overstaffed.Between subscriber payment custom, payment demand and payment channel building
Contradiction highlights, and tariff recovery hidden danger, electric service hidden danger, the problems such as human resource distribution is unreasonable gradually show.
Especially with payment user increase and the target that there is payment point in village village is set up, it is newly-built or change what is moved
Address a little is paid in the electricity charge, and how this selects, and is present urgent problem.
Invention content
The present invention is to solve the above-mentioned problems, it is proposed that the electricity charge of the one kind based on improved nearest neighbor classifier propagation algorithm (AP) are paid a little
Optimization Method for Location-Selection, the present invention is based on neighbour's propagation algorithm methods, establish covering problem model, using taiwan area as demand point, platform
The Electricity customers number in area is paid a little as demand, the representative point of neighbour's propagation algorithm result as the initial candidate electricity charge.
To achieve these goals, the present invention adopts the following technical scheme that：
An Optimization Method for Location-Selection is paid in a kind of electricity charge based on neighbour's propagation algorithm, is included the following steps：
(1) statistics and number of electricity consumption number of users are carried out in the addressing overall region drafted in electric company；
(2) taiwan area of different user customer quantity range in overall region is clustered using neighbour's propagation algorithm, really
Determine cluster representative point, obtain the taiwan area that longitude and latitude, taiwan area title and each cluster of each cluster representative point include, obtain initial wait
Choosing payment point；
(3) selection set covering model, which is paid the initial electricity charge, carries out a double optimization, to determine final to pay a position
It puts.
Further, in the step (1), select respectively Electricity customers number from 1 to the taiwan area at P families and P+1 to Q families for
Research object is respectively labeled as A classes and B classes, wherein, Q is more than P, and P is more than or equal to 20.
Further, in the step (2), all data objects are divided into cluster so that the object tool in same cluster
There is very high similitude, and it is poor with the object similarity in other clusters.
Further, in the step (2), similarity measurement select spherical distance negative value, similarity is bigger, taiwan area away from
From nearer, by setting the iteration of number, A classes respectively obtain cluster representative point result with B classes.
Further, in the step (3), the electricity charge are paid a location problem and are described as using taiwan area as demand point, taiwan area
Electricity customers number as demand, the representative point of neighbour's propagation algorithm (AP) result is paid a little as the initial candidate electricity charge.
Further, in the step (3), given taiwan area point set and candidate pay point set, it is known that the number of taiwan area point
Mesh, the distance between Electricity customers number and taiwan area, setpoint distance requirement and the minimal amount of all taiwan areas of covering can be met by being obtained
Point set is paid in the electricity charge.
Further, in the step (3), the target that set covering model a little is paid in the electricity charge is：
Constraints includes：
dijyij≤Li∈M,j∈N (2)
xi={ 0,1 }, i ∈ M
yij={ 0,1 }, i ∈ M, j ∈ N
Wherein：M is that point (M=1,2 ...) is paid in m in research object candidate's electricity charge；
N is the n taiwan area (N=1,2 ...) in research object；
dij----taiwan area and the candidate electricity charge are paid the distance between a little；
The maximum spherical surface arcuate distance for a little arriving taiwan area is paid in L--- candidate's electricity charge；
The set of taiwan area that point i is covered is paid in A (i) --- the candidate electricity charge；
The set of point i is paid in the candidate electricity charge of B (j) --- B (j)={ i | j ∈ A (i) } covering taiwan areas j；
Further, in point set Set Covering Location is paid in the electricity charge, object function is to be selected in the m candidate electricity charge are paid a little
Take minimal number of payment point；Constraints ensure respectively the Electricity customers of n taiwan area node can be fully satisfied and by
It is selected as the electricity charge and pays the distance of each taiwan area in both candidate nodes to its service range a little being not more than the restriction of served distance.
Further, the optimization method in the step (3) replaces with branch and bound method, ant group algorithm or genetic algorithm.
Further, the optimization method in the step (2) replaces with k-means algorithms and k- CENTER ALGORITHMs.
Compared with prior art, beneficial effects of the present invention are：
1) present invention can pay an addressing to the electricity charge in target area and optimize and determine, obtain comparing science
Dot address is paid in the electricity charge；
2) the present invention is based on neighbour's propagation algorithm (AP) methods, establish covering problem model, using taiwan area as demand point, platform
The Electricity customers number in area is paid a little as demand, the representative point of neighbour's propagation algorithm (AP) result as the initial candidate electricity charge,
Ensure the basis of selection optimization.
Description of the drawings
The accompanying drawings which form a part of this application are used for providing further understanding of the present application, and the application's shows
Meaning property embodiment and its explanation do not form the improper restriction to the application for explaining the application.
Fig. 1 is the A class taiwan area map reference schematic diagrames of the present invention；
Fig. 2 is A classes taiwan area neighbour propagation algorithm (AP) result schematic diagram of the present invention；
Fig. 3 is the B class taiwan area map reference schematic diagrames of the present invention；
Fig. 4 is B classes taiwan area neighbour propagation algorithm (AP) result schematic diagram of the present invention；
Fig. 5 pays double optimization addressing schematic diagram a little for the electricity charge of the present invention.
Specific embodiment：
The invention will be further described with embodiment below in conjunction with the accompanying drawings.
It is noted that following detailed description is all illustrative, it is intended to provide further instruction to the application.It is unless another
It indicates, all technical and scientific terms used herein has usual with the application person of an ordinary skill in the technical field
The identical meanings of understanding.
It should be noted that term used herein above is merely to describe specific embodiment, and be not intended to restricted root
According to the illustrative embodiments of the application.As used herein, unless the context clearly indicates otherwise, otherwise singulative
It is also intended to include plural form, additionally, it should be understood that, when in the present specification using term "comprising" and/or " packet
Include " when, indicate existing characteristics, step, operation, device, component and/or combination thereof.
In the present invention, term as " on ", " under ", "left", "right", "front", "rear", " vertical ", " level ", " side ",
The orientation or position relationship of instructions such as " bottoms " are based on orientation shown in the drawings or position relationship, only to facilitate describing this hair
Bright each component or component structure relationship and determining relative, not refer in particular to either component or element in the present invention, it is impossible to understand
For limitation of the present invention.
In the present invention, term such as " affixed ", " connected ", " connection " should be interpreted broadly, and expression can be fixedly connected,
Can also be integrally connected or be detachably connected；It can be directly connected, can also be indirectly connected by intermediary.For
The related scientific research of this field or technical staff can determine the concrete meaning of above-mentioned term in the present invention as the case may be,
It is not considered as limiting the invention.
As background technology is introduced, in the prior art with payment user increase and there is payment point in village of village
Target set up, it is newly-built or change the electricity charge moved and pay address a little how this selects, be present urgent problem.
In order to realize the target of " there is payment point in village of village ", need gradually stage by stage to the electricity charge is not disposed to pay a little remote
Rural area carries out addressing, it is assumed that more than the construction requirements that the taiwan area at 50 families has met " ten minutes payment circles ".As a kind of typical real
Apply mode, the present invention select respectively Electricity customers number from 30 to 50 family, 1 to 29 families taiwan area be research object, this kind of taiwan area
Electricity customers number is less, is the key area of current electric company's siting analysis.Know Electricity customers number from 30 to 50 from Fig. 1
Family, 1 to 29 families taiwan area be respectively 720,985, digital coding is carried out to it for operation is convenient, respectively from A classes：1,
2 ... ..., 720 with B classes：1,2 ... ..., 985, similarity measurement selects the negative value of spherical distance, and similarity is bigger, taiwan area distance
It is nearer.By 15 iteration, A classes and B classes respectively obtain 72 classes with 247 classes as a result, i.e. cluster representative point, such as Fig. 2, Fig. 4 and table 1
It is shown.Table 1 gives the taiwan area that longitude and latitude, taiwan area title and each cluster of each cluster representative point include.Due to platform in Fig. 2, Fig. 4
Area's Electricity customers number is less, and more disperses, and leads to cluster result far more than the result clustered in Fig. 1 and Fig. 3.
Table 1 neighbour's propagation algorithm (AP) result
Classical location optimization model is respectively covering problem model, p-center models, p-median models.Wherein,
Overlay model is to determine that one group of service facility carrys out specific trip requirements of the meet demand than more consistent portion requirements point.According to this
Model solves the problems, such as that the difference of method can be divided into set covering model and Maximal covering model, and common method for solving is plans strategies for
Branch and bound method, ant group algorithm, genetic algorithm etc..Set covering model is common a kind of covering mould in discrete point addressing
How type for some demand points known to demand, determines one group of service facility to meet the needs of these demand points；Maximum is covered
Cover mold type is in the case where giving a certain number of service facilities, how to determine that its position makes the demand point of its cover-most as far as possible.
And the goal in research of the present invention is that the minimum electricity charge how to be set to pay all taiwan areas of covering, is built so as to reduce power supply enterprise
The cost at vertical payment station.Therefore, present invention selection set covering model pays the initial electricity charge progress double optimization, to determine
Final pays a position.
Overlay model is built
The electricity charge are paid a location problem and be can be described as：Using taiwan area as demand point, the Electricity customers number of taiwan area is as demand
Amount, the representative point of neighbour's propagation algorithm (AP) result pay point (service network) as the initial candidate electricity charge.Given taiwan area point set
It closes and candidate pays point set, it is known that the number of taiwan area point, the distance between Electricity customers number and taiwan area, " village of village can be met by being obtained
Having payment point " electricity charge of required distance and the minimal amount of all taiwan areas of covering pay point set, as shown in Figure 5.
Therefore, the set covering model structure that the electricity charge are paid a little is as follows：
Object function：
Constraints：
dijyij≤L i∈M,j∈N (2)
xi={ 0,1 }, i ∈ M
yij={ 0,1 }, i ∈ M, j ∈ N
Wherein：Point (M=1,2 ...) is paid in the candidate electricity charge of M--- m in research object；
N taiwan areas (N=1,2 ...) of the N--- in research object；
dij----taiwan area and the candidate electricity charge are paid the distance between a little；
The maximum spherical surface arcuate distance for a little arriving taiwan area is paid in L--- candidate's electricity charge；
The set of taiwan area that point i is covered is paid in A (i) --- the candidate electricity charge；
The set of point i is paid in the candidate electricity charge of B (j) --- B (j)={ i | j ∈ A (i) } covering taiwan areas j；
In point set Set Covering Location is paid in the electricity charge, object function is minimum to be chosen in being paid a little in the m candidate electricity charge
The payment point of amount；The Electricity customers that formula (1) represents to ensure n taiwan area node can be fully satisfied；Formula (2) expression is chosen as electricity
Expense pays restriction of the distance no more than served distance of each taiwan area in both candidate nodes to its service range a little.
The foregoing is merely the preferred embodiments of the application, are not limited to the application, for the skill of this field
For art personnel, the application can have various modifications and variations.It is all within spirit herein and principle, made any repair
Change, equivalent replacement, improvement etc., should be included within the protection domain of the application.
Above-mentioned, although the foregoing specific embodiments of the present invention is described with reference to the accompanying drawings, not protects model to the present invention
The limitation enclosed, those skilled in the art should understand that, based on the technical solutions of the present invention, those skilled in the art are not
Need to make the creative labor the various modifications or changes that can be made still within protection scope of the present invention.
Claims (10)
1. an Optimization Method for Location-Selection is paid in a kind of electricity charge based on improved nearest neighbor classifier propagation algorithm, it is characterized in that：Include the following steps：
(1) statistics and number of electricity consumption number of users are carried out in the addressing overall region drafted in electric company；
(2) taiwan area of different user customer quantity range in overall region is clustered using neighbour's propagation algorithm, determined poly-
Representative point obtains the taiwan area that longitude and latitude, taiwan area title and each cluster of each cluster representative point include, and obtains initial candidate and pays
Fei Dian；
(3) selection set covering model, which is paid the initial electricity charge, carries out a double optimization, to determine final to pay a position.
2. an Optimization Method for Location-Selection is paid in a kind of electricity charge based on neighbour's propagation algorithm as described in claim 1, it is characterized in that：
In the step (1), it from 1 to the taiwan area at P families and P+1 to Q families is research object to select Electricity customers number respectively, is marked respectively
For A classes and B classes, wherein, Q is more than P, and P is more than or equal to 20.
3. an Optimization Method for Location-Selection is paid in a kind of electricity charge based on neighbour's propagation algorithm as described in claim 1, it is characterized in that：
In the step (2), all data objects are divided into cluster so that the object in same cluster has very high similitude, and
It is poor with the object similarity in other clusters.
4. an Optimization Method for Location-Selection is paid in a kind of electricity charge based on neighbour's propagation algorithm as described in claim 1, it is characterized in that：
In the step (2), similarity measurement selects the negative value of spherical distance, and similarity is bigger, and taiwan area distance is nearer, secondary by setting
Several iteration, A classes respectively obtain cluster representative point result with B classes.
5. an Optimization Method for Location-Selection is paid in a kind of electricity charge based on neighbour's propagation algorithm as described in claim 1, it is characterized in that：
In the step (3), the electricity charge are paid a location problem and are described as using taiwan area as demand point, and the Electricity customers number of taiwan area is used as and needs
The amount of asking, the representative point of neighbour's propagation algorithm result are paid a little as the initial candidate electricity charge.
6. an Optimization Method for Location-Selection is paid in a kind of electricity charge based on neighbour's propagation algorithm as described in claim 1, it is characterized in that：
In the step (3), given taiwan area point set and candidate pay point set, it is known that the number of taiwan area point, Electricity customers number and platform
Point set is paid in the distance in section, the electricity charge that the minimal amount that can meet setpoint distance requirement and cover all taiwan areas is obtained.
7. an Optimization Method for Location-Selection is paid in a kind of electricity charge based on neighbour's propagation algorithm as described in claim 1, it is characterized in that：
In the step (3), the target that set covering model a little is paid in the electricity charge is minimum to be chosen in being paid a little in the m candidate electricity charge
The payment point of amount, i.e.,M is that point (M=1,2 ... ...) is paid in the m candidate electricity charge in research object,
8. an Optimization Method for Location-Selection is paid in a kind of electricity charge based on neighbour's propagation algorithm as described in claim 1, it is characterized in that：
In the step (3), the constraints that set covering model a little is paid in the electricity charge includes：
dijyij≤L i∈M,j∈N (2)
xi={ 0,1 }, i ∈ M
yij={ 0,1 }, i ∈ M, j ∈ N
Wherein：N is the n taiwan area (N=1,2 ...) in research object；
dijIt is paid the distance between a little for taiwan area and the candidate electricity charge；
L is that the maximum spherical surface arcuate distance for a little arriving taiwan area is paid in the candidate electricity charge；
A (i) pays the set of taiwan area that point i covered for the candidate electricity charge；
B (j)=i | j ∈ A (i) } represent that the set of point i is paid in the candidate electricity charge of covering taiwan area j；
9. an Optimization Method for Location-Selection is paid in a kind of electricity charge based on neighbour's propagation algorithm as claimed in claim 8, it is characterized in that：
In point set Set Covering Location is paid in the electricity charge, constraints ensures that the Electricity customers of n taiwan area node can be by completely full respectively
It is enough and is chosen as the electricity charge to pay the distance of each taiwan area in both candidate nodes to its service range a little no more than served distance
Restriction.
10. an Optimization Method for Location-Selection, feature are paid in a kind of electricity charge based on neighbour's propagation algorithm as described in claim 1
It is：Optimization method in the step (3) replaces with branch and bound method, ant group algorithm or genetic algorithm；
Or/and the optimization method in the step (2) replaces with k-means algorithms and k- CENTER ALGORITHMs.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711269050.XA CN108133281A (en) | 2017-12-05 | 2017-12-05 | An Optimization Method for Location-Selection is paid in the electricity charge based on improved nearest neighbor classifier propagation algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711269050.XA CN108133281A (en) | 2017-12-05 | 2017-12-05 | An Optimization Method for Location-Selection is paid in the electricity charge based on improved nearest neighbor classifier propagation algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108133281A true CN108133281A (en) | 2018-06-08 |
Family
ID=62389013
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711269050.XA Pending CN108133281A (en) | 2017-12-05 | 2017-12-05 | An Optimization Method for Location-Selection is paid in the electricity charge based on improved nearest neighbor classifier propagation algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108133281A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109543888A (en) * | 2018-11-07 | 2019-03-29 | 中国联合网络通信集团有限公司 | Business hall position selecting method, device and storage medium |
| CN112235778A (en) * | 2019-06-26 | 2021-01-15 | ***通信集团湖南有限公司 | Group member determination method and server |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103338517A (en) * | 2013-06-04 | 2013-10-02 | 北京邮电大学 | A multipoint cooperation system clustering method based on a high-performance processor |
| CN103838820A (en) * | 2013-12-24 | 2014-06-04 | 西安电子科技大学 | Evolutionary multi-objective optimization community detection method based on affinity propagation |
| CN104199884A (en) * | 2014-08-19 | 2014-12-10 | 东北大学 | Social networking service viewpoint selection method based on R coverage rate priority |
| CN104378371A (en) * | 2014-11-14 | 2015-02-25 | 浙江工业大学 | Network intrusion detection method for parallel AP cluster based on MapReduce |
| CN105825298A (en) * | 2016-03-14 | 2016-08-03 | 梁海东 | Electric network metering early-warning system and method based on load characteristic pre-estimation |
| CN105955209A (en) * | 2016-04-26 | 2016-09-21 | 中南民族大学 | Manufacturing industry factory equipment layout method based on data mining |
| US20170052960A1 (en) * | 2015-08-20 | 2017-02-23 | Skyhook Wireless, Inc. | Techniques for measuring a property of interest in a dataset of location samples |
-
2017
- 2017-12-05 CN CN201711269050.XA patent/CN108133281A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103338517A (en) * | 2013-06-04 | 2013-10-02 | 北京邮电大学 | A multipoint cooperation system clustering method based on a high-performance processor |
| CN103838820A (en) * | 2013-12-24 | 2014-06-04 | 西安电子科技大学 | Evolutionary multi-objective optimization community detection method based on affinity propagation |
| CN104199884A (en) * | 2014-08-19 | 2014-12-10 | 东北大学 | Social networking service viewpoint selection method based on R coverage rate priority |
| CN104378371A (en) * | 2014-11-14 | 2015-02-25 | 浙江工业大学 | Network intrusion detection method for parallel AP cluster based on MapReduce |
| US20170052960A1 (en) * | 2015-08-20 | 2017-02-23 | Skyhook Wireless, Inc. | Techniques for measuring a property of interest in a dataset of location samples |
| CN105825298A (en) * | 2016-03-14 | 2016-08-03 | 梁海东 | Electric network metering early-warning system and method based on load characteristic pre-estimation |
| CN105955209A (en) * | 2016-04-26 | 2016-09-21 | 中南民族大学 | Manufacturing industry factory equipment layout method based on data mining |
Non-Patent Citations (3)
| Title |
|---|
| RASHED SAHRAEIAN等: "A fuzzy set covering-clustering algorithm for facility location problem", 《2011 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT》 * |
| YAN SHI等: "Study on Locations for Electricity Fee Payment in Rural Power Business Regions Driven by Data", 《2017 9TH INTERNATIONAL CONFERENCE ON INTELLIGENT HUMAN-MACHINE SYSTEMS AND CYBERNETICS》 * |
| 江元 等: "基于集合覆盖模型的电费缴纳点选址研究", 《中国电力》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109543888A (en) * | 2018-11-07 | 2019-03-29 | 中国联合网络通信集团有限公司 | Business hall position selecting method, device and storage medium |
| CN109543888B (en) * | 2018-11-07 | 2021-03-05 | 中国联合网络通信集团有限公司 | Business hall position selection method, business hall position selection device and storage medium |
| CN112235778A (en) * | 2019-06-26 | 2021-01-15 | ***通信集团湖南有限公司 | Group member determination method and server |
| CN112235778B (en) * | 2019-06-26 | 2022-06-14 | ***通信集团湖南有限公司 | Group member determination method and server |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106849065B (en) | It is a kind of meter and charging station power distribution network multiple target collaborative planning method | |
| Yuan et al. | Competitive charging station pricing for plug-in electric vehicles | |
| Bayram et al. | Electric power allocation in a network of fast charging stations | |
| Bayram et al. | Unsplittable load balancing in a network of charging stations under QoS guarantees | |
| Li et al. | Price incentive-based charging navigation strategy for electric vehicles | |
| CN103262583B (en) | Use the user profiles including using pattern for the offer of many grades billing scheme, call acceptance or the geography of capacity planning and/or time Radio Resource | |
| CN101132363B (en) | Free associating wireless resource management system and method based on reinforcement learning | |
| CN108229733A (en) | A kind of electric vehicle charging schedule method for considering customer satisfaction evaluation | |
| CN105874743A (en) | Service provider network migration | |
| CN107567079B (en) | A kind of base station energy-saving method of mobile Internet data driving | |
| CN109902930A (en) | A kind of auxiliary facility planning auxiliary system based on real population index | |
| CN109768886A (en) | Network planning evaluation method and device | |
| CN112668129B (en) | Space load clustering-based intelligent grid dividing method for power distribution network | |
| CN108133281A (en) | An Optimization Method for Location-Selection is paid in the electricity charge based on improved nearest neighbor classifier propagation algorithm | |
| CN201947445U (en) | Dynamic spectrum allocation system based on time particle size | |
| CN111582581B (en) | Electric automobile battery replacement station robust site selection method considering random traffic flow offset | |
| CN108462965A (en) | Share planing method in a kind of steel tower demand site | |
| CN112381398A (en) | Electric vehicle charging station site selection method and system considering limited trip of user | |
| CN107231640B (en) | LTE230 power system private network construction layout method | |
| CN110111001A (en) | A kind of Site planning method of electric automobile charging station, device and equipment | |
| CN110288125A (en) | It is a kind of based on the commuting method for establishing model of mobile phone signaling data and application | |
| CN111861397A (en) | Intelligent scheduling platform for client visit | |
| CN111146815B (en) | Distributed power generation planning configuration method for intelligent power distribution network | |
| CN106162671B (en) | A kind of base station deployment location determining method and device | |
| CN113627765B (en) | Distributed space crowdsourcing task distribution method and system based on user satisfaction |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180608 |
|
| RJ01 | Rejection of invention patent application after publication |