CN113642905A - Mobile parallel charging method with detachable shared electric vehicle charging requirements - Google Patents
Mobile parallel charging method with detachable shared electric vehicle charging requirements Download PDFInfo
- Publication number
- CN113642905A CN113642905A CN202110951667.XA CN202110951667A CN113642905A CN 113642905 A CN113642905 A CN 113642905A CN 202110951667 A CN202110951667 A CN 202110951667A CN 113642905 A CN113642905 A CN 113642905A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- shared electric
- charging
- mobile
- electric vehicle
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 31
- 238000011156 evaluation Methods 0.000 claims abstract description 10
- 230000002776 aggregation Effects 0.000 claims description 15
- 230000005611 electricity Effects 0.000 claims description 15
- 238000004220 aggregation Methods 0.000 claims description 12
- 239000013589 supplement Substances 0.000 description 3
- 230000001502 supplementing effect Effects 0.000 description 2
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/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
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- 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/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/04—Constraint-based CAD
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Tourism & Hospitality (AREA)
- Operations Research (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Game Theory and Decision Science (AREA)
- Health & Medical Sciences (AREA)
- Development Economics (AREA)
- Charge And Discharge Circuits For Batteries Or The Like (AREA)
- General Health & Medical Sciences (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- Electric Propulsion And Braking For Vehicles (AREA)
- Primary Health Care (AREA)
Abstract
The invention discloses a mobile parallel charging method with detachable charging requirements of a shared electric vehicle, which allows the electric quantity requirement of one shared electric vehicle to be provided by a plurality of mobile charging vehicles, meets the limitation of hard service time windows of the shared electric vehicle, allows the shared electric vehicles positioned at the same gathering point to be simultaneously charged by the service of the same mobile charging vehicle, meets the limitation of battery capacity of the mobile charging vehicle, and solves the path of each mobile charging vehicle by using commercial solving software CPLEX; the solving method comprises the following steps: (1) defining a graph on which the model is based; (2) defining a model evaluation index; (3) defining a flow balance constraint; (4) defining the electric quantity constraint of the mobile charging vehicle; (5) a mobile charging vehicle time window constraint is defined. The invention improves the charging efficiency of the shared electric automobile and the service efficiency of the mobile charging vehicle.
Description
Technical Field
The invention relates to the technical field of shared charging, in particular to a mobile parallel charging method with detachable charging requirements of a shared electric vehicle.
Background
Due to the characteristics of no exhaust emission, low noise and the like of the shared electric automobile, the shared electric automobile is generally accepted by the public as a new travel mode. Among the many shared electric vehicle sharing modes, Free-flowing (Free-floating) shared electric vehicles are more selected by the general public due to their unrestricted parking positions. However, the user for traveling only selects the shared electric vehicle with sufficient electric quantity to travel, and stops the vehicle at the parking place at will. Popular parking places such as shopping centers and office buildings are often insufficient to charge the electric pile in an idle state so as to supplement electric quantity for the shared electric automobile with insufficient electric quantity. The mobile charging car can be flexibly moved to the parking point of the shared electric car with the charge to be compensated to supplement the electric quantity for the shared electric car, so that the problem of electric quantity supplement of the shared electric car with insufficient electric quantity can be effectively solved, and the advantage of gathering the shared electric car in popular places can be effectively utilized.
The problems and disadvantages exist:
1. the traditional method for dispatching the shared electric vehicle with insufficient electric quantity to charge the station for supplementing the electric quantity is low in efficiency;
2. the charging requirement of a traditional single shared electric automobile is met by only one mobile charging automobile;
3. the traditional method for forcing the user to return the shared electric vehicle with insufficient electric quantity to the short-distance charging station hinders the selection of the shared electric vehicle;
4. the traditional shared electric automobile with insufficient scheduling electric quantity cannot fully utilize the advantage of gathering of the shared electric automobile in popular places.
Disclosure of Invention
Based on the technical problems in the background art, the invention provides a mobile parallel charging method with detachable charging requirements of a shared electric vehicle.
The technical scheme adopted by the invention is as follows:
a mobile parallel charging method with detachable charging requirements of a shared electric vehicle is characterized in that the electric quantity requirement of one shared electric vehicle is allowed to be provided by a plurality of mobile charging vehicles, the hard service time window limit of the shared electric vehicle is met, the shared electric vehicles at the same gathering point are allowed to be simultaneously charged by the same mobile charging vehicle, the battery capacity limit of the mobile charging vehicles is met, and the path of each mobile charging vehicle is solved by using commercial solving software CPLEX; the solving method comprises the following steps:
(1) defining a graph on which the model is based;
(2) defining a model evaluation index;
(3) defining a flow balance constraint;
(4) defining the electric quantity constraint of the mobile charging vehicle;
(5) a mobile charging vehicle time window constraint is defined.
Further, the mobile parallel charging method with the detachable charging requirement of the shared electric vehicle is characterized in that: the step (1) comprises the following steps:
(1-1) defining a graph based model, the form is as follows:
c ═ 1, 2., N } is a set of shared electric vehicle aggregation nodes, where N is the number of total shared electric vehicle aggregation nodes, each aggregation node may stop multiple shared electric vehicles, in order to determine whether a shared electric vehicle located in the same shared electric vehicle aggregation node has been serviced and by which mobile charging vehicle, a set C 'is defined, and only one shared electric vehicle is stopped on a node within the set C'; 0 and N +1 are stations located at the same position; all mobile charging vehicles K belong to K and provide charging service for the shared electric automobile from the station 0, and finally return to the station N +1 after the scheduled service is finished; defining a link set a { (i, j) | i, j ∈ C { [ 0, N +1} }; therefore, a parallel service path planning method for a mobile charging vehicle with detachable charging requirement considering sharing of electric vehicles is defined in a graph G ═ (C {0, N +1}, a).
Further, the mobile parallel charging method with the detachable charging requirement of the shared electric vehicle is characterized in that: the step (2) comprises the following steps:
(2-1) defining a model evaluation index in the form of:
minα1∑k∈K∑(i,j)∈Adijxijk+α2∑k∈K∑j∈C′∪(N+1)x0jk
the model evaluation index is the lowest total cost, wherein the first item is the total vehicle running cost, and the second item is the total vehicle cost; alpha is alpha1And alpha2The unit vehicle running cost and the single mobile charging vehicle use cost are respectively; dijIs a parameter representing the euclidean distance between nodes i and j; x is the number ofijkE {0, 1} is a knapsack variable; x if vehicle k visits road segment (i, j)ijk1 is ═ 1; otherwise, xijk=0。
Further, the mobile parallel charging method with the detachable charging requirement of the shared electric vehicle is characterized in that: the step (3) comprises the following steps:
(3-1) defining a flow balance constraint of the form:
a first flow balance constraint ensures that the number of mobile charging vehicles dispatched equals the number of mobile charging vehicles returning to the yard; a second flow balance constraint ensures that the number of vehicles entering the intermediate node other than the yard is equal to the number of vehicles exiting the node; the third flow balance constraint ensures that a mobile charging vehicle can only serve one shared electric vehicle once.
Further, the mobile parallel charging method with the detachable charging requirement of the shared electric vehicle is characterized in that: the step (4) comprises the following steps:
(4-1) defining the electric quantity constraint of the mobile charging vehicle, wherein the form is as follows:
k∈K
the first constraint is to ensure that the power demand of each shared electric vehicle is met; w is aikThe variable is used for representing the electric quantity provided by the mobile charging car k for the shared electric car located at the virtual node i belonging to C'; qi is a parameter and represents the electric quantity demand of the shared electric automobile positioned at the virtual node i belonging to C'; the second constraint is used to ensure that the quantity of electricity at the time when the mobile charging vehicle k reaches the node j ∈ C' [ N +1 ] > is not less than 0 and less than the quantity of electricity at the time when it reaches the previous node minus the quantity of electricity it has served at the previous node and the quantity of electricity hd consumed during operation between two pointsijxijk(ii) a h is the electricity consumption rate per unit travel distance; the third constraint ensures that the electric quantity when the mobile charging vehicle leaves the station is equal to the battery capacity, and the station does not have a shared electric vehicle, so the electric quantity requirement of the station shared electric vehicle is 0, i.e. q0=0。
Further, the mobile parallel charging method with the detachable charging requirement of the shared electric vehicle is characterized in that: the step (5) comprises the following steps:
(5-1) defining a mobile charging vehicle time window constraint of the form:
the first and second constraints ensure the time feasibility of the mobile charging vehicle for the road segment leaving station 0 and the virtual aggregation node, respectively; tau isikThe variable represents the time when the mobile charging vehicle k starts to provide charging service for the shared electric vehicle located at the virtual node i belonging to C'; sijkE {0, 1} is a knapsack variable representing whether a shared electric vehicle located at a virtual node i e C 'and a shared electric vehicle located at a virtual node j e C' can be serviced simultaneously; constraint three ensures that the time that the mobile charging vehicle provides charging services for the shared electric vehicle located at virtual node i e C' is in its time window (i.e, [ ei, li)]) Internal; constraint four is used to ensure variable sijkAnd variable xijkThe relationship between them.
The invention has the advantages that:
(1) the parallel mobile charging service path planning method provided by the invention effectively improves the efficiency of the traditional method for dispatching the shared electric vehicle with insufficient electric quantity to charge the station for supplementing the electric quantity;
(2) when the electric quantity demand of the shared electric automobile is large, the electric quantity demand can be provided by two or even more shared electric automobiles;
(3) the parallel mobile charging service path planning method can flexibly schedule the shared electric vehicle to move to the periphery of the shared electric vehicle so as to reduce the assisted scheduling of users, thereby improving the order of the shared electric vehicle;
(4) the parallel mobile charging service path planning method provided by the invention allows a plurality of shared electric vehicles positioned at the same node to be simultaneously served, and improves the service efficiency of the mobile charging vehicles.
Detailed Description
The technical solutions in the embodiments of the present invention are clearly and completely described below, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all embodiments.
Example 1.
A mobile parallel charging method with detachable charging requirements of a shared electric vehicle allows the electric quantity requirement of one shared electric vehicle to be provided by a plurality of mobile charging vehicles, the hard service time window limit of the shared electric vehicle is met, the shared electric vehicles at the same gathering point are allowed to be charged by the same mobile charging vehicle at the same time, the battery capacity limit of the mobile charging vehicles is met, and the path of each mobile charging vehicle is solved by using commercial solving software CPLEX; the solving method comprises the following steps:
(1) defining a graph on which the model is based;
(2) defining a model evaluation index;
(3) defining a flow balance constraint;
(4) defining the electric quantity constraint of the mobile charging vehicle;
(5) a mobile charging vehicle time window constraint is defined.
The step (1) comprises the following steps:
(1-1) defining a graph based model, the form is as follows:
c ═ 1, 2., N } is a set of shared electric vehicle aggregation nodes, where N is the number of total shared electric vehicle aggregation nodes, each aggregation node may stop multiple shared electric vehicles, in order to determine whether a shared electric vehicle located in the same shared electric vehicle aggregation node has been serviced and by which mobile charging vehicle, a set C 'is defined, and only one shared electric vehicle is stopped on a node within the set C'; 0 and N +1 are stations located at the same position; all mobile charging vehicles K belong to K and provide charging service for the shared electric automobile from the station 0, and finally return to the station N +1 after the scheduled service is finished; defining a link set a { (i, j) | i, j ∈ C { [ 0, N +1} }; therefore, a parallel service path planning method for a mobile charging vehicle with detachable charging requirement considering sharing of electric vehicles is defined in a graph G ═ (C {0, N +1}, a).
The step (2) comprises the following steps:
(2-1) defining a model evaluation index in the form of:
min α1∑k∈K∑(i,j)∈Adijxijk+α2∑k∈K∑j∈C′∪(N+1)x0jk
the model evaluation index is the lowest total cost, wherein the first item is the total vehicle running cost, and the second item is the total vehicle cost; alpha is alpha1And alpha2The unit vehicle running cost and the single mobile charging vehicle use cost are respectively; dijIs a parameter representing the euclidean distance between nodes i and j; x is the number ofijkE {0, 1} is a knapsack variable; x if vehicle k visits road segment (i, j)ijk1 is ═ 1; otherwise, xijk=0。
The step (3) comprises the following steps:
(3-1) defining a flow balance constraint of the form:
a first flow balance constraint ensures that the number of mobile charging vehicles dispatched equals the number of mobile charging vehicles returning to the yard; a second flow balance constraint ensures that the number of vehicles entering the intermediate node other than the yard is equal to the number of vehicles exiting the node; the third flow balance constraint ensures that a mobile charging vehicle can only serve one shared electric vehicle once.
The step (4) comprises the following steps:
(4-1) defining the electric quantity constraint of the mobile charging vehicle, wherein the form is as follows:
k∈K
the first constraint is to ensure that the power demand of each shared electric vehicle is met; w is aikThe variable is used for representing the electric quantity provided by the mobile charging car k for the shared electric car located at the virtual node i belonging to C'; q. q.siRepresenting the electric quantity demand of the shared electric vehicle positioned at the virtual node i belonging to C' as a parameter; the second constraint is used to ensure that the quantity of electricity at the time when the mobile charging vehicle k reaches the node j ∈ C' [ N +1 ] > is not less than 0 and less than the quantity of electricity at the time when it reaches the previous node minus the quantity of electricity it has served at the previous node and the quantity of electricity hd consumed during operation between two pointsijxijk(ii) a h is the electricity consumption rate per unit travel distance; the third constraint ensures that the electric quantity when the mobile charging vehicle leaves the station is equal to the battery capacity, and the station does not share the electric vehicle, so the electric quantity requirement of the station sharing electric vehicle is 0, i.e., q.0=0。
The step (5) comprises the following steps:
(5-1) defining a mobile charging vehicle time window constraint of the form:
the first and second constraints ensure the time feasibility of the mobile charging vehicle for the road segment leaving station 0 and the virtual aggregation node, respectively; tau isikThe variable represents the time when the mobile charging vehicle k starts to provide charging service for the shared electric vehicle located at the virtual node i belonging to C'; sijkE {0, 1} is a knapsack variable representing whether a shared electric vehicle located at a virtual node i e C 'and a shared electric vehicle located at a virtual node j e C' can be serviced simultaneously; constraint three ensures that the time at which the mobile charging vehicle provides charging services for the shared electric vehicle located at virtual node i e C' is within its time window (i.e., [ e ])i,li]) Internal; constraint four is used to ensure variable sijkAnd variable xijkThe relationship between them.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art should be considered to be within the technical scope of the present invention, and the technical solutions and the inventive concepts thereof according to the present invention should be equivalent or changed within the scope of the present invention.
Claims (6)
1. The mobile parallel charging method with the detachable charging requirement of the shared electric vehicle is characterized in that the electric quantity requirement of one shared electric vehicle is allowed to be provided by a plurality of mobile charging vehicles, the hard service time window limit of the shared electric vehicle is met, the shared electric vehicles at the same gathering point are allowed to be charged by the same mobile charging vehicle at the same time, the battery capacity limit of the mobile charging vehicles is met, and the path of each mobile charging vehicle is solved by using commercial solving software CPLEX; the solving method comprises the following steps:
(1) defining a graph on which the model is based;
(2) defining a model evaluation index;
(3) defining a flow balance constraint;
(4) defining the electric quantity constraint of the mobile charging vehicle;
(5) a mobile charging vehicle time window constraint is defined.
2. The mobile parallel charging method with detachable charging requirement for the shared electric vehicle as claimed in claim 1, wherein: the step (1) comprises the following steps:
(1-1) defining a graph based model, the form is as follows:
c ═ 1, 2., N } is a set of shared electric vehicle aggregation nodes, where N is the number of total shared electric vehicle aggregation nodes, each aggregation node may stop multiple shared electric vehicles, in order to determine whether a shared electric vehicle located in the same shared electric vehicle aggregation node has been serviced and by which mobile charging vehicle, a set C 'is defined, and only one shared electric vehicle is stopped on a node within the set C'; 0 and N +1 are stations located at the same position; all mobile charging vehicles K belong to K and provide charging service for the shared electric automobile from the station 0, and finally return to the station N +1 after the scheduled service is finished; defining a link set a { (i, j) | i, j ∈ C { [ 0, N +1} }; therefore, a parallel service path planning method for a mobile charging vehicle with detachable charging requirement considering sharing of electric vehicles is defined in a graph G ═ (C {0, N +1}, a).
3. The mobile parallel charging method with detachable charging requirement for the shared electric vehicle as claimed in claim 1, wherein: the step (2) comprises the following steps:
(2-1) defining a model evaluation index in the form of:
minα1∑k∈K∑(i,j)∈Adijxijk+α2∑k∈K∑j∈C′∪(N+1)x0jk
model (model)The evaluation index is the lowest total cost, wherein the first item is the total vehicle running cost, and the second item is the total vehicle cost; alpha is alpha1And alpha2The unit vehicle running cost and the single mobile charging vehicle use cost are respectively; dijIs a parameter representing the euclidean distance between nodes i and j; x is the number ofijkE {0, 1} is a knapsack variable; x if vehicle k visits road segment (i, j)ijk1 is ═ 1; otherwise, xijk=0。
4. The mobile parallel charging method with detachable charging requirement for the shared electric vehicle as claimed in claim 1, wherein: the step (3) comprises the following steps:
(3-1) defining a flow balance constraint of the form:
a first flow balance constraint ensures that the number of mobile charging vehicles dispatched equals the number of mobile charging vehicles returning to the yard; a second flow balance constraint ensures that the number of vehicles entering the intermediate node other than the yard is equal to the number of vehicles exiting the node; the third flow balance constraint ensures that a mobile charging vehicle can only serve one shared electric vehicle once.
5. The mobile parallel charging method with detachable charging requirement for the shared electric vehicle as claimed in claim 1, wherein: the step (4) comprises the following steps:
(4-1) defining the electric quantity constraint of the mobile charging vehicle, wherein the form is as follows:
k∈K
the first constraint is to ensure that the power demand of each shared electric vehicle is met; w is aikThe variable is used for representing the electric quantity provided by the mobile charging car k for the shared electric car located at the virtual node i belonging to C'; q. q.siRepresenting the electric quantity demand of the shared electric vehicle positioned at the virtual node i belonging to C' as a parameter; the second constraint is used to ensure that the quantity of electricity at the time when the mobile charging vehicle k reaches the node j ∈ C' [ N +1 ] > is not less than 0 and less than the quantity of electricity at the time when it reaches the previous node minus the quantity of electricity it has served at the previous node and the quantity of electricity hd consumed during operation between two pointsijxijk(ii) a h is the electricity consumption rate per unit travel distance; the third constraint ensures that the electric quantity when the mobile charging vehicle leaves the station is equal to the battery capacity, and the station does not share the electric vehicle, so the electric quantity requirement of the station sharing electric vehicle is 0, i.e., q.0=0。
6. The mobile parallel charging method with detachable charging requirement for the shared electric vehicle as claimed in claim 1, wherein: the step (5) comprises the following steps:
(5-1) defining a mobile charging vehicle time window constraint of the form:
the first and second constraints ensure the time feasibility of the mobile charging vehicle for the road segment leaving station 0 and the virtual aggregation node, respectively; tau isikThe variable represents the time when the mobile charging vehicle k starts to provide charging service for the shared electric vehicle located at the virtual node i belonging to C'; sijkE {0, 1} is a knapsack variable representing whether a shared electric vehicle located at a virtual node i e C 'and a shared electric vehicle located at a virtual node j e C' can be serviced simultaneously; constraint three ensures that the time at which the mobile charging vehicle provides charging services for the shared electric vehicle located at virtual node i e C' is in its time window (i.e, [ e ] ei,li]) Internal; constraint four is used to ensure variable sijkAnd variable xijkThe relationship between them.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110951667.XA CN113642905B (en) | 2021-08-18 | 2021-08-18 | Mobile parallel charging method capable of splitting charging requirements of shared electric automobile |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110951667.XA CN113642905B (en) | 2021-08-18 | 2021-08-18 | Mobile parallel charging method capable of splitting charging requirements of shared electric automobile |
Publications (2)
Publication Number | Publication Date |
---|---|
CN113642905A true CN113642905A (en) | 2021-11-12 |
CN113642905B CN113642905B (en) | 2024-05-10 |
Family
ID=78422821
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110951667.XA Active CN113642905B (en) | 2021-08-18 | 2021-08-18 | Mobile parallel charging method capable of splitting charging requirements of shared electric automobile |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN113642905B (en) |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2019210745A1 (en) * | 2018-05-02 | 2019-11-07 | 爱驰汽车(上海)有限公司 | Replaceable battery pack electric vehicle charging method, system, device, and storage medium |
CN111612358A (en) * | 2020-05-25 | 2020-09-01 | 北京交通大学 | Shared automobile vehicle scheduling and dispatcher path optimization method |
US20200356509A1 (en) * | 2019-05-09 | 2020-11-12 | The Empowerment US Company | Interactive content distribution system with mobile charging device interface |
CN112507506A (en) * | 2020-09-18 | 2021-03-16 | 长安大学 | Multi-objective optimization method for sharing automobile pricing planning model based on genetic algorithm |
CN112590598A (en) * | 2020-12-11 | 2021-04-02 | 合肥工业大学 | Optimal configuration method and system for mobile charging vehicle |
CN112882466A (en) * | 2021-01-12 | 2021-06-01 | 上海电力大学 | Fusion hierarchical planning and A*Shared electric vehicle path planning method of algorithm |
CN113077085A (en) * | 2021-03-30 | 2021-07-06 | 国网江苏省电力有限公司苏州供电分公司 | Mobile charging car station planning method for serving electric car |
-
2021
- 2021-08-18 CN CN202110951667.XA patent/CN113642905B/en active Active
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2019210745A1 (en) * | 2018-05-02 | 2019-11-07 | 爱驰汽车(上海)有限公司 | Replaceable battery pack electric vehicle charging method, system, device, and storage medium |
US20200356509A1 (en) * | 2019-05-09 | 2020-11-12 | The Empowerment US Company | Interactive content distribution system with mobile charging device interface |
CN111612358A (en) * | 2020-05-25 | 2020-09-01 | 北京交通大学 | Shared automobile vehicle scheduling and dispatcher path optimization method |
CN112507506A (en) * | 2020-09-18 | 2021-03-16 | 长安大学 | Multi-objective optimization method for sharing automobile pricing planning model based on genetic algorithm |
CN112590598A (en) * | 2020-12-11 | 2021-04-02 | 合肥工业大学 | Optimal configuration method and system for mobile charging vehicle |
CN112882466A (en) * | 2021-01-12 | 2021-06-01 | 上海电力大学 | Fusion hierarchical planning and A*Shared electric vehicle path planning method of algorithm |
CN113077085A (en) * | 2021-03-30 | 2021-07-06 | 国网江苏省电力有限公司苏州供电分公司 | Mobile charging car station planning method for serving electric car |
Non-Patent Citations (6)
Title |
---|
CUI, SHAOHUA.ETC: "Multiple Types of Plug-In Charging Facilities’ Location-Routing Problem with Time Windows for Mobile Charging Vehicles", SUSTAINABILITY * |
JULIAN DE HOOG.ETC: "Analysis of Constraints for Optimal Electric Vehicle Charging", IFAC PROCEEDINGS VOLUMES * |
SHAOHUA CUI.ETC: "The multi-mode mobile charging service based on electric vehicle spatiotemporal distribution", ENERGY * |
刘洪;戚博硕;韩震焘;葛少云;张强;: "考虑移动充电车路径选择和能源补给的充电服务一体化经济调度", 电力自动化设备, no. 09 * |
崔少华: "移动充电服务的路径规划与设计问题研究", 中国优秀硕士学位论文全文数据库 * |
陈烁炜: "无线传感网络中基于移动充电源的路径规划研究", 中国优秀硕士学位论文全文数据库 * |
Also Published As
Publication number | Publication date |
---|---|
CN113642905B (en) | 2024-05-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN106991492B (en) | Northern climate quick-charging pure electric bus operation scheduling optimization method | |
CN110288821B (en) | Joint scheduling optimization method for manually driven buses and automatically driven buses | |
US10549645B2 (en) | Smart-charging apparatus for use with electric-vehicle-sharing stations | |
Bischoff et al. | Agent-based simulation of electric taxicab fleets | |
CN108417031B (en) | Intelligent parking berth reservation strategy optimization method based on Agent simulation | |
CN109492791B (en) | Inter-city expressway network light storage charging station constant volume planning method based on charging guidance | |
CN107101643B (en) | A kind of share-car matching process | |
CN112193116B (en) | Electric vehicle charging optimization guiding strategy considering reward mechanism | |
Li et al. | Direct vehicle-to-vehicle charging strategy in vehicular ad-hoc networks | |
CN103729724A (en) | Natural-mixing scheduling method of public bike system | |
CN107392336A (en) | Distributed electric automobile charging dispatching method based on reservation in intelligent transportation | |
CN112487560B (en) | Electric power traffic coupling system coordinated game scheduling method based on EV (electric vehicle) owner intention | |
CN111660861B (en) | Charging control method for electric vehicle in charging station | |
CN111815166A (en) | Cooperative optimization method and device of urban public transport system based on passenger flow distribution | |
CN110232219A (en) | A kind of schedulable capacity ratification method of electric car based on data mining | |
CN108133329B (en) | Electric automobile travel and charging demand analysis method considering charging feedback effect | |
CN113627814B (en) | Mobile parallel charging system based on dynamic charging request of electric automobile | |
CN110148297B (en) | Parking transfer system using regular bus connection and optimization method | |
CN113642905A (en) | Mobile parallel charging method with detachable shared electric vehicle charging requirements | |
CN110861508B (en) | Charging control method and system shared by residential area direct current chargers and storage medium | |
CN113657768B (en) | Mobile parallel charging service method based on random electric quantity demand of shared electric automobile | |
CN112149906A (en) | Electric vehicle trip line comprehensive optimization method considering charging time | |
CN116470549A (en) | Charging and storing power station group scheduling method considering random transfer characteristics of electric automobile | |
CN111047227B (en) | Robust energy scheduling method based on two-stage energy and service space-time matching | |
CN115936330A (en) | Demand response type BRT vehicle scheduling algorithm based on Lagrangian principle |
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 |