CN108133290A - A kind of preferential dispatching method of timeliness and system - Google Patents
A kind of preferential dispatching method of timeliness and system Download PDFInfo
- Publication number
- CN108133290A CN108133290A CN201711395763.0A CN201711395763A CN108133290A CN 108133290 A CN108133290 A CN 108133290A CN 201711395763 A CN201711395763 A CN 201711395763A CN 108133290 A CN108133290 A CN 108133290A
- Authority
- CN
- China
- Prior art keywords
- order
- headstock
- time
- vehicle
- cost
- 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
- 238000000034 method Methods 0.000 title claims abstract description 14
- 238000013138 pruning Methods 0.000 claims abstract description 17
- 230000008901 benefit Effects 0.000 description 3
- 238000005457 optimization Methods 0.000 description 2
- 238000010845 search algorithm Methods 0.000 description 2
- 230000002159 abnormal effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- 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
-
- 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
-
- 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Traffic Control Systems (AREA)
Abstract
The present invention provides a kind of preferential dispatching method of timeliness and system, for Drop and pull transport, including：Task queue is established for arbitrary headstock, vehicle extension, estimates that the headstock or vehicle extension have performed position and the time of last task；Given order set finds out each order in the order set and meets the optimal headstock of the following conditions and vehicle extension combination：The expectation of order is more than vehicle to the compartment time and hangs the sum of pot life and predicted travel time, and the expectation time of departure of order is more than the sum of headstock pot life and predicted travel time；Single order cost is calculated, the single order cost refutes the sum of cost and main line cost equal to short；If each order optimal solution sends a car to hang and headstock does not conflict, it is then a globally optimal solution, otherwise globally optimal solution is found by pruning search, the order for having conflict is replaced respectively, combination is hung using the headstock and vehicle of next Least-cost not conflicted, the whole cost of the order set is solved, the beta pruning discarding if whole cost increase；It is not solved if described search finishes, abandons expectation to the farthest order of compartment time gap current time, repeat above-mentioned steps.
Description
Technical field
The present invention relates to a kind of Drop and pull transport technical field, more particularly, to a kind of preferential intelligent dispatching method of timeliness and
System.
Background technology
In Drop and pull transport, the scheduling that headstock and vehicle are hung saves transportation cost and plays an important role for reasonable distribution resource.
Domestic and foreign scholars are concentrated mainly on traffic safety, enterprise schema and policies and regulations for the correlative study of Drop and pull transport
Etc., it is left to be desired for the research of Drop and pull transport vehicle dispatching problem, and grinding for Drop and pull transport vehicle dispatching problem
It there are the drawbacks such as enterprise schema is single, model construction is not rigorous, research bicycle field in studying carefully.In algorithm design aspect,
It is that simplification usually has been done to practical business scene in algorithm design due to really getting rid of extension business complexity.The VSP/ studied at present
VRP、TTRP(Truck and Trailer Routing Problem)、TSRP(Tractor and Semi-trailer
Routing Problem) problem is abstract for one-to-many, the relationship of multi-to-multi.In practical application scene, headstock, vehicle
It hangs, loading point is actually three layers of more-more-more relationships.
Existing research has the following disadvantages：
1st, scheduling model is abstracted and has been simplified, be not suitable for true Drop and pull transport business.
2nd, the study computational complexity of model is high, and the running current intelligence of vehicle cannot be calculated in real time.
3rd, order numbers are less than for some abnormal conditions, such as vehicle number, can not solved.
Invention content
To solve problem above, the present invention proposes a kind of vehicle scheduling side with the optimal global optimum for target of timeliness
Case.The present invention is set out with practical business scene, based on generalized information system road condition analyzing, have estimated vehicle estimated arrival and it is expected that can
With the time, then using pruning search algorithm, greedy thought, the global optimum of single order optimal solution and multiple orders has been solved
Solution.
Specifically, the present invention provides a kind of preferential dispatching method of timeliness, for Drop and pull transport, include the following steps：
Task queue is established for arbitrary headstock, vehicle extension, estimate the headstock or vehicle extension has performed the position of last task with
Time；
Given order set, finds out each order in the order set and meets the optimal headstock of the following conditions and vehicle extension group
It closes：The expectation of order is more than vehicle to the compartment time and hangs the sum of pot life and predicted travel time, and the expectation time of departure of order is big
In the sum of headstock pot life and predicted travel time；
Single order cost is calculated, the single order cost refutes the sum of cost and main line cost equal to short；
If each order optimal solution sends a car to hang and headstock does not conflict, for a globally optimal solution, otherwise by cutting
Globally optimal solution is found in branch search, and replace has the order of conflict respectively, using next Least-cost not conflicted headstock and
Vehicle hangs combination, solves the whole cost of the order set, the beta pruning discarding if whole cost increase；
It is not solved if described search finishes, abandons expectation to the farthest order of compartment time gap current time, repetition is held
Row above-mentioned steps.
Preferably, the headstock refutes headstock and/or main line headstock including short.
Preferably, the position for having performed last task and time include：License plate number, type of vehicle, during vehicle idle
Place longitude and latitude, vehicle pot life.
Preferably, single order attributes include in the order set：The order place of loading, the expectation of order to compartment time,
It is expected the time of departure, order sends task type.
It is furthermore preferred that the order sends task type to include following three types：Only send it is short refute, send main line or both
All send.
Preferably, it is described short to refute cost=α t1+t2+βt3, t1、t2And t3Time that respectively headstock is hung to vehicle, vehicle are suspended to
Loading point time and headstock wait for vehicle to hang the time；Main line cost=the t4+γt5, t4And t5It is headstock respectively to loading point
Time, headstock wait for the time of departure, wherein, α, β, γ are linear coefficient.
According to another aspect of the present invention, the present invention also provides a kind of preferential scheduling systems of timeliness, are hung for getting rid of
Transport, including the following module being linked in sequence：
Module is established in queue, and task queue is established for arbitrary headstock, vehicle extension, estimates that the headstock or vehicle extension have performed finally
The position of task and time；
Optimum combination determining module, for according to given order set, finding out each order in the order set and meeting
The optimal headstock and vehicle of the following conditions hang combination：The expectation of order is more than vehicle to the compartment time and hangs pot life and predicted travel time
The sum of, the expectation time of departure of order is more than the sum of headstock pot life and predicted travel time；
Order cost computing module, for calculating single order cost, the single order cost be equal to it is short refute cost with
The sum of main line cost；
Optimal solution acquisition module, according to the globally optimal solution of following Rule one or more order：If each order
Optimal solution sends a car to hang and headstock does not conflict, then is a globally optimal solution, otherwise finds global optimum by pruning search
Solution replaces the order for having conflict respectively, hangs combination using the headstock and vehicle of next Least-cost not conflicted, is ordered described in solution
The whole cost singly gathered, the beta pruning discarding if whole cost increase；It is not solved if search finishes, abandons expectation to the compartment time
The order farthest apart from current time.
The invention has the advantages that：
1) based on practical business scene, question essence is reduced, passes through scheduling model solving practical problems.
It 2), can Real-time solution be single orders under the premise of time window is met with timeliness (shortest time) for optimum target
The globally optimal solution of single optimal solution and multiple orders.
3) it when being unsatisfactory for schedulable condition (such as order numbers are more than available vehicle number), is sent according to priority and urgency level
It is single.
4) dynamic dispatching estimated based on remaining time is realized.
Description of the drawings
By reading the detailed description of hereafter preferred embodiment, it is various other the advantages of and benefit it is common for this field
Technical staff will become clear.Attached drawing is only used for showing the purpose of preferred embodiment, and is not considered as to the present invention
Limitation.And throughout the drawings, the same reference numbers will be used to refer to the same parts.In the accompanying drawings：
Fig. 1 is the flow chart of the preferential dispatching method of timeliness of the present invention；
Fig. 2 is the structure chart of the preferential scheduling system of timeliness of the present invention.
Specific embodiment
Exemplary embodiments of the present invention are more fully described below with reference to accompanying drawings.Although this hair is shown in attached drawing
Bright illustrative embodiments, it being understood, however, that may be realized in various forms the reality of the invention without that should be illustrated here
The mode of applying is limited.It is to be able to be best understood from the present invention, and this can be sent out on the contrary, providing these embodiments
Bright range is completely communicated to those skilled in the art.
The present invention proposes a kind of vehicle scheduling scheme with the optimal global optimum for target of timeliness.The present invention is with reality
Business scenario triggers, and based on generalized information system road condition analyzing, has estimated the estimated arrival of vehicle and it is expected that pot life, then uses
Pruning search algorithm, greedy thought, have solved the globally optimal solution of single order optimal solution and multiple orders.
Greedy thought (also known as greedy algorithm) refers to, when to problem solving, always makes and is currently appearing to be best
Selection.That is, not taken in from total optimization, what is made is locally optimal solution in some sense.Greed
Algorithm is not that can obtain total optimization solution to all problems, it is important to which the selection of Greedy strategy, the Greedy strategy of selection are necessary
Has markov property, i.e. the pervious process of some state does not interfere with later state, only related with current state.
First, in a preferred embodiment of the invention, the scheduling of Drop and pull transport be divided into it is short refute scheduling and main line scheduling.Get rid of extension
The short task of refuting refers to empty hangs be drawn to give client for freighting from appointed place (such as parking lot) in transport, and distance is shorter, leads to
Chang Yi city.Main line task refers to the vehicle extension for filling cargo being fixed the long range of circuit, the transport of big quantity.
Short headstock of refuting draws empty hang to be sent to loading point, and then main line headstock, which draws to hang again, carries out line haul, and short vehicle is refuted no
During head, main line headstock can be used to carry out that extension is sent to operate.Following two situations are divided into for single order dispatch：
(a), short headstock of refuting send empty extension, and main line headstock band is hung again dispatches a car.
(b), main line headstock send empty extension, hangs and dispatches a car again in the dresses such as loading point or another main line headstock band.
Dispatching algorithm principal content used in the present invention is described below：
First, algorithm parameter
(1) network attribute parameter
·O：The set of all orders
·U：The set that all vehicles are hung
·V：All short set for refuting headstock
·W：The set of all main line headstocks
(2) nodal community parameter
·shorto：O ∈ O, order o whether need to assign it is short refute task, needed when being 1,0 when does not need to
·The expectation of o ∈ O, order o are to the compartment time
·The expectation time of departure of o ∈ O, order o
·Ti：The estimated pot life of i ∈ U ∪ V ∪ W, vehicle v
(3) edge value parameter
·disij：I, j ∈ U ∪ V ∪ Oori, j ∈ U ∪ W ∪ O, the path length between i and j
·timeij：I, j ∈ U ∪ V ∪ O ori, j ∈ U ∪ W ∪ O, the route time between i and j
(4) cost parameter
·I ∈ V ∪ W, headstock traveling unit length cost
·I ∈ V ∪ W, headstock traveling long-run cost rate
·I ∈ V ∪ V ∪ W, vehicle wait for long-run cost rate
(5) logical variable
·I ∈ V ∪ W, j ∈ U, o ∈ O, it is 1 that main line headstock i is assigned, which to pull a cart to hang j to go to order o durations, is otherwise 0
·I ∈ W, o ∈ O, it is 1 that main line headstock i is assigned, which to go to order o durations, is otherwise 0.
2nd, object function (timeliness is preferential)
(1) all object functions for assigning main line task order
Before intelligent dispatching algorithm is run, some orders be assigned it is short refute task, only need algorithm assign main line vehicle
Head performs main line task, referred to as main line order, these order dispatch highest priorities for it, so object function needs individually
It formulates.
1. if main line headstock i is assigned to go to order o, i.e.,Then the total waiting time of i it is expected the time of departure for order
And the difference of the estimated pot life of main line vehicle and link travel time, i.e.,：
2. if main line headstock i is assigned to go to order o, i.e.,Total timeliness cost for wire time cost with wait for into
The sum of this, i.e.,：
3. more than, object function is：
4. constraints is：
For arbitrarily meeting shorto=0 o ∈ O, haveThis constraint orders each main line
Single, one and only one main line headstock completes its task.
To arbitrary i ∈ W, haveThis constraint at most only completes one to each main line headstock
A main line order.
(2) with the object function for hanging order of dispatching a car
After having assigned and need to send main line task order, if there is idle main line headstock in system, need to pay the utmost attention to
These main line headstocks are assigned, while short refute for completing other orders with main line task, i.e. appointment main line headstock dispatch a car with extension.
If assigning main line headstock i that vehicle is gone to hang at j, order o is then gone to, then
1.i stand-by period at j is
2.i stand-by period at o is
3.j stand-by period at o is
Total delay cost of 4.i and j is
The total travel cost of 5.i and j is
6. total timeliness cost is
More than, the object function that all non-main line order bands hang scheduling of dispatching a car is
Constraints is：
To arbitrary shorto=1 o ∈ O, haveThis constraint is complete to each non-main line order
Distinguish one and only one into being hung with the main line headstock and vehicle for hanging task of dispatching a car.
To arbitrary i ∈ W, haveThis constraint is to each main line vehicle
Head is at most assigned and completes a non-main line order or main line order.
Similarly, to arbitrary j ∈ U, haveThis constraint hangs each vehicle,
It is at most assigned and completes a non-main line order or main line order.
(3) object function of non-main line order dispatched a car with extension can not be assigned
Limitation main line headstock quantity not enough etc. due to, there are some non-main line orders, can not complete what band extension was dispatched a car
Assign, can only first assign it is short refute headstock complete it is short refute task, then assign main line headstock, it is independent mutually between assigning twice, therefore can be with
It is considered as the appointment that sub-band extension is dispatched a car with primary main order.Specific cost function, object function and constraints have been given above
Go out, need the stand-by period for middle headstock of only dispatching a car with extension changed, because short headstock of refuting need not be waited in order position, so
Total waiting time is reduced.
Based on above algorithm idea, the present invention proposes a kind of preferential intelligent dispatching method of timeliness, for Drop and pull transport,
As shown in Figure 1, its execution step is as follows：
A. arbitrary vehicle is hung, headstock (i.e. headstock short refutes headstock and main line headstock including recited above)
Establish task queue, estimate the vehicle hang or headstock performed last task position and the time (vno, type, lon,
Lat, ft), vno is license plate number, and type is type of vehicle, and lon, longitude and latitude where when lat is respectively vehicle idle, ft is vehicle
Pot life.
B. order set O is given, single order attributes are following (lon, lat, expt_tr, expt_dp, type), lon,
Lat is the order place of loading, expt_tr be the expectation of order to the compartment time, expt_dp is the order expectation time of departure, and type is
Order sends task type：Including only send it is short refute, main line or both is sent all to send three types.Each order is found out to meet
Optimal headstock and vehicle hang combination H, T under expt_tr and expt_dp.
C. single order cost C=C is calculateds+Ct, wherein CsCost, C are refuted to be shorts=α t1+t2+βt3, t1、t2And t3Respectively
Time for being hung for headstock to vehicle, vehicle are suspended to the loading point time and headstock waits for vehicle to hang the time；CtFor main line cost, Ct=t4+γ
t5, t4And t5It is that headstock is put the time to loading respectively, headstock waits for the time of departure.Wherein, α, β, γ are linear coefficient.
D. if each order optimal solution sends a car to hang and headstock does not conflict, for a globally optimal solution.Otherwise pass through
Pruning search finds globally optimal solution.The order for having conflict is replaced respectively, uses the headstock of next Least-cost not conflicted
It hangs and combines with vehicle, solve the whole cost ∑ C of the order set, the beta pruning discarding if whole cost increase.
It is not solved if e. search finishes, abandons expectation to the farthest order of compartment time gap current time, repeat
Above-mentioned steps.
The pruning search used in the present invention can be, when sending a car to have conflict, randomly select an order and carry out depth
First search, when finding first feasible solution, record cost is W, with W or is found in the follow-up search for finding optimal solution
Smaller cost needs to search for entire tree if feasible solution is not received as beta pruning condition.
As shown in Fig. 2, according to another aspect of the present invention, the present invention also provides a kind of preferential scheduling systems of timeliness
100, for Drop and pull transport, including the following module being linked in sequence：
Module 110 is established in queue, is established task queue for arbitrary vehicle extension, headstock, is estimated that the vehicle is hung or headstock has performed
The position of last task and time；
Optimum combination determining module 120, for according to given order set, finding out each order in the order set to expire
The optimal headstock and vehicle of sufficient the following conditions hang combination：The expectation of order is more than vehicle to the compartment time when hanging pot life and predicted travel
The sum of between, the expectation time of departure of order is more than the sum of headstock pot life and predicted travel time；
Order cost computing module 130, for calculating single order cost, the single order cost refutes cost equal to short
The sum of with main line cost；
Optimal solution acquisition module 140, according to the globally optimal solution of following Rule one or more order：If it each orders
Single optimal solution sends a car to hang and headstock does not conflict, then is a globally optimal solution, otherwise finds the overall situation most by pruning search
Excellent solution replaces the order for having conflict respectively, is hung and combined using the headstock and vehicle of next Least-cost not conflicted, described in solution
The whole cost of order set, the beta pruning discarding if whole cost increase；It is not solved if search finishes, when abandoning expectation to compartment
Between the order farthest apart from current time.
There are many application scenarios of the present invention, such as in practical applications, there is m headstock, and n vehicle is hung, p order.Each
Which headstock order under the premise of the time is met, chooses and vehicle hangs combination goes which is performed there are one loading time it is expected
Order, and make entirely to transport timeliness minimum, it is the main problem that the present invention solves.In addition to this, vehicle program free time,
Vehicle fleet size is insufficient, and state changes, cancellation of order, and worksheet processing sequence waits and all final scheduling result can be had an impact, the present invention
Single order and all optimal solutions for not sending order can be calculated in real time when any resource status changes, provide rationalization
Send a car scheme, reduce it is such as more run, the problems such as waiting, improve conevying efficiency.
The foregoing is only a preferred embodiment of the present invention, but protection scope of the present invention be not limited thereto,
Any one skilled in the art in the technical scope disclosed by the present invention, the change or replacement that can be readily occurred in,
It should be covered by the protection scope of the present invention.Therefore, protection scope of the present invention should be with the protection model of the claim
Subject to enclosing.
Claims (10)
1. a kind of preferential dispatching method of timeliness, for Drop and pull transport, which is characterized in that include the following steps：
Task queue is established for arbitrary headstock, vehicle extension, estimates that the headstock or vehicle extension have performed position and the time of last task；
Given order set finds out each order in the order set and meets the optimal headstock of the following conditions and vehicle extension combination：
The expectation of order is more than vehicle to the compartment time and hangs the sum of pot life and predicted travel time, and the expectation time of departure of order is more than vehicle
Head the sum of pot life and predicted travel time；
Single order cost is calculated, the single order cost refutes the sum of cost and main line cost equal to short；
If the optimal solution of each order sends a car to hang and headstock does not conflict, for a globally optimal solution, otherwise pass through beta pruning
Globally optimal solution is found in search, is replaced the order for having conflict respectively, is used the headstock and vehicle of next Least-cost not conflicted
Combination is hung, solves the whole cost of the order set, the beta pruning discarding if whole cost increase；
It is not solved if described search finishes, abandons expectation to the farthest order of compartment time gap current time, repeat
State step.
2. the preferential dispatching method of timeliness according to claim 1, it is characterised in that：
The headstock refutes headstock and/or main line headstock including short.
3. the preferential dispatching method of timeliness according to claim 1, it is characterised in that：
The position for having performed last task and time include：License plate number, type of vehicle, longitude and latitude where during vehicle idle,
Vehicle pot life.
4. the preferential dispatching method of timeliness according to claim 1, it is characterised in that：
Single order attributes include in the order set：The order place of loading, the expectation of order to compartment time, when it is expected to dispatch a car
Between, order sends task type.
5. the preferential dispatching method of timeliness according to claim 4, it is characterised in that：
The order sends task type to include following three types：Only send it is short refute, main line or both is sent all to be sent.
6. the preferential dispatching method of timeliness according to claim 1, it is characterised in that：
It is described short to refute cost=α t1+t2+βt3, t1、t2And t3Time that respectively headstock is hung to vehicle, vehicle be suspended to the loading point time with
And headstock waits for vehicle to hang the time；Main line cost=the t4+γt5, t4And t5It is that headstock is put the time to loading respectively, headstock waits for
The time of departure, wherein, α, β, γ are linear coefficient.
7. a kind of preferential scheduling system of timeliness, for Drop and pull transport, which is characterized in that including the following module being linked in sequence：
Module is established in queue, and task queue is established for arbitrary headstock, vehicle extension, estimates that the headstock or vehicle extension have performed last task
Position and the time；
Optimum combination determining module, for according to given order set, it is following to find out each order satisfaction in the order set
The optimal headstock and vehicle of condition hang combination：The expectation of order to the compartment time be more than vehicle hang pot life and predicted travel time it
It is more than the sum of headstock pot life and predicted travel time with the expectation time of departure of, order；
Order cost computing module, for calculating single order cost, the single order cost refutes cost and main line equal to short
The sum of cost；
Optimal solution acquisition module, according to the globally optimal solution of following Rule one or more order：If each order is optimal
Solution sends a car to hang and headstock does not conflict, then is a globally optimal solution, otherwise finds globally optimal solution by pruning search, point
Ti Huan there be the order of conflict, hang combination using the headstock and vehicle of next Least-cost not conflicted, solve the order collection
The whole cost of conjunction, the beta pruning discarding if whole cost increase；It is not solved if search finishes, abandons expectation to compartment time gap
The farthest order of current time.
8. the preferential scheduling system of timeliness according to claim 7, it is characterised in that：
The position for having performed last task and time include：License plate number, type of vehicle, longitude and latitude where during vehicle idle,
Vehicle pot life.
9. the preferential scheduling system of timeliness according to claim 7, it is characterised in that：
Single order attributes include in the order set：The order place of loading, the expectation of order to compartment time, when it is expected to dispatch a car
Between, order sends task type.
10. the preferential scheduling system of timeliness according to claim 7, it is characterised in that：
It is described short to refute cost=α t1+t2+βt3, t1、t2And t3Time that respectively headstock is hung to vehicle, vehicle be suspended to the loading point time with
And headstock waits for vehicle to hang the time；Main line cost=the t4+γt5, t4And t5It is that headstock is put the time to loading respectively, headstock waits for
The time of departure, wherein, α, β, γ are linear coefficient.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711395763.0A CN108133290B (en) | 2017-12-21 | 2017-12-21 | Scheduling method and system with time efficiency priority |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711395763.0A CN108133290B (en) | 2017-12-21 | 2017-12-21 | Scheduling method and system with time efficiency priority |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108133290A true CN108133290A (en) | 2018-06-08 |
| CN108133290B CN108133290B (en) | 2021-06-25 |
Family
ID=62392102
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711395763.0A Active CN108133290B (en) | 2017-12-21 | 2017-12-21 | Scheduling method and system with time efficiency priority |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108133290B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109635980A (en) * | 2018-12-21 | 2019-04-16 | 重庆呼我出行网络科技有限公司 | About vehicle order allocation method and system |
| CN109978245A (en) * | 2019-03-15 | 2019-07-05 | 中国科学技术大学 | It is a kind of based on estimating with the used time most short guided missile truck dispatching method for index |
| CN110871979A (en) * | 2018-08-30 | 2020-03-10 | 株式会社日立制作所 | Picking support system and picking support method |
| CN114077952A (en) * | 2020-08-17 | 2022-02-22 | 南京福佑在线电子商务有限公司 | Method and device for intelligent drop and hang scheduling |
| CN114331220A (en) * | 2022-03-01 | 2022-04-12 | 北京邮电大学 | Passenger vehicle transport vehicle scheduling method and device based on order dynamic priority |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150370228A1 (en) * | 2014-06-20 | 2015-12-24 | Atigeo Corp. | Determining control actions of decision modules |
| CN106156981A (en) * | 2016-07-07 | 2016-11-23 | 成都镜杰科技有限责任公司 | Logistics collaboration processing method based on cloud computing |
| CN106203911A (en) * | 2016-07-07 | 2016-12-07 | 成都镜杰科技有限责任公司 | Intelligent logistics data managing method based on cloud computing |
| CN106503789A (en) * | 2016-11-08 | 2017-03-15 | 西安电子科技大学宁波信息技术研究院 | Loop-free shortest path searching method based on Di Jiesitela and minimax ant colony |
-
2017
- 2017-12-21 CN CN201711395763.0A patent/CN108133290B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150370228A1 (en) * | 2014-06-20 | 2015-12-24 | Atigeo Corp. | Determining control actions of decision modules |
| CN106156981A (en) * | 2016-07-07 | 2016-11-23 | 成都镜杰科技有限责任公司 | Logistics collaboration processing method based on cloud computing |
| CN106203911A (en) * | 2016-07-07 | 2016-12-07 | 成都镜杰科技有限责任公司 | Intelligent logistics data managing method based on cloud computing |
| CN106503789A (en) * | 2016-11-08 | 2017-03-15 | 西安电子科技大学宁波信息技术研究院 | Loop-free shortest path searching method based on Di Jiesitela and minimax ant colony |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110871979A (en) * | 2018-08-30 | 2020-03-10 | 株式会社日立制作所 | Picking support system and picking support method |
| CN109635980A (en) * | 2018-12-21 | 2019-04-16 | 重庆呼我出行网络科技有限公司 | About vehicle order allocation method and system |
| CN109635980B (en) * | 2018-12-21 | 2023-09-05 | 重庆呼我出行网络科技有限公司 | Method and system for allocating order of vehicle |
| CN109978245A (en) * | 2019-03-15 | 2019-07-05 | 中国科学技术大学 | It is a kind of based on estimating with the used time most short guided missile truck dispatching method for index |
| CN114077952A (en) * | 2020-08-17 | 2022-02-22 | 南京福佑在线电子商务有限公司 | Method and device for intelligent drop and hang scheduling |
| CN114331220A (en) * | 2022-03-01 | 2022-04-12 | 北京邮电大学 | Passenger vehicle transport vehicle scheduling method and device based on order dynamic priority |
| CN114331220B (en) * | 2022-03-01 | 2022-05-13 | 北京邮电大学 | Passenger vehicle transport vehicle scheduling method and device based on order dynamic priority |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108133290B (en) | 2021-06-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108133290A (en) | A kind of preferential dispatching method of timeliness and system | |
| CN112000458B (en) | Method and device for allocating automobile computing tasks to heterogeneous-capability networking equipment | |
| CN109635971A (en) | A kind of people's goods is shared to use vehicle method of servicing | |
| US12001996B2 (en) | Systems and methods for imputation of shipment milestones | |
| CN109657820B (en) | Taxi matching method capable of making reservation | |
| CN110009272A (en) | More strategies parallel logistic resources dispatching method and relevant apparatus | |
| CN110826968B (en) | Urban crowdsourcing distribution task optimal scheduling method based on path planning | |
| Zhang et al. | Dynamic vehicle routing with random requests: A literature review | |
| CN110136427A (en) | A kind of automatic Pilot taxi dispatching system based on car networking big data | |
| JP2020004404A (en) | System for assigning commutation vehicle to passenger | |
| JP7474525B2 (en) | Vehicle scheduling system, method, electronic device, and storage medium based on cooperation of multiple vehicles | |
| US20150294251A1 (en) | Distributed task scheduling using multiple agent paradigms | |
| Azab et al. | A dynamic and collaborative truck appointment management system in container terminals | |
| Bischoff et al. | A framework for agent based simulation of demand responsive transport systems | |
| Azab et al. | Impact of collaborative external truck scheduling on yard efficiency in container terminals | |
| CN112085271A (en) | Crowdsourcing mode-based traditional industry cluster goods collection path optimization method | |
| CN115035739A (en) | Automatic driving vehicle scheduling method applied to intelligent network park | |
| Maciejewski12 et al. | A microscopic simulation approach for optimization of taxi services | |
| CN113988770B (en) | Transport vehicle on-road queuing control method and device and electronic equipment | |
| CN109948850A (en) | Route optimizing method for logistic distribution vehicle and system | |
| CN116030655A (en) | Vehicle control method, device and system | |
| El Falou et al. | On demand transport system's approach as a multi-agent planning problem | |
| CN109872523A (en) | A kind of Automatic dispatching server-side, dispatching method, equipment and readable storage medium storing program for executing | |
| CN107437208A (en) | Order processing method and server | |
| Balbo et al. | Bimodal traffic regulation system: A multi-agent approach |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20190823 Address after: 100193 No. 207, 2nd floor, Building A, No. 27, Zhongguancun Software Park Phase I, 8 Wangxi Road, Haidian District, Beijing Applicant after: Beijing Youhang Information Technology Co.,Ltd. Address before: 100176 22nd Floor 2606, No. 29 Building, No. 8 Courtyard, West Cultural Park, Beijing Economic and Technological Development Zone, Daxing District, Beijing Applicant before: BEIJING ZHONGJIAO XINGLU XINYUAN TECHNOLOGY Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20180608 Assignee: CHINA TECHNOLOGY EXCHANGE Co.,Ltd. Assignor: Beijing Youhang Information Technology Co.,Ltd. Contract record no.: X2021980013170 Denomination of invention: A scheduling method and system with time priority Granted publication date: 20210625 License type: Exclusive License Record date: 20211124 |
|
| EE01 | Entry into force of recordation of patent licensing contract | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: A scheduling method and system with time priority Effective date of registration: 20211125 Granted publication date: 20210625 Pledgee: CHINA TECHNOLOGY EXCHANGE Co.,Ltd. Pledgor: Beijing Youhang Information Technology Co.,Ltd. Registration number: Y2021110000067 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Date of cancellation: 20230129 Granted publication date: 20210625 Pledgee: CHINA TECHNOLOGY EXCHANGE Co.,Ltd. Pledgor: Beijing Youhang Information Technology Co.,Ltd. Registration number: Y2021110000067 |
|
| PC01 | Cancellation of the registration of the contract for pledge of patent right | ||
| EC01 | Cancellation of recordation of patent licensing contract |
Assignee: CHINA TECHNOLOGY EXCHANGE Co.,Ltd. Assignor: Beijing Youhang Information Technology Co.,Ltd. Contract record no.: X2021980013170 Date of cancellation: 20230321 |
|
| EC01 | Cancellation of recordation of patent licensing contract | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20180608 Assignee: CHINA TECHNOLOGY EXCHANGE Co.,Ltd. Assignor: Beijing Youhang Information Technology Co.,Ltd. Contract record no.: X2023110000045 Denomination of invention: A Time First Scheduling Method and System Granted publication date: 20210625 License type: Exclusive License Record date: 20230323 |
|
| EE01 | Entry into force of recordation of patent licensing contract | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: A Time First Scheduling Method and System Effective date of registration: 20230327 Granted publication date: 20210625 Pledgee: CHINA TECHNOLOGY EXCHANGE Co.,Ltd. Pledgor: Beijing Youhang Information Technology Co.,Ltd. Registration number: Y2023110000132 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |