CN108985597A - A kind of dynamic logistics dispatching method - Google Patents
A kind of dynamic logistics dispatching method Download PDFInfo
- Publication number
- CN108985597A CN108985597A CN201810713626.5A CN201810713626A CN108985597A CN 108985597 A CN108985597 A CN 108985597A CN 201810713626 A CN201810713626 A CN 201810713626A CN 108985597 A CN108985597 A CN 108985597A
- Authority
- CN
- China
- Prior art keywords
- point
- order
- request
- path
- newly
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (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)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of dynamic logistics dispatching methods.It is an object of the invention to the requests of real-time response dynamic logistics, and the request of real-time dynamic logistics is updated into existing logistics distribution path, optimal vehicle delivery path is re-formed, so that preset target optimizes.The dispatching method can increase order dynamic requests newly and request of recalling an order with quick response, in response to newly-increased order request, carry out newly-increased order insertion invention introduces a kind of real-time insertion algorithm and calculate；In response to request of recalling an order, the processing scheme of request in varied situations of recalling an order is optimized in the present invention.The present invention requests for efficient quickly response dynamics logistics, the degree of fitting of newly-increased order and distribution route is introduced, degree of fitting is bigger, and the feasibility that newly-increased order request is added to the distribution route is higher, after introducing degree of fitting, the calculating cost of newly-increased order selection distribution route can be greatly reduced.
Description
Technical field
The invention belongs to Logistic Scheduling fields, and in particular to dynamic logistics request scheduling method and a kind of real-time insertion method
It realizes.
Background technique
Under the promotion energetically of economic development, present logistics becomes the important component of business administration, not only due to object
Stream occupies higher ratio in enterprise's totle drilling cost, even more because of influence of the logistics activity to enterprises service level, outstanding object
Stream service directly influences client to the loyalty of enterprise, therefore, reduces logistics consuming cost, has improved logistics operational efficiency
As generally acknowledged one of the important channel that can effectively improve enterprise competitiveness.In previous logistics distribution activity, enterprise is all
Batch orders are subjected to static allocation dispatching, and with Communication in China network, quick popularize of smart phone means of communication adds
The convenient feature of electric business shopping, the people issue logistics request whenever and wherever possible and have become a kind of normality.In face of this real-time
Dynamic logistics request, the ability for needing materials circulation delivery service to have quick response handle dynamic logistics request as early as possible.This
Kind capability of fast response has become one of core competitiveness of enterprise.
Logistics distribution on the way, for weight, for the biggish cargo of volume, if unloaded, cargo is located just
In compartment outermost layer, then without carrying out the additional lay day moved forwarder valence, reduce in logistics distribution, greatly improve
Logistics distribution experience.And at present both at home and abroad in dynamic logistics request scheduling consider this order in cargo it is advanced after
The research of restrictive condition is few out, and there is also dynamic dispatchings to solve many deficiencies such as overlong time.
Summary of the invention
In order to which more efficient response dynamics logistics is requested and guarantees that order cargo follows restrictive condition first-in last-out, this hair
It is bright to propose a kind of dynamic logistics dispatching method.
The purpose of the present invention is realized at least through one of following technical solution.
A kind of dynamic logistics dispatching method, it is characterised in that the request of real-time response dynamic logistics, by real-time dynamic logistics
Request is updated into existing logistics distribution path, re-forms optimal vehicle delivery path, so that path new after updating
Cost and the difference of original path cost are minimum.
Further, real-time dynamic logistics request includes newly-increased order request and request of recalling an order.
Further, the corresponding order of every kind of dynamic requests all includes the volume, weight and type of merchandize of cargo；Every kind dynamic
State request is all comprising a picking request and a delivery request；Picking request corresponds to a picking address, delivery request
One Shipping Address, picking address and Shipping Address belong to different address.
Further, the picking request and delivery of dynamic requests are requested, picking movement has to act it in delivery
Preceding generation.
Further, it for increasing the processing of order request newly, introduces real-time insertion algorithm and is inserted into order and have dispatching
In path, real-time insertion algorithm includes the following steps:
(1) newly-increased order request is generated into picking task and delivery task according to picking request and delivery request respectively；
(2) for two tasks newly-generated in (1), the company between address of the degree of fitting for calculating two tasks is introduced
The fitting degree of line and existing distribution route；
(3) successively selection with the newly-increased highest distribution route of order degree of fitting, is introduced into greediness insertion algorithm will be in step (1)
Two tasks be inserted into distribution plan route, until finding the newly-increased the smallest route of cost；
(4) distribution route is updated.
Further, the greedy insertion algorithm includes:
1) vehicle projected trip route is represented with R, directed line segment PD is by increasing the picking task point of order demand X newly and sending
Straight-line segment determined by goods task point；The point nearest from point P and D is P' and D', compare traveling before and after P to be inserted into P' away from
From variation, if be inserted into the total travel distance before P' be less than insertion P' point after total travel distance, by P be inserted into P' it
Before, and check whether the load-carrying of insertion P point rear vehicle and the restrictive condition first-in last-out of volume and the last order of vehicle are expired
P point is continued to migrate into path R and be inserted into, met until finding all above-mentioned conditions by foot if cannot be met
Logistics distribution sequence, P can be inserted into the sequence point；It is on the contrary then after P is inserted into P', and as described above successively backward
Searching meets vehicle load, the logistics distribution sequence of volume and first-in last-out restrictive condition, can be with until finding some sequence
Meet above-mentioned all restrictive conditions, then P point greediness insertion is completed；
2) compare the operating range variation before and after D to be inserted into D', if being inserted into the total travel distance before D' is less than insertion
Total travel distance after D' point before D is then inserted into D', and checks that each order is first-in last-out in the rear car for being inserted into D point
Whether restrictive condition obtains meeting and whether P point is before D point, if not being able to satisfy the condition first-in last-out but satisfaction of each order
D point then can be continued to be inserted into path forward by P point before D point；It, must be by D if being unsatisfactory for P point before D point
Point is inserted into backward in path, restrictive condition or meets P point until D point first-in last-out until both meeting each order；Otherwise by D
After point insertion D', check whether above-mentioned two restrictive condition is met, if all meeting, then the greedy insertion process of D point
Terminate, is otherwise inserted into D' continuation in path backward, until meeting above-mentioned two restrictive condition.
Further, it is requested for cancelling the dynamic logistics of original order request, directly the dispatching by order belonging to it
It is deleted in route, then introduces tabu search algorithm and re-optimization calculating is carried out to the distribution route after deleting order.
Further, the implementation procedure of tabu search algorithm is as follows:
1) for path R, route is calculated apart from cost value f (R)；
2) initialization path time gap matrix M, taboo list T, history optimal path cost best_f；
3) judge whether that meeting termination condition is unsatisfactory for continuing to execute, satisfaction then stops；
4) neighborhood for constructing R, is indicated with N (S)；
5) in calculating field N (S) all paths cost value；
6) best taboo or non-taboo movement with minimal path cost value are found；
7) best taboo movement is executed if meeting hope condition, otherwise executes best non-taboo movement；
8) current path, path cost value f, history optimal path cost best_f, taboo list are updated；
9) step (3) are executed.
Further, updated distribution plan route must satisfy the restrictive condition of cargo first-in last-out, the elder generation of cargo
Refer into rear restrictive condition out, in the delivery request of Service Order, the cargo of order must be in the compartment outermost layer of vehicle.
Further, updated distribution plan must assure that the load-carrying of vehicle and volumetric constraint are guaranteed.
Compared with prior art, the invention has the advantages that and technical effect: the present invention for increase newly order request, lead to
It crosses a kind of real-time insertion algorithm newly-increased order is added in existing Distribution path；For recall an order request, using directly from
The method that corresponding two task nodes of order are deleted in distribution route recycles tabu search algorithm corresponding to order is deleted
Distribution route after two task nodes carries out re-optimization；In order to which efficient quickly response dynamics logistics is requested, for inserting in real time
Enter algorithm, introduce the degree of fitting of newly-increased order and distribution route, degree of fitting is used to estimate that newly-increased order request is added to certain
The probability of route.Degree of fitting is bigger, and the feasibility that newly-increased order request is added to the distribution route is higher, introduces degree of fitting
Afterwards, the calculating cost of newly-increased order selection distribution route can be greatly reduced.
Detailed description of the invention
Fig. 1 dynamic logistics scheduling flow figure.
Fig. 2 is newly-increased order request and vehicle delivery route relational graph.
Fig. 3 is whether vehicle delivery route meets restrictive condition schematic diagram first-in last-out.
Specific embodiment
In order to which technical solution of the present invention and advantage are more clearly understood, below in conjunction with attached drawing, carry out further detailed
It is without being limited thereto to describe bright but of the invention implementation and protection in detail.
1. dynamic logistics request is handled
Fig. 1 is dynamic logistics scheduling flow figure, wherein requesting detailed processing side for increasing order request newly and recalling an order
Method is as follows:
1.1 newly-increased order request processing methods
Enterprise carries out logistics distribution service on the way, and control centre receives newly-increased order request, and there are two types of choosings for enterprise at this time
It selects.The first selection is to accept an order；Second is selection refusal order.Present invention primarily contemplates the scheduling in the case of the first
Method, materials circulation control centre is gathered around there are two types of selection at this time, the first selection is selection one without any dispatching task
Vehicle goes to service newly-increased order；Second selection be consider newly-increased order is added in existing distribution plan, with save at
This, if second of selection is unable to satisfy demand, considers the first selection.
Attached drawing 1 describes the relationship of newly-increased order request Yu existing certain distribution plan route, and directed line segment PD is by new
Straight-line segment determined by the picking task point and delivery task point of single demand X is revised and enlarged, directing curve R represents vehicle projected trip
Route, the intermediate node in curve R represent vehicle transit point.For the degree of fitting for calculating line segment PD and curve R, steps are as follows: 1)
It is found out respectively from each approach point set of curve R with point P and D nearest point P' and D', defining the straight line that P'D' is determined is
R'；Assuming that P' and D' is overlapped, then any one point in P and D is selected, reselects one with next closest approach as newly nearest
Point, such as select the secondary closest approach of P as P'；2) defining PD with the angle of R' is α, α ∈ [0, π], then calculating newly-increased order needs
Ask X with the degree of fitting of vehicle projected trip route are as follows:
Wherein | P'-P |, | D'-D | for the distance between two o'clock, C > 0 is constant, and usually taking C is place map area space
Radius." average distance " between obvious line segment PD and P'D' is bigger, and angle α is smaller, then FxIt is bigger.Work as FxWhen approaching 1, generation
Table increases order newly and vehicle projected trip route degree of fitting is higher, otherwise smaller.Only described in attached drawing 1 newly-increased order request with
The degree of fitting of a certain route calculates, for the degree of fitting meter of other distribution routes of the same city of enterprise and this newly-increased order request
It calculates, method is same as above with calculation formula.
Newly-increased order and all just after the degree of fitting of distribution route is being obtained, from high to low according to degree of fitting, will increased newly
Two tasks that order generates are inserted it into distribution route using greedy insertion algorithm.The implementation process of greedy insertion algorithm
It is as follows:
3) as shown in Fig. 2, compare the operating range variation before and after P to be inserted into P', if being inserted into the total travel before P'
Distance is less than the total travel distance after insertion P' point, then before P being inserted into P', and checks the load-carrying of insertion P point rear vehicle
Whether met with the restrictive condition first-in last-out of order each in volume and vehicle, if cannot be met, by P point after
Continue and migrate insertion into path R, P can be inserted by the logistics distribution sequence met until finding all above-mentioned conditions
The sequence point.It is on the contrary then after P is inserted into P', and successively find backward meet vehicle load, volume and elder generation as described above
Logistics distribution sequence into rear restrictive condition out can satisfy above-mentioned all restrictive conditions, then P point until finding some sequence
Greediness insertion is completed.
4) as shown in Fig. 2, compare the operating range variation before and after D to be inserted into D', if being inserted into the total travel before D'
Distance is less than the total travel distance after insertion D' point, then before D being inserted into D', and checks and respectively order in the rear car for being inserted into D point
Whether single restrictive condition first-in last-out obtains meeting and whether P point before D point, if be not able to satisfy each order it is advanced after
Condition but meet P point before D point out, then can continue be inserted into path forward by D point；If be unsatisfactory for P point D point it
Before, then D point must be inserted into path backward, restrictive condition or meet P point in D point first-in last-out until both meeting each order
Before.Otherwise after D point is inserted into D', check whether above-mentioned two restrictive condition is met, if all meeting, then D point
Greedy insertion process terminates, and is otherwise inserted into D' continuation in path backward, until meeting above-mentioned two restrictive condition.
During executing greedy insertion algorithm, needs to meet after distribution route meets the click-through of cargo and goes out restrictive condition,
Fig. 3 illustrates satisfaction restrictive condition and certain distribution route being unsatisfactory under restrictive condition first-in last-out first-in last-out, the left side Fig. 3
Describe satisfaction restrictive condition first-in last-out, it is found that under this dispatching sequence, all will not in the task point of any order
It generates and first carries partial cargo and get off and could correctly unload the cargo of this task point, be then unsatisfactory for such limitation on the right of Fig. 3, it can
When being serviced with discovery to the delivery task to order 1, needs first first to carry the cargo of task 2 and get off, could complete
The cargo of order 1 unloads, and also needs the cargo by task 2 to carry again later and gets on the bus, thus brings extra carry cost.Therefore full
The limitation first-in last-out of sufficient cargo can be significantly reduced additional carrying cost, improve logistics service experience.
If above-mentioned algorithm is unable to satisfy the processing of newly-increased order request, control centre sends new car to go to service this dynamic
Request.
1.2 recall an order processing method
When control centre be connected to recall an order request when, at this time there are two types of situation, a kind of situation is that the picking of the order is appointed
Business has been completed, and second situation is that the picking task of the order does not complete also.
For the first case, which can not be cancelled, but can convert thereof into a newly-increased order request, should
The picking task of newly-increased order request is the former delivery task recalled an order, and delivery task is the former picking task recalled an order.
Dispatching task will continue to be dispensed, but newly-increased order request refers to and increases order request method in above-mentioned 1.1 newly, needs
Service vehicle of the newly-increased order request is not necessarily the service vehicle of former request of recalling an order when bright, specifically by which vehicle into
Row dispatching, is determined by the algorithm in 1.1.
And for second situation, goods task is fetched and delivered after being deleted in Distribution path by two belonging to the order,
It needs to carry out re-optimization to the Distribution path after deletion order.Path is optimized using tabu search algorithm, the present invention
The implementation procedure of middle tabu search algorithm is as follows:
1) it for path R, calculates path cost value f (R)；
2) initialization path time gap matrix M, taboo list T, history optimal path cost best_f；
3) judge whether tabu search algorithm the number of iterations is more than or equal to setting maximum number of iterations, be unsatisfactory for, continue to hold
Row meets then algorithm and stops executing；
4) neighborhood for constructing R, is indicated with N (S)；
5) in calculating field N (S) all paths cost value；
6) best taboo or non-taboo movement with minimal path cost value are found；
7) best taboo movement is executed if meeting hope condition, otherwise executes best non-taboo movement；
8) current path, path cost value f, history optimal path cost best_f, taboo list are updated；
9) step (3) are executed；
Wherein f (R) is route apart from cost, and taboo list T depth is 5, and hope condition refers to optimal in field N (S)
Solution is all worse than the optimal solution in taboo list, if meeting this condition, executes taboo movement, otherwise executes non-taboo movement, R's
Steps are as follows for field construction algorithm:
1) the picking task and corresponding delivery task for selecting an order from the R of path at random, then insert it again
Enter into path R, the new route after insertion needs to meet the load-carrying of vehicle and the restrictive condition first-in last-out of volume and each order
Met.
If 2) newly-generated path is added in field not in field, repeat step 1) 10 times.
Claims (10)
1. a kind of dynamic logistics dispatching method, it is characterised in that real-time dynamic logistics are asked in the request of real-time response dynamic logistics
It asks update into existing logistics distribution path, re-forms optimal vehicle delivery path, so that path generation new after updating
The difference of valence and original path cost is minimum.
2. a kind of dynamic logistics dispatching method according to claim 1, it is characterised in that real-time dynamic logistics request includes
Newly-increased order request and request of recalling an order, path cost is vehicle driving distance.
3. a kind of dynamic logistics dispatching method according to claim 2, it is characterised in that every kind of dynamic requests are corresponding to be ordered
Single all includes volume, weight and the type of merchandize of cargo；Every kind of dynamic requests all include that a picking request and a delivery are asked
It asks；Picking request is for a picking address, and a corresponding Shipping Address is requested in delivery, and picking address and Shipping Address belong to not
Same address.
4. a kind of dynamic logistics dispatching method according to claim 3, it is characterised in that the picking of dynamic requests is asked
Delivery of summing is requested, and picking movement has to occur before delivery acts.
5. a kind of dynamic logistics dispatching method according to claim 2, it is characterised in that for increasing the place of order request newly
Reason, is introduced into real-time insertion algorithm and order is inserted into existing Distribution path, real-time insertion algorithm includes the following steps:
(1) newly-increased order request is generated into picking task and delivery task according to picking request and delivery request respectively；
(2) for two tasks newly-generated in (1), introduce degree of fitting be used to calculate line between the address of two tasks with
The fitting degree of existing distribution route；
(3) successively selection and the newly-increased highest distribution route of order degree of fitting, are introduced into greediness insertion algorithm for two in step (1)
A task is inserted into distribution plan route, until finding the newly-increased the smallest route of cost；
(4) distribution route is updated.
6. a kind of dynamic logistics dispatching method according to claim 5, it is characterised in that it is described greediness insertion algorithm include:
Vehicle projected trip route is represented with R, directed line segment PD is the picking task point and delivery task by increasing order demand X newly
Straight-line segment determined by point；The point nearest from point P and D is P' and D', compares the operating range before and after P to be inserted into P' and becomes
Change, if being inserted into the total travel distance that the total travel distance before P' is less than after insertion P' point, before P is inserted into P', and
Whether the restrictive condition first-in last-out of the load-carrying and volume and the last order of vehicle that check insertion P point rear vehicle is met, such as
Fruit cannot be met, then continue to migrate into path R by P point and be inserted into, the object met until finding all above-mentioned conditions
Dispatching sequence is flowed, P can be inserted into the sequence point；It is on the contrary then after P is inserted into P', and successively find backward as described above
Meet vehicle load, the logistics distribution sequence of volume and first-in last-out restrictive condition can satisfy until finding some sequence
Above-mentioned all restrictive conditions, then P point greediness insertion are completed；
Compare before and after D to be inserted into D' operating range variation, if be inserted into the total travel distance before D' be less than insertion D' point it
Total travel distance afterwards before D is then inserted into D', and checks the limitation item first-in last-out of each order in the rear car for being inserted into D point
Whether part obtains meeting and whether P point is before D point, if not being able to satisfy the condition first-in last-out of each order but meeting P point in D
Before point, then D point can be continued to be inserted into path forward；It, must be by D point backward if being unsatisfactory for P point before D point
It is inserted into path, restrictive condition or meets P point until D point first-in last-out until both meeting each order；Otherwise D point is inserted into
After D', check whether above-mentioned two restrictive condition is met, if all meeting, then the greedy insertion process of D point terminates, no
Then D' continuation is inserted into path backward, until meeting above-mentioned two restrictive condition.
7. a kind of dynamic logistics dispatching method according to claim 2 or 6, which is characterized in that for cancelling original order
The dynamic logistics of request are requested, and directly delete order from the distribution route belonging to it, then introduce tabu search algorithm pair
Distribution route after deleting order carries out re-optimization calculating.
8. a kind of dynamic logistics dispatching method according to claim 7, which is characterized in that the execution of tabu search algorithm
Journey is as follows:
1) for path R, route is calculated apart from cost value f (R)；
2) initialization path time gap matrix M, taboo list T, history optimal path cost best_f；
3) judge whether that meeting termination condition is unsatisfactory for continuing to execute, satisfaction then stops；
4) neighborhood for constructing R, is indicated with N (S)；
5) in calculating field N (S) all paths cost value；
6) best taboo or non-taboo movement with minimal path cost value are found；
7) best taboo movement is executed if meeting hope condition, otherwise executes best non-taboo movement；
8) current path, path cost value f, history optimal path cost best_f, taboo list are updated；
9) step (3) are executed.
9. a kind of dynamic logistics dispatching method according to claim 5, which is characterized in that updated distribution plan road
Line must satisfy the restrictive condition of cargo first-in last-out, and the restrictive condition first-in last-out of cargo refers to, in the delivery of Service Order
When request, the cargo of order must be in the compartment outermost layer of vehicle.
10. a kind of dynamic logistics dispatching method according to claim 5, which is characterized in that updated distribution plan must
It must guarantee that the load-carrying of vehicle and volumetric constraint are guaranteed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810713626.5A CN108985597B (en) | 2018-06-29 | 2018-06-29 | Dynamic logistics scheduling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810713626.5A CN108985597B (en) | 2018-06-29 | 2018-06-29 | Dynamic logistics scheduling method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108985597A true CN108985597A (en) | 2018-12-11 |
| CN108985597B CN108985597B (en) | 2021-11-19 |
Family
ID=64539918
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810713626.5A Active CN108985597B (en) | 2018-06-29 | 2018-06-29 | Dynamic logistics scheduling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108985597B (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110231044A (en) * | 2019-06-10 | 2019-09-13 | 北京三快在线科技有限公司 | A kind of paths planning method and device |
| CN110334723A (en) * | 2019-04-12 | 2019-10-15 | 成都服务生科技有限公司 | A kind of pair of increased luggage of dynamic fetches and delivers the luggage that order is scheduled and fetches and delivers dispatching method |
| CN110956384A (en) * | 2019-11-26 | 2020-04-03 | 拉扎斯网络科技（上海）有限公司 | Distribution task processing method and device, electronic equipment and readable storage medium |
| CN111191847A (en) * | 2019-12-31 | 2020-05-22 | 苏宁云计算有限公司 | Distribution path planning method and system considering order polymerization degree |
| CN111260276A (en) * | 2019-12-16 | 2020-06-09 | 杭州长策科技有限公司 | Logistics method and system for rapidly performing real-time dynamic route planning |
| CN111325502A (en) * | 2020-02-07 | 2020-06-23 | 北京三快在线科技有限公司 | Line calculation method and device, electronic equipment and readable storage medium |
| CN111461624A (en) * | 2020-04-20 | 2020-07-28 | 上海东普信息科技有限公司 | Logistics line planning method, device, equipment and storage medium |
| CN111695850A (en) * | 2020-04-22 | 2020-09-22 | 时时同云科技(成都)有限责任公司 | Distribution line generation method, device and equipment |
| CN112001064A (en) * | 2020-07-29 | 2020-11-27 | 浙江大学 | Full-autonomous water transport scheduling method and system between container terminals |
| CN112016872A (en) * | 2020-08-31 | 2020-12-01 | 杭州拼便宜网络科技有限公司 | Distribution method, distribution device, electronic equipment and computer readable storage medium |
| CN113052539A (en) * | 2021-04-12 | 2021-06-29 | 上海东普信息科技有限公司 | Logistics distribution task scheduling method, device, equipment and storage medium |
| CN113592275A (en) * | 2021-07-23 | 2021-11-02 | 深圳依时货拉拉科技有限公司 | Freight scheduling method, computer-readable storage medium and computer equipment |
| WO2022021119A1 (en) * | 2020-07-29 | 2022-02-03 | 浙江大学 | Method and system for fully autonomous waterborne transport scheduling between container terminals |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104616490A (en) * | 2015-02-17 | 2015-05-13 | 北京九五智驾信息技术股份有限公司 | Car sharing method |
| CN105046338A (en) * | 2015-08-24 | 2015-11-11 | 扬州大学 | Intelligent express distribution method on mobile platform |
| CN107145971A (en) * | 2017-04-18 | 2017-09-08 | 苏州工业职业技术学院 | A kind of express delivery dispatching optimization method of dynamic adjustment |
| CN107194575A (en) * | 2017-05-19 | 2017-09-22 | 重庆大学 | It is a kind of to handle the vehicle autonomy dispatching method that express delivery increases pickup demand newly |
| CN107194513A (en) * | 2017-05-26 | 2017-09-22 | 中南大学 | A kind of optimization method for solving full channel logistics distribution |
-
2018
- 2018-06-29 CN CN201810713626.5A patent/CN108985597B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104616490A (en) * | 2015-02-17 | 2015-05-13 | 北京九五智驾信息技术股份有限公司 | Car sharing method |
| CN105046338A (en) * | 2015-08-24 | 2015-11-11 | 扬州大学 | Intelligent express distribution method on mobile platform |
| CN107145971A (en) * | 2017-04-18 | 2017-09-08 | 苏州工业职业技术学院 | A kind of express delivery dispatching optimization method of dynamic adjustment |
| CN107194575A (en) * | 2017-05-19 | 2017-09-22 | 重庆大学 | It is a kind of to handle the vehicle autonomy dispatching method that express delivery increases pickup demand newly |
| CN107194513A (en) * | 2017-05-26 | 2017-09-22 | 中南大学 | A kind of optimization method for solving full channel logistics distribution |
Non-Patent Citations (1)
| Title |
|---|
| 刘丹霞: "基于互联网的同城配送车货匹配模式及路径优化研究", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110334723A (en) * | 2019-04-12 | 2019-10-15 | 成都服务生科技有限公司 | A kind of pair of increased luggage of dynamic fetches and delivers the luggage that order is scheduled and fetches and delivers dispatching method |
| CN110334723B (en) * | 2019-04-12 | 2023-04-07 | 赵志为 | Dynamically-increased baggage picking and delivering order scheduling method |
| CN110231044A (en) * | 2019-06-10 | 2019-09-13 | 北京三快在线科技有限公司 | A kind of paths planning method and device |
| CN110956384A (en) * | 2019-11-26 | 2020-04-03 | 拉扎斯网络科技（上海）有限公司 | Distribution task processing method and device, electronic equipment and readable storage medium |
| CN111260276A (en) * | 2019-12-16 | 2020-06-09 | 杭州长策科技有限公司 | Logistics method and system for rapidly performing real-time dynamic route planning |
| CN111191847B (en) * | 2019-12-31 | 2022-10-14 | 苏宁云计算有限公司 | Distribution path planning method and system considering order polymerization degree |
| CN111191847A (en) * | 2019-12-31 | 2020-05-22 | 苏宁云计算有限公司 | Distribution path planning method and system considering order polymerization degree |
| CN111325502A (en) * | 2020-02-07 | 2020-06-23 | 北京三快在线科技有限公司 | Line calculation method and device, electronic equipment and readable storage medium |
| CN111461624A (en) * | 2020-04-20 | 2020-07-28 | 上海东普信息科技有限公司 | Logistics line planning method, device, equipment and storage medium |
| CN111461624B (en) * | 2020-04-20 | 2023-07-11 | 上海东普信息科技有限公司 | Logistics line planning method, device, equipment and storage medium |
| CN111695850A (en) * | 2020-04-22 | 2020-09-22 | 时时同云科技(成都)有限责任公司 | Distribution line generation method, device and equipment |
| CN111695850B (en) * | 2020-04-22 | 2023-05-26 | 时时同云科技(成都)有限责任公司 | Distribution line generation method, device and equipment |
| CN112001064A (en) * | 2020-07-29 | 2020-11-27 | 浙江大学 | Full-autonomous water transport scheduling method and system between container terminals |
| WO2022021119A1 (en) * | 2020-07-29 | 2022-02-03 | 浙江大学 | Method and system for fully autonomous waterborne transport scheduling between container terminals |
| CN112001064B (en) * | 2020-07-29 | 2022-08-23 | 浙江大学 | Full-autonomous water transport scheduling method and system between container terminals |
| US11886191B2 (en) | 2020-07-29 | 2024-01-30 | Zhejiang University | Scheduling method and system for fully autonomous waterborne inter terminal transportation |
| CN112016872A (en) * | 2020-08-31 | 2020-12-01 | 杭州拼便宜网络科技有限公司 | Distribution method, distribution device, electronic equipment and computer readable storage medium |
| CN113052539A (en) * | 2021-04-12 | 2021-06-29 | 上海东普信息科技有限公司 | Logistics distribution task scheduling method, device, equipment and storage medium |
| CN113592275A (en) * | 2021-07-23 | 2021-11-02 | 深圳依时货拉拉科技有限公司 | Freight scheduling method, computer-readable storage medium and computer equipment |
| CN113592275B (en) * | 2021-07-23 | 2024-03-05 | 深圳依时货拉拉科技有限公司 | Freight dispatching method, computer readable storage medium and computer equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108985597B (en) | 2021-11-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108985597A (en) | A kind of dynamic logistics dispatching method | |
| CN109034481B (en) | Constraint programming-based vehicle path problem modeling and optimizing method with time window | |
| CN108764777B (en) | Electric logistics vehicle scheduling method and system with time window | |
| CN112833905B (en) | Distributed multi-AGV collision-free path planning method based on improved A-x algorithm | |
| CN109214755A (en) | A kind of automatic row single dispatching method in warehousing management | |
| CN108364105A (en) | A kind of purpose optimal method of logistics distribution circuit | |
| Xu et al. | Dynamic pickup and delivery problem with transshipments and LIFO constraints | |
| CN111553548B (en) | Goods picking method and device | |
| CN113074728A (en) | Multi-AGV path planning method based on jumping point routing and collaborative obstacle avoidance | |
| US20200327497A1 (en) | System and method for linehaul optimization | |
| CN114037180B (en) | Collaborative distribution path optimization method based on branch pricing and cutting algorithm | |
| CN113848970B (en) | Multi-target cooperative path planning method for vehicle-unmanned aerial vehicle | |
| CN108564211A (en) | Goods' transportation routing method and system for planning | |
| CN113516429B (en) | Multi-AGV global planning method based on network congestion model | |
| CN112184053A (en) | Task scheduling method, device and equipment | |
| CN113947310A (en) | Workshop material distribution path optimization method | |
| CN114415610A (en) | Robot scheduling method and device, electronic equipment and storage medium | |
| CN110097313B (en) | Method for acquiring a delivery vehicle path with a time window and a first-in last-out limit | |
| CN112633609B (en) | Vehicle path planning method, device, equipment and storage medium | |
| CN112520284B (en) | Goods shelf storage position adjusting method and system | |
| CN113344267A (en) | Logistics network resource allocation optimization method based on cooperation | |
| KR20040072250A (en) | Material control system | |
| CN108921338B (en) | Multi-vehicle workshop logistics transportation scheduling method | |
| CN112598316B (en) | Material distribution and cooperative scheduling method for co-track double AGVs | |
| Li et al. | Efficient Task Planning for Heterogeneous AGVs in Warehouses |
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 |