CN108805481A - A kind of goods delivery method of shipping share-car end - Google Patents

A kind of goods delivery method of shipping share-car end Download PDF

Info

Publication number
CN108805481A
CN108805481A CN201810350655.XA CN201810350655A CN108805481A CN 108805481 A CN108805481 A CN 108805481A CN 201810350655 A CN201810350655 A CN 201810350655A CN 108805481 A CN108805481 A CN 108805481A
Authority
CN
China
Prior art keywords
point
circuit
trans
share
consignee
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
Application number
CN201810350655.XA
Other languages
Chinese (zh)
Other versions
CN108805481B (en
Inventor
李敬泉
李屿宇
徐桥
刘云飞
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing University
Original Assignee
Nanjing University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nanjing University filed Critical Nanjing University
Priority to CN201810350655.XA priority Critical patent/CN108805481B/en
Publication of CN108805481A publication Critical patent/CN108805481A/en
Application granted granted Critical
Publication of CN108805481B publication Critical patent/CN108805481B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Quality & Reliability (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The present invention relates to a kind of goods delivery methods of shipping share-car end, include the following steps：Distribution information is extracted from share-car database；Transport power to carrying unit is planned as a whole；Calculate real road distance of the trans-shipment point service range consignee apart from trans-shipment point；The initial scheme of goods delivery is made according to distribution information, the transport power ability of acknowledgement of consignment unit and real road distance；According to initial scheme, optimize its transportation cost, plans that distribution project obtains single order scheme again；According to single order scheme, a line rule of receiving is added, obtains second-order scheme；Single order scheme and second-order scheme are compared, final distribution project of the conevying efficiency highest distribution project as trans-shipment point for this share-car cargo is selected.This method can either optimize Distribution path under limiting factor and can improve goods delivery conevying efficiency.

Description

A kind of goods delivery method of shipping share-car end
Technical field
The present invention relates to path optimization's technical field more particularly to a kind of goods delivery methods of shipping share-car end.
Background technology
It flourishes in China Logistics industry, and under the overall background that deepens continuously of the theory of " internet+logistics " and technology, Shipping share-car industry situation as one of the main function mode of highway freight obtains significant progress.However, for now, much Transport enterprise does not form system in the goods delivery link of share-car end, is only to have vehicle to send, not by consignee according to It is cascaded according to certain optimization method, this makes the dispatching of highway freight end cargo that scattered, random feature be presented.Cause to spell The unit cost of vehicle can not decline, to drag down the dispatching efficiency of transport enterprise but also the transportation cost undertaken needed for client Rise.Meanwhile lack goods delivery after the share-car of planning will also result in detour, goods delivery time-out, cargo are impaired etc. bad asks Topic.
Invention content
The purpose of the present invention is to provide a kind of goods delivery method of shipping share-car end, this method can either limit Optimize Distribution path under factor and goods delivery conevying efficiency can be improved.
To achieve the above object, the technical scheme is that：
A kind of goods delivery method of shipping share-car end, includes the following steps：
Step 1：Distribution information is extracted from share-car database；
Step 2：Transport power to carrying unit is planned as a whole；
Step 3：Calculate real road distance of the trans-shipment point service range consignee apart from trans-shipment point；
Step 4：The initial of goods delivery is made according to distribution information, the transport power ability of acknowledgement of consignment unit and real road distance Scheme；
Step 5：According to initial scheme, optimize its transportation cost, plans that distribution project obtains single order scheme again；
Step 6：According to single order scheme, a line rule of receiving is added, obtains second-order scheme；
Step 7：Single order scheme and second-order scheme are compared, select conevying efficiency highest distribution project as trans-shipment point pair In the final distribution project of this share-car cargo.
Further, distribution information includes consignee's quantity, Description of Goods, cargo type, goods weight, turns in step 1 It transports ground, destination, loading time and receives the time, wherein consignee's quantity, goods weight and destination are transport end letter Breath, Description of Goods, cargo type, quantity of goods, transhipment ground, destination, loading time and time of receiving are transport front-end information, Trans-shipment point number 0 is indicated that the consignee in operation final word usesLabel, wherein, theA receipts The corresponding goods weight of goods people is expressed as(unit kg).
Further, plan as a whole in step 2 information include driver's quantity, lorry quantity, lorry described in lorry model and load-carrying Quantity is expressed as, wherein；ByThe load-carrying of lorry is expressed as, unit kg.
Further, real road distance system of the trans-shipment point service range consignee apart from trans-shipment point will be calculated in step 3 At transportation range table.
Further, the initial scheme of goods delivery is as follows in step 4：
Step 4.1：All consignees in trans-shipment point service range are scanned, confirm the levels of precision of transportation range table；
Step 4.2：Since trans-shipment point 0, connect each consignee, wherein each consignee only connect it is primary and only with transhipment Point 0 constitutes closed circuit；
Step 4.3：The distance for calculating each closed circuit completes the total distance that all closed circuits needAnd it is each The rate of actual loading of vehicle and rate of actual loading is very poor on closed circuit, wherein rate of actual loading is expressed as；
Step 4.4：According to calculated each item data in step 4.3, dispatching initial scheme is formed, and wait for new with next stage The comparison of scheme.
Further, according to initial scheme in step 5, optimize its transportation cost, plan that distribution project obtains single order again Scheme is as follows：
Step 5.1：All consignees in trans-shipment point service range are scanned, confirm the levels of precision of transportation range table；
Step 5.2：It establishes and waits for collection and collection on line, still will be put into waiting collection for the consignee of layout of roads is added, be added Consignee be put into collection on line；
Step 5.3：The most heavy conduct first of dispatching goods weight needed for consignee in chosen area is concentrated to be closed back from waiting for First point of road is updated to first from trans-shipment point for basic point and receives a little；
Step 5.4：It is received a little for basic point with first, into region, other maximum points of and weight adjacent with new basic point are soundd out Property connection, if connected it is next receive a little needed for dispense cargo plus current basic point need dispatching goods weight be no more than, then concentrated from waiting and extract next entrance set of matches of receiving out, while updating basic point, if the overload of basic point and subsequent point It crosses, then choose a time heavy conduct of receiving in basic point neighborhood and newly sound out a little；
Step 5.5：When on line newest basic point becauseLimitation and can not update on next adjoint point or the circuit Cargo dead-weight is exactly equal to, then basic point is retracted into trans-shipment point again, to constitute a closed circuit；
Step 5.6：Make to clamp on the rule for integrating and completing to dispense circuit to all consignees in region as empty set according to above-mentioned steps It draws, while checking whether dispatching circuit the problem of trans-routing occurs, if occurring, involved circuit is split, is returned It is planned again to step 5.3, circuit is dispensed in region, any trans-routing situation is not present；
Step 5.7：Circuit is dispensed according to step, calculates separately out the corresponding rate of actual loading of every circuit, every closed circuit The average bearing capacity of haul distance, dispatching circuit total haul and unit haul distance.
Further, a line rule of receiving is added, obtains the specific step of second-order scheme according to single order scheme in step 6 It is rapid as follows：
Step 6.1：By in line rule it is each receive can only a little connect it is primary make into first connect repeatedly, that is, allow in batches to A same dispatching cargo of receiving；
Step 6.2：Compare the size of every circuit rate of actual loading in single order scheme, preferentially to the closed circuit of rate of actual loading minimum into Row is planned and updates waiting collection again；
Step 6.3：Choosing to wait for concentrates required most heavy the receiving of dispatching cargo the new basic point of conduct and to be incorporated to new basic point neighbouring Rate of actual loading does not do exploratory connection for 1 closed circuit, if newly being closed after the closed circuit that it is 1 that periphery rate of actual loading, which is added, or not new basic point Close circuit>, then cargo will be dispensed needed for new basic point and is divided into two parts, and a part is classified as current exploratory closed circuit In, so that its rate of actual loading is equal to 1, the part exceeded then enables, wait for the connection of next circuit and by new basic point institute The corresponding weight that need to dispense cargo fromIt is updated toNew after the closed circuit that it is 1 that if periphery rate of actual loading, which is added, or not new basic point Closed circuit , then current new basic point is directly included into exploratory closed circuit, and update and wait for collection and collection on line；
Step 6.4：Repeat step 6.2,6.3 implementation procedures, until all the points have constituted closed circuit and can not continue to split, Meanwhile it is corresponding to calculate separately out every new line, every closed circuit haul distance, dispatching circuit total haul and unit fortune Away from average bearing capacity.
The goods delivery method of the shipping share-car end of the present invention can optimize Distribution path under limiting factor and can Goods delivery conevying efficiency is improved, transportation cost is reduced, meanwhile, avoid goods delivery from causing to detour, goods delivery time-out, cargo The bad problem such as impaired.
Description of the drawings
Fig. 1 is the goods delivery method flow diagram of shipping share-car of the present invention end；
Fig. 2 is the goods delivery method initial scheme line graph of shipping share-car of the present invention end；
Fig. 3 is the goods delivery method single order scheme line graph of shipping share-car of the present invention end；
Fig. 4 is the goods delivery method second-order scheme line graph of shipping share-car of the present invention end.
Specific implementation mode
Technical scheme of the present invention is described in further detail with reference to the accompanying drawings and detailed description.
As shown in Figure 1, a kind of goods delivery method of shipping share-car end of the present invention.
Step 1：Distribution information is extracted from share-car database, distribution information includes consignee's quantity, Description of Goods, goods Species type, goods weight transport ground, destination, loading time and receive the time, wherein consignee's quantity, goods weight and mesh Ground be transport final word, Description of Goods, cargo type, quantity of goods, transhipment ground, destination, loading time and when receiving Between for transport front-end information, trans-shipment point number 0 is indicated, consignee's use in operation final wordLabel, wherein, theThe corresponding goods weight of a consignee is expressed as(unit kg).
Table 1 is distribution information table：
Consignee Description of Goods Goods weight Transhipment ground Destination
Consignee 1 Stainless steel bowl 13 Nanjing It is long
Consignee 2 Porcelain 3 Nanjing Yangzhou
Consignee 3 Down jackets 3 Nanjing Liyang
Consignee 4 Apple 11 Nanjing Wuhu
Consignee 5 Books 4 Nanjing Hefei
Consignee 6 Salt 10 Nanjing Chuzhou
Consignee 7 Banana 10 Nanjing Quanjiang
Consignee 8 Cup 5 Nanjing Changzhou
Step 2：Transport power to carrying unit is planned as a whole, and plans as a whole information and includes：Driver's quantity, lorry quantity, lorry model and Load-carrying, lorry quantity are expressed as, wherein；ByThe load-carrying of lorry is expressed as, unit kg.
Table 2 is acknowledgement of consignment unit capacity information table：
Vehicle Driver Car plate Vehicle Load-carrying
Vehicle 1 Lee master worker Revive A W1Oxx Van 20
Vehicle 2 King master worker Revive A 4Q3xx Van 20
Vehicle 3 Liu master worker Revive A 41Pxx Van 20
Vehicle 4 Zhao master worker Revive A Y12xx Van 20
Step 3：Calculate real road distance of the trans-shipment point service range consignee apart from trans-shipment point, transportation range table be made, InIndicate the distance between different consignees.
Table 3 is practical reason distance of the consignee apart from trans-shipment point（Kilometer）：
Place of acceptance Nanjing It is long Yangzhou Liyang Wuhu Hefei Chuzhou Quanjiang Changzhou
Nanjing 0 120 100 107 102 170 71 63 132
It is long 120 0 68 190 214 265 143 160 206
Yangzhou 100 68 0 126 194 254 126 146 103
Liyang 107 190 126 0 131 259 164 156 77
Wuhu 102 214 194 131 0 150 132 123 200
Hefei 170 265 254 259 150 0 131 117 300
Chuzhou 71 143 126 164 132 131 0 30 193
Quanjiang 63 160 146 156 123 117 30 0 192
Changzhou 132 206 103 77 200 300 193 192 0
Step 4：The initial of goods delivery is made according to distribution information, the transport power ability of acknowledgement of consignment unit and real road distance Scheme, as shown in Figure 2.
Step 4.1：All consignees within trans-shipment point service range are scanned, confirm the levels of precision of transportation range table；
Step 4.2：Since trans-shipment point 0, connect each consignee, wherein each consignee only connect it is primary and only with Trans-shipment point 0 constitutes closed circuit, meanwhile, the real road distance between every bit is fitted the expression that is in line in composition, and It is same line segment back and forth；
Step 4.3：The distance for calculating each closed circuit completes total distance and each that all closed circuits need The rate of actual loading of vehicle on closed circuit, wherein rate of actual loading is expressed as；
Table 4 is the corresponding data of initial scheme：
Closed path Road is long Rate of actual loading
No. 1 route 240 0.65
No. 2 routes 200 0.15
No. 3 routes 214 0.15
No. 4 routes 204 0.55
No. 5 routes 340 0.20
No. 6 routes 142 0.50
No. 7 routes 126 0.50
No. 8 routes 264 0.25
Show that total haul is 1730,
Step 4.4：Each item data in 4.3 steps is recorded, forms dispatching initial scheme, and wait for and next stage new departure Comparison.
Step 5：According to initial scheme, optimize its transportation cost, plans that distribution project obtains single order scheme, such as Fig. 3 again It is shown.
Step 5.1：All consignees within trans-shipment point service range are scanned, confirm the levels of precision of transportation range table；
Step 5.2：It establishes and waits for collection { 1,2,3,4,5,6,7,8 } and collection { } on line；
Step 5.3：No. 1 point needs the cargo dispensed most heavy as shown in Table 1, therefore by basic point from 0 point of update to No. 1 point；
Step 5.4：Current basic point does exploratory connection in No. 1 point from No. 1 point to its consecutive points；
And line adjacent with No. 1 point will not cause the point with follow-up closed circuit crossing elimination in scanning area, it is known that No. 2 points with No. 7 points meet condition, while No. 7 adjacent point cargos are most heavy, then preferential analysis circuit 1-7.
Circuit 1-7：, then basic point can not be updated to No. 7 points；
Circuit 1-2：, then basic point can update No. 2 points；
Therefore, basic point is updated to No. 2 points.
And line adjacent with No. 2 points will not cause the point with follow-up closed circuit crossing elimination in scanning area, it is known that No. 8 Point and No. 7 points meet condition, while No. 7 adjacent point cargos are most heavy, then preferential analysis circuit 1-2-7.
Circuit 1-2-7：, then basic point can not be updated to No. 7 points；
Circuit 1-2-8：, then basic point can not be updated to No. 8 points；
Therefore, 0,1,2 closed circuit is constituted, basic point is back at 0 point, while collection will be waited for be updated to { 3,4,5,6,7,8 }, on line Collection is updated to { 1,2 }.
Cargo most No. 4 points of emphasis and basic point is updated to No. 4 points in chosen area, it is adjacent with No. 4 points in scanning area and Line will not cause the point with follow-up closed circuit crossing elimination, it is known that No. 5 points and No. 3 points meet condition, while adjacent No. 4 Point cargo is most heavy, then preferential analysis circuit 4-5.
Circuit 4-5：, then basic point can update No. 5 points；
Circuit 4-3：, then basic point can update No. 3 points；
Compare two lines road, the rate of actual loading of circuit 4-5 is more than circuit 4-3, then access line 4-5 and basic point is updated to No. 5 Point.
And line adjacent with No. 5 points will not cause the point with follow-up closed circuit crossing elimination in scanning area, it is known that No. 6 Point meets condition.
Circuit 4-5-6：, then basic point can not be updated to No. 6 points.
Therefore, 0,4,5 closed circuit is constituted, basic point is back at 0 point, while collection will be waited for be updated to { 3,6,7,8 }, on line Collection is updated to { 1-2,4-5 }.
Cargo most No. 6 points of emphasis and basic point is updated to No. 6 points in chosen area, it is adjacent with No. 6 points in scanning area and Line will not cause the point with follow-up closed circuit crossing elimination, it is known that No. 7 points meet condition.
Circuit 6-7：, then basic point update No. 7 points.
And line adjacent with No. 7 points will not cause the point with follow-up closed circuit crossing elimination in scanning area, it is known that not have It receives and a little meets condition.
Therefore, 0,6,7 closed circuit is constituted, basic point is back at 0 point, while collection will be waited for be updated to { 3,8 }, and collection on line is more Newly at { 1-2,4-5,6-7 }.
Cargo most No. 8 points of emphasis and basic point is updated to No. 8 points in chosen area, it is adjacent with No. 8 points in scanning area and Line will not cause the point with follow-up closed circuit crossing elimination, it is known that No. 3 points meet condition.
Circuit 8-3：, then basic point update No. 3 points, and line adjacent with No. 3 points in scanning area It will not cause the point with follow-up closed circuit crossing elimination, it is known that do not receive and a little meet condition.
Therefore, 0,8,3 closed circuit is constituted, basic point is back at 0 point, while collection will be waited for be updated to { }, collection update on line At { 1-2,4-5,6-7,3-8 }.
Step 5.5：When on the line of step 5.4 newest basic point becauseLimitation and next adjoint point can not be updated Or the cargo dead-weight on the circuit is exactly equal to, then basic point is retracted into trans-shipment point again, to constitute a closed circuit；
Table 5 is traffic program tables of data after improving：
Closed circuit Haul distance Load capacity Rate of actual loading
Circuit 0-1-2-0 288 16 0.80
Circuit 0-4-5-0 422 15 0.75
Circuit 0-6-7-0 164 20 1.00
Circuit 0-8-3-0 316 8 0.40
Improved total haul is 1190 as shown in Table 5, and very poor rate of actual loading is 0.60, and the average bearing capacity of unit haul distance
Step 5.6：Repeating the above steps makes to clamp on the rule for integrating and completing to dispense circuit to all consignees in region as empty set It draws.It checks whether dispatching circuit the problem of trans-routing occurs simultaneously, if occurring, involved circuit is split, is returned It is planned again to step 5.3, circuit is dispensed in region, any trans-routing situation is not present；
Step 5.7：According to the dispatching circuit that step 5.6 is formed, it is corresponding to calculate separately out every circuit, every closed circuit Haul distance, dispatching circuit total haul and weighted average haul distance.
Step 6：According to single order scheme, a line rule of receiving is added, as shown in figure 3, obtaining second-order scheme.
Step 6.1：By in line rule it is each receive can only a little connect it is primary make into first connect repeatedly, that is, allow point It criticizes to a same dispatching cargo of receiving；
Step 6.2：Compare the size of every circuit rate of actual loading in single order scheme, preferentially to the closed circuit of rate of actual loading minimum into Row plans that as shown in Table 5, the rate of actual loading of this circuit of 0-8-3-0 is only 0.40 again, is less than other closed circuit rates of actual loading, Therefore the circuit is chosen and is split, collection will be waited for be updated to { 3,8 }；
Step 6.3：Choose wait for cargo in collection most heavy receive a little 8, by receive a little 8 be incorporated to close on rate of actual loading not for 1 closure Among the 0-1-2-0 of circuit, due to, therefore, receives and a little 8 the cargo of 4t is put into closed circuit 0-1-2-0, And the cargo of also surplus 1t needs to dispense；
Again it chooses and waits for that cargo consolidation is most heavy receives a little, become receiving a little 3 at this time, will receive and a little 3 be incorporated to and close on rate of actual loading Among for 1 closed circuit 0-4-5-0, due to,, therefore will receive and a little 3 be fully incorporated circuit 0-4-5-0 In, at the same update waiting integrate { 8 }, it is on line collection be { 1-2-8,4-5-3,6-7 }.
It chooses and waits for that cargo consolidation is most heavy receives a little, become receiving a little 8 at this time, will receive and a little 8 be incorporated to and close on rate of actual loading Among for 1 closed circuit 0-4-5-3-0, due to, and a little 8 only residue 1t that receives, then it will receive a little It is incorporated in circuit 0-4-5-3-0, update, which waits for, to integrate as empty set, and collection on line becomes { 1-2-8,4-5-3-8,6-7 }.
Table 6 is each item data of second-order scheme：
Closed circuit Haul distance Load capacity Rate of actual loading
Circuit 0-1-2-8-0 423 20 1.00
Circuit 0-5-4-3-8-0 660 19 0.95
Circuit 0-6-7-0 164 20 1.00
Improved total haul is 1247 as shown in Table 6, and very poor rate of actual loading is 0.05, and the average bearing capacity of unit haul distance
Step 7：The transport dispatching efficiency of single order scheme is 14.07, and the transport dispatching efficiency of second-order scheme is 19.47, therefore will Second-order scheme is selected as the final solution of end dispatching after this share-car, and implements to dispense.
Above-described specific implementation mode has carried out further the purpose of the present invention, technical solution and advantageous effect It is described in detail, it should be understood that the foregoing is merely the specific implementation mode of the present invention, the guarantor being not intended to limit the present invention Range is protected, all within the spirits and principles of the present invention, any modification, equivalent substitution, improvement and etc. done should all be contained in this hair Within bright protection domain.

Claims (7)

1. a kind of goods delivery method of shipping share-car end, which is characterized in that include the following steps：
Step 1：Distribution information is extracted from share-car database；
Step 2：Transport power to carrying unit is planned as a whole；
Step 3：Calculate real road distance of the trans-shipment point service range consignee apart from trans-shipment point；
Step 4：The initial of goods delivery is made according to distribution information, the transport power ability of acknowledgement of consignment unit and real road distance Scheme；
Step 5：According to initial scheme, optimize its transportation cost, plans that distribution project obtains single order scheme again；
Step 6：According to single order scheme, a line rule of receiving is added, obtains second-order scheme；
Step 7：Single order scheme and second-order scheme are compared, select conevying efficiency highest distribution project as trans-shipment point pair In the final distribution project of this share-car cargo.
2. the goods delivery method of shipping share-car according to claim 1 end, it is characterised in that：Match in step 1 and delivers letters Breath includes consignee's quantity, Description of Goods, cargo type, goods weight, transhipment ground, destination, loading time and receives the time, Wherein, consignee's quantity, goods weight and destination are transport final word, and Description of Goods, quantity of goods, turns cargo type Fortune ground, destination, loading time and time of receiving are transport front-end information, trans-shipment point number 0 are indicated, operation final word In consignee's i labels, wherein i, j ∈ (1,2,3......n), the corresponding goods weight of i-th of consignee are expressed as Qi (unit kg).
3. the goods delivery method of shipping share-car according to claim 2 end, it is characterised in that：Plan as a whole letter in step 2 Breath includes driver's quantity, lorry quantity, lorry quantity is expressed as k described in lorry model and load-carrying, wherein k ∈ (1,2, 3...n)；The load-carrying of kth lorry is expressed as Qk, unit kg.
4. the goods delivery method of shipping share-car according to claim 1 end, it is characterised in that：It will measuring and calculating in step 3 Transportation range table is made in real road distance of the trans-shipment point service range consignee apart from trans-shipment point.
5. the goods delivery method of shipping share-car according to claim 1 end, it is characterised in that：Cargo is matched in step 4 The initial scheme sent is as follows：
Step 4.1：All consignees in trans-shipment point service range are scanned, confirm the levels of precision of transportation range table；
Step 4.2：Since trans-shipment point 0, connect each consignee, wherein each consignee only connect it is primary and only with transhipment Point 0 constitutes closed circuit；
Step 4.3：The distance for calculating each closed circuit completes total distance O and each that all closed circuits need The very poor R of the rate of actual loading of vehicle and rate of actual loading on closed circuit, wherein rate of actual loading is expressed as
Step 4.4：According to calculated each item data in step 4.3, dispatching initial scheme is formed, and wait for new with next stage The comparison of scheme.
6. the goods delivery method of shipping share-car according to claim 1 end, it is characterised in that：Single order side in step 5 Case is as follows：
Step 5.1：All consignees in trans-shipment point service range are scanned, confirm the levels of precision of transportation range table；
Step 5.2：It establishes and waits for collection and collection on line, still will be put into waiting collection for the consignee of layout of roads is added, be added Consignee be put into collection on line；
Step 5.3：The most heavy conduct first of dispatching goods weight needed for consignee in chosen area is concentrated to be closed back from waiting for First point of road is updated to first from trans-shipment point for basic point and receives a little；
Step 5.4：It is received a little for basic point with first, into region, other maximum points of and weight adjacent with new basic point are soundd out Property connection, if connected it is next receive a little needed for dispense cargo plus current basic point need dispatching goods weight be no more than Qk, then concentrated from waiting and extract next entrance set of matches of receiving out, while updating basic point, if the overload of basic point and subsequent point Cross Qk, then choose a time heavy conduct of receiving in basic point neighborhood and newly sound out a little；
Step 5.5：When on line newest basic point because of QkLimitation and the load on next adjoint point or the circuit can not be updated Goods amount is exactly equal to Qk, then basic point is retracted into trans-shipment point again, to constitute a closed circuit；
Step 5.6：Make to clamp on the rule for integrating and completing to dispense circuit to all consignees in region as empty set according to above-mentioned steps It draws, while checking whether dispatching circuit the problem of trans-routing occurs, if occurring, involved circuit is split, is returned It is planned again to step 5.3, circuit is dispensed in region, any trans-routing situation is not present；
Step 5.7：Circuit is dispensed according to step, calculates separately out the fortune of the corresponding rate of actual loading U of every circuit, every closed circuit Away from, dispatching circuit total haul and unit haul distance average bearing capacity.
7. the goods delivery method of shipping share-car according to claim 1 end, it is characterised in that：Second order side in step 6 Case is as follows：
Step 6.1：By in line rule it is each receive can only a little connect it is primary make into first connect repeatedly, that is, allow in batches to A same dispatching cargo of receiving；
Step 6.2：Compare the size of every circuit rate of actual loading in single order scheme, preferentially to the closed circuit of rate of actual loading minimum into Row is planned and updates waiting collection again；
Step 6.3：Choosing to wait for concentrates required most heavy the receiving of dispatching cargo the new basic point of conduct and to be incorporated to new basic point neighbouring Rate of actual loading does not do exploratory connection for 1 closed circuit, if newly being closed after the closed circuit that it is 1 that periphery rate of actual loading, which is added, or not new basic point Close the ∑ Q in circuiti>Qk, then cargo will be dispensed needed for new basic point and is divided into two parts, and a part is classified as current exploratory closed circuit In, so that its rate of actual loading is equal to 1, the part exceeded then enables Qiy=∑ Qi-Qk, next circuit of waiting connects simultaneously that new basic point institute is right The weight for the need dispatching cargo answered is from QiIt is updated to QiyIf newly being closed after the closed circuit that it is 1 that periphery rate of actual loading, which is added, or not new basic point Close the ∑ Q in circuiti≤Qk, then current new basic point is directly included into exploratory closed circuit, and update and wait for collection and collection on line；
Step 6.4：Repeat step 6.2,6.3 implementation procedures, until all the points have constituted closed circuit and can not continue to split, Meanwhile calculate separately out the corresponding rate of actual loading U of every new line, the haul distance of every closed circuit, dispatching circuit total haul and The average bearing capacity of unit haul distance.
CN201810350655.XA 2018-04-18 2018-04-18 Cargo distribution method for tail end of freight car Active CN108805481B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810350655.XA CN108805481B (en) 2018-04-18 2018-04-18 Cargo distribution method for tail end of freight car

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810350655.XA CN108805481B (en) 2018-04-18 2018-04-18 Cargo distribution method for tail end of freight car

Publications (2)

Publication Number Publication Date
CN108805481A true CN108805481A (en) 2018-11-13
CN108805481B CN108805481B (en) 2021-10-26

Family

ID=64095651

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810350655.XA Active CN108805481B (en) 2018-04-18 2018-04-18 Cargo distribution method for tail end of freight car

Country Status (1)

Country Link
CN (1) CN108805481B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109685410A (en) * 2018-11-16 2019-04-26 南京大学 A kind of share-car method for light alveolitoid cargo transport
CN109711789A (en) * 2019-01-22 2019-05-03 北京顺丰同城科技有限公司 A kind of dispatching method of determining range and device
CN110580546A (en) * 2019-08-26 2019-12-17 安徽师范大学 route planning method and system based on same vehicle carrier and goods
CN111652438A (en) * 2020-06-04 2020-09-11 上海燕汐软件信息科技有限公司 Dynamic optimization method and device for logistics line
CN112801593A (en) * 2021-02-09 2021-05-14 北京橙心无限科技发展有限公司 Method and device for generating distribution scheme

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105023126A (en) * 2014-04-28 2015-11-04 杨超 Logistics speedy receiving and sending delivery method based on mobile terminal and system thereof
CN106485913A (en) * 2016-12-09 2017-03-08 巫溪县致恒科技有限公司 A kind of Carpooling system
CN106709688A (en) * 2017-01-03 2017-05-24 南京大学 Vehicle pooling method of freight vehicle-pooling platform
US20170169396A1 (en) * 2015-12-11 2017-06-15 Cybertan Technology, Inc. Transport and transportation systems and method for same

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105023126A (en) * 2014-04-28 2015-11-04 杨超 Logistics speedy receiving and sending delivery method based on mobile terminal and system thereof
US20170169396A1 (en) * 2015-12-11 2017-06-15 Cybertan Technology, Inc. Transport and transportation systems and method for same
CN106485913A (en) * 2016-12-09 2017-03-08 巫溪县致恒科技有限公司 A kind of Carpooling system
CN106709688A (en) * 2017-01-03 2017-05-24 南京大学 Vehicle pooling method of freight vehicle-pooling platform

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109685410A (en) * 2018-11-16 2019-04-26 南京大学 A kind of share-car method for light alveolitoid cargo transport
CN109711789A (en) * 2019-01-22 2019-05-03 北京顺丰同城科技有限公司 A kind of dispatching method of determining range and device
CN110580546A (en) * 2019-08-26 2019-12-17 安徽师范大学 route planning method and system based on same vehicle carrier and goods
CN111652438A (en) * 2020-06-04 2020-09-11 上海燕汐软件信息科技有限公司 Dynamic optimization method and device for logistics line
CN111652438B (en) * 2020-06-04 2024-04-19 上海燕汐软件信息科技有限公司 Dynamic optimization method and device for logistics line
CN112801593A (en) * 2021-02-09 2021-05-14 北京橙心无限科技发展有限公司 Method and device for generating distribution scheme

Also Published As

Publication number Publication date
CN108805481B (en) 2021-10-26

Similar Documents

Publication Publication Date Title
CN108805481A (en) A kind of goods delivery method of shipping share-car end
Havenga et al. Freight logistics’ contribution to sustainability: Systemic measurement facilitates behavioural change
CN105069593A (en) Logistics integrated transportation method and system based on social idle resources
CN106803136A (en) A kind of fresh dispatching real-time optimization method based on genetic algorithm
CN104021488A (en) Goods freight calculating method and device, and mobile terminal
Wagener Intermodal logistics centres and freight corridors-concepts and trends
Prentice et al. Concepts of transportation economics
KR100613858B1 (en) Method of vehicle assignment for logistic workflow
CN108038649A (en) Transportation management method and system
CN113705966B (en) Vehicle transportation scheduling method for meeting road load rate in closed factory
Khalipova et al. Development of a model for the integrated management of the international delivery chains formation
CN112069391B (en) Geohash-based cargo forward road carpooling method
Menukhova et al. Intelligent system for centralized freight traffic planning
Krzyżewska Problems in the organisation of the transport process on the international market
KR101738489B1 (en) Intermediating apparatus for cargo transportation based on online-to-offline
Tweddle et al. Impact of the Channel Tunnel: A Survey of Anglo-European Unitised Freight. Results of the Phase II Interviews.
Jauernig et al. International logistics in Lithuania at a time of transition
US20230332906A1 (en) System and method for loading a vehicle trailer
Van der Mescht Revisiting the road versus rail debate
Syahraini et al. A Decision Model For Tackling Logistic Optimization Problem in Online Business Environment
ESCAP Strengthening transport connectivity between the Republic of Korea and Europe through the UNESCAP Eurasian transport corridors
Primachenko DEVELOPMENT OF INTERMODAL TRANSPORT AND LOGISTICS SCHEMES FOR PASSENGER TRANSPORTATION BY RAILWAY TRANSPORT WITHIN UKRAINEEUROPE DIRECTION
Havenga et al. Future demand for heavy freight vehicles in South Africa
CN114693201A (en) Logistics information processing method, device, equipment and storage medium
ESCAP Planning, development and operation of dry ports of international importance

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