CN106991555A - City vehicle mass-rent parcel transmission method based on incentive mechanism - Google Patents
City vehicle mass-rent parcel transmission method based on incentive mechanism Download PDFInfo
- Publication number
- CN106991555A CN106991555A CN201710194705.5A CN201710194705A CN106991555A CN 106991555 A CN106991555 A CN 106991555A CN 201710194705 A CN201710194705 A CN 201710194705A CN 106991555 A CN106991555 A CN 106991555A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- parcel
- website
- city
- user
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
-
- 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"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0834—Choice of carriers
- G06Q10/08345—Pricing
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Transmission method is wrapped up the present invention relates to a kind of city vehicle mass-rent based on incentive mechanism, belongs to car networking technology field；Comprise the following steps：Parcel transit point is set up according to the history run track of city vehicle first；It is each parcel planning transportation route followed by path planning algorithm；Then model is set up：The optimal return value of each website package shipment is found by model, and how to select optimal haulage vehicle to go transport to wrap up；Finally according to the bid amounts for participating in competitive bidding vehicle, the rate of rise of freight is set, and realizes by third party software the payment of expense.The inventive method takes full advantage of city operations vehicle, not only increases the efficiency of transmission of parcel, decreases the operating cost of city vehicle.
Description
Technical field
The present invention relates to a kind of method of city parcel transmission, more particularly to a kind of city vehicle based on incentive mechanism is many
Bag parcel transmission method, belongs to car networking technology field.
Background technology
Along with being continually changing for expanding economy and people's lives demand, the continuous renewal that urban industries are laid out is caused to be adjusted
It is whole.The change simultaneously because the productive consumption mode of people is constantly upgraded, and e-commerce technology extensive use and modern city
Diversification is presented in city's industry and commerce gradually so that nowadays this small lot, how often, it is efficient parcel dispatching, fixed point dispatching with
And the growth requirement growing tension of " door t door " delivery service.Resource between city and surrounding cities is not only solved with city express delivery
The problem of configuring uneven, while also having handled the problem of urban inner resource distribution is uneven.In actual life, due to big
Medium-sized city has certain transport limitation to city lorry, and this leads to not realize that large-scale logistics transportation is matched somebody with somebody using lorry
Take business.Therefore, during parcel is transported, both met ageing, cost of transportation is reduced again into current Developing Logistics
Bottleneck.
Nowadays China Logistics company is numerous, but management system there is a problem.First, built with city materials stream informationization
Also relatively lag behind, it is impossible to accomplish article real-time tracking.Secondly as regional limitation, can not be covered entirely with city express delivery comprehensively
City.For town and country, suburbs these be located in remote place, express delivery point is not provided with substantially or express delivery point is very sparse.Most
Afterwards, due to the imperfection of same city express delivery system, the express fee needed for the different regions of city is treated.Simultaneously as transport
The limitation of expense, it is impossible to accomplish Real-Time Transport to article, article is needed to wait until some time point consolidated delivery, and this is greatly reduced
What is transmitted is ageing.Exactly because these problems hamper the development of Chinese Express Service business.
The content of the invention
The purpose of the present invention is in view of the above-mentioned problems, proposing a kind of city vehicle mass-rent parcel transmission based on incentive mechanism
Method, to effectively facilitate the development of domestic and international logistics transportation business.
The principle of the present invention is to be based on mass-rent principle, and the transmission of parcel is realized using city vehicle multi-hop.It is different from
The mass-rent incentive mechanism existed, herein we not only consider the bid amounts of sending personnel, it is also considered that send distance with charge free.For
Raising conevying efficiency and freight is reduced, path has been planned for each parcel according to conventional track of vehicle in advance.And
The present invention is provided with two modules of platform and user, in console module, is looked for properly using Stackelberg theory of games
Value return value；In line module, go to select optimal vehicle user to go to send parcel with charge free using reverse auction algorithm.If single
Individual vehicle user is then delivered parcel in the path planned because the limitation of driving trace can not be sent to parcel destination
On website, auction again selects vehicle, untill parcel is delivered to destination.
The present invention to implement step as follows：
A kind of method of the city vehicle mass-rent parcel transmission based on incentive mechanism, this method comprises the following steps：
Step 1: setting up parcel transit point：
Clustered by the historical track to vehicle, find out track of vehicle concentrated area and set up website；Preferably,
The historical track to vehicle carries out cluster and uses improved DBSCAN algorithms；
Step 2: package paths are planned：
By the foundation of previous step transit point, according to the historical track of vehicle, website uses optimal road to the parcel of reception
Footpath planning algorithm is obtained the optimal transportation route of parcel and issued；
Step 3: website, which is calculated by following formula and issues R, makes website maximum revenue：
Wherein, P represents the parcel set of the website, | P | the parcel number of the website is represented, k represents that vehicle user is transported
The unit transport expense of parcel；
Step 4: the transportation route of R values that vehicle user is issued according to platform and parcel and considering the travel track of itself
Bid θ is carried out to website parcelip=(lip,bip), b hereipRepresent traffic unit expenses of the vehicle user i to parcel p, lipTable
Show transportation ranges of the vehicle user i to parcel p；
Step 5: website selects suitable vehicle transport to wrap up and passes through third party's branch according to the competitive bidding situation of vehicle user
The instrument of paying pays user's freight：
Competitive bidding of the website based on vehicle user is calculated using following formulaAnd select to causeMaximum vehicle user i transport bags
Wrap up in p：
Wherein, γ represents systematic parameter, and its value is 2ln10；fiThe income for participating in wrapping up the vehicle user i that p is transported is represented,
Calculated by following formula：
Wherein,i*=argmin { bij,i∈
V', j=p }, j*=argmin { lij, i ∈ V', j=p }, V' represents to participate in the vehicle set of competitive bidding；ηpRepresent unit price with
The rate of rise of package shipment distance, is calculated by following formula：
Beneficial effect：
The present invention considers a variety of traffic characteristics, the speed of such as vehicle, the time, position and point leaving from station away from
From；Using these different traffic characteristic information, method proposed by the present invention consider simultaneously consignor's expense, platform income and
Vehicle user income.In addition, method time complexity very little proposed by the present invention, can restrain quickly.
Existing parcel transmission method is contrasted, the inventive method takes full advantage of existing city operations vehicle, not only increased
The efficiency of transmission of parcel, decreases the operating cost of city vehicle.Experimental result also show the validity of this method
Brief description of the drawings
Fig. 1 be the embodiment of the present invention in wrap up the schematic flow sheet sent with charge free.
Fig. 2 is package shipment system composition schematic diagram of the present invention.
Position selections and the path planning schematic diagram of single parcel of the Fig. 3 for city website.
Fig. 4 is vehicle number (Number of Delivering Vehicles) and total transportation range (Overall
Delivery Distance) relation schematic diagram.
Fig. 5 is platform income (Platform Utility) and return value R (Reward R) relation schematic diagram.
Fig. 6 is participation vehicle number (Number of Delivering Vehicles) and delivery expense (Sender
Cost) relation schematic diagram.
Fig. 7 is delivery distance (Delivery Distances) and delivery expense (Sender Cost) relation schematic diagram.
Fig. 8 is platform income (Platform Utility) with participating in haulage vehicle number (Number of
Participatory Vehicles) relation schematic diagram.
Fig. 9 is consignor's expense (Sender Cost) with participating in haulage vehicle number (Number of
Participatory Vehicles) relation schematic diagram.
Figure 10 is the success rate (Success Rate) of package shipment of the present invention with participating in haulage vehicle number (Number
Of participatory Vehicles) relation schematic diagram.
Embodiment
The preferred embodiment of the present invention is described in detail below in conjunction with the accompanying drawings, illustrates use as shown in Figure 1
The inventive method carries out the process of package shipment, i.e. consignor and submits parcel transport request to central platform, and parcel is given
Nearest parcel switching website, central platform is calculated based on return value R and transported according to the parcel transport request of the submission of consignor
Path, and optimal package shipment vehicle, then transfer to the haulage vehicle calculated on transportation route according to result of calculation
The delivery successively wrapped up, shows package shipment system composition schematic diagram of the present invention as shown in Figure 2, can from figure
Arrive, the system mainly includes two large divisions：Central platform model and customer center model, wherein, central platform model is used to set
Count the transportation route and return value of parcel；Customer center model is used for the transport for selecting vehicle to realize parcel, comprises the following steps that：
Step 1: setting up parcel transit point as shown in Figure 3：
For whole urban district, road network is intricate, but considers the unicity of city vehicle transit route and have
It is sex-limited, it is necessary to each region set website could cover whole road vehicle net.User carries out parcel throwing for convenience simultaneously
Pass, it is necessary to design parcel transit point, the dispensing and transfer wrapped up for vehicle in whole urban district.For setting for parcel transit point
A variety of strategies can be used by putting, such as according to user's concentration degree, vehicle concentration degree, and the present embodiment passes through to participating in multi-stop delivery van
Historical track clustered, find out track of vehicle concentrated area and set up website, can so efficiently reduce and be wrapped in
The stand-by period of website.It is preferred that, the historical track cluster to vehicle uses DBSCAN algorithms；Certainly, those skilled in the art
Not limited to this method, also can be used other clustering methods, such as Kmeans, AGNES, DIANA.
It is illustrated in figure 3 grey blockage table in the parcel transit point for using DBSCAN algorithms to set up in example city, figure
Show transit point.
The transport wrapped up for city, the transportation route each wrapped up from starting point to destination is not unique, but for
Their running orbit is single for each haulage vehicle, in order to be supervised in real time to being wrapped in transportation
Control, to avoid parcel and loses, it is necessary to plan the transportation route of parcel.
Step 2: planning package shipment path；
By the foundation of previous step website, next need for parcel planning transit route.Here by using
Dijkstra's algorithm finds out optimal package shipment path as the transmission path of parcel.Such as the transportation route in Fig. 3.
Step 3: maximizing platform (wrapping up transit point) income
By the planning in above path, it is how to find optimal issue value R below, the income that platform can be allowed to obtain
Maximize.The present invention goes to predict the optimal transportation range of user by Stackelberg theories, can be with so as to find optimal R
Allow platform Income Maximum.
In the text, liRepresent that user's vehicle i sends the transportation range of parcel with charge free.Work as liWhen=0, represent that vehicle user i does not join
With the transport of parcel.Here the unit costs k of the vehicle of package shipment is participated ini＞ 0.Represent in platform model, platform is false
Determine vehicle user and obtain financial value.
For platform, the income formula of each vehicle user is predicted：
Income formula progress arrangement to vehicle user can obtain optimal transportation range.Here received in the presence of one assorted equal
Weighing apparatus.And treat the transportation range of each user and meet formula (3.2), i.e.,
According to Nash Equilibrium principle, our transportation ranges to vehicle, which carry out abbreviation, here can obtain formula (3.3)
According to actual life, we may be designed as the charging formula to consignor
Wherein, spRepresent that consignor sends parcel p and needs to pay the expense of platform, γ represents the factor of influence of system, V*
Represent to participate in the vehicle number that p is wrapped up in transport, function log (1+l during package shipmenti) reflect vehicle user transport bag
The rate of rise for wrapping up in distance is more than the rate of rise of consignor's expense.
After website issues these parcels, the income that this website can be obtained is
HereRepresent the website number wrapped up according to website and the transportation range that each wraps up and assess oneself can be with
Obtain income.
Here formula (2.3) and (2.5) are arranged and can obtained
Here
To functionCarrying out secondary derivation can obtain
It can be obtained by formula (3.7)So the revenue function of platformIt it is one in interval R ∈ (0, ∞)
Strict convex function, that is, certainly exist a return value R and allow platform to obtain maximum.As return value R=0, substitute into
In formula (3.6), the income that can obtain platform is also 0；When R tends to ∞, the income that substitution formula can obtain platform tends to-∞.
Therefore we can obtain the equation (3.8) on issue value R
Here
Here because the present embodiment is based on hiring out vehicle model, therefore the expense that each vehicle is spent is identical, i.e. ki=kj.Most
Final finishing can must issue value R calculation formula
Step 4 participates in vehicle expense and paid
Optimal transit point can be found by preceding step and wrap up issue value, when platform issues return value R and parcel
During transportation route L, user i can carry out bid θ according to the actual shipment track of oneselfip=(lip,bip), following step be as
What calculates the expense for paying and participating in competitive bidding vehicle.A variable η is defined hereinp, for representing the growth with transportation range,
The rate of rise of price.V' represents to participate in the vehicle set of competitive bidding.Therefore,
In formula (4.1), when the transportation range of competitive bidding successful user is equal to the transportation range of these competitive bidding vehicle users
During minimum value, then ηp=1.
Income formula can be obtained from platform for each vehicle user i for participating in package shipment is
As can be seen that working as η from formula (4.2)pOne timing, for the vehicle of each participation package shipment, their fortune
Defeated unit costs are relevant only with their transportation range, only maximize the transportation range of transport parcel, and vehicle could be maximized
The income of itself.
Step 5: the selection of haulage vehicle；
By above paying the calculating of expense to user i, therefore user i true earning formula is
HereRepresent that the vehicle user i for participating in package shipment can obtain net profit,Represent that vehicle i completes to wrap up
The expense spent after transport.The vehicle of transport is not engaged in for other, the income of last gained is 0.
If certain website goes to complete parcel p transport by vehicle user i, it can be obtained for the website from parcel p
Ultimate yield formula be
In formula (5.2), g (θip) vehicle user i is represented after parcel p transport is completed, (can it be put down to the website
Platform) true value that brings.Wherein, γ represents systematic parameter, and its value is 2ln10；Represent that website completes parcel p transport
The net profit that can be obtained afterwards.By formula selection the vehicle of maximum return can be brought to transport parcel to website.
Assess
In order to more can effectively assess method described herein, theoretical proof is carried out to model first here.Secondly by
The method that the present invention is selected is compared to illustrate advantages of the present invention with other method.
Model evaluation
In order to more can effectively assess method described herein, theoretical proof is carried out with regard to model below.
If the vehicle user i of theorem 1 wins parcel p competitive bidding θip=(lip,bip) andSo competitive bidding isUser necessarily also won competitive bidding.
Prove：From formula (3.4), when transportation range is identical, the value produced to platform is equivalent, soTherefore,According to the principle of greedy algorithm, platform is in order to obtain more
Many incomes are bound to selectUser go transport wrap up.
Theorem 2 wins competitive bidding θip=(lip,bip) vehicle user i expense be necessarily less than threshold value, if beyond this
Individual threshold value, then can not possibly win competitive bidding.
Prove：The customer charge of all competitive biddings is calculated according to formula (4.2), the expense for finally needing payment isNext prove to be b for all user's vehicle i expected revenus(i,p)*l(i,p),
If user's vehicle i expense bip*lip＞ fi, vehicle user, which is unwilling to transport, wraps up p, then can be substituted by other users.It is assumed that
Carry out after M circulation, just select the vehicle user of transport, then necessarily meet formula.
Theoretical proof more than, whole model necessarily meets authenticity.
All vehicle users for participating in transport of theorem 3 are necessarily metHereRepresent that user i is entirely transported
Expense during defeated.
Prove：By formula (4.2) it is known that the income of the vehicle for participating in the transport of some websiteThereforeHere bi' represent that user can be true from platform
The unit transport expense obtained in fact.For each participation transport vehicle, they in order to which certain income can be obtained, they
Unit bid price necessarily meetFinally, it can be deduced that formula (6.2)
The whole model of proof more than meets personal reasonability.
Theorem 4 is during parcel is transported, the income that platform is obtained
Prove：According to the proof of authenticity, after having circulated M times, platform just selects the vehicle that transport is wrapped up.Then can be with
Obtain
It can be obtained by formula (4.3), for the vehicle of each participation package shipmentIt therefore, it can obtain formula (4.4)
Prove to obtain more than, the model meets the feasibility of incentive mechanism.
It is ready to transport parcel it is assumed that there is n vehicle user, suitable vehicle user m is selected from this n vehicle user
The time complexity spent is O (n), is that the time complexity that p parcel of website carries out bid needs is from this m vehicle
O(mp).Therefore, during whole algorithm is run, required algorithm complex is O (nmp).Whole system can be effective
Time in obtain optimal package shipment vehicle.
Experimental result is assessed
As shown in figure 4, abscissa represents to participate in vehicle number (the Number of Delivering of package shipment in figure
Vehicles), ordinate represents the transportation range summation (Overall Delivery Distance) of all parcels.From figure
As can be seen that after platform issues the return value R of all parcels of some website, with the increase for participating in vehicle number, all bags
The summation for the transportation range wrapped up in is also in increase.Along with increasing for vehicle number, the increase speed of the transportation range sum of all parcels
Rate is tapered into.Because return value R is certain, each itself unit costs for participating in package shipment vehicle are certain, with bag
The increase of transportation range is wrapped up in, the total expense of haulage vehicle is also gradually increasing, and vehicle user is due to by vehicle expense
Limitation will not reduce always, if the self benefits for reducing this always and causing vehicle user are gradually reduced and constantly convergence 0.To car
Lost more than gain for user.So the rate of rise of transportation range can be caused less and less.
Abscissa represents return value R (Reward R) in Fig. 5, and ordinate represents that platform obtains income (Platform
Utility).The figure reflect platform issue certain website return value R and platform obtain income between relation.Divide from figure
Analysis show that, when platform issues price R=5, now platform can obtain Income Maximum；The return value R issued when platform<When 5,
Platform, which obtains income, gradually to be increased, because when R is smaller, can limit the vehicle number for participating in package shipment, add
The cost of transportation of parcel, but as R gradually increase, vehicle user gradually increase, cost of transportation is also gradually decreased；When issue
Return value R>When 5, with return value R increase, platform income is gradually decreased, because the expense of consignor is in certain wave zone
Between, after R reaches some value, with the increase of R values, but the freight of consignor is almost unchanged, and this causes return value R mistakes
Greatly, the income of platform is negative value.
Fig. 6 abscissas are represented to participate in the vehicle number (Number of Delivering Vehicles) of package shipment, indulged
The expense (Sender Cost) of coordinate representation consignor.It can be seen that the expense of consignor is wrapped up with participating in from the relation in figure
The vehicle number of transport is relevant.When it is 1 to participate in vehicle number, then it represents that parcel can be directly taken destination, now
Expense is minimum.With the increase of vehicle number, freight is also increased as.Influenceed, joined yet with by website number
Vehicle number with package shipment is limited, so total freight has a maximum.Simultaneously as can be seen from the figure with
The increase for participating in package shipment vehicle number, the rate of rise of the delivery expense of consignor is gradually decreased.Due in actual bag
During wrapping up in transport, the website of the transportation route experience of parcel planning is limited, so participating in the vehicle user of package shipment
Limited, when the vehicle user for participating in parcel reaches this value, the freight of parcel will not be further added by.
Fig. 7 abscissas represent the transportation range (Delivery Distance) of parcel, and ordinate represents the expense of consignor
(Sender Cost).Consignor sends the delivery expense that the distance wrapped up decides consignor, as can be seen from the figure with bag
The transportation range increase wrapped up in, the total freight of consignor can also increase therewith.In practical application, in order to stimulate more hairs
Goods people is sent by platform and wrapped up, and platform sets the freight of parcel for the distance of the transportation range of parcel.Work as consignor
The distance of transmission is shorter, then the express fee collected is just relatively fewer, but the freight of mean unit distance is then relatively most；
When the transportation range that consignor sends parcel is relatively more remote, the freight undertaken is relative to be increased, but mean unit distance
Freight is then relatively minimal.So the expense rate of rise of consignor is tapered into along with distance increase, this is also current
The price discipline of all logistics transportations.
In Fig. 8, abscissa represents all haulage vehicle number (the Number of participatory for participating in competitive bidding in city
Vehicles), ordinate represents the income (Platform Utility) of platform.It can be found that as whole urban district is transported from figure
The increase for a number of driving a vehicle, the income of platform also gradually increases.But relative to FIFO algorithms, the incentive mechanism that this paper is set
The income for allowing platform to obtain is more.All it is relatively independent between the vehicle submitted a tender by FIFO algorithms selection vehicles, participation, does not have
There is inner link, other tender prices for participating in vehicle will not produce influence to the tender price of vehicle nearby, so with car
The increase of number, after vehicle number reaches certain value, platform income will not change, and so be unfavorable for competition.
In fig .9, abscissa represents all haulage vehicle number (the Number of for participating in competitive bidding in city
Participatory Vehicles), ordinate represents the expense (Sender Cost) of consignor.It can be analyzed from figure
Arrive, the incentive mechanism algorithm set herein is gradually decreased with the increase of vehicle number, the freight of consignor.And FIFO is calculated
Method, when vehicle number is less than 2000 cars, with the increase of vehicle number, the expense of consignor gradually increases；When vehicle
After number is more than 2000, the expense of consignor just gradually lowers.In whole process, using the incentive mechanism algorithm designed herein,
The freight of user will be less than the freight of consignor in FIFO algorithms.
Comparative illustration more than, delivery can be not only effectively reduced using incentive mechanism algorithm proposed by the present invention
The expense of people, and platform acquisition income can also be made to reach maximization.Therefore incentive mechanism algorithm proposed by the present invention is used,
More vehicle users are stimulated to participate in the transport of parcel.The wasting of resources caused by this not only efficiently solves city vehicle more
The problem of, and solve the predicament that current China faces with city express delivery.
Abscissa represents to participate in the vehicle number (Number of participatory Vehicles) of competitive bidding in Figure 10,
Ordinate represents package shipment success rate (Sucess Rate).As can be observed from Figure, when vehicle number is 1000,
Whole Cologne city can not be covered because vehicle distribution is sparse, is caused in transportation, it is impossible to be in time parcel auction to transport
Vehicle, so as to easily make package shipment fail, the transport success rate of parcel is than relatively low.With whole municipal transport vehicles number
Increase, city vehicle coverage rate more and more higher, the success rate of parcel is consequently increased.When whole municipal transport vehicles reach 7000
When, the success rate of parcel is already close to 90%.In the life of reality, city operations vehicle number will be considerably beyond 7000
, so the success rate of parcel is also far longer than 90%.
In summary, proposed use mass-rent principle is being invented, parcel transmission is being realized using city vehicle multi-hop, no
The conevying efficiency of parcel is improve only, while decreasing the cost of transportation of consignor, the success rate of parcel is also very high.
Claims (1)
1. a kind of method of the city vehicle mass-rent parcel transmission based on incentive mechanism, it is characterised in that comprise the following steps：
Step 1: setting up parcel transit point：
Clustered by the historical track to vehicle, find out track of vehicle concentrated area and set up website, be i.e. transit point；As
It is preferred that, the historical track to vehicle carries out cluster and uses improved DBSCAN algorithms；
Step 2: package paths are planned：
By the foundation of previous step transit point, according to the historical track of vehicle, website is advised to the parcel of reception using optimal path
Method to one's profit is obtained the optimal transportation route of parcel and issued；
Step 3: website, which is calculated by following formula and issues R, makes website maximum revenue：
Wherein, P represents the parcel set of the website, | P | the parcel number of the website is represented, k represents vehicle user transport parcel
Unit transport expense；
Step 4: the transportation route of R values that vehicle user is issued according to platform and parcel and considering the travel track of itself to station
Point parcel carries out bid θip=(lip,bip), b hereipRepresent traffic unit expenses of the vehicle user i to parcel p, lipRepresent car
User i is to wrapping up p transportation range；
Step 5: competitive bidding of the website based on vehicle user is calculated using following formulaAnd select to causeMaximum vehicle user i fortune
Defeated parcel p：
Wherein, γ represents systematic parameter, and its value is 2ln10；fiThe income for participating in wrapping up the vehicle user i that p is transported is represented, is passed through
Following formula is calculated：
Wherein,i*=argmin { bij, i ∈ V', j=
P }, j*=argmin { lij, i ∈ V', j=p }, V' represents to participate in the vehicle set of competitive bidding；ηpRepresent that unit price is transported with parcel
The rate of rise of defeated distance, is calculated by following formula：
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710194705.5A CN106991555B (en) | 2017-03-29 | 2017-03-29 | Urban vehicle crowdsourcing package transfer method based on incentive mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710194705.5A CN106991555B (en) | 2017-03-29 | 2017-03-29 | Urban vehicle crowdsourcing package transfer method based on incentive mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106991555A true CN106991555A (en) | 2017-07-28 |
| CN106991555B CN106991555B (en) | 2021-01-01 |
Family
ID=59413423
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710194705.5A Active CN106991555B (en) | 2017-03-29 | 2017-03-29 | Urban vehicle crowdsourcing package transfer method based on incentive mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106991555B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108446878A (en) * | 2018-03-27 | 2018-08-24 | 重庆大学 | A kind of reverse delivery routes planning system of package based on carrying taxi group |
| CN109919550A (en) * | 2019-03-07 | 2019-06-21 | 重庆交通大学 | A kind of crowdsourcing express system and method based on track vehicle |
| CN111311019A (en) * | 2020-03-10 | 2020-06-19 | 山西省地震局 | Logistics distribution system based on population distribution |
| CN113393040A (en) * | 2021-06-18 | 2021-09-14 | 重庆邮电大学工业互联网研究院 | Industrial park logistics scheduling method and system based on game theory |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014088864A2 (en) * | 2012-12-05 | 2014-06-12 | International Business Machines Corporation | Selective automated transformation of tasks in crowdsourcing systems |
| CN103942669A (en) * | 2014-04-29 | 2014-07-23 | 吉林财经大学 | Logistic goods distributing method based on social networking services |
| CN104463424A (en) * | 2014-11-11 | 2015-03-25 | 上海交通大学 | Crowdsourcing task optimal allocation method and system |
| CN104573995A (en) * | 2015-01-28 | 2015-04-29 | 重庆软文科技有限责任公司 | Crowdsourcing task release and execution methods and devices |
| CN104599085A (en) * | 2015-02-12 | 2015-05-06 | 北京航空航天大学 | User motivating method under crowdsourcing mode and crowdsourcing system |
| CN104881710A (en) * | 2015-05-11 | 2015-09-02 | 浙江大学 | Urban express delivering method based on vehicle self-organized network |
| CN105976234A (en) * | 2016-05-04 | 2016-09-28 | 南京邮电大学 | Method for realizing team-based incentive mechanism in mobile crowdsourcing system |
| US20160335610A1 (en) * | 2015-05-15 | 2016-11-17 | 3M Innovative Properties Company | Incentivized crowd funding system for internal innovation by an organization |
-
2017
- 2017-03-29 CN CN201710194705.5A patent/CN106991555B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014088864A2 (en) * | 2012-12-05 | 2014-06-12 | International Business Machines Corporation | Selective automated transformation of tasks in crowdsourcing systems |
| CN103942669A (en) * | 2014-04-29 | 2014-07-23 | 吉林财经大学 | Logistic goods distributing method based on social networking services |
| CN104463424A (en) * | 2014-11-11 | 2015-03-25 | 上海交通大学 | Crowdsourcing task optimal allocation method and system |
| CN104573995A (en) * | 2015-01-28 | 2015-04-29 | 重庆软文科技有限责任公司 | Crowdsourcing task release and execution methods and devices |
| CN104599085A (en) * | 2015-02-12 | 2015-05-06 | 北京航空航天大学 | User motivating method under crowdsourcing mode and crowdsourcing system |
| CN104881710A (en) * | 2015-05-11 | 2015-09-02 | 浙江大学 | Urban express delivering method based on vehicle self-organized network |
| US20160335610A1 (en) * | 2015-05-15 | 2016-11-17 | 3M Innovative Properties Company | Incentivized crowd funding system for internal innovation by an organization |
| CN105976234A (en) * | 2016-05-04 | 2016-09-28 | 南京邮电大学 | Method for realizing team-based incentive mechanism in mobile crowdsourcing system |
Non-Patent Citations (4)
| Title |
|---|
| CHAO CHEN ET AL.: "Using taxis to collect citywide E-commerce reverse flows: A crowdsourcing solution", 《INT. J. PROD. RES.》 * |
| D. YANG ET AL.: "Crowdsourcing to smart-phones: Incentive mechanism design for mobile phone sensing", 《IN PROC.18TH ANNU. INT. CONF. MOBILE COMPUT. NETW.》 * |
| L. GAO ET AL.: "Providing long-term participation incentive in participatory sensing", 《IN PROC.IEEE CONF.COMPUT.COMMUN.(INFOCOM)》 * |
| 赵兴龙: "基于K-means-遗传算法的众包配送网络优化研究", 《中国优秀硕士学位论文全文数据库 经济与管理科学辑》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108446878A (en) * | 2018-03-27 | 2018-08-24 | 重庆大学 | A kind of reverse delivery routes planning system of package based on carrying taxi group |
| CN109919550A (en) * | 2019-03-07 | 2019-06-21 | 重庆交通大学 | A kind of crowdsourcing express system and method based on track vehicle |
| CN111311019A (en) * | 2020-03-10 | 2020-06-19 | 山西省地震局 | Logistics distribution system based on population distribution |
| CN113393040A (en) * | 2021-06-18 | 2021-09-14 | 重庆邮电大学工业互联网研究院 | Industrial park logistics scheduling method and system based on game theory |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106991555B (en) | 2021-01-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106991555A (en) | City vehicle mass-rent parcel transmission method based on incentive mechanism | |
| Nourinejad et al. | Agent based model for dynamic ridesharing | |
| US20020019759A1 (en) | Transportation planning, execution, and freight payments managers and related methods | |
| Shao et al. | Variable neighborhood search and tabu search for auction-based waste collection synchronization | |
| CN109299810A (en) | A kind of goods stock stowage method | |
| CN107563699A (en) | A kind of logistics system and with goods transport courses | |
| Mesa-Arango et al. | Benefits of in-vehicle consolidation in less than truckload freight transportation operations | |
| Chen et al. | An effective pricing model for the congestion alleviation of e-commerce logistics | |
| US20110099022A1 (en) | Methods and Systems for Vehicle Emission Reporting | |
| Zhang et al. | Integrated optimization for feeder bus timetabling and procurement scheme with consideration of environmental impact | |
| Kaan et al. | The vanpool assignment problem: Optimization models and solution algorithms | |
| Mochalin et al. | Condition for application of logistic principles in practice of urban public passenger transport in the city of Omsk | |
| Yu et al. | Differential pricing strategies of air freight transport carriers in the spot market | |
| Wang et al. | Joint optimization of parcel allocation and crowd routing for crowdsourced last-mile delivery | |
| Abualola et al. | A matching game-based crowdsourcing framework for last-mile delivery: Ground-vehicles and unmanned-aerial vehicles | |
| Yang et al. | Feasibility on the integration of passenger and freight transportation in rural areas: A service mode and an optimization model | |
| CN105260865A (en) | Logistic resource sharing platform based on internet and usage method thereof | |
| Liatsos et al. | The capacitated hybrid truck platooning network design problem | |
| CN108197879B (en) | Multi-mode passenger and cargo co-transportation method and system | |
| Liakos et al. | An interactive freight-pooling service for efficient last-mile delivery | |
| Janic et al. | Sustainability of the European freight transport system: evaluation of innovative bundling networks | |
| Hanum et al. | Vehicle routing problems in rice-for-the-poor distribution | |
| Zhou et al. | Combinatorial auction to allocate traffic | |
| Tsyganov | Market incentives for transport monopoly | |
| Zhou et al. | Study on the optimization of collection and distribution system of freight hub ports: Illustrated by the case of Shanghai international shipping center, China |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |