CN109284891A - Charging pile Maintenance Scheduling method based on temporal index - Google Patents
Charging pile Maintenance Scheduling method based on temporal index Download PDFInfo
- Publication number
- CN109284891A CN109284891A CN201810862720.7A CN201810862720A CN109284891A CN 109284891 A CN109284891 A CN 109284891A CN 201810862720 A CN201810862720 A CN 201810862720A CN 109284891 A CN109284891 A CN 109284891A
- Authority
- CN
- China
- Prior art keywords
- maintenance
- grid
- maintenance man
- man
- time
- 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
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
-
- 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/20—Administration of product repair or maintenance
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention belongs to computer application technologies, provide a kind of charging pile Maintenance Scheduling method based on temporal index.This method completes quick maintenance personal's search, the degree it is pressed for time repaired further according to each charging pile and maintenance difficulty by establishing temporal index, weighs the cost between detour distance and quick response, completes maintenance personal's scheduling with optimal policy.And it is larger for the computational load of maintenance personal's traveling short line, inert shortest path calculation method is used, this method makes full use of known geographic information, is simple and efficient, and speed improves a lot compared with conventional algorithm.Quick maintenance man's search, the degree it is pressed for time repaired further according to each charging pile and maintenance difficulty are completed by establishing temporal index in entire scheduling process, weighs the cost between detour distance and quick response, maintenance man's scheduling is completed with optimal policy.And it is larger for the computational load of maintenance man's traveling short line, using inert shortest path calculation method, reduce redundant computation.
Description
Technical field
The invention belongs to computer application technologies, are related to a kind of charging pile Maintenance Scheduling side based on temporal index
Method.
Background technique
With the rise of green traffic, the market demand of Rechargeable vehicle is gradually increased, it is followed by that charging
The demand of stake increases.For charging pile operator, the timely degree of charging pile maintenance directly affects the use of charging pile
Rate and enterprises service image.However personnel's coordination difficulty of charging pile maintenance is big, personal scheduling at high cost is one extremely important
The problem of.
Have benefited from the development of current mobile Internet information technology, smart phone GPS positioning can very easily position spy
Positioning is set.In current charging pile enterprise operation, maintenance man is managed APP by the charging pile of mobile phone terminal and is updated with certain frequency
For real-time oneself state information to control centre, user can be according to Real-time Feedback in service condition again APP, if there is charging pile event
Barrier needs repairing, then sends maintenance call to control centre, while charging pile also can upload status code to server, report stake
Whether present case is normal.
However charging pile Frequent Troubles, position of fault dispersion and existing Maintenance Scheduling method do not account for maintenance man and work as
Front position state and working condition also bring biggish operating cost for charging pile operation enterprise.Charging pile is also required to repair
Member carries out daily maintenance, such as charging gun daily maintenance, pile body inspection, charge function detection, the detection of charging pile communication failure.That
How efficient scheduling maintenance person, which responds the go forward side by side daily maintenance task of trade day of charging pile maintenance call, is transported charging pile
It seeks most important for enterprise.
Summary of the invention
For the difficult status at high cost of Maintenance Scheduling that charging pile enterprise faces, the present invention provides one kind to be based on space-time rope
The charging pile Maintenance Scheduling method drawn, this method makes full use of known geographic information, is simple and efficient, and speed has compared with conventional algorithm
Large increase.Quick maintenance man's search is completed by establishing temporal index in entire scheduling process, further according to each charging pile
The degree it is pressed for time and maintenance difficulty of maintenance, weigh the cost between detour distance and quick response, complete to tie up with optimal policy
The person's of repairing scheduling.And it is larger for the computational load of maintenance man's traveling short line, using inert shortest path calculation method, subtract
Redundant computation is lacked.
Technical solution of the present invention:
A kind of charging pile Maintenance Scheduling method based on temporal index, steps are as follows:
Define 1 maintenance call Q=(tq,Q.lat,Q.lon,Qf,Wu), Q is requested for each breakdown maintenancex, wherein tx.q
It is request time, Qx.latAnd Qx.lonFor the longitude and latitude of failure charging pile, Qx.fFor the completion of minimum used in each breakdown maintenance
Time, Wx.uFor the degree it is pressed for time of maintenance task, i.e. time windows constraints；
Define 2 operation plan s=(v1,v2..., vn) it is the n maintenance task that sequence is determined by Maintenance Scheduling algorithm
The temporary table of the time sequencing of composition, vkFor the geographical location of failure charging pile；
Define the current state letter that 3 maintenance man P=(id, P.lat, P.lon, occ, ot, P.s) include a maintenance man
Breath, wherein id is maintenance man's work number, and P.lat and P.lon are the current location information of maintenance man, occ indicate maintenance man whether
Work, ot indicate whether maintenance man can also work or complete work according to Maintenance Scheduling program launched, and P.s indicates working as maintenance man
Preceding Maintenance Scheduling plan；
(1) temporal index is established according to charging pile geographical location information
The map datum of charging pile phase Yingcheng City is carried out grid dividing by 1.1, the size of grid as far as possible with the Urban Streets
Size is close；If in grid including charging pile, select the geographical location of charging pile as the anchor point of grid, if do not wrapped
Containing charging pile, then anchor point of the grid element center point as grid is selected；
1.2, according to the operational data of history maintenance man, obtain the running time and running section between a part of anchor point, estimate
Travel speed；Another part does not have between the anchor point of history mantenance data, selects population mean travel speed；
1.3 calculate the most short operating range between each grid anchor point, establish Distance matrix D；And estimated according to the result in 1.2
Calculate running time, settling time matrix H, to support inertia shortest path to calculate；
1.4 be each grid GiSettling time index list, spatial index list and grid GiCorresponding maintenance man's rope
Draw table, is searched for for maintenance man；
1.4.1 time index list is from each grid to grid GiThe ascending sort of required running time；
1.4.2 spatial index list is from each grid to grid GiThe ascending sort of required operating range；
1.4.3 maintenance man and grid G will be driven into special time period in gridiMaintenance man's list, which is
State variation, each maintenance man is driven out to grid GiWhen will be removed, each maintenance man drives into grid GiWhen will be inserted into, in grid
The timestamp of maintenance man can also update after the GPS signal for receiving update；The ID having time of each maintenance man stabs label；
(2) using the maintenance man's Candidate Set that can be serviced based on the screening of running time Fibonacci search
Maintenance man's Candidate Set, t are set firsttmpIndicate current time, tijIt indicates needed for travelling between two grid anchor points
The running time wanted, uses t(A,B)Indicate the running time needed between the two places AB, d(A,B)Indicate between the two places AB the traveling that needs away from
From；
2.1 are located at grid G when a maintenance calliWhen, according to the dimension in the sequence checking grid in time index list
Whether the person of repairing can satisfy the time windows constraints of charging pile maintenance, reapply grid GiCorresponding maintenance man's concordance list is searched current
Time is located at grid GiMeet time windows constraints and not in the maintenance man of service mode, if it is satisfied, then sequentially in time
The urgent maintenance man of charging pile maintenance will be met to be inserted into Candidate Set；
If the size of 2.2 maintenance man's Candidate Sets is greater than the given upper bound, Candidate Set range is excessive, part maintenance man when
Between window constraint it is excessively nervous, will lead to and be inserted into failure in many maintenance men later, increase whole computation burden；The size in the upper bound
It can be determined according to the calculated performance of the sum of maintenance personal during actual operation and Maintenance Scheduling system；
The split point of lookup is determined using the Fibonacci numerical value closest to maintenance man's Candidate Set length；In Fibonacci
Ordered series of numbers looks for the number F [n] being equal or close to equal to maintenance man's Candidate Set length, and former Candidate Set length, which is extended to length, is
F [n] (if necessary to complementary element, then supplements the last one maintenance man's element of repetition, until meeting F [n] a element), after the completion
Fibonacci segmentation is carried out, first half F [n-1] a element of segmentation is taken to establish new maintenance man's Candidate Set；
(3) maintenance call Q is inserted into the dispatch state of maintenance man P using inert shortest path calculative strategy
3.1 judge whether the maintenance man P in maintenance man's Candidate Set currently has subsequent tasks in its operation plan, if without after
After task, then by maintenance task QxIt is added in the dispatch state of maintenance man P；If there is subsequent tasks Qy, then according to temporal index
Sequence checking in list is located at grid GjMaintenance man whether meet ttmp+t(P.loc, i)+Qx.f≤Wy.uLimitation；
3.1.1 it is located at grid G due to calculatingjMaintenance man's calculating of the shortest distance of grid anchor point j where it open
Pin, which is significantly less than directly to calculate, is located at grid GjMaintenance man apart from its target maintenance charging pile i the shortest distance, using inertia
Shortest path calculative strategy it is as much as possible using data cached and as few as possible reduction computing cost, pass through triangle etc.
Formula calculates the running time lower bound of maintenance man and charging pile to be repaired, i.e. t (P.loc, i) >=tij-t(P.loc,j)；Under
Limit constraint, the feasibility test being quickly inserted into；
3.1.2 only when time-to-violation does not constrain lower bound, algorithm just needs to continue to calculate maintenance man's current point and wait tie up
It repairs the shortest time path between charging pile and completes the limitation judgement of 3.2 steps；
3.2 judge to respond limiting around whether row distance meets α for maintenance call Q generation；For guarantee it is minimum manage maintenance at
Originally with maximum operating service quality, maintenance needs are responded with maximum commercial interest, limit original plan distance (directly in response to QyMaintenance
Request) it accounts for as respond request QxThe ratio of produced operating rangeGreater than a certain specific ratios, if meeting
Maintenance call Q is then inserted into the service mode of the maintenance man by limitation；
If 3.3 do not find qualified maintenance man, remained in the maintenance man's candidate being not optimised in step (2)
Remaining personnel carry out insertion feasibility inspection by 3.1 and 3.2 steps.If not finding suitable maintenance man, task is assigned
To idle candidate maintenance man.
The invention has the benefit that making full use of the geographical location information of maintenance man and history maintenance to adjust by this method
Degree record establishes temporal index for each of system maintenance man to complete quick region maintenance man search, reduces and search
Computational load during rope, and inert shortest path calculation method is used, adequately using history mantenance data and offline
Path computation result reduces and computes repeatedly.The running time of maintenance man and charging pile to be repaired are calculated by triangle inequality
Lower bound simplifies running time calculating.This method sufficiently solves that charging pile Frequent Troubles maintenance call amount is big, the position of fault point
Not the problem of scattered and existing Maintenance Scheduling method does not account for maintenance man's current position state and working condition, and just calculate negative
Carrying capacity repairs the distance proportion that detours, is made that optimization in terms of service response time, solves the maintenance tune that charging pile enterprise faces
The difficult problem at high cost of degree.
Detailed description of the invention
Fig. 1 is the system data flow graph of this method.
Fig. 2 (a) and be (b) most short operating range matrix D and time matrix H between each grid anchor point.
Fig. 3 is that candidate maintenance man's search process schematic diagram is carried out according to spatial index list.
Fig. 4 is the running time lower bound calculating process figure according to maintenance man and charging pile to be repaired.
Fig. 5 is maintenance man's scheduling instance.
It is that the maintenance call be newly inserted into of response detours the calculating process figure of distance that Fig. 6, which is according to maintenance man,.
Specific embodiment
To keep the purpose, technical solution and its advantage of the embodiment of the present invention clearer, below with reference to the embodiment of the present invention
In attached drawing, technical solution in the embodiment of the present invention carries out clear and complete description.
Total system data flow diagram is as shown in Figure 1, lower left is maintenance call data (including request time, failure charging
The longitude and latitude of stake, minimum completion time used in breakdown maintenance, the degree it is pressed for time of maintenance task).
According to maintenance man's temporal index table (1.4) and map and gridding information and each net after receiving maintenance call data
Most short operating range matrix D, that is, shortest path caching (1.3) person of repairing between lattice anchor point searches, involved in search procedure
To the range information that insertion newly calculates not in the routing information of Distance matrix D.It obtains after meeting maintenance man's Candidate Set of range,
Maintenance call is inserted into the dispatch state of maintenance man using inert shortest path calculative strategy, and updates the shape of maintenance man
State information.Above procedure is maintenance call data flow.
When the mobile geographical location information change of maintenance man, updates maintenance man in grid and G will be driven into special time periodi
Maintenance man's list.Above procedure is that maintenance man's state updates stream.
OSM map datum is parsed, city grid information is divided, initializes Distance matrix D, settling time index list and sky
Between index list.Above procedure is off-line calculation stream.
The first step establishes temporal index according to charging pile geographical location information
In the map datum of the xml format of OpenStreetMap downloading charging pile phase Yingcheng City, data base wherein included
Member is Nodes, Ways, Relations, selects the geography information dotted line data of MongoDB database purchase magnanimity, application
The 2dsphere geographical space Indexing Mechanism of MongoDB searches the data of a certain specified point near zone.It is made by oneself by SAX interface
Free burial ground for the destitute diagram data analysis mode will be in the point and arc data deposit MongoDB in the map datum of charging pile phase Yingcheng City
In Point set and Arc set, creation 2dsphere geographical space index db.Point.ensureIndex ({ " gis ": "
2dsphere " }), and the geographic position data for the pile group that charges is stored in the Charge in MongoDB and is gathered.According to the city street
The map datum of charging pile phase Yingcheng City is carried out grid dividing, the ginseng that will be obtained after grid division by block size by area's size
According in information deposit set Grid；If in grid including charging pile, select the geographical location of charging pile as grid
Anchor point, if do not include charging pile, select anchor point of the grid element center point as grid；
According to history maintenance man's operational data, the running time and running section between the anchor point of part are obtained, it will be calculated
Running section is stored in shortestPath set, estimates travel speed, total without selecting between the anchor point of history repair message
Body averaged version speed；
Dijkstra's algorithm after being optimized using Priority Queues is calculated the most short operating range between each grid anchor point, built
Vertical Distance matrix D, and according to the resulting estimate running time in 1.2, settling time matrix H, D and H are as shown in Fig. 2, to prop up
Hold the calculating of inertia shortest path；For each grid GiSettling time index list, spatial index list and grid maintenance man
Concordance list is searched for for maintenance man, searches the point nearest apart from grid central point by near, and by result by distance by close and
Far sequence db.Grid.find (" gis ": " $ near ": " $ geometry ": " type ": " Point ", "
coordinates":[Grid. longitude,Grid.latitude]},"$maxDistance":Grid.size}}})；
Second step, using the maintenance man's Candidate Set that can be serviced based on the screening of running time Fibonacci search
When a maintenance call is located at grid GiWhen, according to the maintenance man in the sequence checking grid in time index list
The time windows constraints that whether can satisfy charging pile maintenance reapply the corresponding maintenance man's concordance list lookup of the grid in range and work as
The preceding time is located at grid GiMeet time windows constraints not in the maintenance man of service mode, if it is satisfied, then according to when driving
Between sequence will meet the urgent maintenance man of charging pile maintenance and be inserted into p_candidate in Candidate Set.
Such as shown in Fig. 3 (a), base map has been completed grid dividing, and is believed according to charging pile geographical location
Breath establishes temporal index, certain charging pile failure issues maintenance call, and the grid where the failure charging pile is G5, search G5Grid
Spatial index list { the G of corresponding range ability3, G10, G4, G6, G2, G11 } and according to travel speed and apart from foundation when
Between index list { G3, G4, G10, G6, G2, G11, because the road conditions in each geographical location are different, corresponding travel speed is not yet
Together, so spatial index list and time index list will not be completely the same, judge whether the grid in temporal index list is full
The time windows constraints of sufficient charging pile maintenance, choose the spatial index list { G for meeting time windows constraints3, G10, G4And time index
List { G3, G4, G10, charging pile maintenance is met according to the sequence selection in the selected corresponding maintenance man's concordance list of three grids
Time windows constraints maintenance man, choose shown in process such as Fig. 3 (b), it is urgent that charging pile maintenance will be met sequentially in time
Maintenance man be inserted into Candidate Set.
If the size p_candidate.size of maintenance man's Candidate Set is greater than given upper bound max_p_can, Candidate Set
Range is excessive, and the time windows constraints of part maintenance man are excessively nervous, will lead to and is inserted into failure in many maintenance men later, increases whole
The computation burden of body.The split point of lookup is determined using the Fibonacci numerical value closest to maintenance man's Candidate Set length；Construction
One Fibonacci array F [i]=F [i-1]+F [i-2] looks for one to be equal or close to and is equal to maintenance in Fibonacci sequence
The number F [n] of member's Candidate Set length, it is that F [n] (if necessary to complementary element, then supplements weight that former Candidate Set length, which is extended to length,
The last one multiple taxi element, until meeting F [n] a element), Fibonacci segmentation is carried out after the completion, takes the first half of segmentation
Part F [n-1] a element establishes new maintenance man's Candidate Set.
Maintenance call Q is inserted into the dispatch state of maintenance man P by third step using inert shortest path calculative strategy
Judge whether the maintenance man P in maintenance man's Candidate Set currently there are subsequent tasks in its operation plan, if not subsequent
Task, then by maintenance task QxIt is added in the dispatch state P.s of maintenance man P, as shown in 2. part in Fig. 5, white circular in figure
Point represents the scheduler task of former operation plan, and black dot represents the scheduler task being inserted into；If there is subsequent tasks Qy, then according to
Sequence checking in time index list is located at grid GjMaintenance man whether meet ttmp+t(P.loc,i)+Qx.f≤Wy.uLimit
System is located at grid GjMaintenance man can meet QyBy current location under the time requirement of maintenance task spent it is pressed for time
Reach grid GiAnd in Qx.fFailure minimum complete the deadline in complete QxMaintenance task, as shown in 1. part in Fig. 5；
It is located at grid G due to calculatingjMaintenance man's shortest distance of grid anchor point j where it computing cost it is obvious
It is located at grid G less than directly calculatingjMaintenance man apart from its target maintenance charging pile i the shortest distance, using inert most short
Path computation policies are as much as possible using data cached and as few as possible reduction computing cost, calculated by triangle inequality
The running time lower bound of maintenance man and charging pile to be repaired is as shown in figure 4, i.e. t (P.loc, i) >=tij-t(P.loc,j).Pass through
Lower limit constraint, the feasibility test that can be quickly inserted into.
Only when time-to-violation does not constrain lower bound, algorithm just needs to continue to calculate maintenance man's current point and charging to be repaired
Stake between the shortest time path and complete remaining steps limitation judgement.
Judgement response maintenance call QxWhether what is generated meets α limitation around row distance；To guarantee minimum operation maintenance cost
With maximum operating service quality, maintenance needs are responded with maximum commercial interest, limits and just completes Qx-1Maintenance call is at P.loc
The maintenance man's original plan distance set is (directly in response to QyMaintenance call) it accounts for as respond request QxThe ratio of produced operating rangeGreater than a certain specific ratios (maintenance call QxAnd QyCorresponding charging pile position is QxAnd QyCharging
The anchor point of stake grid), by maintenance call Q if meeting limitationxIt is inserted into the service mode of the maintenance man；It is calculated to reduce
Amount by triangle inequality calculating d (P.loc, Qy) and d (p.loc, Qx) apart from lower bound.As shown in Figure 6, allow in error
In the range of estimated
If not finding qualified maintenance man, using people remaining in the maintenance man's candidate being not optimised in second step
Member carries out insertion feasibility inspection by third step.If not finding suitable maintenance man, task is dispatched to idle time
Mend maintenance man.
Claims (1)
1. a kind of charging pile Maintenance Scheduling method based on temporal index, which is characterized in that steps are as follows:
Define 1 maintenance call Q=(tq,Q.lat,Q.lon,Qf,Wu), Q is requested for each breakdown maintenancex, wherein tx.qIt is request
Time, Qx.latAnd Qx.lonFor the longitude and latitude of failure charging pile, Qx.fFor minimum completion time used in each breakdown maintenance,
Wx.uFor the degree it is pressed for time of maintenance task, i.e. time windows constraints；
Define 2 operation plan s=(v1,v2..., vn) be one and determine that n maintenance task of sequence is constituted by Maintenance Scheduling algorithm
Time sequencing temporary table, vkFor the geographical location of failure charging pile；
The current state information that 3 maintenance man P=(id, P.lat, P.lon, occ, ot, P.s) include a maintenance man is defined,
Middle id is maintenance man's work number, and P.lat and P.lon are the current location information of maintenance man, and occ indicates whether maintenance man is working,
Ot indicates whether maintenance man can also work or complete work according to Maintenance Scheduling program launched, and P.s indicates the leading dimension of maintenance man
Repair operation plan；
(1) temporal index is established according to charging pile geographical location information
The map datum of charging pile phase Yingcheng City is carried out grid dividing by 1.1, the size of grid as far as possible with the Urban Streets size
It is close；If in grid including charging pile, select the geographical location of charging pile as the anchor point of grid, is filled if do not included
Anchor point of the grid element center point as grid is then selected in electric stake；
1.2, according to the operational data of history maintenance man, obtain the running time and running section between a part of anchor point, estimation traveling
Speed；Another part does not have between the anchor point of history mantenance data, selects population mean travel speed；
1.3 calculate the most short operating range between each grid anchor point, establish Distance matrix D；And according to the resulting estimate row in 1.2
It sails the time, settling time matrix H, to support inertia shortest path to calculate；
1.4 be each grid GiSettling time index list, spatial index list and grid GiCorresponding maintenance man's index
Table is searched for for maintenance man；
1.4.1 time index list is from each grid to grid GiThe ascending sort of required running time；
1.4.2 spatial index list is from each grid to grid GiThe ascending sort of required operating range；
1.4.3 maintenance man and grid G will be driven into special time period in gridiMaintenance man's list, which is dynamic change
, each maintenance man is driven out to grid GiWhen will be removed, each maintenance man drives into grid GiWhen will be inserted into, maintenance man in grid
Timestamp can also be updated after the GPS signal for receiving update；The ID having time of each maintenance man stabs label；
(2) using the maintenance man's Candidate Set that can be serviced based on the screening of running time Fibonacci search
Maintenance man's Candidate Set, t are set firsttmpIndicate current time, tijIt indicates required for travelling between two grid anchor points
Running time uses t(A,B)Indicate the running time needed between the two places AB, d(A,B)Indicate the operating range needed between the two places AB；
2.1 are located at grid G when a maintenance calliWhen, it is according to the maintenance man in the sequence checking grid in time index list
The no time windows constraints that can satisfy charging pile maintenance, reapply grid GiCorresponding maintenance man's concordance list searches current time position
In grid GiMeet time windows constraints and not in the maintenance man of service mode, if it is satisfied, then sequentially in time will meet
The urgent maintenance man of charging pile maintenance is inserted into Candidate Set；
If the size of 2.2 maintenance man's Candidate Sets is greater than the given upper bound, Candidate Set range is excessive, the time window of part maintenance man
Constraint is excessively nervous, causes to be inserted into failure in many maintenance men later, increases whole computation burden；The size in the upper bound is according to reality
The sum of maintenance personal and the calculated performance of Maintenance Scheduling system determine during the operation of border；
The split point of lookup is determined using the Fibonacci numerical value closest to maintenance man's Candidate Set length；In Fibonacci sequence
The number F [n] being equal or close to equal to maintenance man's Candidate Set length is looked for, it is F that former Candidate Set length, which is extended to length,
[n] then supplements the last one maintenance man's element of repetition if necessary to complementary element, until meeting F [n] a element, completes laggard
The segmentation of row Fibonacci, takes first half F [n-1] a element of segmentation to establish new maintenance man's Candidate Set；
(3) maintenance call Q is inserted into the dispatch state of maintenance man P using inert shortest path calculative strategy
3.1 judge whether the maintenance man P in maintenance man's Candidate Set currently has subsequent tasks in its operation plan, if not taking over sb.'s job afterwards
Business, then by maintenance task QxIt is added in the dispatch state of maintenance man P；If there is subsequent tasks Qy, then according in temporal index list
Sequence checking be located at grid GjMaintenance man whether meet ttmp+t(P.loc,i)+Qx.f≤Wy.uLimitation；
3.1.1 it is located at grid G due to calculatingjMaintenance man's shortest distance of grid anchor point j where it computing cost it is obvious
It is located at grid G less than directly calculatingjMaintenance man apart from its target maintenance charging pile i the shortest distance, using inert most short
Path computation policies are as much as possible using data cached and as few as possible reduction computing cost, calculated by triangle inequality
The running time lower bound of maintenance man and charging pile to be repaired, i.e. t (P.loc, i) >=tij-t(P.loc,j)；It is constrained by lower limit,
The feasibility test being quickly inserted into；
3.1.2 only when time-to-violation does not constrain lower bound, algorithm just needs to continue calculating maintenance man's current point and to be repaired fills
The limitation judgement of the shortest time path and 3.2 steps of completion between electric stake；
3.2 judge to respond limiting around whether row distance meets α for maintenance call Q generation；For guarantee it is minimum manage maintenance cost and
Maximum operating service quality responds maintenance needs with maximum commercial interest, limits original plan distance (directly in response to QyMaintenance is asked
Ask) it accounts for as respond request QxThe ratio of produced operating rangeGreater than a certain specific ratios, if full
Maintenance call Q is then inserted into the service mode of the maintenance man by foot limitation；
If 3.3 do not find qualified maintenance man, with people remaining in the maintenance man's candidate being not optimised in step (2)
Member carries out insertion feasibility inspection by 3.1 and 3.2 steps；If not finding suitable maintenance man, task is dispatched to sky
Not busy candidate maintenance man.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810862720.7A CN109284891B (en) | 2018-08-01 | 2018-08-01 | Charging pile maintenance scheduling method based on time-space index |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810862720.7A CN109284891B (en) | 2018-08-01 | 2018-08-01 | Charging pile maintenance scheduling method based on time-space index |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109284891A true CN109284891A (en) | 2019-01-29 |
| CN109284891B CN109284891B (en) | 2021-06-08 |
Family
ID=65183318
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810862720.7A Active CN109284891B (en) | 2018-08-01 | 2018-08-01 | Charging pile maintenance scheduling method based on time-space index |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109284891B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111027719A (en) * | 2019-11-14 | 2020-04-17 | 东华大学 | Maintenance optimization method for multi-component system state opportunity |
| CN112260347A (en) * | 2020-09-28 | 2021-01-22 | 浙江尼普顿科技股份有限公司 | Fill electric pile leakage protection system |
| CN112285397A (en) * | 2020-10-20 | 2021-01-29 | 武汉联翰电力科技有限公司 | Electric energy meter and position information management method, system and storage medium of acquisition terminal |
| CN116187981A (en) * | 2023-04-21 | 2023-05-30 | 广东工业大学 | Microwave oven intelligent detection method based on historical maintenance data |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102344069A (en) * | 2011-10-14 | 2012-02-08 | 东营市宏安电梯有限责任公司 | Elevator emergency management technology supporting system |
| CN104734171A (en) * | 2015-04-16 | 2015-06-24 | 合肥工业大学 | Electric vehicle charging station modeling method for reliability assessment of power distribution network and application of electric vehicle charging station modeling method |
| CN104833885A (en) * | 2015-05-18 | 2015-08-12 | 国家电网公司 | Fault prediction method of power transformation primary equipment |
| CN104899700A (en) * | 2015-06-23 | 2015-09-09 | 国网天津市电力公司 | Intelligent terminal operation and maintenance emanagement system |
| CN106056255A (en) * | 2016-06-23 | 2016-10-26 | 海南电力技术研究院 | Space-time joint scheduling ordered charging method and device |
| CN107122868A (en) * | 2017-05-04 | 2017-09-01 | 北京许继电气有限公司 | Battery management system and method based on electric automobile charging and conversion electric service network |
-
2018
- 2018-08-01 CN CN201810862720.7A patent/CN109284891B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102344069A (en) * | 2011-10-14 | 2012-02-08 | 东营市宏安电梯有限责任公司 | Elevator emergency management technology supporting system |
| CN104734171A (en) * | 2015-04-16 | 2015-06-24 | 合肥工业大学 | Electric vehicle charging station modeling method for reliability assessment of power distribution network and application of electric vehicle charging station modeling method |
| CN104833885A (en) * | 2015-05-18 | 2015-08-12 | 国家电网公司 | Fault prediction method of power transformation primary equipment |
| CN104899700A (en) * | 2015-06-23 | 2015-09-09 | 国网天津市电力公司 | Intelligent terminal operation and maintenance emanagement system |
| CN106056255A (en) * | 2016-06-23 | 2016-10-26 | 海南电力技术研究院 | Space-time joint scheduling ordered charging method and device |
| CN107122868A (en) * | 2017-05-04 | 2017-09-01 | 北京许继电气有限公司 | Battery management system and method based on electric automobile charging and conversion electric service network |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111027719A (en) * | 2019-11-14 | 2020-04-17 | 东华大学 | Maintenance optimization method for multi-component system state opportunity |
| CN111027719B (en) * | 2019-11-14 | 2023-06-20 | 东华大学 | Multi-component system state opportunity maintenance optimization method |
| CN112260347A (en) * | 2020-09-28 | 2021-01-22 | 浙江尼普顿科技股份有限公司 | Fill electric pile leakage protection system |
| CN112285397A (en) * | 2020-10-20 | 2021-01-29 | 武汉联翰电力科技有限公司 | Electric energy meter and position information management method, system and storage medium of acquisition terminal |
| CN116187981A (en) * | 2023-04-21 | 2023-05-30 | 广东工业大学 | Microwave oven intelligent detection method based on historical maintenance data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109284891B (en) | 2021-06-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wang et al. | Next road rerouting: A multiagent system for mitigating unexpected urban traffic congestion | |
| EP3658857B1 (en) | Dynamically determining origin and destination locations for a vehicle communicating with a network system | |
| CN109284891A (en) | Charging pile Maintenance Scheduling method based on temporal index | |
| Ma et al. | T-share: A large-scale dynamic taxi ridesharing service | |
| Wang et al. | A multi-agent based vehicles re-routing system for unexpected traffic congestion avoidance | |
| US10119826B2 (en) | System and method for accelerating route search | |
| US8755991B2 (en) | Method and structure for vehicular traffic prediction with link interactions and missing real-time data | |
| Pattanaik et al. | Smart real-time traffic congestion estimation and clustering technique for urban vehicular roads | |
| CN109612488B (en) | Big data micro-service-based mixed travel mode path planning system and method | |
| CN101482419A (en) | Vehicle dynamic navigation service system based on A-GPS and 3G network | |
| JP2002259888A (en) | Simulation control program, method and device | |
| CN111612122A (en) | Method and device for predicting real-time demand and electronic equipment | |
| CN104680820A (en) | Traffic flow car networking system and traffic flow control method based on gradient field | |
| CN110491158A (en) | A kind of bus arrival time prediction technique and system based on multivariate data fusion | |
| CN106017496A (en) | Real-time navigation method based on road condition | |
| Wang et al. | An adaptive and VANETs-based Next Road Re-routing system for unexpected urban traffic congestion avoidance | |
| CN108985506A (en) | Planning driving path recommended method, prediction technique, acquisition methods and its device | |
| EP4252217A1 (en) | Distributed multi-task machine learning for traffic prediction | |
| CN111009140B (en) | Intelligent traffic signal control method based on open-source road condition information | |
| Nadembega et al. | An integrated predictive mobile-oriented bandwidth-reservation framework to support mobile multimedia streaming | |
| Tavassoli et al. | Calibrating a transit assignment model using smart card data in a large-scale multi-modal transit network | |
| CN111582527A (en) | Travel time estimation method and device, electronic equipment and storage medium | |
| Kamiński et al. | Multiagent routing simulation with partial smart vehicles penetration | |
| CN112529338A (en) | Method for calculating degree of forward road | |
| CN110674990B (en) | Instant distribution path selection method and system with sliding window updating mechanism |
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 |