Nothing Special   »   [go: up one dir, main page]

CN104680258A - Method and device for dispatching electric taxi - Google Patents

Method and device for dispatching electric taxi Download PDF

Info

Publication number
CN104680258A
CN104680258A CN201510108978.4A CN201510108978A CN104680258A CN 104680258 A CN104680258 A CN 104680258A CN 201510108978 A CN201510108978 A CN 201510108978A CN 104680258 A CN104680258 A CN 104680258A
Authority
CN
China
Prior art keywords
mrow
msub
charging
time
electric taxi
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201510108978.4A
Other languages
Chinese (zh)
Inventor
张维戈
杨玉青
姜久春
牛利勇
黄梅
张帝
严乙桉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jiaotong University
Original Assignee
Beijing Jiaotong University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Jiaotong University filed Critical Beijing Jiaotong University
Priority to CN201510108978.4A priority Critical patent/CN104680258A/en
Publication of CN104680258A publication Critical patent/CN104680258A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40Business processes related to the transportation industry
    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02JCIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J7/00Circuit arrangements for charging or depolarising batteries or for supplying loads from batteries
    • H02J7/0013Circuit arrangements for charging or depolarising batteries or for supplying loads from batteries acting upon several batteries simultaneously or sequentially
    • H02J7/0027
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02EREDUCTION OF GREENHOUSE GAS [GHG] EMISSIONS, RELATED TO ENERGY GENERATION, TRANSMISSION OR DISTRIBUTION
    • Y02E60/00Enabling technologies; Technologies with a potential or indirect contribution to GHG emissions mitigation
    • Y02E60/10Energy storage using batteries

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • Theoretical Computer Science (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Power Engineering (AREA)
  • Development Economics (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Charge And Discharge Circuits For Batteries Or The Like (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a method and device for dispatching an electric taxi. The method comprises the following steps: A, according to a predetermined time interval, collecting data of the electric taxi and a charging facility; B, optimally dispatching the charging of the electric taxi by an ordered time charging strategy, an ordered space charging strategy or an ordered time and space combined charging strategy, wherein the ordered time charging strategy comprises maximization of the time utilization efficiency of a charging facility of a charging station, minimization of the time of charging service of the electric taxi and minimization of time-category load variance from the electric taxi to an electric region distribution network; the ordered space charging strategy comprises maximization of the space utilization efficiency of the charging facility of the charging station, minimization of a displacement distance of charging the electric taxi and minimization of time-category load variance from the electric taxi to the electric region distribution network. Through the use of the method and device for dispatching the electric taxi, the usage rate of charging equipment in the charging station can be increased.

Description

Electric taxi dispatching method and device
Technical Field
The invention relates to the technical field of new energy, in particular to the technical field of urban electric vehicle charging management.
Background
With the development of the automobile industry technology and the improvement of the living standard of residents, the quantity of automobiles kept in China is rapidly increased. At the same time, however, worldwide energy shortage and environmental pollution problems are also increasing. Electric vehicles are a new generation of vehicles, and are widely concerned by governments of various countries due to the advantages of energy conservation, environmental protection and the like. The electric taxi is used as an exemplary application of an electric automobile, and already runs in cities such as Beijing and Shenzhen, and more electric taxis can replace fuel vehicles in the future.
However, due to the operating characteristics of the electric taxi, it is necessary to increase the operation time as much as possible, and under the current fast charging technical conditions, an electric taxi needs about two hours to complete charging from 0% to 100% of the State of Charge (SOC) with a charging rate of 0.5C. Under the condition of disordered charging, the electric taxi randomly selects the charging time, so that the charging load of the electric taxi is often unevenly distributed in time and space, and the charging congestion phenomenon occurs in part of time periods and part of charging stations. The manual service adopted at present is relatively passive and does not play a role in orderly scheduling.
And then, the charging station is used as a medium for energy exchange between the electric taxi and the power grid, and has great influence on the power grid and users of the electric taxi in operation and dispatching. The orderly operation of the charging station is the basis for realizing the orderly charging of the large-scale electric taxi. Moreover, orderly charging of the electric taxis in the charging station has important significance for improving the operating economy and the operating efficiency of the charging station.
The charging rule of the current charging station is shown in fig. 1, and an electric taxi selects a charging station nearby; after the vehicle enters the station, selecting an idle charging pile for charging; if no idle charging pile exists, the user can choose to wait continuously or choose other charging stations to charge. And when the vehicle finishes charging, leaving the charging station.
If a large-scale electric taxi enters a commercialized era, the unordered charging rule is continuously used, and the charging service cannot meet the charging requirement of the existing user. The unordered charging method can seriously affect the experience of electric taxi users and the operating efficiency of the charging station, and meanwhile threatens the stability and the safety of the power distribution network.
Disclosure of Invention
In view of the above, the present invention aims to overcome the defects in the prior art, and provide a method and a device for scheduling electric taxis, which utilize the obvious characteristic that electric taxis have mobility in time and space to orderly control electric taxis in time and space on the premise that electric taxis participate in scheduling.
In order to achieve the purpose, the invention adopts the following technical scheme.
An electric taxi dispatching method, comprising:
A. acquiring data of the electric taxi and the charging facility according to a preset time interval;
B. the electric taxi is optimally scheduled by an ordered time charging strategy, an ordered space charging strategy or an ordered space-time combined charging strategy, the ordered charging scheduling strategy is determined,
the ordered time charging strategy comprises the steps of maximizing the time utilization efficiency of charging facilities of the charging station, minimizing the charging service time of the electric taxis and minimizing the time category load variance of the electric taxis to a regional power distribution network;
the ordered space charging strategy comprises the steps of maximizing the space utilization efficiency of charging facilities of the charging station, minimizing the charging moving distance of the electric taxi and minimizing the space category load variance of the electric taxi to a regional power distribution network;
the ordered spatiotemporal joint charging strategy comprises optimization targets of an ordered time charging strategy and an ordered space charging strategy.
In the step A, the collected data of the electric taxi and the charging facility comprise electric taxi number data, electric taxi position data, electric taxi charge state, electric taxi passenger carrying destination, electric taxi running state data, charging facility running state data, current charging vehicle charge state, charging facility charging remaining time estimation and charging vehicle waiting information.
In particular, the predetermined time interval is data collected every 15 minutes.
In addition, the constraints of the step B for carrying out optimized scheduling on the charging of the electric taxi by the ordered time charging strategy, the ordered space charging strategy or the ordered space-time combined charging strategy comprise electric taxi running constraints and electric taxi battery constraints, wherein,
the electric taxi operation constraint comprises the following steps: the electric taxi has fixed charging times in each time period, the charging station is selected as one of the plurality of charging stations when the electric taxi returns to the station, and the electric taxi has enough electric quantity to return to the charging station after completing a passenger carrying task before returning to the station;
the electric taxi battery restraint comprises the following steps: the charging power of the electric taxi in the charging process is between the upper limit and the lower limit of the charging power of the charging facility, and the state of charge (SOC) of the electric taxi in the running process is between the upper limit and the lower limit.
In the ordered time charging strategy, the time utilization efficiency of the charging facility of the charging station is maximized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>time</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>t</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>T</mi> </munderover> <msup> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mt</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>-</mo> <mfrac> <mn>1</mn> <mi>T</mi> </mfrac> <munderover> <mi>&Sigma;</mi> <mrow> <mi>t</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>T</mi> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mt</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
wherein x ismtFor time-optimized decision variables, PmThe charging power of the electric taxis M, the number of the electric taxis M and the total dispatching duration T,
the charging service time of the electric taxi is minimized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>time</mi> </mrow> </msub> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <mrow> <mo>(</mo> <msub> <mi>T</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>b</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>T</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>w</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>T</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>c</mi> </mrow> </msub> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math>
wherein, Tm,b、Tm,wAnd Tm,cRespectively representing the in-transit time, the waiting time and the charging time of the electric taxi m in the charging service process,
the time domain load variance of the electric taxi to the regional power distribution network is minimized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>time</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>t</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>T</mi> </munderover> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mi>t</mi> </msub> <mo>-</mo> <msub> <mover> <mi>P</mi> <mo>&OverBar;</mo> </mover> <mi>T</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
wherein, PtFor the active load of the regional distribution network at time t,the average load of the regional distribution network in the time domain is obtained.
In the ordered space charging strategy, the space utilization efficiency of the charging facility of the charging station is maximized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>space</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </munderover> <msup> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mn</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>-</mo> <mfrac> <msub> <mi>C</mi> <mi>n</mi> </msub> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </munderover> <msub> <mi>C</mi> <mi>n</mi> </msub> </mrow> </mfrac> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mn</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
wherein x ismnDecision variables, P, for spatial optimizationmCharging power of M electric taxis, M is the number of electric taxis, N is the number of charging stations in the area, CnTo chargeThe number of charging facilities within the plant n,
the charging moving distance of the electric taxi is minimized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>space</mi> </mrow> </msub> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>L</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>travel</mi> </mrow> </msub> <mo>,</mo> </mrow> </math>
wherein L ism,travelFor the moving distance in the charging service process of the electric taxi m,
the space category load variance of the electric taxi to the regional power distribution network is minimized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>space</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <msub> <mi>n</mi> <mi>bus</mi> </msub> <mo>=</mo> <mn>1</mn> </mrow> <msub> <mi>N</mi> <mi>bus</mi> </msub> </munderover> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <msub> <mi>n</mi> <mi>bus</mi> </msub> </msub> <mo>-</mo> <msub> <mover> <mi>P</mi> <mo>&OverBar;</mo> </mover> <msub> <mi>N</mi> <mi>bus</mi> </msub> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
wherein,for regional distribution networks in nbusThe active load of the node is the real load,the average load of the regional distribution network in the spatial domain is obtained.
In addition, in the step B, the target is fuzzified by adopting membership degrees for an ordered time charging strategy, an ordered space charging strategy or an ordered space-time combined charging strategy to form a fuzzy target,
<math> <mrow> <msub> <mi>&mu;</mi> <mi>x</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mn>0</mn> </mtd> <mtd> <msub> <mi>f</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>&le;</mo> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>min</mi> </mrow> </msub> </mtd> <mtd> </mtd> </mtr> <mtr> <mtd> <mfrac> <mrow> <msub> <mi>f</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>-</mo> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>min</mi> </mrow> </msub> </mrow> <mrow> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>max</mi> </mrow> </msub> <mo>-</mo> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>min</mi> </mrow> </msub> </mrow> </mfrac> </mtd> <mtd> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>min</mi> </mrow> </msub> <mo>&lt;</mo> <msub> <mi>f</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <msub> <mrow> <mo>&lt;</mo> <mi>c</mi> </mrow> <mrow> <mi>i</mi> <mi>max</mi> </mrow> </msub> </mtd> <mtd> <mi>i</mi> <mo>=</mo> <mn>1,2,3</mn> </mtd> </mtr> <mtr> <mtd> <mn>1</mn> </mtd> <mtd> <msub> <mi>f</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>&GreaterEqual;</mo> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>max</mi> </mrow> </msub> </mtd> <mtd> </mtd> </mtr> </mtable> </mfenced> <mo>,</mo> </mrow> </math>
wherein f isi(x) Refers to the ith target of fuzzification; mu.si(x) Is referred to as target fi(x) Degree of membership of; c. Ci minAnd ci maxRespectively refer to the target fi(x) Upper and lower limits of ci minRefers to the optimal fitness value of a single target, ci maxRefers to the initial fitness value of the corresponding target,
and then, comprehensively forming single-target optimization by the multiple membership degrees:
F=max(μ123)。
after the single-target optimization is formed, further obtaining an optimization result by using a particle swarm method, wherein the method comprises the following steps:
<math> <mrow> <msubsup> <mi>v</mi> <mi>id</mi> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> <mo>=</mo> <mi>&omega;</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> <msubsup> <mi>v</mi> <mi>id</mi> <mi>k</mi> </msubsup> <mo>+</mo> <msub> <mi>c</mi> <mn>1</mn> </msub> <msub> <mi>r</mi> <mn>1</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>p</mi> <mi>id</mi> </msub> <mo>-</mo> <msubsup> <mi>z</mi> <mi>id</mi> <mi>k</mi> </msubsup> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>c</mi> <mn>2</mn> </msub> <msub> <mi>r</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>p</mi> <mi>gd</mi> </msub> <mo>-</mo> <msubsup> <mi>z</mi> <mi>id</mi> <mi>k</mi> </msubsup> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math>
z id k + 1 = z id k + v id k + 1 ,
<math> <mrow> <mi>&omega;</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>&omega;</mi> <mi>start</mi> </msub> <mo>-</mo> <mrow> <mo>(</mo> <msub> <mi>&omega;</mi> <mi>start</mi> </msub> <mo>-</mo> <msub> <mi>&omega;</mi> <mi>end</mi> </msub> <mo>)</mo> </mrow> <msup> <mrow> <mo>(</mo> <mfrac> <mi>k</mi> <mi>T</mi> </mfrac> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
wherein,the position of the particles is represented by a variable,representing the variation of particle velocity, pid、pgdRespectively representing an individual optimal solution and a population optimal solution, c1,c2Is a constant number r1,r2Is a random number, ω (k) is an inertial weight, ωstartAnd ωendRespectively, the initial and end weights, and k and T are respectively the current iteration algebra and the iteration total algebra.
An electric taxi dispatching device comprises an electric taxi monitoring platform, a charging facility monitoring platform and an ordered charging control center, wherein,
the electric taxi monitoring platform and the charging facility monitoring platform are respectively used for acquiring electric taxi and charging facility data according to a preset time interval;
the ordered charging control center is used for carrying out optimized scheduling on the charging of the electric taxi by an ordered time charging strategy, an ordered space charging strategy or an ordered space-time combined charging strategy, determining the ordered charging scheduling strategy,
the ordered time charging strategy comprises the steps of maximizing the time utilization efficiency of charging facilities of the charging station, minimizing the charging service time of the electric taxis and minimizing the time category load variance of the electric taxis to a regional power distribution network;
the ordered space charging strategy comprises the steps of maximizing the space utilization efficiency of charging facilities of the charging station, minimizing the charging moving distance of the electric taxi and minimizing the space category load variance of the electric taxi to a regional power distribution network;
the ordered spatiotemporal joint charging strategy comprises optimization targets of an ordered time charging strategy and an ordered space charging strategy.
The method comprises the steps of utilizing an Ethernet or a communication network to transmit collected electric taxi and charging facility data to an ordered charging control center, and utilizing the communication network to transmit an ordered charging scheduling strategy determined by the ordered charging control center to electric taxi users.
By adopting the method and the device for dispatching the electric taxi, the unbalance of the charging load of the charging station in time and space can be reduced, and the utilization rate of charging facilities in the charging station is improved.
In addition, by adopting the method and the device for dispatching the electric taxi, the charging waiting time of the electric taxi can be reduced, and the charging distance of the electric taxi can be shortened.
In addition, by adopting the electric taxi dispatching method and device disclosed by the invention, the influence of the charging station on the power distribution network system can be reduced, so that the stability and the safety of the power distribution network are improved.
Drawings
Fig. 1 is a schematic flow chart of disordered charging of an electric taxi in the prior art.
Fig. 2 is a structural diagram of an electric taxi dispatching apparatus according to an embodiment of the present invention.
Fig. 3 is a schematic flow chart of an electric taxi dispatching method in an embodiment of the invention.
Fig. 4 is a schematic diagram illustrating a comparison between a method for scheduling an electric taxi and a result of disordered charging of the electric taxi in the embodiment of the present invention.
Fig. 5 is a schematic diagram illustrating a comparison between a method for scheduling an electric taxi and a result of disordered charging of the electric taxi in the embodiment of the present invention.
Detailed Description
The present invention will be described in detail below with reference to the accompanying drawings.
Detailed exemplary embodiments are disclosed below. However, specific structural and functional details disclosed herein are merely for purposes of describing example embodiments.
It should be understood, however, that the intention is not to limit the invention to the particular exemplary embodiments disclosed, but to cover all modifications, equivalents, and alternatives falling within the scope of the disclosure. Like reference numerals refer to like elements throughout the description of the figures.
It will also be understood that the term "and/or" as used herein includes any and all combinations of one or more of the associated listed items. It will be further understood that when an element or unit is referred to as being "connected" or "coupled" to another element or unit, it can be directly connected or coupled to the other element or unit or intervening elements or units may also be present. Moreover, other words used to describe the relationship between components or elements should be understood in the same manner (e.g., "between" versus "directly between," "adjacent" versus "directly adjacent," etc.).
As shown in fig. 2, the electric taxi dispatching device of the present invention includes an electric taxi monitoring platform, a charging facility monitoring platform, and an ordered charging control center, wherein,
the electric taxi monitoring platform and the charging facility monitoring platform are respectively used for acquiring electric taxi and charging facility data according to a preset time interval;
the ordered charging control center is used for carrying out optimized scheduling on the charging of the electric taxi by an ordered time charging strategy, an ordered space charging strategy or an ordered space-time combined charging strategy, determining the ordered charging scheduling strategy,
the ordered time charging strategy comprises the steps of maximizing the time utilization efficiency of charging facilities of the charging station, minimizing the charging service time of the electric taxis and minimizing the time category load variance of the electric taxis to a regional power distribution network;
the ordered space charging strategy comprises the steps of maximizing the space utilization efficiency of charging facilities of the charging station, minimizing the charging moving distance of the electric taxi and minimizing the space category load variance of the electric taxi to a regional power distribution network;
the ordered spatiotemporal joint charging strategy comprises optimization targets of an ordered time charging strategy and an ordered space charging strategy.
As a specific embodiment of the present invention, the collected data of the electric taxi and the charging facility are transmitted to the ordered charging control center by using an ethernet or a communication network, and the ordered charging scheduling policy determined by the ordered charging control center is transmitted to the electric taxi user by using the communication network. For example, there are two data transmission modes, one is ethernet data transmission, and the other is communication through a 2G/3G network. The charging equipment monitoring platform, the electric taxi monitoring platform and the ordered charging control center are communicated with each other by utilizing the Ethernet inside the charging station, and current data of the charging equipment monitoring platform and the electric taxi monitoring platform are transmitted to the ordered charging control center at fixed time intervals. And obtaining an ordered charging scheduling strategy of the electric taxi by utilizing an ordered scheduling optimization method of the control center in the charging station ordered control center. In addition, in the communication between the electric taxi and the charging station, 2G/3G network transmission is utilized, on one hand, real-time running data of the electric taxi is transmitted to an electric taxi monitoring platform, and on the other hand, the ordered charging scheduling strategy obtained by the charging station control center is transmitted to a corresponding electric taxi user.
Correspondingly, the electric taxi dispatching method comprises the following steps:
A. acquiring data of the electric taxi and the charging facility according to a preset time interval;
B. the electric taxi is optimally scheduled by an ordered time charging strategy, an ordered space charging strategy or an ordered space-time combined charging strategy, the ordered charging scheduling strategy is determined,
the ordered time charging strategy comprises the steps of maximizing the time utilization efficiency of charging facilities of the charging station, minimizing the charging service time of the electric taxis and minimizing the time category load variance of the electric taxis to a regional power distribution network;
the ordered space charging strategy comprises the steps of maximizing the space utilization efficiency of charging facilities of the charging station, minimizing the charging moving distance of the electric taxi and minimizing the space category load variance of the electric taxi to a regional power distribution network;
the ordered spatiotemporal joint charging strategy comprises optimization targets of an ordered time charging strategy and an ordered space charging strategy.
Therefore, by adopting the electric taxi dispatching method and the electric taxi dispatching device, imbalance of charging load of the charging station in time and space can be reduced, and utilization rate of charging equipment in the charging station is improved.
In addition, by adopting the method and the device for dispatching the electric taxi, the charging waiting time of the electric taxi can be reduced, and the charging route of the electric taxi can be shortened.
In a specific embodiment, in step a, the collected data of the electric taxi and the charging facility includes number data of the electric taxi, a position of the electric taxi, a charge state of the electric taxi, a passenger carrying destination of the electric taxi, running state data of the charging facility, a current charge state of the charging vehicle, a charge remaining time estimation of the charging facility, and information of the waiting-to-charge vehicle.
In addition, the predetermined time interval for collecting data may be selected according to actual situations, for example, in one embodiment, the predetermined time interval is data collection every 15 minutes.
The technical solution of the present invention will be described below in different embodiments.
Firstly, introducing a scheduling strategy, wherein the scheduling strategy is closely related to an optimized target, and the scheduling strategy specifically comprises the following steps:
1. the time and space utilization rate of the charging facility of the charging station is improved.
Due to the operation characteristics of the electric taxi, the efficiency of the charging equipment is unbalanced in the time range, so that vehicles to be charged are intensively selected to be charged in a certain time period, the time utilization rate of the charging equipment is reduced, the charging pile is idle in partial time periods, and the charging queuing phenomenon in partial time periods is avoided. Similarly, the charging distribution is unbalanced in space, so that vehicles to be charged are intensively selected from one charging station for charging, the space-time utilization rate of charging equipment is reduced, and the overall development of the charging station is negatively affected.
From the perspective of a charging station operator, the charging taxis are distributed according to time and space with the aim of improving the time and space utilization rate of the charging facility, the time and space characteristics of the charging vehicles are averaged, the imbalance of the charging load of the charging station in time and space can be reduced, and the utilization rate of the charging equipment in the charging station is higher.
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>time</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>t</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>T</mi> </munderover> <msup> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mt</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>-</mo> <mfrac> <mn>1</mn> <mi>T</mi> </mfrac> <munderover> <mi>&Sigma;</mi> <mrow> <mi>t</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>T</mi> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mt</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>space</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </munderover> <msup> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mn</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>-</mo> <mfrac> <msub> <mi>C</mi> <mi>n</mi> </msub> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </munderover> <msub> <mi>C</mi> <mi>n</mi> </msub> </mrow> </mfrac> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mn</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow> </math>
Wherein, T is 1, 2.. times.t; m ═ 1,2,. said, M; n is 1,2,. cndot.n;
in the formulas (1) and (2), M and N are the number of electric taxis and the number of electric taxi charging stations in the region respectively; t is the total scheduling duration; x is the number ofmtAnd xmnRespectively, are the decision variables for temporal optimization and spatial optimization. Furthermore, PmCharging power for electric taxi m, CnThe number of charging facilities for the charging station n.
2. The charging service time of the electric taxi user is minimized and the moving distance caused by the charging service is minimized.
The target 1 mainly aims at the angle of a charging station to analyze the uneven distribution of the charging load, and the target 2 is to analyze the uneven distribution of the charging load at the angle of an electric taxi user, and aims at minimizing the charging service time of the electric taxi user in the time range; in the space category, the moving distance of the electric taxi due to the charging service is minimized. Wherein the charging service time includes three parts of a time-in-transit from the passenger carrying destination to the charging station, a charging station waiting time, and a charging time, wherein the time-in-transit and the charging waiting time are both optimizable amounts. The spatial movement distance caused by the charging service refers to a distance of spatial movement caused by traveling to a charging station for charging between the last passenger and the next passenger when the electric taxi has a charging demand.
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>time</mi> </mrow> </msub> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <mrow> <mo>(</mo> <msub> <mi>T</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>b</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>T</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>w</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>T</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>c</mi> </mrow> </msub> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>space</mi> </mrow> </msub> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>L</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>travel</mi> </mrow> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </mrow> </math>
In the formula, Tm,b、Tm,w、Tm,cThe in-transit time, the waiting time and the charging time of the electric taxi m in the charging service process are respectively indicated. And L ism,travelThe spatial transfer distance of the electric taxi m in the charging service process is indicated.
3. Minimizing negative impact of electric taxi charging on regional distribution network
In the invention, for model simplification, the time and space influence of the electric taxi charging station on the regional power distribution network is evaluated by using the load variance indexes of the time and space of the regional power distribution network. The load variance index can effectively measure the fluctuation condition of the regional load, and the more severe the load fluctuation is, the larger the feeder loss and the more unstable the voltage of the regional power distribution network are. Therefore, by controlling the load variance, the adverse effect of the charging load of the electric taxi charging station can be well controlled, as shown in formulas (5) to (6).
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>time</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>t</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>T</mi> </munderover> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mi>t</mi> </msub> <mo>-</mo> <msub> <mover> <mi>P</mi> <mo>&OverBar;</mo> </mover> <mi>T</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>space</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <msub> <mi>n</mi> <mi>bus</mi> </msub> <mo>=</mo> <mn>1</mn> </mrow> <msub> <mi>N</mi> <mi>bus</mi> </msub> </munderover> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <msub> <mi>n</mi> <mi>bus</mi> </msub> </msub> <mo>-</mo> <msub> <mover> <mi>P</mi> <mo>&OverBar;</mo> </mover> <msub> <mi>N</mi> <mi>bus</mi> </msub> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow> </math>
In the formula, PtAndrespectively representing the active load and n of the regional distribution network at time tbusThe active load of the node is respectively the measurement of time and space; whileAndthe average load in the temporal and spatial domains is represented, respectively.
Therefore, in the embodiment of the present invention, in the ordered time charging policy, the time utilization efficiency of the charging facility of the charging station is maximized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>time</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>t</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>T</mi> </munderover> <msup> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mt</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>-</mo> <mfrac> <mn>1</mn> <mi>T</mi> </mfrac> <munderover> <mi>&Sigma;</mi> <mrow> <mi>t</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>T</mi> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mt</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
the charging service time of the electric taxi is minimized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>time</mi> </mrow> </msub> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <mrow> <mo>(</mo> <msub> <mi>T</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>b</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>T</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>w</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>T</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>c</mi> </mrow> </msub> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math>
the time domain load variance of the electric taxi to the regional power distribution network is minimized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>time</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>t</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>T</mi> </munderover> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mi>t</mi> </msub> <mo>-</mo> <msub> <mover> <mi>P</mi> <mo>&OverBar;</mo> </mover> <mi>T</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
in addition, in the ordered space charging strategy, the space utilization efficiency of the charging facility of the charging station is maximized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>space</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </munderover> <msup> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mn</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>-</mo> <mfrac> <msub> <mi>C</mi> <mi>n</mi> </msub> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </munderover> <msub> <mi>C</mi> <mi>n</mi> </msub> </mrow> </mfrac> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mn</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
the charging moving distance of the electric taxi is minimized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>space</mi> </mrow> </msub> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>L</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>travel</mi> </mrow> </msub> <mo>,</mo> </mrow> </math>
the space category load variance of the electric taxi to the regional power distribution network is minimized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>space</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <msub> <mi>n</mi> <mi>bus</mi> </msub> <mo>=</mo> <mn>1</mn> </mrow> <msub> <mi>N</mi> <mi>bus</mi> </msub> </munderover> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <msub> <mi>n</mi> <mi>bus</mi> </msub> </msub> <mo>-</mo> <msub> <mover> <mi>P</mi> <mo>&OverBar;</mo> </mover> <msub> <mi>N</mi> <mi>bus</mi> </msub> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
in addition, in step B of the electric taxi scheduling method according to the specific embodiment of the present invention, the constraints of performing optimal scheduling on electric taxi charging by using the ordered time charging strategy, the ordered space charging strategy, or the ordered space-time combined charging strategy include electric taxi operation constraints and electric taxi battery constraints, where the electric taxi operation constraints include:
the electric taxi has a fixed charging time S within each time period T, i.e.
<math> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>t</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>T</mi> </munderover> <msub> <mi>x</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>t</mi> </mrow> </msub> <mo>=</mo> <mi>S</mi> <mo>,</mo> </mrow> </math>
When the electric taxi returns to the station, the electric taxi selects the charging station as one of N charging stations, namely
<math> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </munderover> <msub> <mi>x</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>n</mi> </mrow> </msub> <mo>=</mo> <mn>1</mn> <mo>,</mo> </mrow> </math>
The electric taxi has enough electric quantity to return to the charging station after completing the passenger carrying task before returning to the station, namely
Loperation≤DM;
Wherein L isoperationThe driving distance is the total driving distance between two times of charging of the electric taxi, and the DM is the driving distance of the electric taxi.
The electric taxi battery restraint comprises the following steps: the charging power of the electric taxi in the charging process is between the upper limit and the lower limit of the charging power of the charging facility, namely
Pc-min≤Pc≤Pc-max,Pc-minAnd Pc-maxRespectively a lower limit and an upper limit of the charging power,
the SOC of the electric taxi is between the upper limit and the lower limit during the running process, namely
SOCmin≤SOCmt≤SOCmax
When a plurality of optimization targets coexist, the scheduling problem of the electric taxi is actually a multi-target optimization problem. Generally, a weight penalty function method or a fuzzy method is used to solve a similar problem. The weight penalty function method usually needs to subjectively set or obtain a proper weight coefficient through multiple tests, and the fuzzy rule fuzzifies the target by using the membership degree to form a fuzzy multi-target. Therefore, it is not necessary to set a weight coefficient, and objective solution is performed.
Therefore, in one embodiment of the present invention, the objective is fuzzified using membership to an ordered time charging strategy, an ordered space charging strategy, or an ordered spatio-temporal joint charging strategy to form a fuzzy objective,
<math> <mrow> <msub> <mi>&mu;</mi> <mi>x</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mn>0</mn> </mtd> <mtd> <msub> <mi>f</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>&le;</mo> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>min</mi> </mrow> </msub> </mtd> <mtd> </mtd> </mtr> <mtr> <mtd> <mfrac> <mrow> <msub> <mi>f</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>-</mo> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>min</mi> </mrow> </msub> </mrow> <mrow> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>max</mi> </mrow> </msub> <mo>-</mo> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>min</mi> </mrow> </msub> </mrow> </mfrac> </mtd> <mtd> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>min</mi> </mrow> </msub> <mo>&lt;</mo> <msub> <mi>f</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <msub> <mrow> <mo>&lt;</mo> <mi>c</mi> </mrow> <mrow> <mi>i</mi> <mi>max</mi> </mrow> </msub> </mtd> <mtd> <mi>i</mi> <mo>=</mo> <mn>1,2,3</mn> </mtd> </mtr> <mtr> <mtd> <mn>1</mn> </mtd> <mtd> <msub> <mi>f</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>&GreaterEqual;</mo> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>max</mi> </mrow> </msub> </mtd> <mtd> </mtd> </mtr> </mtable> </mfenced> <mo>,</mo> </mrow> </math>
wherein f isi(x) Refers to the ith target of fuzzification; mu.si(x) Is referred to as target fi(x) Degree of membership of; c. Ci minAnd ci maxRespectively refer to the target fi(x) Upper and lower limits of ci minRefers to the optimal fitness value of a single target, ci maxRefers to the initial fitness value of the corresponding target,
and then, comprehensively forming single-target optimization by the multiple membership degrees:
F=max(μ123)。
after the single-target optimization is formed, the embodiment of the invention further comprises the step of obtaining an optimization result by using a particle swarm method, which is originally proposed by Kennedy and Eberhart in 1995, and has been widely adopted in optimization calculation in various fields due to the advantages of high search speed and strong search capability. Similarly, the particle swarm is also performed in the neighborhood of the previous generation optimal solution in the process of performing particle iterative search, and the problem of falling into the local optimal solution also exists. Therefore, the basic particle swarm method is improved in the solving process, on one hand, when the optimizing process falls into the local optimal solution, the forced jumping is carried out; on the other hand, the inertia weight of the algorithm is improved, as shown in equations (14) to (16), so that the optimization process is prevented from falling into a local optimal solution. The method comprises the following steps:
<math> <mrow> <msubsup> <mi>v</mi> <mi>id</mi> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> <mo>=</mo> <mi>&omega;</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> <msubsup> <mi>v</mi> <mi>id</mi> <mi>k</mi> </msubsup> <mo>+</mo> <msub> <mi>c</mi> <mn>1</mn> </msub> <msub> <mi>r</mi> <mn>1</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>p</mi> <mi>id</mi> </msub> <mo>-</mo> <msubsup> <mi>z</mi> <mi>id</mi> <mi>k</mi> </msubsup> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>c</mi> <mn>2</mn> </msub> <msub> <mi>r</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>p</mi> <mi>gd</mi> </msub> <mo>-</mo> <msubsup> <mi>z</mi> <mi>id</mi> <mi>k</mi> </msubsup> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math>
z id k + 1 = z id k + v id k + 1 ,
<math> <mrow> <mi>&omega;</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>&omega;</mi> <mi>start</mi> </msub> <mo>-</mo> <mrow> <mo>(</mo> <msub> <mi>&omega;</mi> <mi>start</mi> </msub> <mo>-</mo> <msub> <mi>&omega;</mi> <mi>end</mi> </msub> <mo>)</mo> </mrow> <msup> <mrow> <mo>(</mo> <mfrac> <mi>k</mi> <mi>T</mi> </mfrac> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
wherein,indicating the position of the particleThe variable quantity is set, and the variable quantity is set,representing the variation of particle velocity, pid、pgdRespectively representing an individual optimal solution and a population optimal solution, c1,c2Is a constant number r1,r2Is a random number, ω (k) is an inertial weight, ωstartAnd ωendRespectively, the initial and end weights, and k and T are respectively the current iteration algebra and the iteration total algebra.
Although the fuzzy method is used for constructing the single optimization target and the particle swarm optimization method is used for obtaining the optimal result, it should be understood by those skilled in the art that the electric taxi dispatching method is not limited to constructing the single target by using the fuzzy method, nor to solving by using the particle swarm optimization method. For example, the optimization result can be obtained by using methods such as classical linear programming and quadratic programming, and an artificial intelligence method, and the implementation of the technical scheme of the invention is not affected.
The technical effect of the present invention is explained below by using a more specific example, assuming that 8 charging stations are distributed in an area of 50km × 30km, and the number of charging facilities of each charging station is [1,2,2,1,1,2,3,1] respectively; the number of the electric taxis is 100, and the initial positions of the electric taxis are randomly distributed in the center of the area; the station return SOC of the electric taxi is in accordance with N (0.5,0.1) distribution.
Disordered charge mode of the prior art:
in the operation process of the electric taxi, the electric taxi is in an unordered charging state, namely a near charging mode, which represents the operation process of the electric taxi and the charging station under the condition of no interactive communication, and is shown in fig. 1. If the SOC of the electric taxi is lower than the set operation warning lower limit, selecting the nearest charging station for charging when the passenger carrying task is completed; and if the electric taxi finishes the passenger carrying process at a certain time and finds that the current residual electric quantity cannot complete the next passenger carrying task, selecting the nearest charging station for charging.
In addition, by adopting the electric taxi scheduling method and device, on the basis of bidirectional communication between the charging station and the electric taxi, the time utilization efficiency of the charging facility of the charging station is maximized, the charging service time of the electric taxi is minimized, and the time category load variance of the electric taxi to a regional power distribution network is minimized; the space utilization efficiency of charging facilities of the charging station is maximized, the charging moving distance of the electric taxis is minimized, and the space category load variance of the electric taxis on the regional power distribution network is minimized to serve as optimization targets, and orderly charging scheduling is carried out in the time, space and space-time combined category. The results of fig. 4 and 5 can be obtained. Fig. 4 is a comparison of charging loads of electric taxis in disorder and ordered time scheduling and space-time combined scheduling. As can be seen from fig. 4, in the electric taxi scheduling method of the present invention, compared with the space-time joint optimization scheduling strategy, the individual ordered time scheduling has a more obvious effect on the optimization control in the time domain. In addition, fig. 5 is a comparison between the unordered and ordered spatial scheduling of the electric taxi and the selection of the space-time joint scheduling charging station, and it can be known from fig. 5 that, in the electric taxi scheduling method of the present invention, the effect of the individual ordered spatial scheduling on the optimization control in the space category is more obvious compared with the space-time joint optimization scheduling strategy.
It should be noted that the above-mentioned embodiments are only preferred embodiments of the present invention, and should not be construed as limiting the scope of the present invention, and any minor changes and modifications to the present invention are within the scope of the present invention without departing from the spirit of the present invention.

Claims (10)

1. An electric taxi dispatching method, comprising:
A. acquiring data of the electric taxi and the charging facility according to a preset time interval;
B. the electric taxi is optimally scheduled by an ordered time charging strategy, an ordered space charging strategy or an ordered space-time combined charging strategy, the ordered charging scheduling strategy is determined,
the ordered time charging strategy comprises the steps of maximizing the time utilization efficiency of charging facilities of the charging station, minimizing the charging service time of the electric taxis and minimizing the time category load variance of the electric taxis to a regional power distribution network;
the ordered space charging strategy comprises the steps of maximizing the space utilization efficiency of charging facilities of the charging station, minimizing the charging moving distance of the electric taxi and minimizing the space category load variance of the electric taxi to a regional power distribution network;
the ordered spatiotemporal joint charging strategy comprises optimization targets of an ordered time charging strategy and an ordered space charging strategy.
2. The method for dispatching an electric taxi according to claim 1, wherein in the step a, the collected data of the electric taxi and the charging facility comprise data of a number of the electric taxi, position data of the electric taxi, a charge state of the electric taxi, a passenger carrying destination of the electric taxi, running state data of the charging facility, a current charge state of the charging vehicle, an estimation of charging remaining time of the charging facility, and information of waiting for the charging vehicle.
3. The method of claim 2, wherein the predetermined time interval is every 15 minutes.
4. The electric taxi dispatching method of claim 1, wherein the constraints on optimal dispatching of electric taxi charging in the ordered time charging strategy, the ordered space charging strategy or the ordered space-time combined charging strategy in step B include electric taxi operation constraints and electric taxi battery constraints, wherein,
the electric taxi operation constraint comprises the following steps: the electric taxi has fixed charging times in each time period, the charging station is selected as one of the plurality of charging stations when the electric taxi returns to the station, and the electric taxi has enough electric quantity to return to the charging station after completing a passenger carrying task before returning to the station;
the electric taxi battery restraint comprises the following steps: the charging power of the electric taxi in the charging process is between the upper limit and the lower limit of the charging power of the charging facility, and the state of charge (SOC) of the electric taxi in the running process is between the upper limit and the lower limit.
5. The method of claim 1, wherein in the ordered time charging strategy,
the time utilization efficiency of the charging facility of the charging station is maximized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>time</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>t</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>T</mi> </munderover> <msup> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mt</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>-</mo> <mfrac> <mn>1</mn> <mi>T</mi> </mfrac> <munderover> <mi>&Sigma;</mi> <mrow> <mi>t</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>T</mi> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mt</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
wherein x ismtFor time-optimized decision variables, PmThe charging power of the electric taxis M, the number of the electric taxis M and the total dispatching duration T,
the charging service time of the electric taxi is minimized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>time</mi> </mrow> </msub> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <mrow> <mo>(</mo> <msub> <mi>T</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>b</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>T</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>w</mi> </mrow> </msub> <mo>+</mo> <msub> <mi>T</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>c</mi> </mrow> </msub> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math>
wherein, Tm,b、Tm,wAnd Tm,cRespectively representing the in-transit time, the waiting time and the charging time of the electric taxi m in the charging service process,
the time domain load variance of the electric taxi to the regional power distribution network is minimized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>time</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>t</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>T</mi> </munderover> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mi>t</mi> </msub> <mo>-</mo> <msub> <mover> <mi>P</mi> <mo>&OverBar;</mo> </mover> <mi>T</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
wherein, PtFor the active load of the regional distribution network at time t,the average load of the regional distribution network in the time domain is obtained.
6. The method of claim 1, wherein in the ordered space charging strategy,
the space utilization efficiency of the charging facility of the charging station is maximized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>space</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msup> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mn</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>-</mo> <mfrac> <msub> <mi>C</mi> <mi>n</mi> </msub> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </munderover> <msub> <mi>C</mi> <mi>n</mi> </msub> </mrow> </mfrac> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>x</mi> <mi>mn</mi> </msub> <msub> <mi>P</mi> <mi>m</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
wherein x ismnDecision variables, P, for spatial optimizationmCharging power of M electric taxis, M is the number of electric taxis, N is the number of charging stations in the area, CnFor the number of charging facilities in a charging station n
The charging moving distance of the electric taxi is minimized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>space</mi> </mrow> </msub> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>L</mi> <mrow> <mi>m</mi> <mo>,</mo> <mi>travel</mi> </mrow> </msub> <mo>,</mo> </mrow> </math>
wherein L ism,travelFor the moving distance in the charging service process of the electric taxi m,
the space category load variance of the electric taxi to the regional power distribution network is minimized as follows:
<math> <mrow> <msub> <mi>F</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>space</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mi>&Sigma;</mi> <mrow> <msub> <mi>n</mi> <mi>bus</mi> </msub> <mo>=</mo> <mn>1</mn> </mrow> <msub> <mi>N</mi> <mi>bus</mi> </msub> </munderover> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <msub> <mi>n</mi> <mi>bus</mi> </msub> </msub> <mo>-</mo> <msub> <mover> <mi>P</mi> <mo>&OverBar;</mo> </mover> <msub> <mi>N</mi> <mi>bus</mi> </msub> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
wherein,for regional distribution networks in nbusThe active load of the node is the real load,the average load of the regional distribution network in the spatial domain is obtained.
7. The method of claim 1, wherein in step B, the objective is fuzzified by membership to an ordered time charging strategy, an ordered space charging strategy or an ordered space-time combined charging strategy to form a fuzzy objective,
<math> <mrow> <msub> <mi>&mu;</mi> <mi>x</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mn>0</mn> </mtd> <mtd> <msub> <mi>f</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>&le;</mo> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>min</mi> </mrow> </msub> </mtd> </mtr> <mtr> <mtd> <mfrac> <mrow> <msub> <mi>f</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>-</mo> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>min</mi> </mrow> </msub> </mrow> <mrow> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>max</mi> </mrow> </msub> <mo>-</mo> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>min</mi> </mrow> </msub> </mrow> </mfrac> </mtd> <mtd> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>min</mi> </mrow> </msub> <mo>&lt;</mo> <msub> <mi>f</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>&lt;</mo> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>max</mi> </mrow> </msub> </mtd> </mtr> <mtr> <mtd> <mn>1</mn> </mtd> <mtd> <msub> <mi>f</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>&GreaterEqual;</mo> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>max</mi> </mrow> </msub> </mtd> </mtr> </mtable> </mfenced> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>1,2,3</mn> <mo>,</mo> </mrow> </math>
wherein f isi(x) Refers to the ith target of fuzzification; mu.si(x) Is referred to as target fi(x) Degree of membership of; c. Ci minAnd ci maxRespectively refer to the target fi(x) Upper and lower limits of ci minRefers to the optimal fitness value of a single target, ci maxRefers to the initial fitness value of the corresponding target,
and then, comprehensively forming single-target optimization by the multiple membership degrees:
F=max(μ123)。
8. the method for dispatching electric taxis according to claim 7, wherein after the forming of the single-target optimization, further comprising obtaining the optimization result by using a particle swarm method, the method comprises:
<math> <mrow> <msubsup> <mi>v</mi> <mi>id</mi> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> <mo>=</mo> <mi>&omega;</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> <msubsup> <mi>v</mi> <mi>id</mi> <mi>k</mi> </msubsup> <mo>+</mo> <msub> <mi>c</mi> <mn>1</mn> </msub> <msub> <mi>r</mi> <mn>1</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>p</mi> <mi>id</mi> </msub> <mo>-</mo> <msubsup> <mi>z</mi> <mi>id</mi> <mi>k</mi> </msubsup> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>c</mi> <mn>2</mn> </msub> <msub> <mi>r</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>p</mi> <mi>gd</mi> </msub> <mo>-</mo> <msubsup> <mi>z</mi> <mi>id</mi> <mi>k</mi> </msubsup> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math>
z id k + 1 = z id k + v id k + 1 ,
<math> <mrow> <mi>&omega;</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>&omega;</mi> <mi>start</mi> </msub> <mo>-</mo> <mrow> <mo>(</mo> <msub> <mi>&omega;</mi> <mi>start</mi> </msub> <mo>-</mo> <msub> <mi>&omega;</mi> <mi>end</mi> </msub> <mo>)</mo> </mrow> <msup> <mrow> <mo>(</mo> <mfrac> <mi>k</mi> <mi>T</mi> </mfrac> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math>
wherein,the position of the particles is represented by a variable,representing the variation of particle velocity, pid、pgdRespectively representIndividual optimal solution and population optimal solution, c1,c2Is a constant number r1,r2Is a random number, ω (k) is an inertial weight, ωstartAnd ωendRespectively, the initial and end weights, and k and T are respectively the current iteration algebra and the iteration total algebra.
9. An electric taxi dispatching device comprises an electric taxi monitoring platform, a charging facility monitoring platform and an ordered charging control center, wherein,
the electric taxi monitoring platform and the charging facility monitoring platform are respectively used for acquiring electric taxi and charging facility data according to a preset time interval;
the ordered charging control center is used for carrying out optimized scheduling on the charging of the electric taxi by an ordered time charging strategy, an ordered space charging strategy or an ordered space-time combined charging strategy, determining the ordered charging scheduling strategy,
the ordered time charging strategy comprises the steps of maximizing the time utilization efficiency of charging facilities of the charging station, minimizing the charging service time of the electric taxis and minimizing the time category load variance of the electric taxis to a regional power distribution network;
the ordered space charging strategy comprises the steps of maximizing the space utilization efficiency of charging facilities of the charging station, minimizing the charging moving distance of the electric taxi and minimizing the space category load variance of the electric taxi to a regional power distribution network;
the ordered spatiotemporal joint charging strategy comprises optimization targets of an ordered time charging strategy and an ordered space charging strategy.
10. The electric taxi dispatching device according to claim 9, wherein the collected electric taxi and charging facility data are transmitted to the ordered charging control center through an ethernet or a communication network, and the ordered charging dispatching strategy determined by the ordered charging control center is transmitted to the electric taxi users through the communication network.
CN201510108978.4A 2015-03-12 2015-03-12 Method and device for dispatching electric taxi Pending CN104680258A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510108978.4A CN104680258A (en) 2015-03-12 2015-03-12 Method and device for dispatching electric taxi

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510108978.4A CN104680258A (en) 2015-03-12 2015-03-12 Method and device for dispatching electric taxi

Publications (1)

Publication Number Publication Date
CN104680258A true CN104680258A (en) 2015-06-03

Family

ID=53315267

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510108978.4A Pending CN104680258A (en) 2015-03-12 2015-03-12 Method and device for dispatching electric taxi

Country Status (1)

Country Link
CN (1) CN104680258A (en)

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105262167A (en) * 2015-10-22 2016-01-20 江苏省电力公司南京供电公司 Intra-regional electric vehicle ordered charging control method
CN105576762A (en) * 2015-11-25 2016-05-11 北京巨力思创科技有限公司 Electric automobile charging control method and device
CN106056255A (en) * 2016-06-23 2016-10-26 海南电力技术研究院 Space-time joint scheduling ordered charging method and device
CN106413028A (en) * 2016-08-31 2017-02-15 浙江爱充网络科技有限公司 Optimal charging policy-based vehicle data routing method
CN106779176A (en) * 2016-11-25 2017-05-31 北京交通大学 Electric taxi fills electrically-charging equipment configuration and constant volume method in station soon
CN106853778A (en) * 2015-12-08 2017-06-16 现代自动车株式会社 For finding the method and apparatus of the PD of EVSE and the operating method of SECC
CN107341563A (en) * 2017-06-09 2017-11-10 安徽富煌科技股份有限公司 A kind of new energy bus intelligent charge dispatches combined optimization method
CN107798415A (en) * 2016-08-29 2018-03-13 福特全球技术公司 Optimize the selection of the battery electric vehicle for performing transport task
CN108734875A (en) * 2017-04-13 2018-11-02 宁波轩悦行电动汽车服务有限公司 It is a kind of that method of hiring a car is preengage based on the WEB for estimating electricity and stand-by period
CN109217433A (en) * 2018-11-07 2019-01-15 武汉理工大学 Vehicle-mounted retired power battery grouping active equalization system and method
CN109636176A (en) * 2018-12-10 2019-04-16 武汉中原电子集团有限公司 A kind of electric bus intelligent website and the bootstrap technique that charges
CN110254284A (en) * 2019-06-21 2019-09-20 北京嘀嘀无限科技发展有限公司 Electric taxi charging reminding method, electronic equipment and storage medium
CN110322120A (en) * 2019-06-12 2019-10-11 深圳大学 A kind of electric vehicle charging schedule method and system based on maximizing the benefits
CN110706124A (en) * 2018-07-09 2020-01-17 郑州宇通客车股份有限公司 Charging scheduling method and system for electric passenger car charging station
CN112530155A (en) * 2020-12-14 2021-03-19 武汉禾青优化科技有限公司 Electric bus dispatching method
CN114919433A (en) * 2022-05-27 2022-08-19 深圳先进技术研究院 Electric vehicle cluster charging and discharging control method, system and related equipment
CN117284135A (en) * 2023-10-25 2023-12-26 昆山市冠康电子有限公司 Charging pile management method and system of new energy charging field based on Internet of things

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103241130A (en) * 2013-04-10 2013-08-14 华中科技大学 Energy management method and system for electric bus charging and swap station
CN103810539A (en) * 2014-02-25 2014-05-21 华北电力大学 Optimal capacity configuration method considering availability of power conversion service for electric automobile converter station
CN103840549A (en) * 2012-11-20 2014-06-04 北京交通大学 System and method for dispatching charging load space of electric vehicle

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103840549A (en) * 2012-11-20 2014-06-04 北京交通大学 System and method for dispatching charging load space of electric vehicle
CN103241130A (en) * 2013-04-10 2013-08-14 华中科技大学 Energy management method and system for electric bus charging and swap station
CN103810539A (en) * 2014-02-25 2014-05-21 华北电力大学 Optimal capacity configuration method considering availability of power conversion service for electric automobile converter station

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
YUQING YANG..ETC: "Coordinated Charging Strategy for Electric Taxis in Temporal and Spatial Scale", 《ENERGIES》 *

Cited By (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105262167A (en) * 2015-10-22 2016-01-20 江苏省电力公司南京供电公司 Intra-regional electric vehicle ordered charging control method
CN105576762A (en) * 2015-11-25 2016-05-11 北京巨力思创科技有限公司 Electric automobile charging control method and device
CN105576762B (en) * 2015-11-25 2018-01-09 北京巨力思创科技有限公司 Charging electric vehicle control method and device
CN106853778A (en) * 2015-12-08 2017-06-16 现代自动车株式会社 For finding the method and apparatus of the PD of EVSE and the operating method of SECC
CN106056255A (en) * 2016-06-23 2016-10-26 海南电力技术研究院 Space-time joint scheduling ordered charging method and device
CN107798415A (en) * 2016-08-29 2018-03-13 福特全球技术公司 Optimize the selection of the battery electric vehicle for performing transport task
CN106413028A (en) * 2016-08-31 2017-02-15 浙江爱充网络科技有限公司 Optimal charging policy-based vehicle data routing method
CN106779176B (en) * 2016-11-25 2023-08-25 北京交通大学 Electric taxi quick-charging station internal charging facility configuration and volume-fixing method
CN106779176A (en) * 2016-11-25 2017-05-31 北京交通大学 Electric taxi fills electrically-charging equipment configuration and constant volume method in station soon
CN108734875A (en) * 2017-04-13 2018-11-02 宁波轩悦行电动汽车服务有限公司 It is a kind of that method of hiring a car is preengage based on the WEB for estimating electricity and stand-by period
CN107341563A (en) * 2017-06-09 2017-11-10 安徽富煌科技股份有限公司 A kind of new energy bus intelligent charge dispatches combined optimization method
CN110706124A (en) * 2018-07-09 2020-01-17 郑州宇通客车股份有限公司 Charging scheduling method and system for electric passenger car charging station
CN109217433A (en) * 2018-11-07 2019-01-15 武汉理工大学 Vehicle-mounted retired power battery grouping active equalization system and method
CN109217433B (en) * 2018-11-07 2022-03-11 武汉理工大学 Vehicle-mounted retired power battery grouping active equalization system and method
CN109636176B (en) * 2018-12-10 2022-04-19 武汉中原电子集团有限公司 Intelligent station building and charging guide method for electric bus
CN109636176A (en) * 2018-12-10 2019-04-16 武汉中原电子集团有限公司 A kind of electric bus intelligent website and the bootstrap technique that charges
CN110322120B (en) * 2019-06-12 2021-08-06 深圳大学 Electric vehicle charging scheduling method and system based on benefit maximization
CN110322120A (en) * 2019-06-12 2019-10-11 深圳大学 A kind of electric vehicle charging schedule method and system based on maximizing the benefits
CN110254284A (en) * 2019-06-21 2019-09-20 北京嘀嘀无限科技发展有限公司 Electric taxi charging reminding method, electronic equipment and storage medium
CN112530155A (en) * 2020-12-14 2021-03-19 武汉禾青优化科技有限公司 Electric bus dispatching method
CN112530155B (en) * 2020-12-14 2022-05-20 武汉禾青优化科技有限公司 Electric bus dispatching method
CN114919433A (en) * 2022-05-27 2022-08-19 深圳先进技术研究院 Electric vehicle cluster charging and discharging control method, system and related equipment
CN117284135A (en) * 2023-10-25 2023-12-26 昆山市冠康电子有限公司 Charging pile management method and system of new energy charging field based on Internet of things
CN117284135B (en) * 2023-10-25 2024-05-28 深圳长盛泰富科技有限公司 Charging pile management method and system of new energy charging field based on Internet of things

Similar Documents

Publication Publication Date Title
CN104680258A (en) Method and device for dispatching electric taxi
CN109034648B (en) Electric vehicle cluster demand response potential evaluation method
CN104933466B (en) A kind of charging schedule system and method based on electric automobile charging priority
CN107392400B (en) EV charging load space-time distribution prediction method considering real-time traffic and temperature
CN110570050B (en) Road-network-vehicle-related electric vehicle charging guiding method
Ou et al. Investigating wireless charging and mobility of electric vehicles on electricity market
Zhang et al. Eco-driving control for connected and automated electric vehicles at signalized intersections with wireless charging
CN109711630A (en) A kind of electric car fast charge station addressing constant volume method based on trip probability matrix
CN103499792B (en) The Forecasting Methodology of available capacity of EV power battery cluster
CN103678917A (en) Bus real-time arrival time predicting method based on simulated annealing algorithm
CN103605885A (en) Traffic network information based residual mileage estimation method for electric vehicle
CN112016745B (en) Planning method for electric vehicle charging station
Zhang et al. Electric vehicle charging load prediction considering multi-source information real-time interaction and user regret psychology
Su et al. Forecast of electric vehicle charging demand based on traffic flow model and optimal path planning
CN107067136A (en) Charging electric vehicle distribution method and device
Guo et al. Rebalancing and charging scheduling with price incentives for car sharing systems
CN114282821A (en) Scheduling method, system and equipment for sharing electric automobile
CN109130897B (en) Space-time dual-scale-based matching type V2V energy exchange method
Saatloo et al. Hierarchical user-driven trajectory planning and charging scheduling of autonomous electric vehicles
Lu et al. En-route electric vehicles charging navigation considering the traffic-flow-dependent energy consumption
CN114039372B (en) Electric vehicle scheduling method and system participating in power grid partition peak clipping and valley filling
Rigas et al. Algorithms for electric vehicle scheduling in mobility-on-demand schemes
CN106096859A (en) The orderly charging method of space-time combined dispatching and device
CN115759505B (en) Task-oriented multi-mobile charging vehicle scheduling method
Zhang et al. Charging time and location recommendation strategy considering taxi user satisfaction

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20150603

RJ01 Rejection of invention patent application after publication