CN107578120A - It is a kind of that utility car share-car dispatching method is done based on electronic map - Google Patents
It is a kind of that utility car share-car dispatching method is done based on electronic map Download PDFInfo
- Publication number
- CN107578120A CN107578120A CN201710695749.6A CN201710695749A CN107578120A CN 107578120 A CN107578120 A CN 107578120A CN 201710695749 A CN201710695749 A CN 201710695749A CN 107578120 A CN107578120 A CN 107578120A
- Authority
- CN
- China
- Prior art keywords
- car
- share
- time
- request slip
- utility
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 14
- 238000003672 processing method Methods 0.000 claims description 2
- 101100400452 Caenorhabditis elegans map-2 gene Proteins 0.000 claims 1
- 238000012423 maintenance Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000015556 catabolic process Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
Abstract
Utility car share-car dispatching method is done based on electronic map the present invention relates to a kind of, its technical characterstic includes application for using car, examination ＆ approval and share-car processing, in share-car processing, plan optimal travel route and time and contrasted with the travel time of existing request slip in system, find the request slip of generation in intervals and matched, using a time shorter destination as transit point, longer one is used as destination, with the time most short travel route is planned again and calculate duration for target, new duration and the time set by destination are contrasted, so as to judge whether share-car succeeds, last basis does utility car share-car module optimum results and carries out vehicle matching and scheduling.The present invention is reasonable in design, realizes that the time is close and utility car share-car use is done in direct route, greatly improve car for public affairs service efficiency, save bus resource and expenses, have realistic meaning and value.
Description
Technical field
It is especially a kind of that utility car share-car dispatching party is done based on electronic map the invention belongs to technical field of intelligent traffic
Method.
Background technology
As social economy continues to develop, people handle official business, and trip is more and more frequent with car, and many enterprises and institutions are all presented
The nervous situation of utility car is done, and " three is public " the strict management and control of consumption and the requirement of enterprises and institutions' cost efficiency cause buying to do
Utility car is more and more difficult, therefore improves and do the service efficiency of utility car and turn into very urgent demand.
Existing utility car automatic dispatching system of doing covers application for using car, examination ＆ approval, vehicle matching, vehicle scheduling, traveling prison
Control, vehicle are returned, maintenance, the overall process of breakdown maintenance and driver management, compared with original manual dispatching mode, greatly carry
High vehicle service efficiency, while save human cost.But during reality car, often there are several application for using cars
Time is close, destination is different but the situation of basic direct route, and each application for using car number only has one, two people.Existing car
Scheduling system can only be sent a car according to application quantity, such as several request slips of direct route be carried out spelling single, it is also necessary to carry out
Manual operation and coordination.Therefore, it is existing do utility car scheduling system exist can not share-car technical problem.
The content of the invention
It is overcome the deficiencies in the prior art the mesh of the present invention, proposes a kind of efficiency high, saves bus resource and expense
Spending does utility car share-car dispatching method based on electronic map.
The present invention solves its technical problem and takes following technical scheme to realize：
It is a kind of that utility car share-car dispatching method is done based on electronic map, comprise the following steps：
Step 1, application for using car：Fill in departure time, destination, number information and Earliest Start Time, reach the latest
Time, whether request slip A can be formed with share-car information；Request slip collection has been generated in system and has been combined into B；
Step 2, examined by person in charge；
Step 3, judge whether this application list A can be with share-car, if can be with share-car, into doing utility car share-car module；If no
Step 4 can be directly transferred to share-car；The processing method for doing utility car share-car module comprises the following steps：
(1) electronic map is based on, planning request slip A optimal travel route and time most short for target with running time,
It is set to TA；
(2) the request slip Bi travel times generated in request slip A departure time and system are contrasted, found full
The generation request slip of sufficient intervals requirement；
(3) request slip A number is matched with meeting the request slip number of generation of time conditions, need to meet to apply
The carrying number N of single A number+request slip Bi number≤existing idle vehicle；
Contrast request slip A and meet the travel time, number requirement request slip Bi running time TAAnd TBi, by the time
As transit point, longer one is used as destination for a shorter destination, and most short traveling is planned again for target with the time
Route, and calculate duration TABi；
(5) by new duration TABiContrasted with the most long running time Tw set by destination, if TABi≤ Tw then share-cars
Success；If TABi＞ Tw, then share-car fail；
Step 4, basis do utility car share-car module optimum results and carry out vehicle matching and scheduling.
(2) described time interval is half an hour to step.
(5) described most long running time is the interval duration of arrival time and Earliest Start Time the latest to step.
The advantages and positive effects of the present invention are：
The present invention it is existing do utility car automatic dispatching system on the basis of, combine the path planning that electronic map has
With time computing function, before vehicle matches and dispatches, add similar conditions car does utility car share-car module, Neng Gouzeng
Add and do utility car every time and go out the carrying number of car, reduce and do utility car and go out car total kilometrage, realize that the time is close and suitable as far as possible
Utility car share-car use is done on road, is realized comprehensive saving of human, financial, and material resources, is greatly improved car for public affairs service efficiency, is saved public
Carfare source and expenses, there is realistic meaning and value.
Brief description of the drawings
Fig. 1 is the overall flow figure of the present invention；
Fig. 2 is the process chart for doing utility car share-car module of the present invention；
Fig. 3 uses car schematic diagram for the embodiment of the present invention.
Embodiment
The embodiment of the present invention is further described below in conjunction with accompanying drawing.
It is a kind of that utility car share-car dispatching method is done based on electronic map, a module application can be used as to be used in existing office
In car scheduling system, the dispatching efficiency for doing utility car is drastically increased.As shown in figure 1, this method comprises the following steps：
The first step：Application for using car link.Applicant is in addition to the information such as departure time to be filled in, destination, number, also
It need to fill in：Earliest Start Time, the latest arrival time, whether can be with information such as share-cars.If this application unitary code is A, in system
Request slip collection is generated and has been combined into B, it is m to have generated request slip number.
Second step：Examined with car.Examined by applicant's person in charge's authority.
3rd step：Judge whether this application list A can be with share-car, if can be with share-car, into doing utility car share-car module；If no
4th step can be directly transferred to share-car.
4th step：Vehicle matching and scheduling are carried out according to utility car share-car module optimum results are done.
5th step：Vehicle send after follow-up link.
As shown in Fig. 2 the Optimization Steps for doing utility car share-car module in the 3rd step are：
1st step：It is most short for target with running time based on electronic map, planning request slip A optimal travel route and when
Between, it is set to TA。
2nd step：The request slip Bi travel times generated in request slip A departure time and system are contrasted, looked for
The generation request slip being spaced in the time within half an hour.
3rd step：Request slip A number is matched with meeting the request slip number of generation of time conditions, A need to be met
(number)+Bi (number)≤N, (N is the carrying number of existing idle vehicle).
4th step：Contrast request slip A and meet the travel time, number requirement request slip Bi running time TAAnd TBi, will
Time, a shorter destination was as transit point, and longer one is used as destination, most short was planned again for target with the time
Travel route, and calculate duration TABi。
5th step：By new duration TABiEnter with the Tw=(arrival time-Earliest Start Time the latest) set by destination
Row contrast, if TABi≤ Tw then share-car successes；If TABi＞ Tw, then share-car fail.
With reference to embodiment, the present invention will be further described：
As shown in figure 3, certain enterprise business address is located at S, currently does in utility car scheduling system, be respectively purposefully
A, B, C application for using car list three, their information and position are listed in chart respectively.
The first step：Submit the application for using car that destination is D, and typing information.
Second step：Pass through examination ＆ approval.
3rd step：Into share-car optimization module, it is 30 minutes to be calculated based on electronic map by S to the D shortest times.
4th step：By comparing, request slip 2 and 3 all meets the requirement of departure time and number.
5th step：Request slip 2 is first considered, because a length of 40 minutes when S to B is estimated, the duration more than S to D 30 minutes will
D is set to approach point, and B is set to destination, calculates new route and duration.By planning and being calculated, the estimated duration from D to B
For 50 minutes, then a length of 80 minutes when whole.
6th step：A length of 70 minutes during the maximum of request slip 2, and required time is 80 minutes after share-car, is unsatisfactory for duration
It is required that therefore D and B share-cars are unsuccessful.
7th step：Consider request slip 3, a length of 20 minutes when being expected due to S to C, the duration less than S to D 30 minutes, by C
Approach point is set to, D is set to destination, calculates new route and duration.It is a length of when estimated from C to D by planning and being calculated
20 minutes, then a length of 40 minutes when whole.
8th step：A length of 60 minutes during the maximum of new request slip, and required time is 40 minutes after share-car, meets that duration will
Ask；And the departure time meets that Earliest Start Time requires, therefore D and C share-cars success.
The new request slip information formed after share-car is：
Finally, vehicle matching and scheduling are carried out according to above-mentioned utility car share-car module optimum results of doing.
It is emphasized that embodiment of the present invention is illustrative, rather than it is limited, therefore present invention bag
Include and be not limited to embodiment described in embodiment, it is every by those skilled in the art's technique according to the invention scheme
The other embodiment drawn, also belongs to the scope of protection of the invention.
Claims (3)
1. a kind of do utility car share-car dispatching method based on electronic map, it is characterised in that comprises the following steps：
Step 1, application for using car：Fill in departure time, destination, number information and Earliest Start Time, the latest arrival time,
Whether request slip A can be formed with share-car information；Request slip collection has been generated in system and has been combined into B；
Step 2, examined by person in charge；
Step 3, judge whether this application list A can be with share-car, if can be with share-car, into doing utility car share-car module；If cannot
Share-car, directly it is transferred to step 4；The processing method for doing utility car share-car module comprises the following steps：
(1) electronic map is based on, it is most short for target with running time, planning request slip A optimal travel route and time, it is set to
TA；
(2) the request slip Bi travel times generated in request slip A departure time and system are contrasted, find satisfaction one
Fix time the generation request slip of space requirement；
(3) request slip A number is matched with meeting the request slip number of generation of time conditions, need to meet request slip A's
The carrying number N of number+request slip Bi number≤existing idle vehicle；
Contrast request slip A and meet the travel time, number requirement request slip Bi running time TAAnd TBi, the time is shorter
A destination as transit point, longer one is used as destination, with the time it is most short plan travel route again for target,
And calculate duration TABi；
(5) by new duration TABiContrasted with the most long running time Tw set by destination, if TABi≤ Tw then share-car into
Work(；If TABi＞ Tw, then share-car fail；
Step 4, basis do utility car share-car module optimum results and carry out vehicle matching and scheduling.
A kind of utility car share-car dispatching method is done based on electronic map 2. according to claim 1, it is characterised in that：Step
Rapid (2) described time interval is half an hour.
A kind of utility car share-car dispatching method is done based on electronic map 3. according to claim 1, it is characterised in that：Step
Rapid (5) described most long running time is the interval duration of arrival time and Earliest Start Time the latest.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710695749.6A CN107578120A (en) | 2017-08-15 | 2017-08-15 | It is a kind of that utility car share-car dispatching method is done based on electronic map |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710695749.6A CN107578120A (en) | 2017-08-15 | 2017-08-15 | It is a kind of that utility car share-car dispatching method is done based on electronic map |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107578120A true CN107578120A (en) | 2018-01-12 |
Family
ID=61034517
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710695749.6A Pending CN107578120A (en) | 2017-08-15 | 2017-08-15 | It is a kind of that utility car share-car dispatching method is done based on electronic map |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107578120A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108109061A (en) * | 2018-02-08 | 2018-06-01 | 上海业创信息科技有限公司 | Online vehicle dispatch system and method |
| CN110147924A (en) * | 2019-04-08 | 2019-08-20 | 浙江华云信息科技有限公司 | A kind of intelligent dispatching system and its dispatching method of car for public affairs |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101355714A (en) * | 2007-07-24 | 2009-01-28 | 梁宇杰 | System and method for real time pooling vehicle |
| CN104408910A (en) * | 2014-11-24 | 2015-03-11 | 无锡清华信息科学与技术国家实验室物联网技术中心 | Taxi-sharing scheduling method beneficial to multiple parties |
| CN104867187A (en) * | 2014-02-23 | 2015-08-26 | 广州市沃希信息科技有限公司 | Taxi sharing charging method for passengers starting from same place, system and server |
| CN105094767A (en) * | 2014-05-06 | 2015-11-25 | 华为技术有限公司 | Automatic driving car scheduling method, car dispatch server and automatic driving car |
| CN105792134A (en) * | 2016-05-12 | 2016-07-20 | 中国联合网络通信集团有限公司 | Carpooling method and system |
| CN106295913A (en) * | 2016-08-31 | 2017-01-04 | 广州地理研究所 | The matching system of a kind of rideshare about car and matching process thereof and device |
-
2017
- 2017-08-15 CN CN201710695749.6A patent/CN107578120A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101355714A (en) * | 2007-07-24 | 2009-01-28 | 梁宇杰 | System and method for real time pooling vehicle |
| CN104867187A (en) * | 2014-02-23 | 2015-08-26 | 广州市沃希信息科技有限公司 | Taxi sharing charging method for passengers starting from same place, system and server |
| CN105094767A (en) * | 2014-05-06 | 2015-11-25 | 华为技术有限公司 | Automatic driving car scheduling method, car dispatch server and automatic driving car |
| CN104408910A (en) * | 2014-11-24 | 2015-03-11 | 无锡清华信息科学与技术国家实验室物联网技术中心 | Taxi-sharing scheduling method beneficial to multiple parties |
| CN105792134A (en) * | 2016-05-12 | 2016-07-20 | 中国联合网络通信集团有限公司 | Carpooling method and system |
| CN106295913A (en) * | 2016-08-31 | 2017-01-04 | 广州地理研究所 | The matching system of a kind of rideshare about car and matching process thereof and device |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108109061A (en) * | 2018-02-08 | 2018-06-01 | 上海业创信息科技有限公司 | Online vehicle dispatch system and method |
| CN110147924A (en) * | 2019-04-08 | 2019-08-20 | 浙江华云信息科技有限公司 | A kind of intelligent dispatching system and its dispatching method of car for public affairs |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2018032808A1 (en) | Big data based bus line schedule collaborative optimization method | |
| CN103680128B (en) | Taxi intelligent dispatching system | |
| Nesheli et al. | Improved reliability of public transportation using real-time transfer synchronization | |
| CN107564270A (en) | A kind of intelligent public transportation dispatching method for running | |
| CN107704950A (en) | A kind of city rail train figure optimization method based on trip requirements and energy saving of system | |
| CN105243836A (en) | Carpooling method and device | |
| CN105373840A (en) | Designated-driving order predicting method and designated-driving transport capacity scheduling method | |
| CN108734353A (en) | A kind of public bus network route plan generation method and device | |
| CN104217585A (en) | Taxi pooling method, system and server | |
| CN105225472A (en) | A kind of share-car method and apparatus | |
| CN104809344A (en) | IC (Integrated Circuit) card data-based estimation method for passenger flow in bus station interval | |
| CN102394011A (en) | Automatic dynamic bus scheduling system and method | |
| Bie et al. | Bus scheduling of overlapping routes with multi-vehicle types based on passenger OD data | |
| CN107578120A (en) | It is a kind of that utility car share-car dispatching method is done based on electronic map | |
| CN113077162A (en) | Multi-vehicle type customized bus area scheduling method facing real-time requirements | |
| Xiao et al. | Optimizing coordinated transfer with probabilistic vehicle arrivals and passengers' walking time | |
| CN105679076A (en) | City bus transfer coordination scheduling method | |
| CN105528890B (en) | A kind of taxi sharing method suitable at Large-sized Communication hinge | |
| CN110598971A (en) | Response type public transportation service planning method based on ant colony algorithm | |
| CN111882097A (en) | Vehicle maintenance personnel scheduling method and system | |
| CN111445091B (en) | Intelligent decision-making method for taxi driver in passenger transport center | |
| CN103021173B (en) | Achieving method of intelligent holographic targeted public transportation system | |
| Lah et al. | Transferability of sustainable urban transport solutions | |
| CN107195192A (en) | A kind of recognition methods of vehicle-mounted orientation running status | |
| CN107292402B (en) | Schedule pre-matching based time and money constraint carpooling method |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200605 Address after: 300452 209 (TG no.750), 2nd floor, animation building C, No.126, animation Middle Road, eco city, Binhai New Area, Tianjin Applicant after: STATE GRID (TIANJIN) INTEGRATION ENERGY SERVICE Co.,Ltd. Applicant after: STATE GRID TIANJIN ENERGY SAVING SERVICE Co.,Ltd. Applicant after: STATE GRID TIANJIN ELECTRIC POWER COMPANY ELECTRIC POWER Research Institute Applicant after: STATE GRID TIANJIN ELECTRIC POWER Co. Applicant after: State Grid Corporation of China Address before: 300301 Tianjin City, Dongli District, Dongli Tourism Development Corporation building, room 233 Applicant before: STATE GRID TIANJIN ENERGY SAVING SERVICE Co.,Ltd. Applicant before: STATE GRID TIANJIN ELECTRIC POWER COMPANY ELECTRIC POWER Research Institute Applicant before: STATE GRID TIANJIN ELECTRIC POWER Co. Applicant before: State Grid Corporation of China |
|
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180112 |