CN113486262B - Electric vehicle charging station site selection method, system and readable storage medium - Google Patents
Electric vehicle charging station site selection method, system and readable storage medium Download PDFInfo
- Publication number
- CN113486262B CN113486262B CN202111045841.0A CN202111045841A CN113486262B CN 113486262 B CN113486262 B CN 113486262B CN 202111045841 A CN202111045841 A CN 202111045841A CN 113486262 B CN113486262 B CN 113486262B
- Authority
- CN
- China
- Prior art keywords
- charging station
- charging
- demand
- address
- candidate address
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000010187 selection method Methods 0.000 title claims abstract description 11
- 238000000034 method Methods 0.000 claims abstract description 40
- 239000013598 vector Substances 0.000 claims description 61
- 238000012545 processing Methods 0.000 claims description 13
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 claims description 13
- 230000008030 elimination Effects 0.000 claims description 8
- 238000003379 elimination reaction Methods 0.000 claims description 8
- 238000005516 engineering process Methods 0.000 claims description 3
- 230000010354 integration Effects 0.000 description 6
- 238000012549 training Methods 0.000 description 6
- 238000000605 extraction Methods 0.000 description 5
- 238000001228 spectrum Methods 0.000 description 5
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 239000002699 waste material Substances 0.000 description 3
- 229910052799 carbon Inorganic materials 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000003203 everyday effect Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000002283 diesel fuel Substances 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000005611 electricity Effects 0.000 description 1
- 238000003912 environmental pollution Methods 0.000 description 1
- 238000001125 extrusion Methods 0.000 description 1
- 239000000446 fuel Substances 0.000 description 1
- 239000000295 fuel oil Substances 0.000 description 1
- 239000003502 gasoline Substances 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 230000001915 proofreading effect Effects 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
-
- 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
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Health & Medical Sciences (AREA)
- Marketing (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Water Supply & Treatment (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Public Health (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Charge And Discharge Circuits For Batteries Or The Like (AREA)
Abstract
The invention provides an electric vehicle charging station site selection method, a system and a readable storage medium, wherein the method comprises the following steps: enumerating all charging station candidate addresses in a preset administrative area; respectively measuring the shortest distance between the addresses to be selected of every two charging stations, and when the shortest distance is smaller than a first preset threshold value, determining that the addresses to be selected of every two charging stations are the addresses to be selected of adjacent charging stations; marking the midpoint of the path of the address to be selected close to the charging station along the shortest path; acquiring all charging demand points within a preset radius range by taking the middle point of the route as a center; respectively measuring the distance from all charging demand points to the address to be selected near the charging station, and respectively accumulating to obtain a first total distance and a second total distance; reserving the addresses to be selected of the adjacent charging stations corresponding to the smaller total route, and eliminating the addresses to be selected of the adjacent charging stations corresponding to the larger total route. The invention can effectively improve the rationality of the electric vehicle charging station planning.
Description
Technical Field
The invention relates to the technical field of light control, in particular to an electric vehicle charging station site selection method, system and readable storage medium.
Background
The traditional automobile uses gasoline or diesel oil as fuel, and the kinetic energy is generated by the work of an engine to drive the automobile to move forwards. The fuel oil belongs to non-renewable resources, and is rapidly developed in the current social economy, and the resource consumption is increased day by day. The exhaust gas from the automobile pollutes the air seriously, which makes the atmosphere warm and raise the temperature. Under the trend that the excessive collection of fossil energy and the environmental pollution are severe, people begin to seek low-carbon pollution-free, economical and efficient electric automobiles as transportation tools.
The health and sustainable development of the electric automobile can not be guaranteed without the charging infrastructure. When the charging stations are arranged, the most important is the rationality of the arrangement site selection and the arrangement scale. At present, the problem that electric vehicles and charging station facilities are not developed coordinately occurs in many areas, and users in most areas are reluctant to use electric vehicles due to the problems of difficult charging, slow charging and the like. In other areas, due to improper planning of charging facilities, coverage areas are overlapped or blind areas are formed between the coverage areas, so that resource waste of 'less piles and more piles' more supplies than demands is caused or a phenomenon of 'more piles and less piles' of vehicles and less supplies than demands is caused.
Disclosure of Invention
In order to solve at least one technical problem, the invention provides an electric vehicle charging station site selection method, a system and a readable storage medium, which can effectively improve the rationality of electric vehicle charging station planning.
The invention provides a first aspect of an electric vehicle charging station site selection method, which comprises the following steps:
enumerating all charging station candidate addresses in a preset administrative area;
respectively measuring the shortest distance between two charging station candidate addresses, and when the shortest distance is smaller than a first preset threshold value, determining that the two charging station candidate addresses are adjacent charging station candidate addresses, wherein the preset adjacent charging station candidate addresses comprise a charging station candidate address A and a charging station candidate address B;
marking the path middle points of the charging station candidate address A and the charging station candidate address B along the shortest path;
acquiring all charging demand points within a preset radius range by taking the middle point of the route as a center;
respectively measuring the distance from all the charging demand points to the to-be-selected address A of the charging station, and accumulating to obtain a first total distance; respectively measuring the distance from all the charging demand points to the to-be-selected address B of the charging station, and accumulating to obtain a second total distance;
and reserving the charging station candidate address A or the charging station candidate address B corresponding to the smaller total distance in the first total distance and the second total distance, and rejecting the charging station candidate address B or the charging station candidate address A corresponding to the larger total distance.
In this scheme, after the charging station candidate address a or the charging station candidate address B corresponding to the smaller total distance is selected to promote as the charging station candidate address, the method further includes:
measuring the shortest distance between every two charging station candidate addresses again based on the remaining charging station candidate addresses, judging whether the shortest distance is smaller than a preset threshold value, and if so, continuously eliminating the adjacent charging station candidate addresses;
and stopping continuously eliminating the processing flow until the shortest distance between every two charging station candidate addresses of the rest charging station candidate addresses is not less than a first preset threshold value after the multi-round elimination processing, and taking the rest charging station candidate addresses as final charging station candidate addresses.
In this scheme, after all the charging demand points within the preset radius range are acquired with the midpoint of the route as the center, the method further includes:
respectively acquiring the demand of all the charging demand points
，
Representing a required amount of an nth charge demand point, n representing a total number of all charge demand points;
respectively measuring the shortest distance from each charging demand point to the candidate address A of the charging station
And the shortest distance from each charging demand point to the candidate address B of the charging station
Wherein
The shortest distance from the n charging demand points to the candidate address A of the charging station is shown,
representing the shortest distance from the n charging demand points to the candidate address B of the charging station;
multiplying the demand of each charging demand point by the shortest distance from each charging demand point to the charging station candidate address A, and accumulating to obtain a first accumulated value
(ii) a Multiplying the demand of each charging demand point by the distance from each charging demand point to the charging station candidate address A, and accumulating to obtain a second accumulated value
；
Respectively comparing the first accumulated values
And a second accumulated value
And selecting the charging station candidate address with a smaller accumulated value for reservation, and rejecting the charging station candidate address with a larger accumulated value.
In this scheme, after all the charging demand points within the preset radius range are acquired with the midpoint of the route as the center, the method further includes:
acquiring a normal driving direction L of the electric automobile from a charging demand point;
respectively acquiring the demand of all the charging demand points
，
Representing a required amount of an nth charge demand point, n representing a total number of all charge demand points;
respectively measuring the shortest distance from each charging demand point to the candidate address A of the charging station
And the shortest distance from each charging demand point to the candidate address B of the charging station
Wherein
The distance from the n charging demand points to the candidate address A of the charging station is shown,
indicating n chargesThe distance from the electricity demand point to the charging station candidate address B;
every shortest route
Respectively projecting the distance in the normal driving direction L, and calculating to obtain each shortest distance
Projection vector of
Eliminating projection vectors with positive vectors and reserving projection vectors with negative vectors; every shortest route
Respectively projecting the distance in the normal driving direction L, and calculating to obtain each shortest distance
Projection vector of
；
According to projection vector
Determining corresponding charging demand points in the projection vectors which are negative, determining corresponding demand according to corresponding charging demand, and projecting the projection vectors
Multiplying the projection vectors with negative middle numbers respectively by corresponding demand quantities, and accumulating to obtain a first projection vector accumulated value; according to projection vector
Determining corresponding charging demand points in the projection vectors which are negative, determining corresponding demand according to corresponding charging demand, and projecting the projection vectors
Multiplying the projection vectors with negative middle numbers respectively by corresponding demand quantities, and accumulating to obtain a second projection vector accumulated value;
and respectively comparing the first projection vector accumulated value with the second projection vector accumulated value, selecting the charging station candidate address with a larger projection vector accumulated value for reservation, and rejecting the charging station candidate address with a smaller projection vector accumulated value.
In this scheme, after enumerating all the candidate addresses of the charging stations in the preset administrative area, the method further includes:
acquiring a historical remote sensing image of a preset administrative region in a preset time period by using a remote sensing technology;
judging the number of times that the address to be selected of each charging station is submerged by water from the historical remote sensing image;
and when the number of times that the address to be selected of a certain charging station is submerged by water is greater than the preset number of times, the address to be selected of the charging station is rejected.
In this scheme, after the remaining candidate addresses of the charging stations are used as the final candidate addresses of the charging stations, the method further includes:
acquiring the area of a candidate address of a certain charging station, and providing the occupied area of a single charging device and the single charging time length for completing one-time charging of the single charging device;
predicting the peak time of the charging station candidate address, and calculating the number of charging devices which can be accommodated by the charging station candidate address according to the area of the charging station candidate address and the occupied area of a single charging device;
counting the traffic flow passing through the candidate address of the charging station in the peak period of the historical time;
multiplying the traffic flow by a preset charging demand ratio to calculate the maximum demand charging vehicle number in the peak period;
acquiring the area of each candidate address, and calculating the number of charging devices according to the total area and the occupied area of a single charging device;
multiplying the number of charging devices that the charging station candidate address can accommodate, the single charging time period of a single charging device, and the peak time period to calculate the maximum number of vehicles that the charging station candidate address can complete charging during the peak time period;
and judging whether the maximum number of the vehicles charged is larger than or equal to the maximum number of the vehicles needing to be charged, if so, determining that the candidate address of the charging station is qualified, and if not, determining that the candidate address of the charging station is unqualified.
The second aspect of the present invention further provides an electric vehicle charging station site selection system, which includes a memory and a processor, where the memory includes an electric vehicle charging station site selection method program, and the electric vehicle charging station site selection method program, when executed by the processor, implements the steps of the electric vehicle charging station site selection method described above.
The third aspect of the present invention also provides a computer-readable storage medium, where the computer-readable storage medium includes a program of an electric vehicle charging station addressing method, and when the program of the electric vehicle charging station addressing method is executed by a processor, the steps of the electric vehicle charging station addressing method are implemented.
The electric vehicle charging station site selection method, the system and the computer readable storage medium provided by the invention can realize reasonable planning of the position of the charging station, relieve the problem of difficult charging of users, avoid excessive overlapping of the charging stations and effectively prevent resource waste.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
FIG. 1 is a flow chart illustrating an electric vehicle charging station location method of the present invention;
fig. 2 shows a block diagram of an electric vehicle charging station addressing system of the present invention.
Detailed Description
In order that the above objects, features and advantages of the present invention can be more clearly understood, a more particular description of the invention will be rendered by reference to the appended drawings. It should be noted that the embodiments and features of the embodiments of the present application may be combined with each other without conflict.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention, however, the present invention may be practiced in other ways than those specifically described herein, and therefore the scope of the present invention is not limited by the specific embodiments disclosed below.
Fig. 1 shows a flowchart of an electric vehicle charging station location method according to the present invention.
As shown in fig. 1, a first aspect of the present invention provides an electric vehicle charging station location method, including:
s102, enumerating all charging station candidate addresses in a preset administrative area;
s104, respectively measuring the shortest distance between the candidate addresses of every two charging stations, and when the shortest distance is smaller than a first preset threshold value, determining that the candidate addresses of every two charging stations are the candidate addresses of adjacent charging stations, wherein the preset candidate addresses of adjacent charging stations comprise the candidate addresses A of the charging stations and the candidate addresses B of the charging stations;
s106, marking the path middle points of the charging station candidate address A and the charging station candidate address B along the shortest path;
s108, acquiring all charging demand points within a preset radius range by taking the middle point of the route as a center;
s110, respectively measuring the distance from all the charging demand points to the to-be-selected address A of the charging station, and accumulating to obtain a first total distance; respectively measuring the distance from all the charging demand points to the to-be-selected address B of the charging station, and accumulating to obtain a second total distance;
and S112, reserving the charging station candidate address A or the charging station candidate address B corresponding to the smaller total distance in the first total distance and the second total distance, and eliminating the charging station candidate address B or the charging station candidate address A corresponding to the larger total distance.
It should be noted that, because most planning construction of the central area of the existing city, especially the two-line city, is already established, there is less possibility of planning a plurality of areas to newly build charging stations directly according to the service radius of the charging stations. The initial charging station candidate address of the present invention is the address selected by the city planning department for an existing parking lot or vacant area. It can be understood that, since the selected addresses are selected based on the existing urban environment, the distribution of the selected addresses may be concentrated, so that the invention firstly identifies the candidate addresses of adjacent charging stations, and then selects the most suitable candidate addresses of the charging stations based on the charging demand point, thereby facilitating the charging of the surrounding electric vehicle owners and saving the distance consumption and time required by the charging.
It should be noted that the shortest route refers to the shortest route where an electric vehicle passes between two charging station candidate addresses along a road under the condition of following a road traffic regulation. It is understood that the midpoint of the route means that the distances from the midpoint of the route to the candidate addresses of the adjacent charging stations are equal, in other words, the midpoint of the route equally divides the shortest route. It can be understood that the charging demand point can be a community, an office building, a shopping mall, a hotel and the like; but is not limited thereto.
According to a specific embodiment of the present invention, after acquiring all charging demand points within a preset radius range with the midpoint of the route as a center, the method further includes:
calculating the shortest route from each charging demand point to the middle point of the route;
and judging whether the shortest distance exceeds a second preset threshold value, if so, rejecting the charging demand point, and if not, selecting the charging demand point and carrying out subsequent decision on the address to be selected of the adjacent charging station.
According to an embodiment of the present invention, after the charging station candidate address a or the charging station candidate address B corresponding to the smaller total distance is selected to advance to the charging station candidate address, the method further includes:
measuring the shortest distance between every two charging station candidate addresses again based on the remaining charging station candidate addresses, judging whether the shortest distance is smaller than a preset threshold value, and if so, continuously eliminating the adjacent charging station candidate addresses;
and stopping continuously eliminating the processing flow until the shortest distance between every two charging station candidate addresses of the rest charging station candidate addresses is not less than a first preset threshold value after the multi-round elimination processing, and taking the rest charging station candidate addresses as final charging station candidate addresses.
It should be noted that, for the charging station candidate address a, the adjacent candidate addresses may be not only the charging station candidate address B but also the charging station candidate address C, however, after the first round of elimination, the charging station candidate address a may be retained from the charging station candidate address A, B, and later, the remaining charging station candidate addresses include the charging station candidate address A, C, at this time, the charging station candidate addresses a and C are still the adjacent charging station candidate addresses of the present invention, and then, the second round of elimination processing still needs to be performed until the remaining charging station candidate addresses do not have the adjacent charging station candidate addresses, and then, the whole elimination processing flow can be completed. And the surplus situations of the charging stations can not be caused due to the fact that the addresses to be selected of the rest charging stations after the elimination processing are not close, and the rationality of address selection planning of the charging stations is further ensured.
According to an embodiment of the present invention, after acquiring all the charging demand points within a preset radius range with the midpoint of the route as a center, the method further includes:
respectively acquiring the demand of all the charging demand points
，
Representing a required amount of an nth charge demand point, n representing a total number of all charge demand points;
respectively measuring the shortest distance from each charging demand point to the candidate address A of the charging station
And the shortest distance from each charging demand point to the candidate address B of the charging station
Wherein
The shortest distance from the n charging demand points to the candidate address A of the charging station is shown,
representing the shortest distance from the n charging demand points to the candidate address B of the charging station;
multiplying the demand of each charging demand point by the shortest distance from each charging demand point to the charging station candidate address A, and accumulating to obtain a first accumulated value
(ii) a Multiplying the demand of each charging demand point by the distance from each charging demand point to the charging station candidate address A, and accumulating to obtain a second accumulated value
；
Respectively comparing the first accumulated values
And a second accumulated value
And selecting the charging station candidate address with a smaller accumulated value for reservation, and rejecting the charging station candidate address with a larger accumulated value.
It should be noted that, when the demand of the charging demand point is obtained, the number of the electric vehicles may be derived according to the number of the parking spaces of the charging demand point, and the number of the electric vehicles is used as the demand of the charging demand point. Furthermore, each charging demand point is provided with an access control system, and the demand quantity of the charging demand point is calculated through counting the electric vehicle information recorded by the access control system.
It can be understood that, because the demand of each charging demand point is different, the demand on the charging station is different, for example, if there are more electric vehicles in one cell, the demand on the charging station is higher, and if there are fewer electric vehicles in another cell, the demand on the charging station is lower. When the address to be selected near the charging station is selected, comprehensive analysis and judgment can be carried out based on the distance and the quantity of demand so as to meet the demands of most users, and therefore the rationality of address selection is achieved.
According to an embodiment of the present invention, after acquiring all the charging demand points within a preset radius range with the midpoint of the route as a center, the method further includes:
acquiring a normal driving direction L of the electric automobile from a charging demand point;
respectively acquiring the demand of all the charging demand points
，
Representing a required amount of an nth charge demand point, n representing a total number of all charge demand points;
respectively measuring the shortest distance from each charging demand point to the candidate address A of the charging station
And the shortest distance from each charging demand point to the candidate address B of the charging station
Wherein
The distance from the n charging demand points to the candidate address A of the charging station is shown,
representing the distance from the n charging demand points to the charging station candidate address B;
every shortest route
Respectively projecting the distance in the normal driving direction L, and calculating to obtain each shortest distance
Projection vector of
Eliminating projection vectors with positive vectors and reserving projection vectors with negative vectors; every shortest route
Respectively projecting the distance in the normal driving direction L, and calculating to obtain each shortest distance
Projection vector of
；
According to projection vector
Determining corresponding charging demand points in the projection vectors which are negative, determining corresponding demand according to corresponding charging demand, and projecting the projection vectors
Multiplying the projection vectors with negative middle numbers respectively by corresponding demand quantities, and accumulating to obtain a first projection vector accumulated value; according to projection vector
Determining corresponding charging demand points in the projection vectors which are negative, determining corresponding demand according to corresponding charging demand, and projecting the projection vectors
Multiplying the projection vectors with negative middle numbers respectively by corresponding demand quantities, and accumulating to obtain a second projection vector accumulated value;
and respectively comparing the first projection vector accumulated value with the second projection vector accumulated value, selecting the charging station candidate address with a larger projection vector accumulated value for reservation, and rejecting the charging station candidate address with a smaller projection vector accumulated value.
It should be noted that each charging demand point in a suburb usually has a common driving direction every day, i.e. going to the center of a city or going to a working area, and in general, a city has some positioning areas, for example, an area is an office building gathering area, such as an east area of the city, whereas each cell in a west area of the city (i.e. a charging demand point) has a common driving direction every day, i.e. going from west to east. In the process of eliminating the candidate address close to the charging station, the traveling direction of a conventional electric vehicle can be considered, if the candidate address of the charging station is located in the traveling direction of the electric vehicle, the effect of achieving twice the result with half the effort can be achieved, if the candidate address of the charging station is located in the opposite direction of the traveling direction of the electric vehicle, excessive useless work is easily caused, the charging time of a user can be prolonged, and meanwhile the user can also cause road congestion in the process of back-and-forth charging. Therefore, the embodiment of the invention comprehensively considers the demand quantity and the normal driving direction factor of each charging demand point, and selects the appropriate charging station candidate address for reservation.
According to the embodiment of the invention, after all the charging station candidate addresses in the preset administrative area are enumerated, the method further comprises the following steps:
acquiring a historical remote sensing image of a preset administrative region in a preset time period by using a remote sensing technology;
judging the number of times that the address to be selected of each charging station is submerged by water from the historical remote sensing image;
and when the number of times that the address to be selected of a certain charging station is submerged by water is greater than the preset number of times, the address to be selected of the charging station is rejected.
It should be noted that, because the charging station needs to operate stably after being established, if a certain address to be selected is submerged by water frequently, it indicates that the address is not suitable for establishing the charging station, and the address to be selected of the charging station should be removed.
According to the specific embodiment of the invention, the step of judging that the address to be selected of each charging station is submerged by water from the historical remote sensing image specifically comprises the following steps:
constructing an integration model based on a local binary pattern and spectrum characteristics: constructing a training set based on remote sensing image data, gridding the remote sensing image of the training set into a feature extraction unit with a preset size, and then respectively extracting a local binary pattern feature set and a spectrum feature set; respectively carrying out K-means algorithm clustering on the local binary pattern feature set and the spectrum feature set to obtain a clustering result based on a local binary pattern and a clustering result based on spectrum features so as to construct an integration model based on the local binary pattern and the spectrum features;
adopting an integration model to extract water in the remote sensing image: vectorizing the remote sensing images of the training set based on the integration model to form a training feature vector set and train an SVM classifier in the integration model; inputting a historical remote sensing image to be recognized, blocking and vectorizing the remote sensing image to be recognized according to an integration model, classifying the remote sensing image by a trained SVM classifier, and counting classification results to obtain a water body extraction result in the historical remote sensing image to be recognized;
and performing detailed identification on the mixed pixel blocks in the water body extraction result to optimize the water body extraction result, judging whether a charging station candidate address falls into the water body extraction result, and if so, marking that the charging station candidate address is not flooded once.
According to an embodiment of the present invention, after taking the remaining charging station candidate addresses as final charging station candidate addresses, the method further includes:
acquiring the area of a candidate address of a certain charging station, and providing the occupied area of a single charging device and the single charging time length for completing one-time charging of the single charging device;
predicting the peak time of the charging station candidate address, and calculating the number of charging devices which can be accommodated by the charging station candidate address according to the area of the charging station candidate address and the occupied area of a single charging device;
counting the traffic flow passing through the candidate address of the charging station in the peak period of the historical time;
multiplying the traffic flow by a preset charging demand ratio to calculate the maximum demand charging vehicle number in the peak period;
acquiring the area of each candidate address, and calculating the number of charging devices according to the total area and the occupied area of a single charging device;
multiplying the number of charging devices that the charging station candidate address can accommodate, the single charging time period of a single charging device, and the peak time period to calculate the maximum number of vehicles that the charging station candidate address can complete charging during the peak time period;
and judging whether the maximum number of the vehicles charged is larger than or equal to the maximum number of the vehicles needing to be charged, if so, determining that the candidate address of the charging station is qualified, and if not, determining that the candidate address of the charging station is unqualified.
It should be noted that, when the peak time of the candidate address of the charging station is analyzed, the area type of the candidate address of the charging station is firstly determined, and then the corresponding peak time is matched according to the area type. The area categories may be residential areas, office building areas, etc., for residential areas, peak hours are typically 6 to 9 pm, while peak hours for office building areas are 9 to 12 pm. It can be understood that the embodiment of the invention analyzes whether the number of the vehicles which can be charged in the peak time period of the candidate address of the charging station meets the maximum required number of the charged vehicles, if not, the queuing is easy to be caused, and the queuing extrusion extends to the middle of the road, so that the road congestion phenomenon is caused, and the long-time road congestion is not beneficial to the healthy operation of the city. According to the embodiment of the invention, when the charging station is selected for construction, the road congestion in the later period is avoided.
According to an embodiment of the present invention, predicting the peak hours of the candidate address of the charging station includes:
acquiring existing charging stations in a preset administrative area, and counting historical charging data of the existing charging stations;
analyzing the peak time period of the existing charging station from the historical charging data, and acquiring the number and types of demand points in a preset range around the existing charging station;
taking the number of demand points and the types of the demand points in the peak time period, the surrounding preset range of all the existing charging stations as a training set;
performing machine learning on a training set to obtain correlation parameters between the peak time and the number and types of demand points in a surrounding preset range, and constructing a peak time preset model based on the correlation parameters;
and acquiring the quantity and types of demand points in a preset range around the candidate address of the charging station, inputting a peak time period preset model, and predicting the peak time period of the candidate address of the charging station by the peak time period preset model.
According to a specific embodiment of the present invention, after taking the remaining charging station candidate addresses as final charging station candidate addresses, the method further comprises:
acquiring congestion history data of a road section where each charging station candidate address is located;
and calculating congestion frequency according to the congestion historical data, judging whether the congestion frequency exceeds a second preset threshold value, if so, determining that the candidate address of the charging station is qualified, and if not, determining that the candidate address of the charging station is unqualified.
According to a specific embodiment of the present invention, after taking the remaining charging station candidate addresses as final charging station candidate addresses, the method further comprises:
after all adjacent addresses to be selected are removed in sequence in the manner, the remaining candidate addresses are subjected to overall proofreading;
marking a map mark of a final charging station candidate address in a preset administrative area;
dividing a preset administrative area into a plurality of small administrative areas, and counting the number of candidate addresses of the charging stations of each small administrative area;
counting the demand of each small administrative region;
calculating the ratio of the number of the candidate addresses of the charging stations in each small administrative area to the demand quantity, judging whether the ratio falls into a preset interval range, and if so, judging that the candidate addresses of the small administrative area reach the standard; if not, selecting corresponding numbers of charging station candidate addresses from the charging station candidate addresses removed from the small administrative area to promote the charging station candidate addresses into the charging station candidate addresses until the ratio falls into the preset interval range;
if not, and if the ratio is larger than the maximum value of the preset interval range, recalculating the shortest distance between every two charging station candidate addresses in the small administrative area, sequencing the shortest distance, selecting every two charging station candidate addresses with smaller shortest distance, and rejecting one charging station candidate address according to a rejection processing principle until the ratio falls into the preset interval range.
It can be understood that the charging station candidate addresses with the corresponding number are selected from the charging station candidate addresses removed from the small administrative area according to a preset selection principle, wherein the selection principle specifically comprises the following steps: the method comprises the steps of firstly calculating the shortest distance between all rejected charging station candidate addresses and adjacent charging station candidate addresses in the small administrative area, sequencing the shortest distances, and selecting the rejected charging station candidate addresses with larger shortest distances to promote as the charging station candidate addresses.
It can be understood that the preset administrative region can be a city, the small administrative regions can be districts, and the charging station candidate addresses are further corrected according to the overall demand of each small administrative region so as to meet the balanced deployment of the charging stations of each small administrative region.
According to a specific embodiment of the present invention, after taking the remaining charging station candidate addresses as final charging station candidate addresses, the method further comprises:
establishing a charging device deployment template library of different types of charging stations;
acquiring a remote sensing image of each charging station candidate address, and extracting a characteristic value of each charging station candidate address from the remote sensing image;
carrying out similarity analysis on the characteristic value of the candidate address of a certain charging station and the characteristic values of different types of charging stations in the charging device deployment template library, and sorting according to the similarity height;
and selecting a charging station template with high similarity, and deploying a charging device for the candidate address of the charging station according to the charging station template.
Fig. 2 shows a block diagram of an electric vehicle charging station addressing system of the present invention.
As shown in fig. 2, the second aspect of the present invention further provides an electric vehicle charging station addressing system 2, which includes a memory 21 and a processor 22, where the memory includes an electric vehicle charging station addressing method program, and the electric vehicle charging station addressing method program, when executed by the processor, implements the following steps:
enumerating all charging station candidate addresses in a preset administrative area;
respectively measuring the shortest distance between two charging station candidate addresses, and when the shortest distance is smaller than a first preset threshold value, determining that the two charging station candidate addresses are adjacent charging station candidate addresses, wherein the preset adjacent charging station candidate addresses comprise a charging station candidate address A and a charging station candidate address B;
marking the path middle points of the charging station candidate address A and the charging station candidate address B along the shortest path;
acquiring all charging demand points within a preset radius range by taking the middle point of the route as a center;
respectively measuring the distance from all the charging demand points to the to-be-selected address A of the charging station, and accumulating to obtain a first total distance; respectively measuring the distance from all the charging demand points to the to-be-selected address B of the charging station, and accumulating to obtain a second total distance;
and reserving the charging station candidate address A or the charging station candidate address B corresponding to the smaller total distance in the first total distance and the second total distance, and rejecting the charging station candidate address B or the charging station candidate address A corresponding to the larger total distance.
According to an embodiment of the present invention, after the charging station candidate address a or the charging station candidate address B corresponding to the smaller total distance is selected and promoted to the charging station candidate address, the electric vehicle charging station addressing method further includes the following steps when executed by the processor:
measuring the shortest distance between every two charging station candidate addresses again based on the remaining charging station candidate addresses, judging whether the shortest distance is smaller than a preset threshold value, and if so, continuously eliminating the adjacent charging station candidate addresses;
and stopping continuously eliminating the processing flow until the shortest distance between every two charging station candidate addresses of the rest charging station candidate addresses is not less than a first preset threshold value after the multi-round elimination processing, and taking the rest charging station candidate addresses as final charging station candidate addresses.
According to the embodiment of the invention, after all the charging demand points within the preset radius range are acquired by taking the midpoint of the path as a center, the electric vehicle charging station location method further realizes the following steps when the processor executes the program:
respectively acquiring the demand of all the charging demand points
，
Representing a required amount of an nth charge demand point, n representing a total number of all charge demand points;
respectively measuring the shortest distance from each charging demand point to the candidate address A of the charging station
And the shortest distance from each charging demand point to the candidate address B of the charging station
Wherein
The shortest distance from the n charging demand points to the candidate address A of the charging station is shown,
representing the shortest distance from the n charging demand points to the candidate address B of the charging station;
multiplying the demand of each charging demand point by the shortest distance from each charging demand point to the charging station candidate address A, and accumulating to obtain a first accumulated value
(ii) a Multiplying the demand of each charging demand point by the distance from each charging demand point to the charging station candidate address A, and accumulating to obtain a second accumulated value
；
Respectively comparing the first accumulated values
And a second accumulated value
And selecting the charging station candidate address with a smaller accumulated value for reservation, and rejecting the charging station candidate address with a larger accumulated value.
The second aspect of the present invention also provides a computer-readable storage medium, which includes a program of an electric vehicle charging station addressing method, and when the program of the electric vehicle charging station addressing method is executed by a processor, the steps of the electric vehicle charging station addressing method are implemented.
The electric vehicle charging station site selection method, the system and the computer readable storage medium provided by the invention can realize reasonable planning of the position of the charging station, relieve the problem of difficult charging of users, avoid excessive overlapping of the charging stations and effectively prevent resource waste.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The above-described device embodiments are merely illustrative, for example, the division of the unit is only a logical functional division, and there may be other division ways in actual implementation, such as: multiple units or components may be combined, or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the coupling, direct coupling or communication connection between the components shown or discussed may be through some interfaces, and the indirect coupling or communication connection between the devices or units may be electrical, mechanical or other forms.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units; can be located in one place or distributed on a plurality of network units; some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, all the functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may be separately regarded as one unit, or two or more units may be integrated into one unit; the integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
Those of ordinary skill in the art will understand that: all or part of the steps for realizing the method embodiments can be completed by hardware related to program instructions, the program can be stored in a computer readable storage medium, and the program executes the steps comprising the method embodiments when executed; and the aforementioned storage medium includes: a mobile storage device, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
Alternatively, the integrated unit of the present invention may be stored in a computer-readable storage medium if it is implemented in the form of a software functional module and sold or used as a separate product. Based on such understanding, the technical solutions of the embodiments of the present invention may be essentially implemented or a part contributing to the prior art may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the methods described in the embodiments of the present invention. And the aforementioned storage medium includes: a removable storage device, a ROM, a RAM, a magnetic or optical disk, or various other media that can store program code.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the appended claims.
Claims (6)
1. An electric vehicle charging station site selection method is characterized by comprising the following steps:
enumerating all charging station candidate addresses in a preset administrative area;
respectively measuring the shortest distance between two charging station candidate addresses, and when the shortest distance is smaller than a first preset threshold value, determining that the two charging station candidate addresses are adjacent charging station candidate addresses, wherein the preset adjacent charging station candidate addresses comprise a charging station candidate address A and a charging station candidate address B;
marking the path middle points of the charging station candidate address A and the charging station candidate address B along the shortest path;
acquiring all charging demand points within a preset radius range by taking the middle point of the route as a center;
respectively measuring the distance from all the charging demand points to the to-be-selected address A of the charging station, and accumulating to obtain a first total distance; respectively measuring the distance from all the charging demand points to the to-be-selected address B of the charging station, and accumulating to obtain a second total distance;
reserving a charging station candidate address A or a charging station candidate address B corresponding to a smaller total distance in the first total distance and the second total distance, and rejecting the charging station candidate address B or the charging station candidate address A corresponding to a larger total distance;
measuring the shortest distance between every two charging station candidate addresses again based on the remaining charging station candidate addresses, judging whether the shortest distance is smaller than a preset threshold value, and if so, continuously eliminating the adjacent charging station candidate addresses;
stopping continuously eliminating the processing flow until the shortest distance between every two charging station candidate addresses of the rest charging station candidate addresses is not less than a first preset threshold value after the multi-round elimination processing, and taking the rest charging station candidate addresses as final charging station candidate addresses;
acquiring the area of a candidate address of a certain charging station, and providing the occupied area of a single charging device and the single charging time length for completing one-time charging of the single charging device;
predicting the peak time of the charging station candidate address, and calculating the number of charging devices which can be accommodated by the charging station candidate address according to the area of the charging station candidate address and the occupied area of a single charging device;
counting the traffic flow passing through the candidate address of the charging station in the peak period of the historical time;
multiplying the traffic flow by a preset charging demand ratio to calculate the maximum demand charging vehicle number in the peak period;
acquiring the area of each candidate address, and calculating the number of charging devices according to the total area and the occupied area of a single charging device;
multiplying the number of charging devices that the charging station candidate address can accommodate, the single charging time period of a single charging device, and the peak time period to calculate the maximum number of vehicles that the charging station candidate address can complete charging during the peak time period;
and judging whether the maximum number of the vehicles charged is larger than or equal to the maximum number of the vehicles needing to be charged, if so, determining that the candidate address of the charging station is qualified, and if not, determining that the candidate address of the charging station is unqualified.
2. The electric vehicle charging station location method according to claim 1, wherein after all charging demand points within a preset radius range are acquired with the midpoint of the route as a center, the method further comprises:
respectively acquiring the demand of all the charging demand points
，
Representing a required amount of an nth charge demand point, n representing a total number of all charge demand points;
respectively measuring the shortest distance from each charging demand point to the candidate address A of the charging station
And the shortest distance from each charging demand point to the candidate address B of the charging station
Wherein
The shortest distance from the n charging demand points to the candidate address A of the charging station is shown,
representing the shortest distance from the n charging demand points to the candidate address B of the charging station;
multiplying the demand of each charging demand point by the shortest distance from each charging demand point to the charging station candidate address A, and accumulating to obtain a first accumulated value
(ii) a Multiplying the demand of each charging demand point by the distance from each charging demand point to the charging station candidate address A, and accumulating to obtain a second accumulated value
；
Respectively comparing the first accumulated values
And a second accumulated value
And selecting the charging station candidate address with a smaller accumulated value for reservation, and rejecting the charging station candidate address with a larger accumulated value.
3. The electric vehicle charging station location method according to claim 1, wherein after all charging demand points within a preset radius range are acquired with the midpoint of the route as a center, the method further comprises:
acquiring a normal driving direction L of the electric automobile from a charging demand point;
respectively acquiring the demand of all the charging demand points
，
Representing a required amount of an nth charge demand point, n representing a total number of all charge demand points;
respectively measuring the shortest distance from each charging demand point to the candidate address A of the charging station
And the shortest distance from each charging demand point to the candidate address B of the charging station
Wherein
The distance from the n charging demand points to the candidate address A of the charging station is shown,
representing the distance from the n charging demand points to the charging station candidate address B;
every shortest route
Respectively projecting the distance in the normal driving direction L, and calculating to obtain each shortest distance
Projection vector of
Eliminating projection vectors with positive vectors and reserving projection vectors with negative vectors; every shortest route
Respectively projecting the distance in the normal driving direction L, and calculating to obtain each shortest distance
Projection vector of
；
According to projection vector
Determining corresponding charging demand points in the projection vectors with the medium to negative values, and determining the corresponding charging demand points according to the corresponding charging demandsProjecting the vector according to the demand
Multiplying the projection vectors with negative middle numbers respectively by corresponding demand quantities, and accumulating to obtain a first projection vector accumulated value; according to projection vector
Determining corresponding charging demand points in the projection vectors which are negative, determining corresponding demand according to corresponding charging demand, and projecting the projection vectors
Multiplying the projection vectors with negative middle numbers respectively by corresponding demand quantities, and accumulating to obtain a second projection vector accumulated value;
and respectively comparing the first projection vector accumulated value with the second projection vector accumulated value, selecting the charging station candidate address with a larger projection vector accumulated value for reservation, and rejecting the charging station candidate address with a smaller projection vector accumulated value.
4. The electric vehicle charging station site selection method according to claim 1, wherein after all charging station candidate addresses in a preset administrative area are enumerated, the method further comprises the following steps:
acquiring a historical remote sensing image of a preset administrative region in a preset time period by using a remote sensing technology;
judging the number of times that the address to be selected of each charging station is submerged by water from the historical remote sensing image;
and when the number of times that the address to be selected of a certain charging station is submerged by water is greater than the preset number of times, the address to be selected of the charging station is rejected.
5. An electric vehicle charging station addressing system, characterized in that it comprises a memory and a processor, said memory comprising an electric vehicle charging station addressing method program, said electric vehicle charging station addressing method program realizing the steps of an electric vehicle charging station addressing method according to any of claims 1 to 4 when executed by said processor.
6. A computer-readable storage medium, characterized in that the computer-readable storage medium comprises an electric vehicle charging station addressing method program, which when executed by a processor, implements the steps of an electric vehicle charging station addressing method according to any of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111045841.0A CN113486262B (en) | 2021-09-07 | 2021-09-07 | Electric vehicle charging station site selection method, system and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111045841.0A CN113486262B (en) | 2021-09-07 | 2021-09-07 | Electric vehicle charging station site selection method, system and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113486262A CN113486262A (en) | 2021-10-08 |
| CN113486262B true CN113486262B (en) | 2021-11-16 |
Family
ID=77947305
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111045841.0A Active CN113486262B (en) | 2021-09-07 | 2021-09-07 | Electric vehicle charging station site selection method, system and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113486262B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116452245B (en) * | 2023-06-15 | 2023-09-01 | 跨越速运集团有限公司 | Logistics station site selection method, device, equipment and storage medium |
| CN116843045B (en) * | 2023-09-01 | 2023-11-14 | 南京特拉利精密电子科技有限公司 | Vehicle charging pile management method and system |
| CN117196265A (en) * | 2023-11-07 | 2023-12-08 | 国网浙江省电力有限公司宁波供电公司 | Electric vehicle charging station site selection planning method, system and readable storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109193727A (en) * | 2018-10-30 | 2019-01-11 | 国网江苏省电力有限公司南通供电分公司 | A kind of intelligent distribution network probability coordinated planning method containing electric car |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009230555A (en) * | 2008-03-24 | 2009-10-08 | Mitsubishi Electric Corp | Demand forecast method, inventory plan decision method, demand forecast system and inventory plan decision system |
| JP5569317B2 (en) * | 2010-10-05 | 2014-08-13 | 株式会社オートネットワーク技術研究所 | Power information notification device |
| US10417723B2 (en) * | 2016-02-08 | 2019-09-17 | Conduent Business Services, Llc | Method and system for identifying locations for placement of replenishment stations for vehicles |
| CN107832958A (en) * | 2017-11-15 | 2018-03-23 | 云南电网有限责任公司 | A kind of electric taxi charging station planing method based on demand analysis |
| CN110288132B (en) * | 2019-06-06 | 2021-03-23 | 浙江工业大学 | Improved TLBO algorithm-based electric vehicle charging pile layout method |
| US11878602B2 (en) * | 2019-11-22 | 2024-01-23 | State Grid Fujian Electric Power Co., Ltd. | Method for establishing active distribution network planning model considering location and capacity determination of electric vehicle charging station |
-
2021
- 2021-09-07 CN CN202111045841.0A patent/CN113486262B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109193727A (en) * | 2018-10-30 | 2019-01-11 | 国网江苏省电力有限公司南通供电分公司 | A kind of intelligent distribution network probability coordinated planning method containing electric car |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113486262A (en) | 2021-10-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113486262B (en) | Electric vehicle charging station site selection method, system and readable storage medium | |
| Faridimehr et al. | A stochastic programming approach for electric vehicle charging network design | |
| Rane et al. | An integrated GIS, MIF, and TOPSIS approach for appraising electric vehicle charging station suitability zones in Mumbai, India | |
| CN108162771B (en) | Intelligent charging navigation method for electric automobile | |
| De Gennaro et al. | Customer-driven design of the recharge infrastructure and Vehicle-to-Grid in urban areas: A large-scale application for electric vehicles deployment | |
| Shi et al. | Battery electric vehicles: What is the minimum range required? | |
| CN105160428B (en) | The planing method of electric automobile on highway quick charge station | |
| De Gennaro et al. | GIS-driven analysis of e-mobility in urban areas: An evaluation of the impact on the electric energy grid | |
| CN109145982A (en) | The personal identification method and device of driver, storage medium, terminal | |
| CN110189182B (en) | Mileage anxiety management method based on Internet of vehicles | |
| Ji et al. | Electric vehicle fast charger planning for metropolitan planning organizations: Adapting to changing markets and vehicle technology | |
| Tan et al. | A stochastic flow capturing location and allocation model for siting electric vehicle charging stations | |
| Hsu et al. | The depot and charging facility location problem for electrifying urban bus services | |
| Andrenacci et al. | Determination of the level of service and customer crowding for electric charging stations through fuzzy models and simulation techniques | |
| Charly et al. | Identifying optimal locations for community electric vehicle charging | |
| CN110807552A (en) | Urban electric bus running condition construction method based on improved K-means | |
| CN110254285A (en) | It is a kind of to provide the method and system of service to mileage anxiety user based on car networking | |
| CN114419924A (en) | AI application control management system based on wisdom city | |
| Li et al. | An empirical analysis of electric vehicles’ charging patterns | |
| CN111861527A (en) | Method and device for determining electric vehicle charging station and storage medium | |
| CN117035357A (en) | Charging and discharging scheduling method for electric taxi team in energy-traffic | |
| He et al. | Factors affecting the adoption intention of electric vehicles: The roles of objective, perceived and prospective accessibility | |
| Zhang et al. | An urban charging load forecasting model based on trip chain model for private passenger electric vehicles: A case study in Beijing | |
| CN111754784A (en) | Attention mechanism-based vehicle main and sub brand identification method of multilayer network | |
| CN111429166A (en) | Electric vehicle charging demand spatial distribution prediction method based on maximum contour clustering |
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 | ||
| CP03 | Change of name, title or address |
Address after: Floor 3, Building Lichun (1 #), Taihua wutong Industrial Park, Sanwei Community, Hangcheng Street, Bao'an District, Shenzhen, Guangdong 518100 Patentee after: Shenzhen Guangmingding Technology Co.,Ltd. Address before: 518100 4th floor, building a, Runfeng Industrial Park, Bao'an Avenue, Xixiang street, Bao'an District, Shenzhen City, Guangdong Province Patentee before: SHENZHEN GUANGMINGDING LIGHTING SCIENCE & TECHNOLOGY CO.,LTD. |
|
| CP03 | Change of name, title or address |