CN105956686A - Vehicle-sharing profit-maximization user request distribution system and method - Google Patents
Vehicle-sharing profit-maximization user request distribution system and method Download PDFInfo
- Publication number
- CN105956686A CN105956686A CN201610247876.5A CN201610247876A CN105956686A CN 105956686 A CN105956686 A CN 105956686A CN 201610247876 A CN201610247876 A CN 201610247876A CN 105956686 A CN105956686 A CN 105956686A
- Authority
- CN
- China
- Prior art keywords
- request
- user
- data
- path sequence
- processing module
- 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 28
- 238000009826 distribution Methods 0.000 title claims abstract description 16
- 238000012545 processing Methods 0.000 claims abstract description 92
- 238000003860 storage Methods 0.000 claims description 51
- 238000013138 pruning Methods 0.000 claims description 15
- 238000004364 calculation method Methods 0.000 claims description 5
- 230000005540 biological transmission Effects 0.000 claims description 3
- 238000007667 floating Methods 0.000 claims description 2
- 238000005304 joining Methods 0.000 claims description 2
- 230000007812 deficiency Effects 0.000 description 3
- 238000012546 transfer Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000002474 experimental method Methods 0.000 description 2
- 230000002123 temporal effect Effects 0.000 description 2
- 230000000739 chaotic effect Effects 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 238000007418 data mining Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
- 238000005728 strengthening Methods 0.000 description 1
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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G06Q50/40—
Abstract
The invention discloses a vehicle-sharing profit-maximization user request distribution system and method. The system of the invention comprises a request processing module, a data processing module, a control center module and an expansion memory module. The request processing module is used to receive request data about users who need to take a vehicle and drivers who want to carry users. Through the data processing module, a command is received from a control center, data are processed, and a path sequence table of the users who need to take a vehicle, a request packet table, a compatibility condition table and carriable combination distance tables of all the drivers are obtained. By means of the control center module, the data are temporarily stored in the expansion memory module, the command is transmitted to the data processing module, and results are sent to terminal devices of the users who need to take a vehicle and the drivers who want to carry users. The system and the method of the invention have the characteristics of wide application range, high fault tolerance, high expansibility and high practicability and are applicable for distribution of user requests.
Description
Technical field
The invention belongs to field of computer technology, further relate to mobile data analysis and service at track data
The user of profit maximization shared by a kind of vehicle in reason technical field asks distribution system and method thereof.The present invention
The multiple users sent from terminal by front end services centring system reception user and driver take same vehicle
Request data, then transfer data to backstage and carry out data process, final service center system by distribution tie
Fruit returns to the terminal of user and driver.
Background technology
The big data in city are the research fields of multi-crossed disciplines, relate to mathematics, computer, economics, environmentology
Deng.How a large amount of track of vehicle data produced in the face of every day, go out the trip of citizen and driver by data mining
Track rule plays pivotal role for city management.By object mobile to the resident in city, vehicle etc.
Track data is collected, and is analyzed data processing, and can excavate the pattern and knowledge wherein hidden.
Utilize these patterns and knowledge, city manager can be helped with policymaker, city reasonably to be planned, with
This solves the current problems faced in city.Vehicle sharing problem can preferably solve difficulty of calling a taxi for a user
Problem, increase the receipts of oneself simultaneously for the low problem of vehicle seat utilization rate can be solved for driver simultaneously
Enter.
Bin Cao, Louai Alarabi, Mohamed F.Mokbel, Anas Basalamah are in its opinion delivered
Literary composition " SHAREK:A Scalable Dynamic Ride Sharing System. " (MDM, 2015) proposes
Euclidean Temporal&Cost Pruning and Semi-Euclidean Skyline-aware Pruning calculates
Method solves the problem that multiple users take same vehicle simultaneously.The method first calculate vehicle with specify user it
Between distance, according to set distance threshold delete ungratified vehicle.Then each car met is calculated
Take generation expense required for this user, participate according to the price set and delete ungratified vehicle.Finally
Calculate each satisfied vehicle to the fullpath of user and time, and be ranked up according to the time, by the time
User distributed to by a short vehicle.The weak point that this system exists is, does not add in data processing module
Storage expanding module so that the confusion of data may be caused in data transfer procedure.The method exist deficiency it
Place is, it is impossible to need the user taking vehicle to distribute to the driver needing to carry user in the same time by multiple.
Shuo Ma, Yu Zheng, Ouri Wolfson is at its " T-Share:A Large-Scale Dynamic delivered
Taxi Ridesharing Service. " (International Conference on Data Engineering, 2013,
Pages 89-101) vehicle search algorithm quick-searching candidate's vehicle based on temporal index is proposed, and when passing through
Carve allocation algorithm and candidate's vehicle is distributed to user, make with this multiple user take same car dynamically simultaneously
?.First city is carried out label gridding by the method, and using net center of a lattice as the node of this grid.So
The each grid of rear calculating is to the time of the grid specifying user's starting point place, according to the time parameter set,
Dot grid is played to meet.Secondly each grid time to the grid specifying user's terminal place is calculated, according to
The time parameter set, the terminal grid being met.Finally, according to playing institute inside dot grid and terminal grid
The vehicle comprised, finds and meets vehicle simultaneously, and this vehicle is distributed to user.Vehicle is distributed to carry by this problem
Go out the user of shared vehicle request.The weak point that this system exists is not calculate road in data processing module
Footpath sequence, it is impossible to be supplied to need to carry one complete driving path of user driver.The deficiency that the method exists
Part is, will not need among the distance the carrying user driver's traveling method in view of distribution.
Summary of the invention
It is an object of the invention to overcome the deficiency of above-mentioned prior art, it is proposed that maximum profit shared by a kind of vehicle
Change user ask distribution system and method thereof, by request processing module receive take vehicle demand user and
The request data needing the driver carrying user to send from terminal unit, after carrying out pretreatment, sends out request data
Giving data processing module, control centre is sent to data processing module data read command, data processing module
Respectively obtain path sequence data, ask grouped table, compatibility condition table, all drivers can take combined distance
Table, after process completes, allocation result is sent to take vehicle demand user, need to carry and use by control centre
The terminal of the driver at family.
The system of the present invention includes request processing module, data processing module, control centre's module, extension storage
Module and city road network data module.Wherein:
Request processing module, for receiving the user taking vehicle demand and needing the driver carrying user from terminal
The request data that equipment sends, the department obtaining the user's request data table taking vehicle demand with needing to carry user
Machine request data table.
Data processing module, for reading the user's request data table taking vehicle demand from request processing module,
Read the Current City Road network data in city road network data module, utilize Di Jiesikela
Dijkstra's algorithm, calculating each has the user taking vehicle demand from origin-to-destination path sequence, will meter
Calculate result and be stored in extension storage module；Data processing module reads from extension storage module and takes vehicle demand
User's required list, be calculated request grouped table, request grouped table be stored in extension storage module；Data
Processing module reads destination request grouped table, path sequence data from extension storage module, utilizes the compatibility to cut
Branch algorithm, obtains compatibility condition table, compatibility condition table is stored in extension storage module；Data process mould
Block reads from extension storage module to be needed to carry driver's request data table of user, compatibility condition table, path
Sequence data, is calculated all drivers and can take combined distance table, all drivers can be taken combined distance table
It is stored in extension storage module.
Control centre's module, for will take user's request data table of vehicle demand and need to carry the department of user
Machine request data table is sent to data processing module；Data read command is sent to by described control centre's module
Data processing module, the request combination that all drivers can take length in combined distance table maximum is sent out respectively
The terminal give and take vehicle demand user, needing to carry the driver of user.
Extension storage module, for storing path sequence data, the destination request packet that data processing module sends
Table, all drivers can take combined distance table, read for control centre's module.
City road network data module, is used for storing city road network data, reads for data processing module.
Specifically comprising the following steps that of the inventive method
(1) data are received:
(1a) request processing module receives and takes the user of vehicle demand and need the driver carrying user from terminal
The request data that equipment sends, the department obtaining the user's request data table taking vehicle demand with needing to carry user
Machine request data table.
(1b) control centre will take user's request data table of vehicle demand and needs the driver carrying user to ask
Tables of data is asked to be sent to data processing module.
(2) calculate and have the path sequence of the user taking vehicle demand:
(2a) data processing module takes user's request data table of vehicle demand in reading expansion module, reads
Current City Road network data in city road network data module, utilizes Di Jiesikela dijkstra's algorithm,
Obtain each having the user taking vehicle demand from origin-to-destination path sequence, result of calculation is stored in extension
Memory module.
(2b) reading data command is sent to data processing module by control centre.
(3) acquisition request grouped table:
(3a) an empty request grouped table is set in data processing module.
(3b) null set is joined request grouped table, obtain current request grouped table.
(3c) data processing module reads the user's required list taking vehicle demand from extension storage module.
(3d) request iterations is set to 1.
(3e) a destination request grouped table is set, current request grouped table is copied to destination request grouped table
In.
(3f) mesh is joined by taking first user taking vehicle demand in user's required list of vehicle demand
In mark table, it is judged that whether the total number of persons of current request combination exceedes the capacity of vehicle, the most then perform step
(3g), otherwise, step (3h) is performed.
(3g) current request combination is deleted in request grouped table.
(3h) judge to ask whether iterations is more than the number of request in the user's required list taking vehicle demand,
The most then iterations is added 1, perform step (3e), otherwise, perform step (3i).
(3i) destination request grouped table is stored in extension storage module.
(3j) data read command is sent to data processing module by control centre.
(4) compatibility condition table is set up:
(4a) data processing module reads destination request grouped table, path sequence data, utilizes compatibility beta pruning
Algorithm, obtains compatibility condition table.
(4b) by the storage of compatibility condition table with extension storage module, data read command is sent out by control centre
Give data processing module.
(5) set up all drivers and can take combined distance table:
(5a) data processing module arranges empty all drivers and can take combined distance table.
(5b) data processing module reads the driver's request data table needing to carry user from extension storage module,
Compatibility condition table, path sequence data.
(5c) request number iterations is set to 1.
(5d) take out the request data of any one driver in the driver's request data table needing to carry user, make
For being currently needed for carrying the request data of the driver of user.
(5e) use distance pruning algorithms, it is thus achieved that can ride-share request combined distance table, can ride-share request combination
Distance table joins all drivers and can take in combined distance table.
(5f) judge to ask number iterations whether more than request in driver's request data table of lift-launch user
Number, the most then perform step (5d), otherwise, perform step (5g) after adding 1 by iterations.
(5g) all drivers can be taken combined distance table and be stored in extension storage module, in control by data processing module
Core module sends and reads data command to data processing module.
(6) allocation result is sent:
(6a) during data processing module reads extension storage module, all drivers can take combined distance table.
(6b) take out all drivers and can take the request combination that length in combined distance table is maximum, as working as
Front transmission asks packet.
(6c) control centre be sent respectively to take by currently transmitted request the terminal of vehicle demand user with
Need to carry the terminal of the driver of user.
The present invention compared with prior art has the advantage that
First, owing to the system of the present invention adding storage expanding module, can will data processing module obtain
To data result be stored in this module, overcome the data that may cause in prior art data transfer procedure
Chaotic problem so that present system has the advantage strengthening fault-tolerance.
Second, owing to the method for the present invention have employed to needing the request data taking vehicle user to be grouped,
Overcome the driver that multiple users can not distribute to carry in the same time present in prior art user, make
The suitability obtaining the present invention strengthens.
3rd, due to the inventive method calculates can the length of path sequence in ride-share request packet, overcome
Prior art will not need among the distance the carrying user driver's traveling method in view of distribution so that this
The practicality of invention strengthens.
Accompanying drawing explanation
Fig. 1 is the block diagram of present system；
Fig. 2 is the flow chart of the inventive method；
Fig. 3 is the flow chart of the concrete steps of the compatibility pruning algorithms in the inventive method described in step (4a).
Detailed description of the invention
The present invention will be further described below in conjunction with the accompanying drawings.
Referring to the drawings the system of 1 present invention includes request processing module, data processing module, control centre's module,
Extension storage mould and city road network data module.Wherein:
Request processing module, is responsible for by computer client, receives the driver taking vehicle user and carry user and leads to
Cross the data that mobile phone terminal transmits, and data are carried out pretreatment.
Data processing module, data processing module, take vehicle demand for reading from request processing module
User's request data table, reads the Current City Road network data in city road network data module, utilizes
Di Jiesikela dijkstra's algorithm, calculating each has the user taking vehicle demand from origin-to-destination road
Footpath sequence, is stored in extension storage module by result of calculation；Described data processing module is from extension storage module
User's required list of vehicle demand is taken in middle reading, is calculated request grouped table, is stored in by request grouped table
Extension storage module；Described data processing module reads destination request grouped table, road from extension storage module
Footpath sequence data, utilizes compatibility pruning algorithms, obtains compatibility condition table, is stored in by compatibility condition table
Extension storage module；Described data processing module reads the driver needing to carry user from extension storage module
Request data table, compatibility condition table, path sequence data, be calculated all drivers and can take combined distance
All drivers can be taken combined distance table and be stored in extension storage module by table.
Control centre's module, for will take user's request data table of vehicle demand and need to carry the department of user
Machine request data table is sent to data processing module；Data read command is sent to by described control centre's module
Data processing module, the request combination that all drivers can take length in combined distance table maximum is sent out respectively
The terminal give and take vehicle demand user, needing to carry the driver of user.
Extension storage module, is made up of dynamic RAM, and store path sequence data, destination request are grouped
Table, all drivers can take combined distance table, read for data processing module.
City road network data module, is used for storing city road network data, reads for data processing module.
Below in conjunction with Fig. 2, the inventive method is further described.
Step 1. receives data.
Request processing module receives takes the user of vehicle demand and needs the driver carrying user to send from terminal unit
Request data, the driver's request data table obtaining the user's request data table taking vehicle demand with needing to carry user.
Control centre will take user's request data table of vehicle demand and needs to carry driver's request data of user
Table is sent to data processing module.
Step 2. calculates the path sequence having the user taking vehicle demand.
Data processing module reads the user's request data table taking vehicle demand in expansion module, reads road, city
Current City Road network data in road network data module, utilizes Di Jiesikela dijkstra's algorithm, obtains
Each have the user taking vehicle demand from origin-to-destination path sequence, and result of calculation is stored in extension storage
Module.
Reading data command is sent to data processing module by control centre.
Step 3. obtains request grouped table.
1st step, arranges an empty request grouped table in data processing module.
2nd step, joins request grouped table by null set, obtains current request grouped table.
3rd step, data processing module reads the user's required list taking vehicle demand from extension storage module.
4th step, is set to 1 by request iterations.
5th step, arranges a destination request grouped table, and current request grouped table copies to destination request packet
In table.
6th step, joins taking first user taking vehicle demand in user's required list of vehicle demand
In object table, it is judged that whether the total number of persons of current request combination exceedes the capacity of vehicle, the most then perform this step
Rapid 7th step, otherwise, performs this step the 8th step.
7th step, deletes current request combination in request grouped table.
8th step, it is judged that whether request iterations is more than taking the number asked in user's required list of vehicle demand
Mesh, the most then add 1 by iterations, performs this step the 5th step, otherwise, performs this step the 9th step.
9th step, is stored in extension storage module by destination request grouped table.
10th step, data read command is sent to data processing module by control centre.
Step 4. sets up compatibility condition table.
Data processing module reads destination request grouped table, path sequence data, utilizes compatibility pruning algorithms,
Obtain compatibility condition table.
Below in conjunction with Fig. 3, the concrete steps of the compatibility pruning algorithms in this step are further described.
1st step, arranges an empty compatibility condition table.
2nd step, it is judged that ask the number of packet whether more than 0 in destination request grouped table, the most then perform
This step the 3rd step, otherwise, performs this step the 14th step.
3rd step, takes out any one request packet in destination request grouped table, is grouped as current request.
4th step, arranges an empty destination request packet, current request packet is copied to destination request packet
In；
5th step, it is judged that in destination request packet, whether the number of request is more than 1, the most then perform this step
6th step, otherwise, performs this step the 13rd step.
6th step, takes out the path sequence of any two request in destination request packet, respectively from path sequence
As path sequence 1, path sequence 2.
7th step, it is judged that whether comprise first node in path sequence 2 and path sequence in path sequence 1
Whether row 2 comprise last node in path sequence 1, the most then performs this step the 11st step, no
Then, this step the 8th step is performed.
8th step, it is judged that whether comprise first node in path sequence 1 and path sequence in path sequence 2
Whether row 2 comprise last node in path sequence 1, the most then perform this step the 11st step,
Otherwise, this step the 9th step is performed.
9th step, it is judged that whether comprise first node in path sequence 2 and path sequence in path sequence 1
Whether row 1 comprise last node in path sequence 2, the most then perform this step the 11st step,
Otherwise, this step the 10th step is performed.
10th step, it is judged that whether comprise first node in path sequence 1 and path sequence in path sequence 2
Row 1 comprise last node in path sequence 2, the most then performs this step the 11st step, otherwise,
Perform this step the 14th step.
11st step, merges the path node that path sequence 1 is identical with path sequence 2, forms a destination path
Sequence, joins destination path sequence in destination request packet.
12nd step, it is judged that in destination request packet, whether the number of request is more than 1, the most then perform this step
6th step, otherwise, performs this step the 13rd step.
13rd step, joins compatibility condition table by current request packet.
14th step, deletes current request packet in destination request grouped table.
15th step, it is judged that ask the number of packet whether more than 0 in destination request grouped table, the most then perform
This step the 3rd step, otherwise, performs this step the 16th step.
16th step, obtains compatibility condition table.
By the storage of compatibility condition table with extension storage module, data read command is sent to number by control centre
According to processing module.
Step 5. sets up all drivers can take combined distance table.
1st step, data processing module arranges empty all drivers can take combined distance table.
2nd step, data processing module reads the driver's request data needing to carry user from extension storage module
Table, compatibility condition table, path sequence data.
3rd step, is set to 1 by request number iterations.
4th step, takes out the request data of any one driver in the driver's request data table needing to carry user,
As being currently needed for carrying the request data of the driver of user.
5th step, use distance pruning algorithms, it is thus achieved that can ride-share request combined distance table, can ride-share request group
Conjunction distance table joins all drivers and can take in combined distance table.
Below the concrete steps of the distance pruning algorithms in this step are further described.
1st step, arranging one in data processing module can ride-share request combined distance table.
2nd step, it is judged that in path sequence table, whether the number in path is more than 0, the most then perform this step the 3rd
Step, otherwise, performs this step the 9th step.
3rd step, selects any one path sequence from path sequence table, as current path sequence.
4th step, takes out the request packet that current path sequence pair is answered, as currently please from compatibility condition table
Ask packet.
5th step, it is judged that whether current path sequence meets following formula, the most then perform this step the 6th step,
Otherwise, this step the 2nd step is performed.
dis(s,d)≤σ
Wherein, dis represents that Euclidean distance, s represent first node in current path sequence, and d represents current
Needing to carry the position of the driver of user, σ represents distance threshold, and this parameter is existed by the user taking vehicle demand
Arrange in scope (0,1).
6th step, according to the following formula, all total lengths taking vehicle user path sequence in computation requests packet:
Wherein, D represents all total lengths taking vehicle user path sequence in request packet, and ∑ represents to be asked
And operation, m represents the sum of path sequence, X in request packetjRepresent jth path sequence in request packet
The length of row, α represents floating parameter, and this parameter is arranged in scope (0,1) by control centre, and Y represents request
The length of common portion path sequence in all path sequence in packet.
7th step, by all total lengths taking vehicle user path sequence in current request packet and request packet
Joining can be in ride-share request combined distance table.
8th step, it is judged that in path sequence table, whether the number in path is more than 0, the most then perform this step the 3rd
Step, otherwise, performs this step the 9th step.
9th step, obtaining can ride-share request combined distance table.
6th step, whether disconnected request number iterations is more than request in driver's request data table of lift-launch user
Number, the most then perform this step the 4th step, otherwise, perform this step the 7th step after adding 1 by iterations.
7th step, all drivers can take combined distance table and be stored in extension storage module by data processing module,
Control centre's module sends and reads data command to data processing module.
Step 6. sends allocation result.
Data processing module reads all drivers in extension storage module can take combined distance table.
Take out all drivers and can take the request combination that length in combined distance table is maximum, as currently transmitted
Request packet.
Currently transmitted request is sent respectively to take the terminal of vehicle demand user in control centre and needs are taken
Carry the terminal of the driver of user.
Below in conjunction with emulation experiment, the effect of the present invention is further described.
The condition of the emulation experiment of the present invention is, uses identical road network data collection, needs the user taken
Request data, carries driver's request data of user, carries the car of the driver of user after being calculated distribution request
The distance travelled needs the ratio of operating range with distribution vehicle in front.The PC processor that the present invention uses is
AMD Phenom N660 Dual-Core Processor, 3GB internal memory, Windows7 operating system, Java
Programming with Pascal Language.
Experimental result is as shown in the table:
| Vehicle capacity | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 |
| Ratio (%) | 31.5 | 30.4 | 28.7 | 32.2 | 32.0 | 33.9 | 31.3 | 33.2 | 30.7 | 31.2 |
The results show, the present invention is asked by distribution, the operating range of vehicle can be reduced about 30%, carry
The high operational efficiency of vehicle.It can be seen that the present invention has the feature of practicality.
Claims (4)
1. vehicle is shared the user of profit maximization and is asked a distribution system, including request processing module, number
According to processing module, control centre's module, extension storage module and city road network data module；Wherein:
Described request processing module, for receiving the user taking vehicle demand and needing to carry the driver of user
The request data sent from terminal unit, obtains the user's request data table taking vehicle demand and needs to carry to use
Driver's request data table at family；
Described data processing module, for reading the user's request taking vehicle demand from request processing module
Tables of data, reads the Current City Road network data in city road network data module, utilizes Di Jiesike
Drawing dijkstra's algorithm, calculating each has the user taking vehicle demand from origin-to-destination path sequence, will
Result of calculation is stored in extension storage module；Described data processing module reads from extension storage module and takes
User's required list of vehicle demand, is calculated request grouped table, and request grouped table is stored in extension storage mould
Block；Described data processing module reads destination request grouped table, path sequence data from extension storage module,
Utilize compatibility pruning algorithms, obtain compatibility condition table, compatibility condition table is stored in extension storage module；
Described data processing module reads from extension storage module to be needed to carry driver's request data table of user, phase
Capacitive condition table, path sequence data, be calculated all drivers and can take combined distance table, by all drivers
Combined distance table can be taken and be stored in extension storage module；
Described control centre's module, for will take user's request data table of vehicle demand and need to carry use
Driver's request data table at family is sent to data processing module；Described control centre's module is by data read command
It is sent to data processing module, all drivers can be taken the request combination that length in combined distance table is maximum
It is sent respectively to take vehicle demand user, needs to carry the terminal of the driver of user；
Described extension storage module, for storing the path sequence data of data processing module transmission, target please
Ask grouped table, all drivers can take combined distance table, read for control centre's module；
Described city road network data module, is used for storing city road network data, processes mould for data
Block reads.
2. vehicle is shared the user of profit maximization and is asked a distribution method, and it specifically comprises the following steps that
(1) data are received:
(1a) request processing module receives and takes the user of vehicle demand and need the driver carrying user from terminal
The request data that equipment sends, the department obtaining the user's request data table taking vehicle demand with needing to carry user
Machine request data table；
(1b) control centre will take user's request data table of vehicle demand and needs the driver carrying user to ask
Tables of data is asked to be sent to data processing module；
(2) calculate and have the path sequence of the user taking vehicle demand:
(2a) data processing module takes user's request data table of vehicle demand in reading expansion module, reads
Current City Road network data in city road network data module, utilizes Di Jiesikela dijkstra's algorithm,
Obtain each having the user taking vehicle demand from origin-to-destination path sequence, result of calculation is stored in extension
Memory module；
(2b) reading data command is sent to data processing module by control centre；
(3) acquisition request grouped table:
(3a) an empty request grouped table is set in data processing module；
(3b) null set is joined request grouped table, obtain current request grouped table；
(3c) data processing module reads the user's required list taking vehicle demand from extension storage module；
(3d) request iterations is set to 1；
(3e) a destination request grouped table is set, current request grouped table is copied to destination request grouped table
In；
(3f) mesh is joined by taking first user taking vehicle demand in user's required list of vehicle demand
In mark table, it is judged that whether the total number of persons of current request combination exceedes the capacity of vehicle, the most then perform step
(3g), otherwise, step (3h) is performed；
(3g) current request combination is deleted in request grouped table；
(3h) judge to ask iterations whether more than taking the number asked in user's required list of vehicle demand
Mesh, the most then add 1 by iterations, performs step (3e), otherwise, performs step (3i)；
(3i) destination request grouped table is stored in extension storage module；
(3j) data read command is sent to data processing module by control centre；
(4) compatibility condition table is set up:
(4a) data processing module reads destination request grouped table, path sequence data, utilizes compatibility beta pruning
Algorithm, obtains compatibility condition table；
(4b) by the storage of compatibility condition table with extension storage module, data read command is sent out by control centre
Give data processing module；
(5) set up all drivers and can take combined distance table:
(5a) data processing module arranges empty all drivers and can take combined distance table；
(5b) data processing module reads the driver's request data needing to carry user from extension storage module
Table, compatibility condition table, path sequence data；
(5c) request number iterations is set to 1；
(5d) take out the request data of any one driver in the driver's request data table needing to carry user, make
For being currently needed for carrying the request data of the driver of user；
(5e) use distance pruning algorithms, it is thus achieved that can ride-share request combined distance table, can ride-share request combination
Distance table joins all drivers and can take in combined distance table；
(5f) judge to ask number iterations whether more than request in driver's request data table of lift-launch user
Number, the most then perform step (5d), otherwise, perform step (5g) after adding 1 by iterations；
(5g) all drivers can be taken combined distance table and be stored in extension storage module by data processing module, control
Center module processed sends and reads data command to data processing module；
(6) allocation result is sent:
(6a) during data processing module reads extension storage module, all drivers can take combined distance table；
(6b) take out all drivers and can take the request combination that length in combined distance table is maximum, as working as
Front transmission asks packet；
(6c) control centre be sent respectively to take by currently transmitted request the terminal of vehicle demand user with
Need to carry the terminal of the driver of user.
The user of profit maximization shared by vehicle the most according to claim 2 asks distribution method, its feature
It is, specifically comprising the following steps that of the compatibility pruning algorithms described in step (4a)
1st step, arranges an empty compatibility condition table；
2nd step, it is judged that ask the number of packet whether more than 0 in destination request grouped table, the most then perform
3rd step, otherwise, performs the 16th step；
3rd step, takes out any one request packet in destination request grouped table, is grouped as current request；
4th step, arranges an empty destination request packet, current request packet is copied to destination request packet
In；
5th step, arranging targeted packets iterations is 1；
6th step, takes out the path sequence of any two request in destination request packet, respectively from path sequence
As path sequence 1, path sequence 2；
7th step, it is judged that whether comprise first node in path sequence 2 and path sequence in path sequence 1
Whether row 2 comprise last node in path sequence 1, the most then performs the 11st step, otherwise, hold
Row the 8th step；
8th step, it is judged that whether comprise first node in path sequence 1 and path sequence in path sequence 2
Whether row 2 comprise last node in path sequence 1, the most then performs the 11st step, otherwise,
Perform the 9th step；
9th step, it is judged that whether comprise first node in path sequence 2 and path sequence in path sequence 1
Whether row 1 comprise last node in path sequence 2, the most then performs the 11st step, otherwise,
Perform the 10th step；
10th step, it is judged that whether comprise first node in path sequence 1 and path in path sequence 2
Sequence 1 comprises last node in path sequence 2, the most then performs the 11st step, otherwise, hold
Row the 14th step；
11st step, merges the path node that path sequence 1 is identical with path sequence 2, forms a target road
Footpath sequence, joins destination path sequence in destination request packet；
12nd step, it is judged that the number whether targeted packets iterations combines more than targeted packets, the most then
Targeted packets iterations adds 1, performs the 6th step, otherwise, performs the 13rd step；
13rd step, joins compatibility condition table by current request packet；
14th step, deletes current request packet in destination request grouped table；
15th step, it is judged that ask the number of packet whether more than 0 in destination request grouped table, the most then hold
Row the 3rd step, otherwise, performs the 16th step；
16th step, obtains compatibility condition table.
The user of profit maximization shared by vehicle the most according to claim 2 asks distribution method, its feature
It is, specifically comprising the following steps that of the distance pruning algorithms described in step (5e)
1st step, arrange in data processing module one empty can ride-share request combined distance table；
2nd step, it is judged that in path sequence table, whether the number in path is more than 0, the most then perform the 3rd step,
Otherwise, the 9th step is performed；
3rd step, selects any one path sequence from path sequence table, as current path sequence；
4th step, takes out the request packet that current path sequence pair is answered, as currently please from compatibility condition table
Ask packet；
5th step, it is judged that whether current path sequence meets following formula, the most then perform the 6th step, otherwise,
Perform the 2nd step:
dis(s,d)≤σ
Wherein, dis represents that Euclidean distance, s represent first node in current path sequence, and d represents current
Needing to carry the position of the driver of user, σ represents distance threshold, and this parameter is existed by the user taking vehicle demand
Arrange in scope (0,1)；
6th step, according to the following formula, all total lengths taking vehicle user path sequence in computation requests packet:
Wherein, D represents all total lengths taking vehicle user path sequence in request packet, and ∑ represents to be asked
And operation, m represents the sum of path sequence, X in request packetjRepresent jth path sequence in request packet
The length of row, α represents floating parameter, and this parameter is arranged in scope (0,1) by control centre, and Y represents request
The length of common portion path sequence in all path sequence in packet；
7th step, by all total lengths taking vehicle user path sequence in current request packet and request packet
Joining can be in ride-share request combined distance table；
8th step, it is judged that in path sequence table, whether the number in path is more than 0, the most then perform the 3rd step,
Otherwise, the 9th step is performed；
9th step, obtaining can ride-share request combined distance table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610247876.5A CN105956686A (en) | 2016-04-20 | 2016-04-20 | Vehicle-sharing profit-maximization user request distribution system and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610247876.5A CN105956686A (en) | 2016-04-20 | 2016-04-20 | Vehicle-sharing profit-maximization user request distribution system and method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105956686A true CN105956686A (en) | 2016-09-21 |
Family
ID=56917831
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610247876.5A Pending CN105956686A (en) | 2016-04-20 | 2016-04-20 | Vehicle-sharing profit-maximization user request distribution system and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105956686A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108416559A (en) * | 2018-04-18 | 2018-08-17 | 江苏富力物流科技有限公司 | A kind of shipping platform car owner maximum revenue intelligence share-car matching process |
| CN111757270A (en) * | 2020-06-19 | 2020-10-09 | 中国联合网络通信集团有限公司 | Method and device for identifying overmaning vehicle |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103218769A (en) * | 2013-03-19 | 2013-07-24 | 王兴健 | Taxi order allocation method |
| CN103259783A (en) * | 2013-04-09 | 2013-08-21 | 安徽科技学院 | Real-time Android mobile terminal carpooling system and method based on SIP conversation and LBS positioning |
| CN104077912A (en) * | 2014-06-13 | 2014-10-01 | 上海交通大学 | Crowd-sourcing-based intelligent car-pooling method for taxies |
| CN104900049A (en) * | 2015-04-17 | 2015-09-09 | 胥达 | Taxi or private car sharing or hitch-hiking method |
-
2016
- 2016-04-20 CN CN201610247876.5A patent/CN105956686A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103218769A (en) * | 2013-03-19 | 2013-07-24 | 王兴健 | Taxi order allocation method |
| CN103259783A (en) * | 2013-04-09 | 2013-08-21 | 安徽科技学院 | Real-time Android mobile terminal carpooling system and method based on SIP conversation and LBS positioning |
| CN104077912A (en) * | 2014-06-13 | 2014-10-01 | 上海交通大学 | Crowd-sourcing-based intelligent car-pooling method for taxies |
| CN104900049A (en) * | 2015-04-17 | 2015-09-09 | 胥达 | Taxi or private car sharing or hitch-hiking method |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108416559A (en) * | 2018-04-18 | 2018-08-17 | 江苏富力物流科技有限公司 | A kind of shipping platform car owner maximum revenue intelligence share-car matching process |
| CN108416559B (en) * | 2018-04-18 | 2021-12-17 | 江苏富力物流科技有限公司 | Intelligent carpooling matching method for maximizing vehicle owner income of freight platform |
| CN111757270A (en) * | 2020-06-19 | 2020-10-09 | 中国联合网络通信集团有限公司 | Method and device for identifying overmaning vehicle |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1967524B (en) | Collecting and inquiry system of traffic information and method thereof | |
| DE112014001078B4 (en) | Data transmission device, data sharing system, data sharing method and message exchange system | |
| CN1967523B (en) | Inquiry system and method of traffic information | |
| CN104123836B (en) | Based on the order supplying system of city chauffeur order time place combination | |
| CN105513348A (en) | Mobile phone signaling trip chain-based OD matrix acquisition method | |
| CN105809962A (en) | Traffic trip mode splitting method based on mobile phone data | |
| CN103985247A (en) | Taxi transport capacity scheduling system based on city taxi calling demand distribution density | |
| CN103413209A (en) | Method for selecting multi-user and multi-warehouse logistics distribution path | |
| CN101187996A (en) | A quick bus line selection algorithm based on self-adapted backbone network | |
| CN104683405A (en) | Method and device for distributing map matching task by cluster server in Internet of Vehicles | |
| CN102880641B (en) | Parametric bus transfer method in consideration of short-distance walking station pair | |
| CN110490381B (en) | Bus trunk line planning method based on mixed integer planning | |
| CN107860393A (en) | A kind of fast searching method of a plurality of shortest path | |
| CN106153056A (en) | Navigation way generates method and device, navigation way acquisition methods and client | |
| CN105956686A (en) | Vehicle-sharing profit-maximization user request distribution system and method | |
| CN109325614B (en) | Bus stop site selection method based on GIS | |
| CN112560724A (en) | Vehicle monitoring method and device and cloud control platform | |
| CN107509229B (en) | A kind of car networking chance method for routing calculated based on vehicle node centrality | |
| CN104933473A (en) | City intelligent traffic dispatching method based on variable neighborhood search ant colony algorithm | |
| CN115713207A (en) | Hybrid bus service combination optimization method | |
| CN102509248B (en) | A kind ofly be applied to the travel Multi-Target Classification Method of forming a team and system | |
| CN105956951A (en) | Method of identifying hot tourist route based on mobile signaling | |
| CN104794301A (en) | Method for exploring influence factors for running time reliability of bus | |
| Guo et al. | Urban Road Network and Taxi Network Modeling Based on Complex Network Theory. | |
| CN112883195A (en) | Method and system for constructing traffic knowledge map of individual trip |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160921 |