CN102426779B - Method for controlling vacant taxi - Google Patents
Method for controlling vacant taxi Download PDFInfo
- Publication number
- CN102426779B CN102426779B CN 201110350515 CN201110350515A CN102426779B CN 102426779 B CN102426779 B CN 102426779B CN 201110350515 CN201110350515 CN 201110350515 CN 201110350515 A CN201110350515 A CN 201110350515A CN 102426779 B CN102426779 B CN 102426779B
- Authority
- CN
- China
- Prior art keywords
- point
- taxi
- empty wagons
- function
- node
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Traffic Control Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to a method for controlling a vacant taxi. The method comprises the following steps of: transmitting attribute reporting information by a vehicle-mounted terminal, and determining a position point of the vacant taxi by combining location of a GPS (Global Positioning System) and further finding the position point of the vacant taxi on a main vehicle line by a round cut method; then, selecting each road section combination of the vacant taxi from current position points to target points by combining the vector characteristic of the main vehicle line with a genealogy genetic algorithm, calculating the length value of the road section combination by combining the data characteristic of the main vehicle line with a road section function, further a shortest path of the vacant taxi and obtaining the optimal vacant taxi by comparison. The method disclosed by the invention has the advantages of overcoming the defects of a Dijkstra algorithm, providing a method for processing the length of a path between any two points of a non-intersection node, a method for selecting a node of a direction function directionally, a method for avoiding selecting the path repeatedly, a method for repeatedly computing the length of the road section between two intersection nodes and a method for computing a combined weighting length value between the nodes, increasing the scientificalness for controlling the taxis and reducing the waiting time of passengers.
Description
Technical field
The present invention relates to the method for vehicle control, especially a kind of method of taxi empty wagons control.
Background technology
At present, the method for taxi control has following four kinds substantially:
First: the manual control method.After the passenger sends the chauffeur request, the staff of control center, according to the voice device of installing on pulpit and the taxi, mode by dialogue, the request will controlled is sent on each taxi, voice answering by the driver or answer according to the button of set time again, car-mounted device is provided with three minutes buttons, five minutes buttons etc.
Second: the method for centered by waiting point, drawing circle.After the passenger sent the chauffeur request, control system was that circle is drawn in the center of circle automatically with the waiting point, and all empty wagons in the circle all are the competitive bidding empty wagons, and empty wagons within limits obtains request by competitive bidding.
The the 3rd: centered by waiting point, draw circle, the method for carrying out the waiting point skew.This kind method can solve in the second approach, although current point is apart from the impact point problem of shortest path recently but not necessarily, position by the actual waiting point of continuous skew forms logical point, can address the above problem to a certain extent (application reference number be the patent of 20041002572.X).But there are following four big shortcomings in this kind method:
1. because the limitation of the circle method of picture can only be controlled the vehicle in the certain limit;
2. carry out the skew of actual waiting point, have the highway section of railing or barrier in the middle of not being suitable for;
3. carry out the competitive bidding of taxi, relatively lose time;
4. when constantly offset function is set in accumulation, need a large amount of historical datas.
The 4th: calculate the current point of empty wagons to the shortest path path of impact point, dijkstra's algorithm is typical shortest path first, is used for calculating a node to the shortest path of other all nodes.Its principal feature is outwards expansion layer by layer centered by starting point, till expanding to terminal point.Dijkstra's algorithm can draw the optimum solution of shortest path.But there is four major problem equally in it:
1. because the node that dijkstra's algorithm traversal is calculated is a lot, generally need node number square internal memory, and take a large amount of computing times;
2. can not solve the problem that has many lines between two crossover nodes.Owing to often all intercepting with railing in the middle of the road between two intersections, adopt dijkstra's algorithm, two crossover nodes must be torn open is that four nodes could solve, and has added interstitial content.If still use two crossover nodes, middle only be provided with a line, dijkstra's algorithm is no problem, but need the retrace one's steps problem of double counting of taxi when can't resolve control;
3. only be applicable to the public transit system that route planning is good, and be unsuitable for applying among the taxi environment, be difficult to calculate efficiently and easily the length between the non-crossover node.If the crossover node of intersection is continued to extend to each point on every road, computing velocity then reduces significantly, can not adapt to the calculating of taxi shortest path.
4. can not solve owing to open circuit and cause the routing problem that can not be open to traffic in the highway section.
The limitation of above method has caused the not scientific of taxi control, causes the long of passenger's Waiting time.
Summary of the invention
The objective of the invention is to overcome above-mentioned defective, a kind of shortest path that taxi empty wagons current location is put impact point that relates to is provided, thereby improve the science of taxi control, reduce the method for the taxi empty wagons control of passenger's Waiting time.
For achieving the above object, the method of taxi empty wagons control provided by the invention, comprise and set out the empty wagons control system of hiring a car, this taxi empty wagons control system comprises the taxi car-mounted terminal, car-mounted terminal comprises locating module, the attribute reporting modules, navigation module and GPRS communication module, this taxi empty wagons control system also comprises System Control Center, this method comprises: System Control Center sends the impact point of determining the passenger place by phone request or the note of passenger when the chauffeur, by taxi attribute report data in the GPRS communication module calling system, determine the position of the current point of all taxi empty wagons, and determine to have the best taxi empty wagons in the shortest carrying path and GPRS number, again will the shortest carrying path data be sent to the navigational system of best taxi empty wagons by the GPRS communication module, the navigation way that navigational system provides the shortest carrying path is confessed the driver that hires a car and is used for picking the passenger; Wherein, System Control Center determines to have the best taxi empty wagons execution following steps in the shortest carrying path:
(1) accesses the highway section function at current some place by the position of the current point of taxi empty wagons;
(2) by judging whether this highway section comprises two end points confirm whether the highway section function is directivity function, if directivity function and impact point be between current point and forward point, execution in step (14); If directivity function but impact point not between current point and forward point, select the adjacent forward in this highway section o'clock as the 1st generation node, carry out next step then; If not directivity function but belong to highway section, impact point place function, execution in step (14); If not directivity function and do not belong to highway section, impact point place function, two end points selecting this highway section as the 1st generation node, carry out next step then;
(3) export and record the 1st generation node and current o'clock to the 1st generation node length value;
(4) judge the 1st generation node whether be blind spot, if, execution in step (3), otherwise carry out next step;
(5) access with i for the adjacent highway section function of node, wherein, i is positive integer 2,3
(6) judge whether this highway section function is directivity function, if, carry out next step, otherwise execution in step (8);
(7) judge whether node of future generation is the forward point, if, carry out next step, if not, execution in step (5);
(8) judge whether to belong to the highway section function at impact point place, if, execution in step (12), otherwise carry out next step;
(9) give i with the i+1 assignment;
(10) export and record i for node and access i for node data;
(11) judge whether i is blind spot for node, if execution in step accesses i for the step of node data in (10), otherwise execution in step (5);
(12) output and record object are put the length value of point in the last reign of a dynasty;
(13) the combined weighted length value between computing node and carry out next step;
(14) according to current point with the 1st generation node length value, internodal combined weighted length value and impact point and the length value COMPREHENSIVE CALCULATING of last reign of a dynasty point draw the shortest path of different taxi empty wagons to determine best taxi empty wagons;
(15) determine GPRS number of best taxi empty wagons;
(16) finish.
The method of taxi empty wagons control of the present invention, wherein System Control Center determines that the method for the impact point at passenger place comprises: if the passenger is when chauffeur, by the phone request, by artificial input keyword, after determining passenger's place, be converted into corresponding good impact point again; If the passenger when chauffeur, according to " X+ place " editing short message, then by the existing keyword of search, determines passenger's place, be converted into corresponding good impact point again; If search for no result, then by artificial affirmation input keyword, determine passenger's impact point, and after passenger's impact point is determined, lock it on the impact point on the nearest main fare.
The method of taxi empty wagons control of the present invention, wherein in described step (1), the method of the empty wagons attribute that judging hires a car reports and the position of current point comprises: the attribute report of each taxi that car-mounted terminal will be stored at any time is transferred to System Control Center, System Control Center has the geographic position point of empty wagons attribute status taxi again by GPS location, and determines current location point on the nearest with it main fare according to the circle cutting method.
The method of taxi empty wagons control of the present invention, wherein in described step (2) and step (6), in the function of described highway section, substitute original main fare to intend main fare, form new highway section function, intend main fare and formed by back end, new highway section function is represented that by piecewise function any two internodal paths equal the main fare length of two internodal plans.
The method of taxi empty wagons control of the present invention, wherein in described step (3) and step (7), the orientation of described directivity function selects the method for node to comprise: be one way or two-way street according to the highway section between two nodes, determine its directivity by the scope of setting the highway section function, be about to one-way highway section function F (x, y) note is made F(x, y] or F (x, y).
The method of taxi empty wagons control of the present invention, wherein in described step (14), the method for the combined weighted length value between described computing node adopts the family tree genetic algorithm.
The method of taxi empty wagons control of the present invention, its useful effect is: overcome and selected one of them node in the dijkstra's algorithm, and length between other non-adjacent nodes is made as the defective that ∝ calculated afterwards, the method of any 2 path of handling non-crossover node is provided, the orientation of directivity function is selected the method for node, avoid repeating to select route method, the method of double counting road section length and employing family tree genetic algorithm are come the method for the combined weighted length value between computing node between two crossbar contacts, thereby provide science to calculate to hire a car the empty wagons current location to put the shortest path of impact point, and then selected best taxi empty wagons.The method of taxi empty wagons control of the present invention has improved the science of taxi control, reduces passenger's Waiting time.
Be described in detail with the embodiments of the present invention of embodiment below in conjunction with accompanying drawing, other features of the present invention, characteristics and advantage will be more obvious.
Description of drawings
Fig. 1 is the synoptic diagram that System Control Center is determined the method for best taxi empty wagons;
Fig. 2 is main fare data, vector property synoptic diagram in the artificial electronic map;
Fig. 3 is according to the synoptic diagram of intending main fare search empty wagons;
Fig. 4 is the synoptic diagram of family tree genetic algorithm;
Fig. 5 is the process flow diagram that System Control Center is determined the method for best taxi empty wagons;
Fig. 6 is the navigation way synoptic diagram that the best taxi empty wagons of indication arrives impact point.
Embodiment
Below in conjunction with accompanying drawing embodiments of the present invention are elaborated.
The invention provides a kind of method of controlling the shortest path taxi, regard all taxis as a point and move unit, its track that moves is called fare.With reference to Fig. 3, taxi is kept to the right, and with a line that mobile unit moves in the road centre position, is called main fare.Because urban road has two-way street or one way, has certain directivity, main fare has the vector property consistent with road direction.Among Fig. 3, line 1, line 2, line 3, and line 4 is all represented the main fare of this panel region road.And empty wagons T1 arrives the A point, and the main fare length that only needs calculating M point arrival B to order gets final product.
Passenger's waiting point A, namely the some B corresponding with the keyword that configures substitutes actual waiting point A with the current some B that has configured.Empty wagons T2 arrives the B point, need walk around intermediate rail and just can arrive.And the relative empty wagons T3 far away of absolute distance but arrives the A point earlier than T2.Picture circule method in the conventional art is but kept away when unavoidably choosing T3 and also can be chosen T2, causes the not scientific of control.The absolute distance that the absolute distance that empty wagons T4 is ordered from A and T2 and T3 are ordered to A is more or less the same, because the directivity on one-way road of travelling need could arrive the A point around sizable circle.
The invention provides to solve and select one of them node in the dijkstra's algorithm, and length between other non-adjacent nodes is made as the defective that ∝ calculated afterwards.
With reference to Fig. 2, what the large rectangle frame represented is the taxi moving range of being scheduled to, and outer rectangular frame is called the blind area, and the node that extends to outside the blind area is referred to as external blind spot, with reference to external blind spot 1,2 among the figure.Within rectangle frame, there is the breakpoint that is not connected with other road, be referred to as to include blind spot, with reference to including blind spot 3,4 among Fig. 2.Put all blind spots into a set A.When systematic search arrives blind spot, can abandon this paths.
The invention provides the method for handling any 2 paths between the non-node.
With reference to Fig. 2, this is an artificial electronic map, alphabetical a, and b, c ... the crossing of expression urban road is referred to as crossover node.Between all crossover nodes and crossover node, between crossover node and the external blind spot, crossover node and include between the blind spot editor highway section function.L1, L2, L3 ... F(x can be edited in the highway section, y)=the F(endpoint node, Li, endpoint node), i=1 wherein, 2,3 ..., represent that namely length is the function of Li between two endpoint nodes.
The situation of main fare in real road is very complicated, and with reference to the b among Fig. 2, c highway section L3 the invention provides the highway section function based on rectangular coordinate system XOY.Two endpoint nodes in known coordinate initial point 0 and highway section utilize the common mathematical functions such as circle, ellipse or straight line of existing geometric formula to substitute the main fare that originally had no rule.For this reason, each highway section crossover node is connected into line segment, to do vertical line and former main fare on the line segment more arbitrarily and new fare meets at 2 points, form one-to-one relationship.In order to reduce the error of approximate substitution, according to the curved way degree difference of each joint in the highway section, introduce back end 5, substitute original main fare to intend main fare, form new highway section function.Intend main fare and formed by back end 5, the characteristics of and endpoint node invariant position constant according to length, new highway section function is represented that by piecewise function piecewise function still utilizes expressions such as existing circular function, elliptic function or linear function.Substitute the new fare that forms of highway section function of original main fare, namely be called and intend main fare.Any two internodal paths equal the main fare length of two internodal plans.
Like this, only need the length of current point to the endpoint node in highway section, place, and impact point is to the length of the endpoint node in highway section, place, in conjunction with the 1st generation node to the path of node in the last reign of a dynasty, can calculate the path of any 2 non-nodes.
Utilize alternative functions can handle highway on tunnel highway in the stratotype traffic and the bridge and be difficult to the problem handled in two dimension.With reference to the d among Fig. 2, the e section is highway or tunnel highway on the bridge common in the traffic, and the mode with above-mentioned alternative functions substitutes on X-Y scheme equally.
The invention provides the directed method of selecting node.When the highway section between two nodes is one way or two-way street, determine directivity according to the scope of setting the highway section function, be about to one-way highway section function F (x, y) note is made F(x, y] or F[x, y).
With reference to Fig. 2, the L8 highway section has one-way upwards, the scope of L8 highway section function can not comprised a point, and can remember and make F(x, y)=and F(a, L8, f].Control system does not comprise a point during from the adjacent highway section of f point selection function, does not just have this situation of a point of selecting.And function F (a, L8, f] be called one-way function, and the another one endpoint node that comprises in the function of highway section is called the forward point, as the f point.
Directivity function not only can utilize the scope control of highway section function unidirectional, two-way, even can control and open circuit, and advances as the interim repairing in highway section, two-wayly all can not select endpoint node.
The invention provides the method for the combined weighted length value between computing node, namely adopt the family tree genetic algorithm.
With reference to Fig. 2, the empty wagons that A is ordered arrives the B point, utilizes highway section, current some place function, and the included endpoint node of search highway section function, by the adjacent highway section function of endpoint node removal search, search is gone down layer by layer centered by current point again, will certainly produce a generation subsystem point.
The characteristics of pedigree heredity are the characteristics of heredity from generation to generation and closely related multitudinous heredity, selected node of per step of control system is shown with representative, and can produce follow-on subsystem point in the node that per step is selected, these subsystem points are belonged to the same generation, and produce but belong to certain subsystem point of previous generation.Wherein numerous subsystem points of certain amplification of previous generation according to they distances apart from the displacement straight line, distribute label 1,2,3 ..., distance is more near, and label is more little.
With reference to Fig. 4, the A point empty wagons among Fig. 2 arrives the node combination that B is ordered, and has the combined situation of pedigree among Fig. 4.By family tree genetic algorithm search point in the last reign of a dynasty, because the selection difference in path, the form of processing can be different.
Adopt the family tree genetic algorithm, can the node of at every turn exporting is corresponding with corresponding family tree label.With reference to the point of a among Fig. 2,11 expressions on available Fig. 4 right side, degree of node is selected in large size word " 1 " expression of front, meaning the 1st time chooses, and the small size word " 1 " of back is expressed as the seniority among brothers and sisters number in the subsystem point of choosing for the first time, i.e. closely related multitudinous branch, i.e. " 11 " expression the 1st generation node.With reference to e point among Fig. 4, can be expressed as " 112232 " and " 112331 ", the meaning of its expression is that respectively a passes through node f to e through node b to e and a, with the situation in the path point figurative expression by certain generation come out.Then, go circulation to select children nodes of future generation by the previous generation node, till selecting point in the last reign of a dynasty.
The invention provides main fare algorithm and combine with the family tree genetic algorithm, with the method that any point-to-point transmission shortest path in the city is selected and calculated, comprise the situation rejecting that to open circuit.Be the current location point of empty wagons T1 with reference to the point of the A among Fig. 2, and the B point is impact point.Calculate the shortest path of 2 of AB so, namely be according to the aeoplotropism of main fare and internodal combined weighted and impact point and the last reign of a dynasty point length value and current point and the 1st generation node the COMPREHENSIVE CALCULATING of length value draw.
The following describes the specific implementation process that the present invention controls the taxi empty wagons.
With reference to Fig. 1, System Control Center is at first determined the impact point at passenger place, comprising: if the passenger when chauffeur, by the phone request, by artificial input keyword, determine passenger's place after, be converted into corresponding good impact point again; If the passenger when chauffeur, according to " X+ place " editing short message, then by the existing keyword of search, determines passenger's place, be converted into corresponding good impact point again; If search for no result, then by artificial affirmation input keyword, determine passenger's impact point, and after passenger's impact point is determined, lock it on the impact point on the nearest main fare.
System Control Center is judged hire a car the empty wagons attribute of report and the position of current point again, comprise: the attribute report of each taxi that car-mounted terminal will be stored at any time is transferred to System Control Center, System Control Center is by taxi attribute report data in the GPRS communication module calling system, determine the position of the current point of all taxi empty wagons, System Control Center has the geographic position point of empty wagons attribute status taxi again by GPS location, and determines current location point on the nearest with it main fare according to the circle cutting method.
With reference to Fig. 5, the step below System Control Center is carried out then:
(1) accesses the highway section function at current some place by the position of the current point of taxi empty wagons;
(2) by judging whether this highway section comprises two end points confirm whether the highway section function is directivity function, if directivity function and impact point be between current point and forward point, execution in step (14); If directivity function but impact point not between current point and forward point, select the adjacent forward in this highway section o'clock as the 1st generation node, carry out next step then; If not directivity function but belong to highway section, impact point place function, execution in step (14); If not directivity function and do not belong to highway section, impact point place function, two end points selecting this highway section as the 1st generation node, carry out next step then;
(3) export and record the 1st generation node and current o'clock to the 1st generation node length value;
(4) judge the 1st generation node whether be blind spot, if, execution in step (3), otherwise carry out next step;
(5) access with i for the adjacent highway section function of node, wherein, i is positive integer 2,3
(6) judge whether this highway section function is directivity function, if, carry out next step, otherwise execution in step (8);
(7) judge whether node of future generation is the forward point, if, carry out next step, if not, execution in step (5);
(8) judge whether to belong to the highway section function at impact point place, if, execution in step (12), otherwise carry out next step;
(9) give i with the i+1 assignment;
(10) export and record i for node and access i for node data;
(11) judge whether i is blind spot for node, if execution in step accesses i for the step of node data in (10), otherwise execution in step (5);
(12) output and record object are put the length value of point in the last reign of a dynasty;
(13) the combined weighted length value between computing node and carry out next step;
(14) according to current point with the 1st generation node length value, internodal combined weighted length value and impact point and the length value COMPREHENSIVE CALCULATING of last reign of a dynasty point draw the shortest path of different taxi empty wagons to determine best taxi empty wagons;
(15) determine GPRS number of best taxi empty wagons;
(16) finish.
Like this, search for adjacent highway section function by crossover node, the point that comprises by highway section function search again, until will putting the last reign of a dynasty of every paths to search, and by determine to put the last reign of a dynasty number confirm all paths whether all search put in place.And the implementation process of family tree genetic algorithm, meeting will be put the last reign of a dynasty and all forms of expression of other crossbar contacts are exported and noted, be the concrete intersection of certain on map yet every kind of expression-form of these crossbar contacts is expressed in fact, just cause the expression-form difference that records through the difference in path.Arrive the B point as the empty wagons among Fig. 2 from the A point, the final node d in the last reign of a dynasty that selects, the form that the family tree genetic algorithm of introducing according to Fig. 4 records has three kinds, is respectively 1
12
23
14
1, 1
12
23
24
1, 1
12
33
14
1Taxi empty wagons control system if by the last reign of a dynasty node expression-form just can learn that the sequential combination mode of the crossbar contact of entire path is as " 1
12
23
14
1", the paths intersect node of expression is respectively a, b, and e, d is because " 11 expression a, 1
12
2Expression b, 1
12
23
1Expression e ".
The present invention selects adjacent node by the highway section function, goes to select the mode of function again by adjacent node, till selecting impact point.This main fare algorithm and the family tree genetic algorithm utilized just can avoid repeat select path for the i+1 of node and selection for the size cases of node algebraically as long as judge current i when handling main fare loop.
This main fare algorithm can solve in the dijkstra's algorithm can not be between two crossbar contacts the problem of double counting road section length.With reference to Fig. 2, current some F of empty wagons arrives impact point E, and shortest path clearly is F-〉e-〉E, by judging the position of current point, access the highway section function, by selecting forward point e, select L6 section function by e again, and impact point uses directly function calculation to go out length value in the function of L6 highway section.
This main fare algorithm, best taxi empty wagons and inferior good for etc. to make the need of reserve is selected in the comparison of shortest path that can also be by qualified empty wagons.
At last, taxi empty wagons control system again will the shortest carrying path data be sent to the navigational system of best taxi empty wagons by the GPRS communication module, and the navigation way that navigational system provides the shortest carrying path is confessed the driver that hires a car and is used for picking the passenger.With reference to Fig. 6, the navigation way that navigational system indication shortest path taxi empty wagons arrives impact point will be presented on the vehicle-mounted LED display automatically.Empty wagons as Fig. 2 arrives impact point B from the A point, can arrive the B point according to the navigation way that thick line among Fig. 6 is represented.
Above-described embodiment is described preferred implementation of the present invention; be not that scope of the present invention is limited; do not breaking away under the prerequisite that the present invention relates to spirit; various distortion and improvement that the common engineering technical personnel in this area make technical scheme of the present invention all should fall in the definite protection domain of claims of the present invention.
Claims (6)
1. the method for taxi empty wagons control, set out the empty wagons control system of hiring a car, this taxi empty wagons control system comprises the taxi car-mounted terminal, car-mounted terminal comprises locating module, the attribute reporting modules, navigation module and GPRS communication module, it is characterized in that, this taxi empty wagons control system also comprises System Control Center, this method comprises: System Control Center sends the impact point of determining the passenger place by phone request or the note of passenger when the chauffeur, by taxi attribute report data in the GPRS communication module calling system, determine the position of the current point of all taxi empty wagons, and determine to have the best taxi empty wagons in the shortest carrying path and GPRS number, again will the shortest carrying path data be sent to the navigational system of best taxi empty wagons by the GPRS communication module, the navigation way that navigational system provides the shortest carrying path is confessed the driver that hires a car and is used for picking the passenger; Wherein, System Control Center determines to have the best taxi empty wagons execution following steps in the shortest carrying path:
(1) accesses the highway section function at current some place by the position of the current point of taxi empty wagons;
(2) by judging whether this highway section comprises two end points confirm whether the highway section function is directivity function, if directivity function and impact point be between current point and forward point, execution in step (14); If directivity function but impact point not between current point and forward point, select the adjacent forward in this highway section o'clock as the 1st generation node, carry out next step then; If not directivity function but belong to highway section, impact point place function, execution in step (14); If not directivity function and do not belong to highway section, impact point place function, two end points selecting this highway section as the 1st generation node, carry out next step then;
(3) export and record the 1st generation node and current o'clock to the 1st generation node length value;
(4) judge the 1st generation node whether be blind spot, if, execution in step (3), otherwise carry out next step;
(5) access with i for the adjacent highway section function of node, wherein, i is positive integer 2,3
(6) judge whether this highway section function is directivity function, if, carry out next step, otherwise execution in step (8);
(7) judge whether node of future generation is the forward point, if, carry out next step, if not, execution in step (5);
(8) judge whether to belong to the highway section function at impact point place, if, execution in step (12), otherwise carry out next step;
(9) give i with the i+1 assignment;
(10) export and record i for node and access i for node data;
(11) judge whether i is blind spot for node, if execution in step accesses i for the step of node data in (10), otherwise execution in step (5);
(12) output and record object are put the length value of point in the last reign of a dynasty;
(13) the combined weighted length value between computing node and carry out next step;
(14) according to current point with the 1st generation node length value, internodal combined weighted length value and impact point and the length value COMPREHENSIVE CALCULATING of last reign of a dynasty point draw the shortest path of different taxi empty wagons to determine best taxi empty wagons;
(15) determine GPRS number of best taxi empty wagons;
(16) finish.
2. the method for taxi empty wagons according to claim 1 control, it is characterized in that, wherein System Control Center determines that the method for the impact point at passenger place comprises: if the passenger is when chauffeur, by the phone request, by artificial input keyword, after determining passenger's place, be converted into corresponding good impact point again; If the passenger when chauffeur, according to " X+ place " editing short message, then by the existing keyword of search, determines passenger's place, be converted into corresponding good impact point again; If search for no result, then by artificial affirmation input keyword, determine passenger's impact point, and after passenger's impact point is determined, lock it on the impact point on the nearest main fare.
3. according to the method for claim 1 or the control of 2 described taxi empty wagons, it is characterized in that, wherein in described step (1), System Control Center is judged the empty wagons attribute of the report of hiring a car and the method for the position of current point comprises: the report of the attribute of each taxi that car-mounted terminal will store at any time is transferred to System Control Center, System Control Center has the geographic position point of empty wagons attribute status taxi again by GPS location, and determines current location point on the nearest with it main fare according to the circle cutting method.
4. the method for taxi empty wagons according to claim 3 control, it is characterized in that, wherein in described step (2) and step (5), in the function of described highway section, substitute original main fare to intend main fare, form new highway section function, intend main fare and formed by back end, new highway section function is represented that by piecewise function any two internodal paths equal the main fare length of two internodal plans.
5. the method for taxi empty wagons according to claim 4 control, it is characterized in that, wherein in described step (2) and step (6), the orientation of described directivity function selects the method for node to comprise: be one way or two-way street according to the highway section between two nodes, determine its directivity by the scope of setting the highway section function, (x y) remembers and makes F(x to be about to one-way highway section function F, y] or F[x, y).
6. the method for taxi empty wagons control according to claim 5 is characterized in that, wherein in described step (14), the method for the combined weighted length value between described computing node adopts the family tree genetic algorithm.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110350515 CN102426779B (en) | 2011-11-08 | 2011-11-08 | Method for controlling vacant taxi |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110350515 CN102426779B (en) | 2011-11-08 | 2011-11-08 | Method for controlling vacant taxi |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102426779A CN102426779A (en) | 2012-04-25 |
| CN102426779B true CN102426779B (en) | 2013-07-10 |
Family
ID=45960756
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110350515 Expired - Fee Related CN102426779B (en) | 2011-11-08 | 2011-11-08 | Method for controlling vacant taxi |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102426779B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103727945B (en) * | 2012-10-16 | 2017-03-01 | 阿尔派株式会社 | Board information terminal and information providing method |
| CN103020884A (en) * | 2012-12-06 | 2013-04-03 | 苏州亿倍信息技术有限公司 | Information interaction control method and system |
| CN102982694B (en) * | 2012-12-10 | 2015-04-15 | 北京世纪高通科技有限公司 | Method and device for acquiring traffic information based on empty taxi position |
| CN110009256A (en) * | 2014-11-27 | 2019-07-12 | 北京嘀嘀无限科技发展有限公司 | A kind of order processing method, equipment, computer system and storage medium |
| CN110455295B (en) * | 2019-09-16 | 2023-05-30 | 广州电加软件有限责任公司 | Automatic planning method for river channel shipping route |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101004858A (en) * | 2007-01-26 | 2007-07-25 | 徐贵超 | Networked director system for reducing taxi idling |
| CN101354832A (en) * | 2008-08-26 | 2009-01-28 | 中国移动通信集团广东有限公司 | Method and system for calling taxi |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002149766A (en) * | 2000-11-06 | 2002-05-24 | Nec Custommax Ltd | Taxi service method, data service method, data processor and method for data processing, and information storage medium |
| JP5203507B2 (en) * | 2009-04-17 | 2013-06-05 | 株式会社エヌ・ティ・ティ・ドコモ | Taxi user extraction device, taxi user extraction method, moving means user extraction device, and moving means user extraction method |
-
2011
- 2011-11-08 CN CN 201110350515 patent/CN102426779B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101004858A (en) * | 2007-01-26 | 2007-07-25 | 徐贵超 | Networked director system for reducing taxi idling |
| CN101354832A (en) * | 2008-08-26 | 2009-01-28 | 中国移动通信集团广东有限公司 | Method and system for calling taxi |
Non-Patent Citations (5)
| Title |
|---|
| JP特开2002-149766A 2002.05.24 |
| 史惠玲等.基于手机电子地图的出租车叫车系统.《硅谷》.2010,(第16期), |
| 周晓敏等.基于GPS的出租车呼叫与调度系统.《计算机工程与设计》.2009,第30卷(第21期), |
| 基于GPS的出租车呼叫与调度系统;周晓敏等;《计算机工程与设计》;20091115;第30卷(第21期);4995-4997页 * |
| 基于手机电子地图的出租车叫车系统;史惠玲等;《硅谷》;20100831(第16期);49页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102426779A (en) | 2012-04-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9857191B2 (en) | Context-based routing and access path selection | |
| CN103557870B (en) | Dynamic trajectory navigation method and cloud platform | |
| CN101964148B (en) | Road traffic information recording server and GPS (Global Positioning System) user terminal | |
| CN102426779B (en) | Method for controlling vacant taxi | |
| CN101970988B (en) | Route shaping systems and methods | |
| CN101344399B (en) | Optimal route selection method in multitask navigation | |
| CN108873905A (en) | Automatic driving vehicle control method, automatic driving vehicle and readable storage medium storing program for executing | |
| US20150338226A1 (en) | Context-based routing and access path selection | |
| US20230282104A1 (en) | Implementation method and system for road traffic resercation passage, and electronic device | |
| CN104864879A (en) | Navigation path planning method and device | |
| CN109697875A (en) | Plan the method and device of driving trace | |
| CN105070044A (en) | Dynamic scheduling method for customized buses and car pooling based on passenger appointments | |
| CN102346041B (en) | Route planning method and service equipment based on real-time road condition | |
| CN109612488B (en) | Big data micro-service-based mixed travel mode path planning system and method | |
| CN101063616A (en) | System and method for planning travel way | |
| CN103337167A (en) | Method for preventing traffic jams through determining final driving route by urban road scheduled allocation | |
| CN103426297A (en) | System and method for enabling bus rapid transit dispatch to be corrected to seconds at time of sudden change of weather or road condition | |
| CN108171967A (en) | A kind of traffic control method and device | |
| CN105185144B (en) | Heavy-cargo road transportation route optimization method taking road intersection steering into consideration | |
| CN113375678B (en) | Driving path planning method, management server and parking management system | |
| CN104680820A (en) | Traffic flow car networking system and traffic flow control method based on gradient field | |
| CN106017496A (en) | Real-time navigation method based on road condition | |
| CN102490769A (en) | Track traffic driving state diagram realization method based on GIS (Geographic Information System) | |
| CN113987103B (en) | Combined travel path searching method and system for urban comprehensive transportation network | |
| CN102945261A (en) | One-button target search optimization method for intelligent vehicle-mounted information service terminal |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20130710 Termination date: 20131108 |