CN110472769A - Transport task processing method, device and electronic equipment - Google Patents
Transport task processing method, device and electronic equipment Download PDFInfo
- Publication number
- CN110472769A CN110472769A CN201910594964.6A CN201910594964A CN110472769A CN 110472769 A CN110472769 A CN 110472769A CN 201910594964 A CN201910594964 A CN 201910594964A CN 110472769 A CN110472769 A CN 110472769A
- Authority
- CN
- China
- Prior art keywords
- task
- transport
- transport task
- original execution
- execution person
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
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"
- 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
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the present invention provides a kind of transport task processing method, device and electronic equipment, this method comprises: transport task processing unit first carries out first time allocation processing to transport task according to the information on services of performer.Then, transport task processing unit is determined again in all transport tasks after first time allocation processing, which is in execution state, and the mission bit stream for respectively including according to the transport task for being currently at execution state, carries out second of allocation processing to it.According to foregoing description, carry out the first sub-distribution consideration is the matching between transport task and executor, carry out the second sub-distribution consideration is the matching between transport task, and allocation processing combines twice, just can avoid the problem that transport task unreasonable distribution as far as possible.And it is rational simultaneously in the distribution for guaranteeing transport task, it can also further increase the execution efficiency of transport task.
Description
Technical field
The present invention relates to Internet technical field more particularly to a kind of transport task processing methods, device and electronic equipment.
Background technique
With the continuous development of internet and mobile terminal device, different types of application program (Application, letter
Claim APP) it can satisfy the demands such as the different demands, such as food and drink, trip, goods transportation of people.Each demand that user proposes
Both correspond to a task of APP generation.And each task can also be distributed to an ISP by APP, to be held by it
This task of row.
In practical applications, by taking goods transportation demand as an example, the service provider usually only quantity of transportation service is provided
Limited performer.And it is that user generates, etc. task quantity to be allocated be it is numerous, therefore, based on being held in task
In the case that passerby's quantity is very sufficient, how to guarantee that the reasonability of task distribution just becomes a urgent problem to be solved.
In view of this, the embodiment of the present invention provides a kind of transport task processing method, device and electronic equipment, to guarantee
The reasonability of transport task distribution.
In a first aspect, the embodiment of the present invention provides a kind of transport task processing method, comprising:
Transport task is distributed to original execution person according to the information on services of performer；
The first transport task and the second transport task for being currently at execution state are determined in the transport task；
According to the mission bit stream that first transport task and second transport task respectively include, described first is judged
Whether transport task and second transport task meet task merging condition；
If first transport task and second transport task meet the task merging condition, by described first
Transport task and second transport task are distributed together to target executor, and the target executor is that first transport is appointed
Be engaged in corresponding first original execution person or the corresponding second original execution person of second transport task.
Second aspect, the embodiment of the present invention provide a kind of transport task processing unit, comprising:
First distribution module, for being distributed transport task to original execution person according to the information on services of performer；
Determining module, for determining the first transport task and second for being currently at execution state in the transport task
Transport task；
Condition judgment module, the task for respectively including according to first transport task and second transport task
Information, judges whether first transport task and second transport task meet task merging condition；
Second distribution module, if meeting the task merging for first transport task and second transport task
Condition is then distributed first transport task and second transport task together to target executor, and the target executes
Person is that the corresponding first original execution person of first transport task or second transport task corresponding second original are held
Passerby.
The third aspect, the embodiment of the present invention provide a kind of electronic equipment, comprising: memory, and connect with the memory
The processor connect；
The memory, for storing one or more computer instruction, wherein one or more computer instruction
It calls and executes for the processor；
The processor, for executing one or more computer instruction in above-mentioned transport task processing method
Any one method.
The embodiment of the invention provides a kind of computer storage mediums, for storing storage computer program, the calculating
Machine program realizes the transport task processing method in above-mentioned first aspect when executing computer.
Transport task processing method, device and electronic equipment provided in an embodiment of the present invention, this method comprises: transport task
Processing unit (hereinafter referred to as processing unit) first carries out the first sub-distribution to transport task according to the information on services of performer
Processing, that is to say each transport task distributing to a corresponding original execution person.This original execution person can start to execute this
Transport task.Then, processing unit determines in all transport tasks after first time allocation processing which is to be in again
Execution state, and second of allocation processing is carried out to each transport task for being currently at execution state.Wherein, above-mentioned to hold
Row state, which that is to say, shows that means of transport transport article is used in original execution person.And second of assigning process is specifically
Are as follows: processing unit is believed according to the task that the first transport task and the second transport task that are currently at execution state respectively include
Breath, judges whether the two transport tasks meet task merging condition.If meeting task merging condition, processing unit can be incited somebody to action
The two transport task distributing uniforms give target executor, this target executor can be corresponding first original of the first transport task
Beginning executor or the corresponding second original execution person of the second transport task.
According to foregoing description it is found that consider during first time allocation processing is between transport task and executor
With property, what is considered during second of allocation processing is the matching between transport task.Allocation processing combines twice, energy
It is enough to avoid the problem that transport task unreasonable distribution as far as possible.For example, two transport task quilts that destination locations are same or similar
Be allocated to different executors, different executors will the identical route of repeated travel, at this point, the reasonability of task distribution
It is exactly poor.And matching process combined use twice can be avoided into above situation well.And guaranteeing transport times
The distribution of business is rational simultaneously, can also further increase the execution efficiency of transport task.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is this hair
Bright some embodiments for those of ordinary skill in the art without creative efforts, can be with root
Other attached drawings are obtained according to these attached drawings.
Fig. 1 is a kind of flow chart of transport task processing method provided in an embodiment of the present invention；
Fig. 2 a is a kind of flow chart of specific implementation of step 103 in embodiment illustrated in fig. 1；
Fig. 2 b is the flow chart of another specific implementation of step 103 in embodiment illustrated in fig. 1；
Fig. 2 c is the flow chart of another specific implementation of step 103 in embodiment illustrated in fig. 1；
Fig. 3 a is a kind of flow chart of specific implementation of step 104 in embodiment illustrated in fig. 1；
Fig. 3 b is the flow chart of another specific implementation of step 104 in embodiment illustrated in fig. 1；
Fig. 4 is the flow chart of another transport task processing method provided in an embodiment of the present invention；
Fig. 5 is a kind of structural schematic diagram of transport task processing unit provided in an embodiment of the present invention；
Fig. 6 is the structural schematic diagram of electronic equipment corresponding with the transport task processing unit that embodiment illustrated in fig. 5 provides.
Specific embodiment
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
Every other embodiment obtained without creative efforts, shall fall within the protection scope of the present invention.
The term used in embodiments of the present invention is only to be not intended to be limiting merely for for the purpose of describing particular embodiments
The present invention.In the embodiment of the present invention and the "an" of singular used in the attached claims, " described " and "the"
It is also intended to including most forms, unless the context clearly indicates other meaning, " a variety of " generally comprise at least two, but not
It excludes to include at least one situation.
It should be appreciated that term "and/or" used herein is only a kind of incidence relation for describing affiliated partner, indicate
There may be three kinds of relationships, for example, A and/or B, can indicate: individualism A, exist simultaneously A and B, individualism B these three
Situation.In addition, character "/" herein, typicallys represent the relationship that forward-backward correlation object is a kind of "or".
Depending on context, word as used in this " if ", " if " can be construed to " ... when " or
" when ... " or " in response to determination " or " in response to test ".Similarly, context is depended on, phrase " if it is determined that " or " such as
Fruit test (condition or event of statement) " can be construed to " when determining " or " in response to determination " or " when test (statement
Condition or event) when " or " in response to test (condition or event of statement) ".
It should also be noted that, the terms "include", "comprise" or its any other variant are intended to nonexcludability
Include, so that commodity or system including a series of elements not only include those elements, but also including not clear
The other element listed, or further include for this commodity or the intrinsic element of system.In the feelings not limited more
Under condition, the element that is limited by sentence "including a ...", it is not excluded that in the commodity or system for including the element also
There are other identical elements.
Fig. 1 is a kind of flow chart of transport task processing method provided in an embodiment of the present invention.It is provided in this embodiment to be somebody's turn to do
The executing subject of transport task processing method can be transport task processing unit, this transport task processing unit is specifically as follows
The task processing server of transportation service provider maintenance, the transport task that this server is used to generate user are allocated,
As shown in Figure 1, this method comprises the following steps:
S101 distributes transport task to original execution person according to the information on services of performer.
User can initiate the mission bit stream inputted in interface in the task in the APP for providing transportation service, to generate
Transport task.Optionally, the mission bit stream of user's input may include: the type of items, article volume, article of article to be transported
Weight, product loading location, product loading location, delivery time of article etc..At this point, transport task processing unit is (following
Processing unit is referred to as in each embodiment) transport task divide for the first time according to the information on services of performer
Match, that is to say and each transport task is distributed on a corresponding original execution person.After the completion of first time allocation processing, this
When transport task be typically at pending state.
Wherein, the information on services for all performers that transportation service provider provides can be maintained in processing unit
In.Information on services specifically may include service range, the grade of service, service time duration, service wish etc. again.In addition, by
In the particularity of transport task, information on services may also include the relevant information of means of transport that performer uses, for example transport
The dead weight of defeated tool, maximum volume etc..It can also have been safeguarded and other than information on services, in processing unit every
The basic personal information of a performer.
For first time allocation processing, a kind of optionally mode, processing unit can first determine the task letter of transport task
Regional scope belonging to the product loading location that breath includes, then determine the alternative executor of service range regional scope thus, most
This transport task distributes so far alternative executor at last.This alternative executor that is to say the original execution person of transport task.In this way
Distribution can make original execution person rush for product loading location as early as possible, to guarantee the timely completion of transport task execution.
In general, there can be multiple tasks executor in same service range, therefore, be determined in the above process
Alternative executor may be multiple.Then in this case, optionally, processing unit can will be in multiple alternative executors
Any one is determined as the original execution person of transport task.Optionally, when processing unit can also be accumulative with the grade of service, service
A length of foundation determines original execution person from multiple alternative executors.Such as it can be by the grade of service in multiple alternative executors most
High, the service longest performer of time duration is determined as original execution person.Distribution can guarantee transport task simultaneously in this way
Execution efficiency and execute quality.
As it can be seen that above-mentioned first time assigning process actually considers is between transport task and performer
With property.Further optionally, processing unit can be real-time perfoming to the first time allocation processing of transport task, that is to say place
Reason device can be allocated processing after often receiving a transport task to it immediately；It is also possible to what timing carried out, that is to say
At interval of preset time period, processing unit can be allocated together the transport task generated in this preset time period.
S102 determines the first transport task and the second transport task for being currently at execution state in transport task.
After original execution person triggers task execution operation in APP, optionally, APP can send to processing unit and notify.Place
The state of transport task can be execution state by pending status modifier after the notice for receiving APP transmission by reason device.This
Execution state, which that is to say, indicates that original execution person is used means of transport transports article to be transported to object from article with loading
Product unloading ground.
Further, processing unit can determine that the first transport for being currently at execution state is appointed in all transport tasks
Business and the second transport task.The two tasks can be all any two being currently in execution state transport task.Its
In, after first time allocation processing, the first transport task corresponds to the first original execution person, and the second transport task corresponds to the
Two original execution persons.
S103 judges that the first transport is appointed according to the mission bit stream that the first transport task and the second transport task respectively include
Whether business and the second transport task meet task merging condition.
S104, if the first transport task and the second transport task meet task merging condition, by the first transport task and
Second transport task is distributed together to target executor, and target executor is the corresponding first original execution person of the first transport task
Or the second corresponding second original execution person of transport task.
Then, processing unit obtains the mission bit stream that the transport task that the two are in execution state respectively includes, and root
Judge whether this two transport task meets task merging condition according to the mission bit stream of the two.Optionally, the second above-mentioned sub-distribution
Processing, processing unit can be carried out at interval of prefixed time interval.
If meeting task merging condition, show the execution along with transport task, point obtained after first time allocation processing
No longer be with result it is most reasonable, then processing unit can merge the first transport task and the second transport task, namely
It is to be distributed unitedly to a target executor, this target executor both can may be second for the first original execution person
Original execution person.At this point, processing unit can also notify the performer after replacement to corresponding after carrying out task merging
User, so that user can understand the latest development of the transport task of oneself generation in time.
For example, after task merging, if processing unit all distributes the first transport task and the second transport task
To the first original execution person, then the second original execution person would be at idle state, at this point, processing unit can be by user most
Newly generated transport task distributes to the second original execution person, to guarantee that the newly generated transport task of user also can be timely
It dispenses, improves the execution efficiency of transport task entirety.
If being unsatisfactory for task merging condition, show that the allocation result that first time assigning process obtains remains very rationally
, then processing unit will not change the original execution person of two transport tasks.
For the foundation for judging whether to meet task merging condition, optionally, the article that can be transport task is loaded
Ground.If the first article of the first transport task loads ground and the second article of the second transport task loads the distance between ground difference
Less than or equal to pre-determined distance value, show that the corresponding article of this two transport task is closer with loading, it is determined that the first transport
Task and the second transport task meet task merging condition.
According to actual needs, optionally, judgment basis can also be the article unloading ground of transport task, if the first transport is appointed
The distance between the first article unloading ground of business and the second article unloading ground of the second transport task difference are less than or equal to default
Distance value shows that two transport tasks are closer with having article unloading, it is determined that the first transport task and the second transport task
Meet task merging condition.
As it can be seen that second above-mentioned of assigning process actually considered is matching between transport task.
In the present embodiment, processing unit first carries out the first sub-distribution to transport task according to the information on services of performer
Processing.Then, then the transport task that execution state is in all transport tasks after first time allocation processing is determined, and
Second of allocation processing is carried out to these transport tasks.The process of this second sub-distribution is specifically: processing unit is according to place
In the mission bit stream that the first transport task of the state of execution and the second transport task respectively include, judge that the two transport tasks are
It is no to meet task merging condition.If meeting task merging condition, can this distribution of two transport tasks is divided equally be assigned to target and hold
Passerby, this target executor are the corresponding first original execution person of the first transport task or the second original execution person.According to upper
Description is stated it is found that first time allocation processing process considered is matching between transport task and performer, second
What allocation processing process considered is the matching between transport task, and allocation processing combines twice, can avoid transporting as far as possible
The problem of task unreasonable distribution, and can also further increase the execution efficiency of transport task.
According to foregoing description it is found that may include plurality of kinds of contents in the mission bit stream of transport task.Wherein, article unloads position
Set is mostly important one during determining whether the first transport task and the second transport task meet task merging condition
A foundation.In addition to this it is possible to which the other content in mission bit stream is used in combination while use " product loading location "
To determine whether the two transport tasks meet task merging condition.
Due to may include user-defined article delivery time in mission bit stream, and in general, the distribution of task
It will guarantee the punctual completion of transport task.Therefore, when between the article of the first transport task and the second transport task unloading ground
Distance difference be less than or equal to pre-determined distance value when, for judging whether the two transport tasks meet task merging condition,
A kind of optionally mode is as shown in Figure 2 a.
S201 calculates separately the first traveling needed for the first original execution person and second original execution person's operating range difference
Time and the second running time.
When distance difference is less than or equal to pre-determined distance value, further, it is original that processing unit can first obtain first
Executor and the current travel speed of the second original execution person.The first fortune is calculated separately out further according to travel speed and distance difference
Corresponding first running time of defeated task and corresponding second running time of the second transport task.Optionally, travel speed can be with
The means of transport acquisition driven by each original execution person, and processing unit is uploaded to by the APP that original execution person uses.
S202, if the first running time and/or the second running time are less than or equal to the first transport task and the second transport
Delivery time between task is poor, it is determined that the first transport task and the second transport task meet task merging condition.
Processing unit determines being sent to for the two transport tasks further according to the delivery time that two transport tasks respectively include
Time difference.If it is poor that the first running time is less than or equal to delivery time, show that the first original execution person is executing the first transport
It is the article unloading ground that can rush for the second transport task in time after task.That is, the first original execution person can be with
Two transport tasks are successively sequentially completed according to delivery time.At this point, processing unit be assured that the first transport task and
Second transport task meets task merging condition, and the two transport tasks can be distributed unitedly to the first original execution person.
Similar, if the second running time is less than or equal to, delivery time is poor, and processing unit determines the first transport task
Meet task merging condition with the second transport task, and the two transport tasks can be distributed to the second original execution person.If
First running time and the second running time are both less than or poor equal to delivery time, then processing unit can appoint the two transports
The first original execution person or the second original execution person are distributed in business.A kind of proper way is usually to transport two
Task distributes original execution person corresponding to minimum running time.
During determining whether the first transport task and the second transport task meet task merging condition, in addition to by object
Except product unloading position and delivery time are used in combination, product loading location and type of items can also be used in combination.Therefore,
When the distance between the article of the first transport task and the second transport task unloading ground, difference is less than or equal to pre-determined distance value,
For judging whether two transport tasks meet task merging condition, another optionally mode, as shown in Figure 2 b.
S203 inquires type of items relation table, to determine the first transport task and the corresponding object of the second transport task
Whether category type is same or similar.
S204, if the first transport task and the second transport task have same or similar type of items, it is determined that the
One transport task and the second transport task meet task merging condition.
Specifically, it is configured with pre-set type of items relation table in processing unit, can recorde in this relation table
There is preset same or similar relationship between various type of items.Then processing unit can determine by inquiring this relation table
Whether the type of items that one transport task and the second transport task respectively include is same or similar.It is if they are the same or similar, table
Transportation environment needed for the two bright transport tasks is essentially identical, then processing unit can determine that two transport tasks meet task conjunction
And condition.
For example, if the first transport task and the corresponding type of items of the second transport task be fragile article or
When for non frangible product, it may be considered that the two transport tasks meet task merging condition.If the corresponding object of the first transport task
Category type is the breakables such as glassware or electronic product, and the corresponding type of items of the second transport task is the non-easy of furniture etc.
Mince product, then sends the first original execution person of the first transport task to go the second transport task of transport clearly inappropriate, this two
A transport task, which that is to say, is unsatisfactory for task merging condition.
Need to illustrate has, and after second of allocation processing, processing unit such as can be by the first transport task and
Two transport tasks are same to distribute to the first original execution person.At this point, the second original execution person is also due to the particularity of transport task
It needs the corresponding article to be transported of the second transport task being transitted to the first original execution person.When thus appearing in a part
The feelings there are two the corresponding whole of transport task article to be transported are placed on the means of transport that interior first original execution person uses
Condition.Based on this, processing unit product loading location and Item Weight can also be used in combination to determine the first, second haulagman
Whether tool meets task merging condition.
Then when the distance between the article of the first transport task and the second transport task unloading ground, difference is less than or equal in advance
If when distance value, for judging whether two transport tasks meet task merging condition, another optionally mode, such as Fig. 2 c institute
Show.
S205 obtains the first Item Weight of the first transport task and the second article weight of the second transport task respectively
Amount.
S206, if the sum of the first Item Weight and the second Item Weight are less than or equal to the first original execution person corresponding the
One dead weight and/or corresponding second dead weight of the second original execution person, it is determined that the first transport task and second
Transport task meets task merging condition.
Specifically, processing unit first gets the first transport according to the mission bit stream that two transport tasks respectively include and appoints
The sum of first Item Weight of business and the second Item Weight of the second transport task, and calculate Item Weight.Processing unit is again
Get corresponding first dead weight of the first original execution person and corresponding second maximum load of the second original execution person
Amount.
If the sum of calculated Item Weight is less than or equal to the first dead weight, show that the first original execution person uses
Means of transport can place the articles to be transported of two transport task wholes simultaneously, then can determine that the first, second transport is appointed
Business meets task merging condition.At this point, processing unit can distribute the two transport tasks unitedly to the first original execution person.
Similar, if the sum of Item Weight is less than or equal to the second dead weight, it can determine the first transport task
Meet task merging condition with the second transport task.Processing unit can distribute the two transport tasks unitedly to first original
Executor.If the sum of Item Weight is not only less than or equal to the first dead weight, but also is less than or equal to the second dead weight, then
The two transport tasks can be distributed to the first original execution person or the second original execution person.A kind of proper way
Usually, two transport tasks are distributed to the immediate performer of the sum of dead weight and Item Weight.
It is similar with Item Weight, product loading location and article volume can also be used in combination.At this point, judging
One, the second transport task whether meet task merging condition detailed process and Fig. 2 c illustrated embodiment it is essentially identical, only need by
Item Weight in above-described embodiment replaces with article volume.
In conclusion the above-mentioned embodiment as shown in Fig. 2 a~Fig. 2 c is in fact provided using different in mission bit stream
Content judges whether two transport tasks meet the mode of task merging condition.The various embodiments described above are a kind of signal, In
It, can also will be in product loading location, the delivery time of article, type of items, Item Weight, article volume in practical application
Any two kinds or any several as according to determine whether meeting task merging condition.Certainly, use is arrived in deterministic process
Content it is more, judging result is more accurate, can also further increase transport task distribution reasonability, guarantee transport appoint
The execution efficiency for entirety of being engaged in.
Due to the particularity of transport task, the process of second of allocation processing is actually in addition to including determining mesh
It marks except executor, it can also be including the transport process of article to be transported, i.e., in the means of transport used non-targeted executor
Article to be transported be transported on the means of transport that target executor uses.Then for the step 104 in embodiment illustrated in fig. 1,
A kind of optionally implementation is as shown in Figure 3a.
S301, according to the current second position in the current first position of the first original execution person and the second original execution person
Determine target position.
S302 notifies target position to the first original execution person and the second original execution person, so that the first original execution
Person or the second original execution person are in target position by the whole of the first transport task and the second transport task item transfer to be transported
To target executor.
Specifically, processing unit can obtain the first position and the second original that the first original execution person is presently in respectively
The second position that beginning executor is presently in, and determine that a target position, this target position that is to say according to this two positions
The transhipment position of article to be transported.Processing unit can notify this target position former to the first original execution person and second respectively
After beginning executor, two original execution persons can then go to this target position immediately, to complete the transhipment of article to be transported in time.
For the position that each original execution person is presently in, it is alternatively possible to be acquired by the APP that performer uses
And it is sent to processing unit.Determination for target position, optionally, processing unit can be by first position and the second positions
Midpoint is determined directly as target position.Optionally, processing unit can also inquire the local multiple default transhipment positions being configured
It sets, the default transhipment position nearest apart from first position or the second position is determined as target position, it can also be by distance first
Position, the default transhipment position that the midpoint of the second position is nearest are determined as target position.Wherein, multiple default transhipment positions
Effect and express delivery dispatching scene in express delivery dispatching site it is similar, can be dedicated for article transhipment.
Other than the mode shown in Fig. 3 a, for the step 104 in embodiment illustrated in fig. 1, another optionally mode
As shown in Figure 3b.
S303 loads ground according to the first article of the first transport task, generates first with reference to traveling to the unloading of the first article
Route.
S304 loads ground according to the second article of the second transport task, generates second with reference to traveling to the unloading of the second article
Route.
S305, according to first with reference to travel route and the second reference traveling route determination target position.
Specifically, processing unit is judging that the first transport task and the second transport task meet task merging condition
Afterwards, so that it may draw one with the unloading of the first article according to the first article of the first transport task for the first transport task with loading
Item first refers to travel route.Likewise, processing unit may be that the second transport task draws out second with reference to travel route.
Travel route is referred to based on two, optionally, processing unit can be straight with reference to the position where the intersection point of travel route by two
It connects and is determined as target position.
It should be noted that in practical applications, for the drafting opportunity of reference travel route, being also possible to processing unit
According to the product loading location of transport task and product loading location, transport task is drawn thus immediately after getting transport task
One is made with reference to travel route.Then, original execution person can execute transport task with reference to travel route according to this.It is handling
Device is after step 103, and when determining that this transport task needs to be merged, processing unit can directly transfer what this had been generated
With reference to travel route.
S306 notifies target position to the first original execution person and the second original execution person, so that the first original execution
Person and the second original execution person are in target position by the whole of the first transport task and the second transport task item transfer to be transported
To target executor.
The implementation procedure of above-mentioned steps 306 may refer to the associated description in embodiment as shown in Figure 3a, no longer superfluous herein
It states.
In conclusion embodiment shown in Fig. 3 a and Fig. 3 b in fact provides two different target position determination sides
Formula.Two original execution persons current position determines target position according to mode shown in Fig. 3 a.Due to original execution person
Position change in real time, therefore, in this way, the target position determined at different times is different, this
Kind method of determination has stronger real-time.Mode shown in Fig. 3 b is to be determined according to pre-rendered reference travel route out
Target position.For each transport task, it is corresponding with reference to travel route be it is fixed, therefore, in this way
The target position determined is also fixed.In practical applications, it can select according to actual needs true using different modes
Surely the target position for article transhipment, improves the flexibility of target position method of determination.
In addition, the description according to the above embodiments when the first transport task and the second transport task meet it is found that appoint
When merging condition of being engaged in, there can be an article transport process, that is, two transport tasks need to transfer to a performer
To complete.Although being conducive to the efficient execution of transport task after merging, the very possible interests for damaging performer,
Because of this, it is very likely that being reluctant to merge the task of oneself with other people there are performer.Based on this, Fig. 4 is that the present invention is implemented
The flow chart for another transport task processing method that example provides.As shown in figure 4, this method further includes following steps:
S101 distributes transport task to original execution person according to the information on services of performer.
S102 determines the first transport task and the second transport task for being currently at execution state in transport task.
The implementation procedure of above-mentioned steps 101~102 may refer to the associated description in embodiment as shown in Figure 1, herein not
It repeats again.
Whether S401, first transport task and second transport task of the judgement in execution state all have merging qualification,
If the first transport task and the second transport task all have merging qualification, 103~104 are thened follow the steps, otherwise return step
101。
During performer registration, each performer can select oneself whether desire to participate in task conjunction
And.Therefore, after performer completes registration, each task is selected as when processing unit can be registered according to performer
Executor is associated with upper qualification mark.After the original execution person that a performer becomes a transport task, this fortune
Defeated task can also be associated a qualification mark identical with this original execution person, to identify whether this transport task has conjunction
And qualification.
Based on this, after step 102 determines the first transport task and the second transport task, processing unit can
According to the two transport tasks, respectively associated qualification identifies whether the two determining transport tasks have merging qualification.If first
The mark of qualification associated by transport task and the second transport task indicates there is merging qualification, then processing unit can continue to hold
Row following steps 103~104, so that the merging for completing transport task that is to say second of allocation processing.
S103 judges that the first transport is appointed according to the mission bit stream that the first transport task and the second transport task respectively include
Whether business and the second transport task meet task merging condition.
S104, if the first transport task and the second transport task meet task merging condition, by the first transport task and
Second transport task is distributed together to target executor, and target executor is the corresponding first original execution person of the first transport task
Or the second corresponding second original execution person of transport task.
The implementation procedure of above-mentioned steps 103~104 may refer to the associated description in embodiment as shown in Figure 1, herein not
It repeats again.
If having at least one not have in the first transport task and the second transport task merges qualification, processing unit will not
Processing is merged to it.At this point, the first transport task is still completed by the first original execution person, the second transport task is still by second
Original execution person completes.Processing unit can continue to carry out first time allocation processing to the new transport task that user generates.
In the present embodiment, before merging to transport task, it can also first judge whether transport task there is merging to provide
Lattice.Processing unit only merges i.e. second of the allocation processing of processing to two transport tasks for all having merging qualification.And it is right
In not having the transport task for merging qualification, can't participate in during second of allocation processing.Above-mentioned deterministic process is drawn
Enter, that is to say while considering the interests of performer and the reasonability of task distribution, is guaranteeing that task distribution is reasonable
While property, it can also guarantee the interests of performer to the maximum extent.
Need to illustrate herein has, and what is be related in the various embodiments described above is all at merging between two transport tasks
Reason.But in practical applications, processing can also be merged to more than two transport tasks.But more than two transports are appointed
It is still two transport tasks that business, which merges the most basic unit of processing,.For example, for transport task A, B, C, if by
The mode that the various embodiments described above provide determines that in transport task A~transport task C, any two transport task is all full respectively
Sufficient task merging condition, then processing unit can merge these three transport tasks, to realize that more than two transports are appointed
The merging treatment of business.
Fig. 5 is a kind of structural schematic diagram of transport task processing unit provided in an embodiment of the present invention, as shown in figure 5, should
Transport task processing unit includes:
First distribution module 11, for being distributed transport task to original execution according to the information on services of performer
Person.
Determining module 12, for determining the first transport task and for being currently at execution state in the transport task
Two transport tasks.
Condition judgment module 13 is appointed for respectively include according to first transport task and second transport task
Business information, judges whether first transport task and second transport task meet task merging condition.
Second distribution module 14 is closed if meeting the task for first transport task and second transport task
And condition, then first transport task and second transport task are distributed together to target executor, the target is held
Passerby is that the corresponding first original execution person of first transport task or second transport task are corresponding second original
Executor.
Optionally, the condition judgment module 13 in described device specifically includes: determination unit 131.
The determination unit 131, if the first article for first transport task transports with unloading with described second
The distance between the second article unloading ground of task difference is less than or equal to pre-determined distance value, it is determined that first transport task
Meet the task merging condition with second transport task.
Optionally, the condition judgment module 13 in described device specifically includes: computing unit 132.
The computing unit 132, for calculating separately the first original execution person and the second original execution person row
Sail the first running time and the second running time needed for the distance difference.
The determination unit 131, if being less than or equal to for first running time and/or second running time
Delivery time between first transport task and second transport task is poor, it is determined that first transport task and institute
It states the second transport task and meets the task merging condition.
Optionally, the condition judgment module 13 in described device specifically includes: query unit 133.
The query unit 133, for inquiring type of items relation table, with determination first transport task and described
Whether the corresponding type of items of two transport tasks is same or similar.
The determination unit 131, if for first transport task and second transport task have it is identical or
Similar type of items, it is determined that first transport task and second transport task meet the task merging condition.
Optionally, the condition judgment module 13 in described device specifically includes: acquiring unit 134.
The acquiring unit 134, for obtaining the first Item Weight and described of first transport task respectively
Second Item Weight of two transport tasks.
The determination unit 131, if being less than or waiting for the sum of first Item Weight and second Item Weight
In corresponding second maximum of corresponding first dead weight of the first original execution person and/or the second original execution person
Loading capacity, it is determined that first transport task and second transport task meet the task merging condition.
Optionally, the second distribution module 14 in described device specifically includes: determination unit 141 and notification unit 142.
The determination unit 141, for according to the current first position of the first original execution person and described second
The current second position of original execution person determines target position.
The notification unit 142, for notifying the target position to the first original execution person and described second
Original execution person, so that the first original execution person and the second original execution person are in the target position by described first
The whole item transfer to be transported of transport task or second transport task is to the target executor.
Optionally, the second distribution module 14 in described device specifically includes: generation unit 143.
The generation unit 143, for loading ground according to the first article of first transport task, the first article unloads
Ground generates first and refers to travel route；And ground, the unloading of the second article are loaded according to the second article of second transport task
Ground generates second and refers to travel route.
The determination unit 141, for true with reference to travel route with reference to travel route and described second according to described first
Set the goal position.
The notification unit 142, for notifying the target position to the first original execution person and described second
Original execution person, so that the first original execution person and the second original execution person are in the target position by described first
The whole item transfer to be transported of transport task or second transport task is to the target executor.
Optionally, described device further include: qualification judgment module 21, for judging first fortune in execution state
Whether defeated task and second transport task all have merging qualification.
The condition judgment module 13, if being also used to first transport task and second transport task all has institute
Merging qualification is stated, then according to being currently in the first transport task of execution state and the second transport task respectively includes of the task
Information, judges whether first transport task and second transport task meet task merging condition.
The method that Fig. 5 shown device can execute FIG. 1 to FIG. 4 illustrated embodiment, the part that the present embodiment is not described in detail,
It can refer to the related description to FIG. 1 to FIG. 4 illustrated embodiment.The implementation procedure and technical effect of the technical solution referring to Fig. 1~
Description in embodiment illustrated in fig. 4, details are not described herein.
The foregoing describe the built-in function of transport task processing unit and structures, and in a possible design, transport is appointed
The structure of business processing unit can be realized as an electronic equipment, such as task distribution server.Fig. 6 is provided in an embodiment of the present invention
The structural schematic diagram of electronic equipment embodiment one as shown in fig. 6, the electronic equipment includes: memory 31, and connects with memory
The processor 32 connect, memory 31 execute the transport task processing side provided in any of the above-described embodiment for storing electronic equipment
The program of method, processor 32 are configurable for executing the program stored in memory 31.
Program includes one or more computer instruction, wherein one or more computer instruction is executed by processor 32
When can be realized following steps:
Transport task is distributed to original execution person according to the information on services of performer；
The first transport task and the second transport task for being currently at execution state are determined in the transport task；
According to the mission bit stream that first transport task and second transport task respectively include, described first is judged
Whether transport task and second transport task meet task merging condition；
If first transport task and second transport task meet the task merging condition, by described first
Transport task and second transport task are distributed together to target executor, and the target executor is that first transport is appointed
Be engaged in corresponding first original execution person or the corresponding second original execution person of second transport task.
Optionally, processor 32 is also used to execute all or part of the steps in aforementioned approaches method step.
Wherein, it can also include communication interface 33 in the structure of electronic equipment, for electronic equipment and other equipment or lead to
Communication network communication.
In addition, the embodiment of the invention provides a kind of computer storage medium, for storing above-mentioned electronic equipments
Computer software instructions, it includes for executing in embodiment of the method shown in above-mentioned FIG. 1 to FIG. 4 involved by transport task processing method
And program.
The apparatus embodiments described above are merely exemplary, wherein unit can be as illustrated by the separation member
Or may not be and be physically separated, component shown as a unit may or may not be physical unit, i.e.,
It can be located in one place, or may be distributed over multiple network units.It can select according to the actual needs therein
Some or all of the modules achieves the purpose of the solution of this embodiment.Those of ordinary skill in the art are not paying creative labor
In the case where dynamic, it can understand and implement.
Through the above description of the embodiments, those skilled in the art can be understood that each embodiment can
It is realized by the mode of required general hardware platform is added, naturally it is also possible to which reality is come in conjunction with by way of hardware and software
It is existing.Based on this understanding, substantially the part that contributes to existing technology can be with product in other words for above-mentioned technical proposal
Form embody, which may be stored in a computer readable storage medium, such as ROM/RAM, magnetic disk, CD
Deng, including some instructions use is so that a computer installation (can be personal computer, server or network equipment etc.)
The method for executing certain parts of each embodiment or embodiment.
Finally, it should be noted that the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although
Present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: it still may be used
To modify the technical solutions described in the foregoing embodiments or equivalent replacement of some of the technical features；
And these are modified or replaceed, technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution spirit and
Range.
Claims (10)
1. a kind of transport task processing method characterized by comprising
Transport task is distributed to original execution person according to the information on services of performer；
The first transport task and the second transport task for being currently at execution state are determined in the transport task；
According to the mission bit stream that first transport task and second transport task respectively include, first transport is judged
Whether task and second transport task meet task merging condition；
If first transport task and second transport task meet the task merging condition, described first is transported
Task and second transport task are distributed together to target executor, and the target executor is first transport task pair
The the first original execution person or the corresponding second original execution person of second transport task answered.
2. the method according to claim 1, wherein described transport according to first transport task with described second
The mission bit stream that defeated task respectively includes, judges whether first transport task and second transport task meet task conjunction
And condition, comprising:
If between the first article unloading ground of first transport task and the second article unloading ground of second transport task
Distance difference be less than or equal to pre-determined distance value, it is determined that first transport task and second transport task meet institute
State task merging condition.
3. according to the method described in claim 2, it is characterized in that, described transport according to first transport task with described second
The mission bit stream that defeated task respectively includes, judges whether first transport task and second transport task meet task conjunction
And condition, comprising:
It calculates separately the first original execution person and the second original execution person travels first needed for the distance difference
Running time and the second running time；
If first running time and/or second running time are less than or equal to first transport task and described the
Delivery time between two transport tasks is poor, it is determined that first transport task and second transport task meet described appoint
Business merging condition.
4. according to the method described in claim 2, it is characterized in that, described transport according to first transport task with described second
The mission bit stream that defeated task respectively includes, judges whether first transport task and second transport task meet task conjunction
And condition, comprising:
Type of items relation table is inquired, with determination first transport task and the corresponding article of the second transport task
Whether type is same or similar；
If first transport task and second transport task have same or similar type of items, it is determined that described
First transport task and second transport task meet the task merging condition.
5. according to the method described in claim 2, it is characterized in that, described transport according to first transport task with described second
The mission bit stream that defeated task respectively includes, judges whether first transport task and second transport task meet task conjunction
And condition, comprising:
The first Item Weight of first transport task and the second Item Weight of second transport task are obtained respectively；
If the sum of first Item Weight and second Item Weight are corresponding less than or equal to the first original execution person
The first dead weight and/or corresponding second dead weight of the second original execution person, it is determined that it is described first fortune
Defeated task and second transport task meet the task merging condition.
6. the method according to any one of claims 1 to 5, which is characterized in that it is described by first transport task and
Second transport task is distributed together to target executor, comprising:
According to the current second position in the current first position of the first original execution person and the second original execution person
Determine target position；
The target position is notified to the first original execution person and the second original execution person, so that described first is former
Beginning executor and the second original execution person appoint first transport task or second transport in the target position
The whole of business item transfer to be transported is to the target executor.
7. the method according to any one of claims 1 to 5, which is characterized in that it is described by first transport task and
Second transport task is distributed together to target executor, comprising:
Ground is loaded according to the first article of first transport task, generates first with reference to travel route to the unloading of the first article；
Ground is loaded according to the second article of second transport task, generates second with reference to travel route to the unloading of the second article；
According to described first with reference to travel route and the second reference traveling route determination target position；
The target position is notified to the first original execution person and the second original execution person, so that described first is former
Beginning executor and the second original execution person appoint first transport task or second transport in the target position
The whole of business item transfer to be transported is to the target executor.
8. the method according to claim 1, wherein the determination in the transport task is currently at execution
After the first transport task and the second transport task of state, the method also includes:
Whether first transport task and second transport task of the judgement in execution state all have merging qualification；
If first transport task and second transport task all have the merging qualification, execute described according to
The mission bit stream that first transport task and second transport task respectively include judges first transport task and described
Whether two transport tasks meet the step of task merging condition.
9. a kind of transport task processing unit characterized by comprising
First distribution module, for being distributed transport task to original execution person according to the information on services of performer；
Determining module, for determining the first transport task and the second transport that are currently at execution state in the transport task
Task；
Condition judgment module, the task letter for respectively including according to first transport task and second transport task
Breath, judges whether first transport task and second transport task meet task merging condition；
Second distribution module, if meeting the task merging item for first transport task and second transport task
Part is then distributed first transport task and second transport task together to target executor, the target executor
For the corresponding first original execution person of first transport task or corresponding second original execution of second transport task
Person.
10. a kind of electronic equipment characterized by comprising memory, and the processor being connect with the memory；
The memory, for storing one or more computer instruction, wherein one or more computer instruction is for institute
It states processor and calls execution；
The processor, for executing one or more computer instruction to realize described in any one of claims 1 to 8
Transport task processing method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910594964.6A CN110472769A (en) | 2019-07-03 | 2019-07-03 | Transport task processing method, device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910594964.6A CN110472769A (en) | 2019-07-03 | 2019-07-03 | Transport task processing method, device and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110472769A true CN110472769A (en) | 2019-11-19 |
Family
ID=68507585
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910594964.6A Pending CN110472769A (en) | 2019-07-03 | 2019-07-03 | Transport task processing method, device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110472769A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113537672A (en) * | 2020-04-15 | 2021-10-22 | 北京旷视机器人技术有限公司 | Task allocation method, task allocation device, medium, and electronic device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107103391A (en) * | 2017-05-02 | 2017-08-29 | 莆田市烛火信息技术有限公司 | A kind of logistics delivery device and method |
| CN107146051A (en) * | 2017-05-02 | 2017-09-08 | 莆田市烛火信息技术有限公司 | A kind of shared logistics transporting device and method |
| CN107844882A (en) * | 2017-08-24 | 2018-03-27 | 北京小度信息科技有限公司 | Dispense task processing method, device and electronic equipment |
| CN108154298A (en) * | 2017-12-22 | 2018-06-12 | 北京小度信息科技有限公司 | Dispense method for allocating tasks, device, electronic equipment and computer storage media |
| CN108335071A (en) * | 2018-02-06 | 2018-07-27 | 北京小度信息科技有限公司 | Dispense method for allocating tasks, device, electronic equipment and computer storage media |
| CN108564269A (en) * | 2018-04-09 | 2018-09-21 | 北京小度信息科技有限公司 | Dispense method for allocating tasks, device, electronic equipment and computer storage media |
-
2019
- 2019-07-03 CN CN201910594964.6A patent/CN110472769A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107103391A (en) * | 2017-05-02 | 2017-08-29 | 莆田市烛火信息技术有限公司 | A kind of logistics delivery device and method |
| CN107146051A (en) * | 2017-05-02 | 2017-09-08 | 莆田市烛火信息技术有限公司 | A kind of shared logistics transporting device and method |
| CN107844882A (en) * | 2017-08-24 | 2018-03-27 | 北京小度信息科技有限公司 | Dispense task processing method, device and electronic equipment |
| CN108154298A (en) * | 2017-12-22 | 2018-06-12 | 北京小度信息科技有限公司 | Dispense method for allocating tasks, device, electronic equipment and computer storage media |
| CN108335071A (en) * | 2018-02-06 | 2018-07-27 | 北京小度信息科技有限公司 | Dispense method for allocating tasks, device, electronic equipment and computer storage media |
| CN108564269A (en) * | 2018-04-09 | 2018-09-21 | 北京小度信息科技有限公司 | Dispense method for allocating tasks, device, electronic equipment and computer storage media |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113537672A (en) * | 2020-04-15 | 2021-10-22 | 北京旷视机器人技术有限公司 | Task allocation method, task allocation device, medium, and electronic device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Giannikas et al. | An interventionist strategy for warehouse order picking: Evidence from two case studies | |
| McFarlane et al. | Intelligent logistics: Involving the customer | |
| Du et al. | A real-time vehicle-dispatching system for consolidating milk runs | |
| Melacini et al. | Development of a framework for pick-and-pass order picking system design | |
| CN106447470A (en) | Delivery order distribution method and delivery order distribution device | |
| CN103971170B (en) | The method and apparatus that a kind of change being used for characteristic information is predicted | |
| CN107194656A (en) | A kind of method and device for planning of the Distribution path based on standard container order | |
| CN110348613A (en) | Distribution Center Intelligent logistics management method and system | |
| CN107316167A (en) | A kind of allocator and device based on shops position of distributors | |
| Baykasoglu et al. | A multi-agent approach to load consolidation in transportation | |
| CN111292045B (en) | Exit management method for intelligent warehouse | |
| Azadeh et al. | Dynamic human-robot collaborative picking strategies | |
| CN107169715A (en) | Parts supply method, system and the terminal based on standard container kinds of goods of distributors | |
| CN115239223A (en) | Allocation center task scheduling method, device, equipment and storage medium | |
| CN112700193A (en) | Order distribution method and device, computing equipment and computer readable storage medium | |
| CN107274084A (en) | A kind of order intelligent dispatching method, system and terminal based on standard container | |
| CN116090942A (en) | Multi-scene robot distribution method and system based on Internet of things | |
| Le-Anh et al. | Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems | |
| CN110472769A (en) | Transport task processing method, device and electronic equipment | |
| Meesuptaweekoon et al. | Dynamic vehicle routing problem with multiple depots | |
| CN109493178A (en) | A kind of cloud retail order decomposition method and system | |
| CN110689293A (en) | Method and device for processing articles out of warehouse | |
| CN112327870A (en) | Dispatching method of meal delivery robot and edge server | |
| Blecker et al. | Complexity management in supply chains: concepts, tools and methods | |
| CN113159467A (en) | Vehicle dispatching order processing method and device |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191119 |