CN109872070A - Static charging pile deployment method based on group division - Google Patents
Static charging pile deployment method based on group division Download PDFInfo
- Publication number
- CN109872070A CN109872070A CN201910132418.0A CN201910132418A CN109872070A CN 109872070 A CN109872070 A CN 109872070A CN 201910132418 A CN201910132418 A CN 201910132418A CN 109872070 A CN109872070 A CN 109872070A
- Authority
- CN
- China
- Prior art keywords
- seb
- scp
- region
- close quarters
- charging pile
- 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
- 238000000034 method Methods 0.000 title claims abstract description 36
- 230000003068 static effect Effects 0.000 title claims abstract description 23
- 238000005457 optimization Methods 0.000 claims abstract description 18
- 238000005192 partition Methods 0.000 claims description 10
- 238000013459 approach Methods 0.000 claims description 3
- 230000000694 effects Effects 0.000 abstract description 6
- 229920002745 polystyrene-block- poly(ethylene /butylene) Polymers 0.000 abstract 4
- 238000010586 diagram Methods 0.000 description 8
- 238000011161 development Methods 0.000 description 3
- 238000002955 isolation Methods 0.000 description 3
- 239000013589 supplement Substances 0.000 description 3
- 230000004888 barrier function Effects 0.000 description 2
- 230000005611 electricity Effects 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000011960 computer-aided design Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000001764 infiltration Methods 0.000 description 1
- 230000008595 infiltration Effects 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/60—Other road transportation technologies with climate change mitigation effect
- Y02T10/70—Energy storage systems for electromobility, e.g. batteries
Landscapes
- Supply And Distribution Of Alternating Current (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
本发明公开了一种基于团划分的静态充电桩部署方法，包括针对SEB和SCP建立网络模型；将若干个SEB分布图划分为相对密集区域和相对稀疏区域，确定若干个SEB分布图中的相对密集区域的交集区域为SCP充电范围；构建满足能够覆盖所有目标区域内所有SEB的最少SCP数量优化函数；解决优化函数问题得到SCP的初步部署位置；对SCP的初步部署位置进行优化得到最终的SCP的部署位置。本发明通过构建优化模型、对优化模型进行求解并进行优化的过程，确定了静态充电桩的部署位置，因此本发明方法能够更好的适用于动态变化的SEB分布情况，能够尽可能的最小化SCP部署数量，而且本发明方法的可靠性高，SCP部署的效果较好。
The invention discloses a method for deploying static charging piles based on group division, including establishing a network model for SEB and SCP; dividing several SEB distribution maps into relatively dense areas and relatively sparse areas, and determining relative The intersection area of the dense area is the SCP charging range; build an optimization function that satisfies the minimum number of SCPs that can cover all SEBs in all target areas; solve the optimization function problem to obtain the initial deployment position of the SCP; optimize the initial deployment position of the SCP to obtain the final SCP deployment location. The present invention determines the deployment position of the static charging pile through the process of constructing an optimization model, solving and optimizing the optimization model, so the method of the present invention can be better applied to the dynamically changing SEB distribution, and can be minimized as much as possible. The number of SCP deployments is high, and the method of the present invention has high reliability, and the effect of SCP deployment is better.
Description
Technical field
Present invention relates particularly to a kind of based on the static charging pile dispositions method divided.
Background technique
With the development of economic technology, it is fast-developing with a kind of emerging economies mode to share economy, and extensively
Infiltration people life multiple fields, wherein since shared bicycle, derive shared motor bicycle Shared Electric
Bicycle (SEB) shares a series of shared trip tools such as automobile.For shared bicycle, energy problem is limitation
The major influence factors of SEB development, therefore, the energy problem for solving SEB is the important link for promoting SEB further to develop.
The SEB brand being primarily present on the market at present, main charging modes are divided into three classes, and are a) using movement respectively
The problems such as charging vehicle is that SEB charges, but by traffic jam, and movable charging vehicle cost is excessively high, using this mode
Operator is simultaneously few；B) manual energy's supplement is carried out by manually carrying storage battery, this mode efficiency is lower, needs a large amount of people
Power material resources investment, is unfavorable for operator long-run development；C) pass through deployment static state charging pile Static Charging Pile
(SCP), SCP is given back by fixed point carry out electricity supplement.Currently, more normal in such a way that SCP carries out electricity supplement on the market
See, but what current SCP deployment was often determined according to the initial input situation of SEB, and SEB has high fluidity
Feature is only disposed SCP according to initial input situation and is not appropriate for, meanwhile, SCP has higher land seizure rate, and cost is also higher,
This will lead to the up-front investment higher cost of operator, so finding a kind of minimal number of SCP of deployment to adapt to SEB dynamic
The Optimization deployment method of variation, becomes the task of top priority.
Summary of the invention
The purpose of the present invention is to provide a kind of high reliablity and effect is preferably based on the static charging pile portion divided
Arranging method.
It is provided by the invention this based on the static charging pile dispositions method divided, include the following steps:
S1. network model is established for shared motor bicycle SEB and static state charging pile SCP；
Several SEB distribution maps are divided into opposite close quarters and opposite by the network model S2. established for step S1
Sparse region, and determine that the intersection area of the opposite close quarters in several SEB distribution maps is SCP chargeable range, it is described
The definition of opposite close quarters is the region comprising most SEB, and SEB distribution map is such as divided into 2 parts, and region A includes 65
A SEB, and region B includes 34 SEB, region A includes more SEB for the B of region, then region A is relatively intensive
Region, mutually deserved, region B is opposite sparse region, that is, is defined as the region comprising less SEB；
S3. building meets the minimum SCP quantity optimization function that can cover all SEB in all target areas；
S4. based on group's partition problem, the majorized function problem of settlement steps to deal S3 building obtains the preliminary deployed position of SCP；
S5. the preliminary deployed position of the obtained SCP of step S4 is optimized, to obtain the deployment position of final SCP
It sets.
Several SEB distribution maps are divided into opposite close quarters and opposite sparse region described in step S2, specially
Several SEB distribution maps are divided by opposite close quarters and opposite sparse region using k-means algorithm.
The intersection area of opposite close quarters in several SEB distribution maps of determination described in step S2 is SCP charging model
It encloses, SCP chargeable range is specially determined using following rule:
If R1. opposite close quarters b1,b2,...,beThere is no unique intersections, then calculate SEB in all intersections
The intersection area for being higher than average value comprising SEB number is considered as SCP chargeable range P by several average valueimportant；
If R2. opposite close quarters b1,b2,...,beThe intersection area is then considered as SCP charging by the intersection of existence anduniquess
Range Pimportant；
If R3. opposite close quarters b1,b2,...,beIt mutually disjoints two-by-two, then calculates opposite close quarters b1,
b2,...,beThe average value of interior SEB number, the opposite close quarters by SEB that is included number not less than average value are considered as SCP
Chargeable range Pimportant。
Building described in step S3 meets the minimum SCP quantity optimization letter that can cover all SEB in all target areas
Number is specially constructed using step:
A. the deployment region D to be selected of SCP is calculated using following formula:
D=D∩∪Dal
D in formula∩={ D∩1,D∩2,...,D∩sIndicate SCP chargeable range PimportantThe affiliated range of all SEB in region
Intersection；Indicate the affiliated model of all SEB that intersection is all not present with any residue SEB
It encloses；
B. deployment region D to be selected is calculated using following formulajInterior SEB set Gj:
In formula | N | for SEB number；diFor the affiliated range of SEB i；
C. using if drag is as minimum SCP quantity optimization function:
Constraint condition:
I ∈ in formula { 1,2 ..., | G | }, xj∈ { 0,1 }, cij∈ { 0,1 },| D | for
Select the number of deployment region；
Based on a partition problem described in step S4, the majorized function problem of settlement steps to deal S3 building is specially used and is opened
Hairdo algorithm solves group's partition problem, thus the majorized function problem of settlement steps to deal S3 building.
The preliminary deployed position of the obtained SCP of step S4 is optimized described in step S5, specially using following rule
Then optimize:
If r1. the SEB in same group has unique public domain, the geometric center position of the public domain is then
The deployed position of SCP；
If r2. unique public domain is not present in the SEB in same group, any one SEB is successively isolated in the group
Affiliated region judges remaining SEB with the presence or absence of unique public domain: unique public domain if it exists, then only by this
The deployment position of the geometric center position of one public domain and the geometric center position of segregate SEB affiliated area as SCP
It sets；If region belonging to any one SEB is successively isolated in the group does not find unique public domain, generated
SCP is disposed in the geometric center position of intersection area.
If range belonging to 3 SEB forms 3 public domains, and 3 public domains are compared r3. in same group
At 1 point, then using the common point as the deployed position of SCP.
It is provided by the invention this based on the static charging pile dispositions method divided, by building Optimized model, to excellent
Change the process that model is solved and optimized, it is determined that the deployed position of static charging pile, therefore the method for the present invention can
Preferably it is suitable for the SEB distribution situation of dynamic change, SCP deployment quantity, and side of the present invention can be minimized as far as possible
The effect of the high reliablity of method, SCP deployment is preferable.
Detailed description of the invention
Fig. 1 is the method flow diagram of the method for the present invention.
Fig. 2 is the network model schematic diagram of the method for the present invention.
Fig. 3 is the schematic diagram of SEB non-directed graph constructed by the method for the present invention.
Fig. 4 is the first regular usable condition schematic diagram optimized to the preliminary deployed position of SCP of the method for the present invention.
Fig. 5 is the Second Rule usable condition schematic diagram optimized to the preliminary deployed position of SCP of the method for the present invention.
Fig. 6 is the third rule usable condition schematic diagram optimized to the preliminary deployed position of SCP of the method for the present invention.
Fig. 7 is that the affiliated range of SEB that the embodiment of the method for the present invention provides illustrates the effect that number needed for SCP influences
Figure.
Fig. 8 is P under the different SEB distribution situation figures that the embodiment of the method for the present invention providesimportantSEB number in region
With the effect diagram of required SCP number.
Specific embodiment
As shown in Figure 1 be the method for the present invention method flow diagram: it is provided by the invention it is this based on divide static state fill
Electric stake dispositions method, includes the following steps:
S1. network model is established for shared motor bicycle SEB and static state charging pile SCP；
SEB is considered as the sensor node in wireless chargeable sensor network by the present invention, and SCP is considered as static energy source；
Assuming that disposing the identical SCP of several specifications in 2 dimensional region, the presence of barrier is not considered；It is that the charging of r is covered that SCP, which has radius,
Lid range, this refers to that the SEB being present in SCP charging coverage area will be responsible for charging (as shown in Figure 2) by the SCP；
Assuming that there is the identical SEB of N number of specification (N > 1), N is usediIndicate that each SEB, SEB collection are combined into N={ N1,N2,...,
NN}；The presence for not considering barrier, using one-to-one charging modes, i.e. a SEB is only capable of being charged by a SCP, because
This, each SEB has its affiliated chargeable range di；
Several SEB distribution maps are divided into opposite close quarters and opposite by the network model S2. established for step S1
Sparse region, and determine that the intersection area of the opposite close quarters in several SEB distribution maps is SCP chargeable range；Described
The definition of opposite close quarters is the region comprising most SEB, and SEB distribution map is such as divided into 2 parts, and region A includes 65
A SEB, and region B includes 34 SEB, region A includes more SEB for the B of region, then region A is relatively intensive
Region, mutually deserved, region B is opposite sparse region, that is, is defined as the region comprising less SEB；
In the specific implementation, several SEB distribution maps are divided by opposite close quarters and opposite using k-means algorithm
Sparse region；
For k SEB distribution situation figure, θ region is divided into using k-means algorithm, according to SEB quantity feelings
Condition is divided into opposite close quarters R={ b1,b2,...,beAnd opposite sparse region B={ c1,c2,...,cl, and lead to
N=R ∪ B expression is crossed, opposite close quarters and opposite sparse region contain all SEB in 2 dimensional region；
In opposite close quarters R, is found in k SEB distribution situation figure respectively, pass through Pimportant=b1∩b2∩...
∩beThe intersection of this e opposite close quarters is found as key area Pimportant, key area PimportantIndicate
A large amount of SEB is distributed in the region；
Meanwhile SCP chargeable range is determined using following rule:
If R1. opposite close quarters b1,b2,...,beThere is no unique intersections, then calculate SEB in all intersections
The intersection area for being higher than average value comprising SEB number is considered as SCP chargeable range P by several average valueimportant；
If R2. opposite close quarters b1,b2,...,beThe intersection area is then considered as SCP charging by the intersection of existence anduniquess
Range Pimportant；
If R3. opposite close quarters b1,b2,...,beIt mutually disjoints two-by-two, then calculates opposite close quarters b1,
b2,...,beThe average value of interior SEB number, the opposite close quarters by SEB that is included number not less than average value are considered as SCP
Chargeable range Pimportant
S3. building meets the minimum SCP quantity optimization function that can cover all SEB in all target areas；Specially
It is constructed using step:
A. the deployment region D to be selected of SCP is calculated using following formula:
D=D∩∪Dal
D in formula∩={ D∩1,D∩2,...,D∩sIndicate SCP chargeable range PimportantThe affiliated range of all SEB in region
Intersection；Indicate the affiliated model of all SEB that intersection is all not present with any residue SEB
It encloses；
B. deployment region D to be selected is calculated using following formulajInterior SEB set Gj:
In formula | N | for SEB number；diFor the affiliated range of SEB i；
C. using if drag is as minimum SCP quantity optimization function:
Constraint condition:
I ∈ in formula { 1,2 ..., | G | }, xj∈ { 0,1 }, cij∈ { 0,1 },| D | for
Select the number of deployment region；
S4. group's partition problem is solved using heuritic approach, the majorized function problem of settlement steps to deal S3 building obtains SCP
Preliminary deployed position；
Minimum SCP quantity optimization problem is NP-HARD problem, and the problem is similar to lower partition problem of complexity,
Group's partition problem, which refers to, finds the minimum group's number that can divide a figure, and each group is certain vertex set, a group
Interior any two vertex is all connected by side；
It is solved for former problem is converted to a partition problem, the present invention is first against final PimportantIt is all in region
SEB constructs non-directed graph G (V, E) (as shown in Figure 3), and each vertex represents final P in figureimportantEach SEB in region, if
The affiliated range intersection of two SEB, then connecting a line between the two points；It is divided using, former problem can be converted
It is lower by final P for complexityimportantOn the non-directed graph that the SEB in region is constituted, the non-directed graph can be divided most by finding
Small quantity；
There are many heuritic approaches to solve group's partition problem at present, and the present invention uses " the Tseng C of Tseng C J et al.
J,Siewiorek D P.Automated Synthesis of Data Paths in Digital Systems.IEEE
Transactions on Computer-Aided Design of Integrated Circuits and Systems,
1986,5 (3): the algorithm that 379-395. " is proposed is solved, and the core concept of the algorithm is as described below:
(1) on non-directed graph G (V, E), the node for having public neighbours most is chosen to (w1,w2), if existed in figure more
A node pair for possessing the identical public neighbours of maximum number, then the maximum node pair of selectance, if there is the degree of node pair
Also identical, then choose at random any node pair；
(2) by the node selected to (w1,w2) merge into a node w1；
(3) following 3 classes side is needed to delete:
1)w1With w2Between side；
2)w1、w2The call number in being connected with public neighbours it is smaller while；
3) and node is to (w1,w2) in the connected independent vertices of a node；
(4) first three step is repeated on new non-directed graph until not having side in figure；
S5. the preliminary deployed position of the obtained SCP of step S4 is optimized, to obtain the deployment position of final SCP
It sets；Specially optimized using following rule:
If r1. the SEB in same group has unique public domain, the geometric center position of the public domain is then
The deployed position of SCP；It is specific as shown in Figure 4；
If r2. unique public domain is not present in the SEB in same group, any one SEB is successively isolated in the group
Affiliated region judges remaining SEB with the presence or absence of unique public domain: unique public domain if it exists, then only by this
The deployment position of the geometric center position of one public domain and the geometric center position of segregate SEB affiliated area as SCP
It sets；If region belonging to any one SEB is successively isolated in the group does not find unique public domain, generated
SCP is disposed in the geometric center position of intersection area；
Specifically as shown in figure 5, the affiliated range of tetra- SEB of a, b, c, d intersects two-by-two, a, b, c possess unique public area
Domain, and SEB d does not intersect with the public domain, in this case, needs if disposing SCP still in public domain
3, but the present invention, in view of disposing SCP in public domain α and γ, the SCP is larger to the effect of SEB d, for SEB
It is not required in that for a, b, c, therefore, for this case, the present invention considers by isolating a SEB out of group, so
Observation residue SEB whether there is unique public intersection afterwards, if it is present SCP to be deployed in the geometric center of public intersection
Place and the affiliated range center the SEB isolated；As shown in Figure 5, SEB d is first isolated, finds residue a, b, c are deposited
In unique public domain β, then SCP is deployed at β geometric center position and the center of the affiliated range of SEB d, this
Former 3 SCP abbreviations in need can be 2 SCP of deployment by sample；If not finding unique public area yet after one SEB of isolation
Domain, then continuing that another SEB progress isolation processing is selected to find unique public domain again；If successively isolation is appointed in the group
Unique public domain is not found in region belonging to a SEB of anticipating, then in the geometric center position of generated intersection area
Dispose SCP；
If range belonging to 3 SEB forms 3 public domains, and 3 public domains are compared r3. in same group
At 1 point, then using the common point as the deployed position of SCP；
Specifically as shown in fig. 6, the affiliated range of 3 SEB forms 3 public domains, and this 3 public domains intersect at
1 point, if the method before continuing to continue to use, it will 2 SCP of deployment, but for such a special circumstances, it is only necessary to it will
SCP is deployed at the intersection point Q of 3 public domains, is replaced original 2 SCP with 1 SCP, is reduced required SCP quantity.
The group's of division quantity, optimization are carried out to based on the minimum static state charging pile quantity optimization dispositions method divided below
Required SCP quantity carries out experimental verification afterwards.
The affiliated range of SEB influences (referring to attached drawing 7) to number needed for SCP:
Specifically, the present invention consider SEB affiliated range fromIt arrivesVariation, with the affiliated model of SEB
The increase enclosed divides obtained group's number by and gradually decreases, and number needed for obtained SCP also gradually subtracts after optimization
Small, this illustrates that the affiliated range of SEB is affected to final required SCP number.Meanwhile it being merely able to using clique partitioning algorithm merely
SEB is divided into the stronger several groups of interdependencies, can not determine SCP required number, is needed by being found after optimization
The specific deployed position and number of SCP, because the affiliated range intersection situation of SEB in single group is complex, one
It is not only to dispose a SCP to service for the SEB in entire group in group, needs to intersect specific feelings according to the affiliated range of SEB
Condition is disposed, therefore can be found optimally, that is, is rolled into a ball interior all affiliated ranges of SEB and intersected at a public domain, this
When group's number is required SCP number, and otherwise required SCP number can be greater than group's number.
P under different SEB distribution situation figuresimportantSEB number and required SCP number (referring to attached drawing 8) in region:
Specifically, the opposite close quarters proposed by the present invention by looking for different SEB distribution situation figures are used as and are born by SCP
Blame the region of charging, it is thus evident that the P found by 10 SEB distribution situation figuresimportantRegion is in different distribution situation figures
Middle SEB covered number is more uniform, and fluctuation is smaller, this illustrates P determined by the present inventionimportantRegion can cover
It is more, the biggish SEB of density, be further illustrated in the region use SCP mode to carry out charging for SEB can be as big as possible
Raising SCP utilization rate.On the other hand, by observing required SCP quantity under different SEB distribution situation figures, it is found that required
SCP quantity changes between 53 to 65, and gap is smaller, this, which also means that work as, finds final PimportantAfter region, no matter
Which selection organize data to determine that SCP is disposed with, and gap is not too large, can better adapt to the SEB distribution situation of dynamic change.
Show that technical method of the invention is suitable for the SEB distribution situation of dynamic change by above-mentioned experiment, simultaneously
It may be implemented to minimize SCP deployment quantity, thus investment needed for reducing deployment SEB operator early period SCP, while also solving well
The SCP that determined once is disposed and is just difficult to mobile problem.
Claims (6)
1. it is a kind of based on the static charging pile dispositions method divided, include the following steps:
S1. network model is established for shared motor bicycle SEB and static state charging pile SCP；
Several SEB distribution maps are divided into opposite close quarters and relatively sparse by the network model S2. established for step S1
Region, and determine that the intersection area of the opposite close quarters in several SEB distribution maps is SCP chargeable range；Described is opposite
The definition of close quarters is the region comprising most SEB；
S3. building meets the minimum SCP quantity optimization function that can cover all SEB in all target areas；
S4. based on group's partition problem, the majorized function problem of settlement steps to deal S3 building obtains the preliminary deployed position of SCP；
S5. the preliminary deployed position of the obtained SCP of step S4 is optimized, to obtain the deployed position of final SCP.
2. according to claim 1 based on the static charging pile dispositions method divided, it is characterised in that described in step S2
Several SEB distribution maps are divided into opposite close quarters and opposite sparse region, if specially will using k-means algorithm
A dry SEB distribution map is divided into opposite close quarters and opposite sparse region.
3. according to claim 2 based on the static charging pile dispositions method divided, it is characterised in that described in step S2
Determination several SEB distribution maps in the intersection areas of opposite close quarters be SCP chargeable range, specially using following rule
Then determine SCP chargeable range:
If R1. opposite close quarters b1,b2,...,beThere is no unique intersections, then calculate SEB number in all intersections
The intersection area for being higher than average value comprising SEB number is considered as SCP chargeable range P by average valueimportant；
If R2. opposite close quarters b1,b2,...,beThe intersection area is then considered as SCP chargeable range by the intersection of existence anduniquess
Pimportant；
If R3. opposite close quarters b1,b2,...,beIt mutually disjoints two-by-two, then calculates opposite close quarters b1,b2,...,be
The average value of interior SEB number, the opposite close quarters by SEB that is included number not less than average value are considered as SCP chargeable range
Pimportant。
4. according to claim 3 based on the static charging pile dispositions method divided, it is characterised in that described in step S3
Building meet and can cover the minimum SCP quantity optimization function of all SEB in all target areas, specially using step into
Row building:
A. the deployment region D to be selected of SCP is calculated using following formula:
D=D∩∪Dal
D in formula∩={ D∩1,D∩2,...,D∩sIndicate SCP chargeable range PimportantThe affiliated range of all SEB is handed in region
Collection；Indicate the affiliated range of all SEB that intersection is all not present with any residue SEB；
B. deployment region D to be selected is calculated using following formulajInterior SEB set Gj:
In formula | N | for SEB number；diFor the affiliated range of SEB i；
C. using if drag is as minimum SCP quantity optimization function:
Constraint condition:
I ∈ in formula { 1,2 ..., | G | }, xj∈ { 0,1 }, cij∈ { 0,1 },| D | it is portion to be selected
Affix one's name to the number in region；
5. according to claim 4 based on the static charging pile dispositions method divided, it is characterised in that described in step S4
Based on a partition problem, the majorized function problem of settlement steps to deal S3 building specially solves group using heuritic approach and divides
Problem, thus the majorized function problem of settlement steps to deal S3 building.
6. according to claim 5 based on the static charging pile dispositions method divided, it is characterised in that described in step S5
The preliminary deployed position of the SCP that step S4 is obtained optimize, specially optimized using following rule:
If r1. the SEB in same group has unique public domain, the geometric center position of the public domain is then SCP's
Deployed position；
If r2. unique public domain is not present in the SEB in same group, successively it is isolated belonging to any one SEB in the group
Region, judge remaining SEB with the presence or absence of unique public domain: unique public domain if it exists, then it is this is unique
The deployed position of the geometric center position of public domain and the geometric center position of segregate SEB affiliated area as SCP；If
Region belonging to any one SEB is successively isolated in the group and does not find unique public domain, then in generated intersection
SCP is disposed in the geometric center position in region；
If range belonging to 3 SEB forms 3 public domains, and 3 public domains are compared to 1 r3. in same group
Point, then using the common point as the deployed position of SCP.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910132418.0A CN109872070B (en) | 2019-02-22 | 2019-02-22 | Static charging pile deployment method based on cluster division |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910132418.0A CN109872070B (en) | 2019-02-22 | 2019-02-22 | Static charging pile deployment method based on cluster division |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109872070A true CN109872070A (en) | 2019-06-11 |
| CN109872070B CN109872070B (en) | 2023-04-07 |
Family
ID=66919061
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910132418.0A Expired - Fee Related CN109872070B (en) | 2019-02-22 | 2019-02-22 | Static charging pile deployment method based on cluster division |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109872070B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102663556A (en) * | 2012-04-16 | 2012-09-12 | 深圳供电局有限公司 | Charging pile position determining method and device |
| CN102880921A (en) * | 2012-10-16 | 2013-01-16 | 山东电力集团公司电力科学研究院 | Method for optimizing site selection of electric vehicle charging stations |
| CN105938514A (en) * | 2016-04-07 | 2016-09-14 | 浙江万马新能源有限公司 | Method for deployment and location selection of charging piles based on 0-1 integer programming model |
| CN107169605A (en) * | 2017-05-18 | 2017-09-15 | 东南大学 | City electric car charging station site selecting method based on vehicle location information |
| CN107886186A (en) * | 2017-10-16 | 2018-04-06 | 清华大学 | A kind of charging pile method to set up based on travelling data and Wei Nuotu zonings |
| CN108053058A (en) * | 2017-11-29 | 2018-05-18 | 东南大学 | A kind of electric taxi charging pile site selecting method based on big data |
| CN108256969A (en) * | 2018-01-12 | 2018-07-06 | 杭州电子科技大学 | A kind of public bicycles lease point dispatcher-controlled territory division methods |
| CN108510128A (en) * | 2018-04-11 | 2018-09-07 | 华南理工大学广州学院 | A kind of region electric vehicle charging load spatial and temporal distributions prediction technique |
| CN108932561A (en) * | 2018-06-22 | 2018-12-04 | 华北电力大学 | A Charging Path Selection Method for Electric Vehicles Considering Nonlinear Charging Function |
-
2019
- 2019-02-22 CN CN201910132418.0A patent/CN109872070B/en not_active Expired - Fee Related
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102663556A (en) * | 2012-04-16 | 2012-09-12 | 深圳供电局有限公司 | Charging pile position determining method and device |
| CN102880921A (en) * | 2012-10-16 | 2013-01-16 | 山东电力集团公司电力科学研究院 | Method for optimizing site selection of electric vehicle charging stations |
| CN105938514A (en) * | 2016-04-07 | 2016-09-14 | 浙江万马新能源有限公司 | Method for deployment and location selection of charging piles based on 0-1 integer programming model |
| CN107169605A (en) * | 2017-05-18 | 2017-09-15 | 东南大学 | City electric car charging station site selecting method based on vehicle location information |
| CN107886186A (en) * | 2017-10-16 | 2018-04-06 | 清华大学 | A kind of charging pile method to set up based on travelling data and Wei Nuotu zonings |
| CN108053058A (en) * | 2017-11-29 | 2018-05-18 | 东南大学 | A kind of electric taxi charging pile site selecting method based on big data |
| CN108256969A (en) * | 2018-01-12 | 2018-07-06 | 杭州电子科技大学 | A kind of public bicycles lease point dispatcher-controlled territory division methods |
| CN108510128A (en) * | 2018-04-11 | 2018-09-07 | 华南理工大学广州学院 | A kind of region electric vehicle charging load spatial and temporal distributions prediction technique |
| CN108932561A (en) * | 2018-06-22 | 2018-12-04 | 华北电力大学 | A Charging Path Selection Method for Electric Vehicles Considering Nonlinear Charging Function |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109872070B (en) | 2023-04-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Vazifeh et al. | Optimizing the deployment of electric vehicle charging stations using pervasive mobility data | |
| Cui et al. | Big data analytics and network calculus enabling intelligent management of autonomous vehicles in a smart city | |
| Kondor et al. | Estimating savings in parking demand using shared vehicles for home–work commuting | |
| Laaribi et al. | A spatial decision aid: a multicriterion evaluation approach | |
| Lee et al. | An analysis of price competition in heterogeneous electric vehicle charging stations | |
| Arribas et al. | Urban solid waste collection system using mathematical modelling and tools of geographic information systems | |
| Hausler et al. | Stochastic park-and-charge balancing for fully electric and plug-in hybrid vehicles | |
| Tilahun et al. | Bus timetabling as a fuzzy multiobjective optimization problem using preference-based genetic algorithm | |
| Tan et al. | A stochastic flow capturing location and allocation model for siting electric vehicle charging stations | |
| CN109754168A (en) | Method and device for site selection of charging station | |
| CN107031444A (en) | Method and apparatus for determining charging path of mobile charging vehicle | |
| Xie et al. | Integrated US nationwide corridor charging infrastructure planning for mass electrification of inter-city trips | |
| Shen et al. | Integrated optimization of electric vehicles charging location and allocation for valet charging service | |
| Pemberton et al. | Rapid charging provision, multiplicity and battery electric vehicle (BEV) mobility in the UK | |
| Grigorev et al. | How will electric vehicles affect traffic congestion and energy consumption: an integrated modelling approach | |
| CN114170830B (en) | Method and system for refined management of charging network in a region | |
| CN109872070A (en) | Static charging pile deployment method based on group division | |
| Dong et al. | Optimal placement of charging stations for electric taxis in urban area with profit maximization | |
| CN109583708A (en) | The method for building up of multiple agent microcosmic traffic Assignment Model | |
| CN106130110A (en) | The electric taxi charging station constant volume method on trip ground is selected based on stratified probability | |
| Lin et al. | A Hierarchical Voronoi Approach to Deploying New Charging Stations in an Existing Network | |
| CN106651010A (en) | Shortest path-based network division method | |
| Starkey et al. | A genetic type-2 fuzzy logic based approach for the optimal allocation of mobile field engineers to their working areas | |
| Wang et al. | Modelling park-and-ride service in a linear monocentric city | |
| Benarbia et al. | Electric cars-sharing systems modeling and analysis |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20230407 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |