CN110322106A - A kind of multi-destination, multiple means of transports luggage fetch and deliver dispatching method - Google Patents
A kind of multi-destination, multiple means of transports luggage fetch and deliver dispatching method Download PDFInfo
- Publication number
- CN110322106A CN110322106A CN201910293991.XA CN201910293991A CN110322106A CN 110322106 A CN110322106 A CN 110322106A CN 201910293991 A CN201910293991 A CN 201910293991A CN 110322106 A CN110322106 A CN 110322106A
- Authority
- CN
- China
- Prior art keywords
- destination
- luggage
- place
- cluster
- order
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/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
- G06Q10/06316—Sequencing of tasks or work
-
- 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)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
It is related to a kind of luggage for having multiple destinations, multiple means of transports the present invention provides a kind of and fetches and delivers dispatching method.The present invention passes through destination allocation schedule step and destination access scheduling step, when being related to multiple destinations, needing to fetch and deliver using multiple means of transports to complete luggage, it is required according to the time and location of extraction and the transport of all luggage orders, for it is all pick luggage vehicle and cook up meet all order requirements as far as possible, the place access sequence few apart from short, time, it realizes high efficiency, time saving and energy saving complete luggage and fetch and deliver task, apparent improvement is brought for people's trip convenience, has filled up blank in the prior art.
Description
Technical field
The present invention relates to a kind of dispatching methods that luggage is fetched and delivered, and in particular to one kind has multiple destinations, multiple haulagman
The luggage of tool fetches and delivers dispatching method.
Background technique
In terms of trip, luggage is always a troubling problem, particularly with the traveler for dragging house to take mouth.Even if
In today that traffic is very flourishing, from airport, the hotel high-speed rail Zhan Dao or family, still there is a distance, especially in strange land,
Foothold between airport or high-speed rail station to generally requiring to use public transport, if carrying many luggage, and plus needing
Child old man is looked after, usually makes in a dilemma, some travelers are extremely awkward in order to avoid this section of journey, can only outbid to beat
Vehicle uses hotel's pickup and delivery service.How economy quickly solves the problems, such as luggage troubling during going on a journey, for improving
The trip experience of people, raising trip quality have great importance.
Currently, a kind of method fetched and delivered specifically for luggage, especially one kind are related to multiple destinations, using more not yet
The efficient luggage that a means of transport is completed fetches and delivers dispatching method.Such a dispatching method is provided, luggage can not only be filled up
Fetch and deliver the blank of scheduling field, moreover it is possible to the efficiency and economy for improving luggage handling system, it is non-for improving people's quality of life
It is often significant.
Summary of the invention
The present invention is directed to blank in the prior art, and providing one kind and being related to one kind has multiple destinations, multiple haulagman
The luggage of tool fetches and delivers dispatching method.The present invention is being related to by destination allocation schedule step and destination access scheduling step
Multiple destinations, when needing to fetch and deliver using multiple means of transports to complete luggage, according to the extraction and transport of all luggage orders
Time and location requirement, for it is all pick luggage vehicle and cook up meet all order requirements as far as possible, apart from short, the time is few
Place access sequence, realize high efficiency, it is time saving and energy saving complete luggage and fetch and deliver task, brought obviously for people's convenience of going on a journey
Improvement.
The present invention is achieved by the following technical solutions:
A kind of multi-destination, multiple means of transports luggage fetch and deliver dispatching method, order is fetched and delivered by the luggage that client submits
In be sent to destination comprising n luggage, task, including destination allocation schedule step are fetched and delivered by m means of transport completion luggage
With destination access order scheduling steps:
The destination allocation schedule step is assigned to n destination in m cluster set by cluster, and by m
Cluster set distributes to m means of transport, and the corresponding cluster set of each means of transport, the cluster is so that same haulagman
The received luggage of tool institute is fetched and delivered in order, and place of withdrawing baggage number identical with Lee place of seeing off is most；
The purpose access order scheduling steps are that the point of destination in each cluster set distributes access order, are gathered by this
Means of transport where class set accesses according to the allocation order, is sent to task to complete luggage.
Further, the destination allocation schedule step the following steps are included:
1.1 take any m destination, and destination includes the initial bit in Lee place or m means of transport of withdrawing baggage and see off
Be set to cluster head, carry out k-means cluster, obtain m cluster set, wherein k-means cluster using apart from for space cost or
Time cost；
1.2 in each cluster set that step 1.1 obtains, count the number of repetition that wherein luggage is sent to place, will
The most place of number of repetition as the cluster set primary destination；
As m >=n: if all n destinations become at least one means of transport primary destination, purpose
Ground allocation schedule is completed, i.e., order belonging to destination is assigned；；If there is at least one destination do not become one or
Multiple means of transports primary destination, then count the number that the destination occurs in all cluster set, by the destination
The most cluster set of frequency of occurrence is primary destination revised as the destination, until all n destinations become at least
One means of transport is primary destination；
As m < n: each cluster of setting gather in frequency of occurrence supreme good k as the main purpose, k is opened by 1
Begin to be incremented by, until all n destinations become at least one means of transport primary destination；
1.3 set each non-principal destination clustered in set as n_d, are primary destination combined into m_ for the cluster set of n_d
D, more each non-principal destination n_d clustered in set and the primary destination place between the cluster set m_d of n_d
The shortest distance, the place includes withdrawing baggage place and to be sent to luggage place, if the shortest distance is less than the place to currently gathering
This place n_d is then moved in cluster set m_d by the average distance in other places in class set by currently clustering set；Extremely
This, cluster is completed.
Further, the step 1.3 are as follows: non-principal destination n_d and main mesh in more each cluster set
Ground be n_d cluster set m_d between place time difference, specifically: set cluster set J primary destination as d, for
Destination is not that the place e of d (sets the corresponding destination in the place as q), calculates e to being primary destination the cluster set of q in J
E is moved in L by the shortest distance in place in L if the shortest distance is less than the average distance in place in e to J by J set；Weight
This multiple step, until set locating for all orders no longer changes, cluster is completed.
Further, k-means cluster is used apart from the space cost between destination in the step 1.1
Running time, or the distance between for destination；The destination includes Lee place of withdrawing baggage and see off, i.e., each transport
Tool needs the place passed through；The running time is to carry out estimation by distance and road conditions to get, and is currently soft by navigating
The interface that part provides is directly read, such as Baidu, Gao De.
Further, k-means cluster takes using apart from the time cost for each luggage in the step 1.1
Send the time difference between order requirements delivery time.
Further, the destination access order scheduling steps the following steps are included:
2.1 have p destination in each cluster set, and destination includes withdraw baggage place and Lee place of seeing off, with fortune
Compared with defeated tool is currently located the progress one by one of the running time between place and the destination of all unallocated access orders, it will go
Time shortest destination is sailed as next stop access locations, distribution access order, then it is current using the place as means of transport
Site, the step for repetition, until corresponding access order is assigned in all p destinations；
The 2.2 destination access orders distributed according to step 2.1 calculate the time that means of transport reaches each destination
Tp, and the difference td between tp and the time tr of order requirements is calculated, the order requirements time is that client submits luggage to fetch and deliver information
It generates luggage and the requirement delivery time provided when order and total deadline Ta is provided:Always
Deadline refer to that means of transport successively accesses the total time on all purposes ground according to the access order of distribution；Running time is such as
The preceding interface provided by navigation software is directly read, such as Baidu, Gao De.
2.3 definition exclude set Q, and are initialized as null set:
For with excluding all purposes other than set Q, as td≤0, keeping current accessed sequence constant；As td > 0
When: the access order of the destination is moved forward 1, the td and total deadline Ta on all purposes ground are then recalculated:
If td is reduced, and Ta does not increase, then the secondary Forward comes into force, and returns to step 2.2；
If td reduces, but Ta is increased, then the secondary Forward does not come into force, i.e., without Forward, is continually maintained in former access
Sequentially, it is then return to step 2.2 and calculates next purpose；
If td is not reduced, which does not come into force, i.e., without Forward, this destination is added and excludes set Q, returned
To step 2.2；
Whether the E.T.A tp of all destinations is in order requirements time tr in 2.4 more each cluster set
Interior, if so, step finishes, destination access order allocation schedule is finished；If it is not, then the maximum destination of tr-tp value is picked
The step is re-started after removing, until the predicted access times tp of the destination in all cluster set is wanting seeking time tr
It is interior, and refuse the corresponding order in destination being removed.
Further, in the step 2.3: setting luggage delivery time threshold value is Td:
Definition excludes set Q, and is initialized as null set: for all purposes other than exclusion set Q, as td≤Td
When, keep current accessed sequence constant；As td > Td: the access order of the destination being moved forward 1, institute is then recalculated
Td and total deadline Ta purposefully:
If td is reduced, and Ta does not increase, then the secondary Forward comes into force, and returns to step 2.2；
If td reduces, but Ta is increased, then the secondary Forward does not come into force, i.e., does not execute Forward；
If td is not reduced, which does not come into force, this destination is added and excludes set Q, returns to step 2.2；
Whether the E.T.A tp of all destinations is in the order requirements time in 2.4 more each cluster set
In tr-Td, if so, step finishes；If it is not, comparing again after then rejecting the maximum destination of tr-tp value, until all poly-
The predicted access times tp of destination in class set is being wanted in seeking time tr, and refuses that the destination that is removed is corresponding to order
It is single.
Further, before executing destination allocation schedule step and destination access scheduling step, order is first carried out
Merge step: identical for place, requiring delivery time, different (order orders two if lead time is not more than T
It is single to merge, take time requirement earlier as the time requirement of order after merging, time requirement herein is that client takes in luggage
The time requirement submitted in order is sent, the identical place includes withdraw baggage place and Lee place of seeing off, times of an order
One place of anticipating is identical as any one place of other orders: T is artificial setting value, numerous according to the same day specific order
The situations such as busy situation, road conditions determine.
It is provided by the invention it is a kind of have multiple destinations, the luggage of multiple means of transports fetches and delivers dispatching method with following skill
Art effect: the present invention is being related to multiple destinations, needs by destination allocation schedule step and destination access scheduling step
When being fetched and delivered using multiple means of transports to complete luggage, required according to the time and location of extraction and the transport of all luggage orders,
For it is all pick luggage vehicle and cook up meet all order requirements as far as possible, the place access sequence few apart from short, time,
Realize high efficiency, it is time saving and energy saving complete luggage and fetch and deliver task, bring apparent improvement for people's convenience of going on a journey, filled up existing
There is the blank in technology.
Specific embodiment
In this part, further explanation and description of the technical solution of the present invention are carried out.It is pointed out that this reality
It applies in example only as explaining and illustrating, is not construed as limiting the invention, embodiments of the present invention are also not limited to following one kind
Or it is several.
Embodiment 1
A kind of multi-destination, multiple means of transports luggage fetch and deliver dispatching method, order is fetched and delivered by the luggage that client submits
In be sent to destination comprising n luggage, task, including destination allocation schedule step are fetched and delivered by m means of transport completion luggage
With destination access order scheduling steps:
The destination allocation schedule step is assigned to n destination in m cluster set by cluster, and by m
Cluster set distributes to m means of transport, and the corresponding cluster set of each means of transport, the cluster is so that same haulagman
The received luggage of tool institute is fetched and delivered in order, and place of withdrawing baggage number identical with Lee place of seeing off is most；
The purpose access order scheduling steps are that the point of destination in each cluster set distributes access order, are gathered by this
Means of transport where class set accesses according to the allocation order, is sent to task to complete luggage.
Further, the destination allocation schedule step the following steps are included:
1.1 take the initial position of m means of transport for cluster head, carry out k-means cluster, obtain m cluster set, wherein
K-means cluster is space cost, running time of the space cost between destination using distance.The purpose
Ground includes Lee place of withdrawing baggage and see off, i.e., the place that each means of transport needs to pass through；The running time is by distance
It carries out what estimation was got with road conditions, is currently to be directly read by the interface that navigation software provides, such as Baidu, Gao De.
1.2 in each cluster set that step 1.1 obtains, count the number of repetition that wherein luggage is sent to place, will
The most place of number of repetition as the cluster set primary destination；
As m >=n: if all n destinations become at least one means of transport primary destination, purpose
Ground allocation schedule is completed, i.e., order belonging to destination is assigned；If there is at least one destination do not become one or
Multiple means of transports primary destination, then count the number that the destination occurs in all cluster set, by the destination
The most cluster set of frequency of occurrence is primary destination revised as the destination, until all n destinations become at least
One means of transport is primary destination；
As m < n: each cluster of setting gather in frequency of occurrence supreme good k as the main purpose, k is opened by 1
Begin to be incremented by, until all n destinations become at least one means of transport primary destination；
1.3 set each non-principal destination clustered in set as n_d, are primary destination combined into m_ for the cluster set of n_d
D, more each non-principal destination n_d clustered in set and the primary destination place between the cluster set m_d of n_d
The shortest distance, the place includes withdrawing baggage place and to be sent to luggage place, if the shortest distance is less than the place to currently gathering
This place n_d is then moved in cluster set m_d by the average distance in other places in class set by currently clustering set；Extremely
This, cluster is completed.
Further, the destination access order scheduling steps the following steps are included:
2.1 have p destination in each cluster set, and destination includes withdraw baggage place and Lee place of seeing off, with fortune
Compared with defeated tool is currently located the progress one by one of the running time between place and the destination of all unallocated access orders, it will go
Time shortest destination is sailed as next stop access locations, distribution access order, then it is current using the place as means of transport
Site, the step for repetition, until corresponding access order is assigned in all p destinations；
The 2.2 destination access orders distributed according to step 2.1 calculate the time that means of transport reaches each destination
Tp, and the difference td between tp and the time tr of order requirements is calculated, the order requirements time is that client submits luggage to fetch and deliver information
It generates luggage and the requirement delivery time provided when order and total deadline Ta is provided:Always
Deadline refer to that means of transport successively accesses the total time on all purposes ground according to the access order of distribution；Running time is such as
The preceding interface provided by navigation software is directly read, such as Baidu, Gao De.
2.3 definition exclude set Q, and are initialized as null set:
For with excluding all purposes other than set Q, as td≤0, keeping current accessed sequence constant；As td > 0
When: the access order of the destination is moved forward 1, the td and total deadline Ta on all purposes ground are then recalculated:
If td is reduced, and Ta does not increase, then the secondary Forward comes into force, and returns to step 2.2；
If td reduces, but Ta is increased, then the secondary Forward does not come into force, i.e., without Forward；
If td is not reduced, which does not come into force, i.e., without Forward, this destination is added and excludes set Q, returned
To step 2.2；
Whether the E.T.A tp of all destinations is in order requirements time tr in 2.4 more each cluster set
Interior, if so, step finishes, destination access order allocation schedule is finished；If it is not, then the maximum destination of tr-tp value is picked
The step is re-started after removing, until the predicted access times tp of the destination in all cluster set is wanting seeking time tr
It is interior, and refuse the corresponding order in destination being removed.
Embodiment 2
Difference from example 1 is that in the present embodiment, in the destination allocation schedule step, step
Rapid 1.1 take m destination (including Lee place of withdrawing baggage and see off) for cluster head, carry out k-means cluster, obtain m cluster set
It closes, wherein k-means cluster is time cost using distance, and the time cost is that each luggage is fetched and delivered order requirements and sent
Up to the time difference between the time.
Compare the time difference in step 1.3: it is more each cluster set in non-principal destination n_d with primary destination
The time difference in place between the cluster set m_d of n_d, specifically:
Between more each non-principal destination n_d clustered in set and the cluster set m_d for being primary destination n_d
The time difference in place, specifically: set cluster set J primary destination as d, (this is set for the place e that destination in J is not d
The corresponding destination in place is q), to calculate e to being primary destination the shortest distance in place in the cluster set L of q, if most short distance
From the average distance for being less than place in e to J, then e is moved in L by J set；This step is repeated, until locating for all orders
Set no longer change, cluster complete.
Embodiment 3
Difference from Example 1 is: in the present embodiment, k-means cluster uses distance in the step 1.1
The space cost is the distance between destination；The destination includes Lee place of withdrawing baggage and see off, i.e., each fortune
Defeated tool needs the place passed through.
In step 1.3: both can the more each non-master syllabus clustered in set of step 1.3 as described in Example 1
Ground n_d and primary destination for n_d cluster set m_d between place the shortest distance, can also be as described in Example 2
Between step 1.3 more each non-principal destination n_d clustered in set and the cluster set m_d for being primary destination n_d
The time difference in place.
Embodiment 4
Difference from Example 1 is: in the present embodiment, the step 2.3 are as follows:
Setting luggage delivery time threshold value is Td:
Definition excludes set Q, and is initialized as null set: for all purposes other than exclusion set Q, as td≤Td
When, keep current accessed sequence constant；As td > Td: the access order of the destination being moved forward 1, institute is then recalculated
Td and total deadline Ta purposefully:
If td is reduced, and Ta does not increase, then the secondary Forward comes into force, and returns to step 2.2；
If td reduces, but Ta is increased, then the secondary Forward does not come into force, i.e., does not execute Forward；
If td is not reduced, which does not come into force, this destination is added and excludes set Q, returns to step 2.2；
Whether the E.T.A tp of all destinations is in the order requirements time in 2.4 more each cluster set
In tr-Td, if so, step finishes；If it is not, comparing again after then rejecting the maximum destination of tr-tp value, until all poly-
The predicted access times tp of destination in class set is being wanted in seeking time tr, and refuses that the destination that is removed is corresponding to order
It is single.
In the present embodiment by being provided with threshold value Td, the regular hour is left to progress luggage friendship between means of transport
Connect and it is some other need the situation considered in practical application so that the luggage fetches and delivers dispatching method in reality
Practicability and convenience are had more in.
Embodiment 5
Difference from Example 1 is: in the present embodiment, executing destination allocation schedule step and destination visit
Before asking scheduling steps, first carries out order and merge step: in order that is identical for place, requiring delivery time different, if when
Between gap be not more than T, then two orders are merged, take time requirement earlier as the time requirement of order after merging, it is described
Time requirement be time requirement that client submits when luggage being submitted to fetch and deliver order.The identical place includes place of withdrawing baggage
With Lee place of seeing off, any one place of an order and any one place of other orders are identical: T is manually to set
Definite value determines according to situations such as the busy situation of the same day specific order, road conditions, is determined as half an hour in the present embodiment.
Claims (9)
1. the luggage of a kind of multi-destination, multiple means of transports fetches and delivers dispatching method, fetched and delivered in order by the luggage that client submits
It is sent to destination comprising n luggage, luggage is completed by m means of transport and fetches and delivers task, it is characterised in that: is distributed including destination
Scheduling steps and destination access order scheduling steps:
The destination allocation schedule step is assigned to n destination in m cluster set by cluster, and m is clustered
Set distributes to m means of transport, and the corresponding cluster set of each means of transport, the cluster is so that same means of transport institute
Received luggage is fetched and delivered in order, and place of withdrawing baggage number identical with Lee place of seeing off is most；
The purpose access order scheduling steps are that the point of destination in each cluster set distributes access order, by the cluster set
Means of transport where closing accesses according to the allocation order, is sent to task to complete luggage.
2. the luggage of a kind of multi-destination as described in claim 1, multiple means of transports fetches and delivers dispatching method, feature exists
In: the destination allocation schedule step the following steps are included:
1.1 take any m destination, and destination includes that withdraw baggage and the see off initial position of Lee place or m means of transport is
Cluster head carries out k-means cluster, obtains m cluster set, wherein k-means cluster is space cost or time using distance
Cost；
1.2 in each cluster set that step 1.1 obtains, count the number of repetition that wherein luggage is sent to place, will repeat
The most place of number as the cluster set primary destination；
As m >=n: if all n destinations become at least one means of transport primary destination, destination point
It is completed with scheduling；If there is at least one destination does not become one or more means of transports primary destination, then statistics should
The number that destination occurs in all cluster set, primary destination by the most cluster set of the destination frequency of occurrence
It is revised as the destination, until all n destinations become at least one means of transport primary destination；
As m < n: each cluster of setting gather in frequency of occurrence supreme good k as the main purpose, k is passed by 1
Increase, until all n destinations become at least one means of transport primary destination；
Between 1.3 more each non-principal destination n_d clustered in set and the cluster set m_d for being primary destination n_d
The shortest distance in place, if the shortest distance is less than the average distance in the place other places into current cluster set, by this
Place n_d is moved in cluster set m_d by currently clustering set.
3. the luggage of a kind of multi-destination as claimed in claim 2, multiple means of transports fetches and delivers dispatching method, feature exists
In: k-means cluster uses the running time apart from the space cost between destination in the step 1.1, or
For the distance between destination.
4. the luggage of a kind of multi-destination as claimed in claim 2, multiple means of transports fetches and delivers dispatching method, feature exists
In: k-means cluster is that each luggage is fetched and delivered order requirements and is sent to using apart from the time cost in the step 1.1
Time difference between time.
5. the luggage of a kind of multi-destination as claimed in claim 2, multiple means of transports fetches and delivers dispatching method, feature exists
In: the step 1.3 are as follows: more each non-principal destination n_d clustered in set and the cluster for being primary destination n_d
The time difference in place between set m_d, specifically: set cluster set J primary destination as d, be not d for destination in J
Place e, if the corresponding destination in the place be q, calculate e to primary destination be q cluster set L in place most short distance
From if average distance of the shortest distance less than place in e to J, e is gathered by J and is moved in L；This step is repeated, until institute
There is set locating for order no longer to change, cluster is completed.
6. claims 1 or 2 or 3 or 4 or 5 it is any as described in a kind of multi-destination, multiple means of transports luggage fetch and deliver tune
Degree method, it is characterised in that: the destination access order scheduling steps the following steps are included:
2.1 have p destination in each cluster set, and destination includes withdraw baggage place and Lee place of seeing off, with haulagman
It, will when driving compared with tool is currently located the progress one by one of the running time between place and the destination of all unallocated access orders
Between shortest destination as next stop access locations, distribution access order, then be currently located using the place as means of transport
Place, the step for repetition, until corresponding access order is assigned in all p destinations；
The 2.2 destination access orders distributed according to step 2.1 calculate the time tp that means of transport reaches each destination, and
Calculate the difference td and total deadline Ta between the tp and time tr of order requirements:
2.3 definition exclude set Q, and are initialized as null set:
For with excluding all purposes other than set Q, as td≤0, keeping current accessed sequence constant；As td > 0: will
The access order of the destination moves forward 1, then recalculates the td and total deadline Ta on all purposes ground:
If td is reduced, and Ta does not increase, then the secondary Forward comes into force, and returns to step 2.2；
If td reduces, but Ta is increased, then the secondary Forward does not come into force；
If td is not reduced, which does not come into force, i.e., without Forward, this destination is added and excludes set Q, returns to step
Rapid 2.2；
Whether the E.T.A tp of all destination in order requirements time tr in 2.4 more each cluster set,
If so, step finishes, destination access order allocation schedule is finished；If it is not, after then the maximum destination of tr-tp value is rejected
The step is re-started, until the predicted access times tp of the destination in all cluster set is being wanted in seeking time tr, and
Refuse the corresponding order in destination being removed.
7. the luggage of a kind of multi-destination as claimed in claim 6, multiple means of transports fetches and delivers dispatching method, feature exists
In: in the step 2.3 are as follows:
Setting luggage delivery time threshold value is Td:
Definition excludes set Q, and is initialized as null set: for all purposes other than exclusion set Q, as td≤Td,
Keep current accessed sequence constant；As td > Td: the access order of the destination being moved forward 1, is then recalculated all
The td of destination and total deadline Ta:
If td is reduced, and Ta does not increase, then the secondary Forward comes into force, and returns to step 2.2；
If td reduces, but Ta is increased, then the secondary Forward does not come into force；
If td is not reduced, which does not come into force, this destination is added and excludes set Q, returns to step 2.2；
The step 2.4 are as follows: whether the E.T.A tp of all destinations is in order in more each cluster set
It wants in seeking time tr-Td, if so, step finishes；If it is not, comparing again after then rejecting the maximum destination of tr-tp value, directly
The predicted access times tp of destination into all cluster set is being wanted in seeking time tr, and refuses the destination being removed
Corresponding order.
8. the luggage of a kind of multi-destination, multiple means of transports as described in the claims 1-5,7 any claim takes
Send dispatching method, it is characterised in that: before executing destination allocation schedule step and destination access scheduling step, first carry out
Order merges step: in order that is identical for place, requiring delivery time different, if lead time is not more than T, by two
Order merges, and takes time requirement earlier as the time requirement of order after merging.
9. as the luggage of a kind of above-mentioned multi-destination as claimed in claim 6, multiple means of transports fetches and delivers dispatching method, feature
It is: before executing destination allocation schedule step and destination access scheduling step, first carries out order and merge step: right
Two orders are merged, are taken earlier if lead time is not more than T by order that is identical in place, requiring delivery time different
Time requirement of the time requirement as order after merging.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910293991.XA CN110322106B (en) | 2019-04-12 | 2019-04-12 | Luggage taking-in and dispatching method for multiple destination and multiple transport means |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910293991.XA CN110322106B (en) | 2019-04-12 | 2019-04-12 | Luggage taking-in and dispatching method for multiple destination and multiple transport means |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110322106A true CN110322106A (en) | 2019-10-11 |
| CN110322106B CN110322106B (en) | 2023-08-01 |
Family
ID=68113328
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910293991.XA Active CN110322106B (en) | 2019-04-12 | 2019-04-12 | Luggage taking-in and dispatching method for multiple destination and multiple transport means |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110322106B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111160690A (en) * | 2019-11-15 | 2020-05-15 | 杭州拼便宜网络科技有限公司 | Vehicle loading planning method and device and storage medium |
| CN111461615A (en) * | 2020-04-07 | 2020-07-28 | 中国民航信息网络股份有限公司 | Method, device and system for calculating luggage processing efficiency |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040199403A1 (en) * | 2002-06-26 | 2004-10-07 | Mohan Ananda | Method and apparatus for transporting passenger baggage |
| CN102136104A (en) * | 2011-03-22 | 2011-07-27 | 西安电子科技大学 | Load balance and Lin-Kernighan (LK) algorithm based vehicle route planning method |
| US20160063436A1 (en) * | 2014-08-29 | 2016-03-03 | Peter Andrew Coles | Optimal bundling of routes in a courier marketplace |
| CN107093050A (en) * | 2017-06-15 | 2017-08-25 | 上海汽车集团股份有限公司 | A kind of vehicle dispatching method and system |
| US9792576B1 (en) * | 2016-10-24 | 2017-10-17 | International Business Machines Corporation | Operating a plurality of drones and trucks in package delivery |
| CN107392374A (en) * | 2017-07-21 | 2017-11-24 | 顺丰科技有限公司 | A kind of task parcel optimization method, system, equipment |
| CN107392513A (en) * | 2017-01-26 | 2017-11-24 | 北京小度信息科技有限公司 | Order processing method and apparatus |
| CN107844885A (en) * | 2017-09-05 | 2018-03-27 | 北京小度信息科技有限公司 | Information-pushing method and device |
| CN108038651A (en) * | 2017-12-29 | 2018-05-15 | 西华大学 | A kind of monitoring logistics transportation system for tracing and managing |
| CN108764804A (en) * | 2018-06-07 | 2018-11-06 | 中国人民解放军国防科技大学 | Warehouse-free parcel transportation method and device by using taxi |
| CN108830528A (en) * | 2018-06-15 | 2018-11-16 | 重庆城市管理职业学院 | Express mail Distribution path planing method based on time-space attribute |
| CN109002960A (en) * | 2018-06-12 | 2018-12-14 | 广东工业大学 | It is a kind of based on the online order of scoring and path planning distribution and allocator |
| US20190050758A1 (en) * | 2014-01-30 | 2019-02-14 | Modutram Mexico, S.A. De. C.V. | System and method for grouping passengers together in an automated collective form of transport |
| CN109345161A (en) * | 2018-08-29 | 2019-02-15 | 广西大学 | A kind of delivery assignment method towards monetary value flow |
-
2019
- 2019-04-12 CN CN201910293991.XA patent/CN110322106B/en active Active
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040199403A1 (en) * | 2002-06-26 | 2004-10-07 | Mohan Ananda | Method and apparatus for transporting passenger baggage |
| CN102136104A (en) * | 2011-03-22 | 2011-07-27 | 西安电子科技大学 | Load balance and Lin-Kernighan (LK) algorithm based vehicle route planning method |
| US20190050758A1 (en) * | 2014-01-30 | 2019-02-14 | Modutram Mexico, S.A. De. C.V. | System and method for grouping passengers together in an automated collective form of transport |
| US20160063436A1 (en) * | 2014-08-29 | 2016-03-03 | Peter Andrew Coles | Optimal bundling of routes in a courier marketplace |
| US9792576B1 (en) * | 2016-10-24 | 2017-10-17 | International Business Machines Corporation | Operating a plurality of drones and trucks in package delivery |
| CN107392513A (en) * | 2017-01-26 | 2017-11-24 | 北京小度信息科技有限公司 | Order processing method and apparatus |
| CN107093050A (en) * | 2017-06-15 | 2017-08-25 | 上海汽车集团股份有限公司 | A kind of vehicle dispatching method and system |
| CN107392374A (en) * | 2017-07-21 | 2017-11-24 | 顺丰科技有限公司 | A kind of task parcel optimization method, system, equipment |
| CN107844885A (en) * | 2017-09-05 | 2018-03-27 | 北京小度信息科技有限公司 | Information-pushing method and device |
| CN108038651A (en) * | 2017-12-29 | 2018-05-15 | 西华大学 | A kind of monitoring logistics transportation system for tracing and managing |
| CN108764804A (en) * | 2018-06-07 | 2018-11-06 | 中国人民解放军国防科技大学 | Warehouse-free parcel transportation method and device by using taxi |
| CN109002960A (en) * | 2018-06-12 | 2018-12-14 | 广东工业大学 | It is a kind of based on the online order of scoring and path planning distribution and allocator |
| CN108830528A (en) * | 2018-06-15 | 2018-11-16 | 重庆城市管理职业学院 | Express mail Distribution path planing method based on time-space attribute |
| CN109345161A (en) * | 2018-08-29 | 2019-02-15 | 广西大学 | A kind of delivery assignment method towards monetary value flow |
Non-Patent Citations (2)
| Title |
|---|
| 李林波 等: "基于空间特性的行李跟随系统的车辆调度方法", 《交通运输工程学报》 * |
| 杨浩雄 等: "电商配送中的车辆调度问题优化研究", 《计算机工程与应用》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111160690A (en) * | 2019-11-15 | 2020-05-15 | 杭州拼便宜网络科技有限公司 | Vehicle loading planning method and device and storage medium |
| CN111461615A (en) * | 2020-04-07 | 2020-07-28 | 中国民航信息网络股份有限公司 | Method, device and system for calculating luggage processing efficiency |
| CN111461615B (en) * | 2020-04-07 | 2023-06-20 | 中国民航信息网络股份有限公司 | Luggage processing efficiency calculation method, device and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110322106B (en) | 2023-08-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111160770B (en) | Dynamic collaborative ordering method for incoming flights | |
| CN103426331B (en) | Multi-airport collaborative delivery system flight sorting and decision making method | |
| CN104751681B (en) | Statistical learning model based gate position allocation method | |
| CN111915932A (en) | Multi-target constrained low-altitude unmanned aerial vehicle route planning design method | |
| CN106843270B (en) | Paths planning method is delivered in a kind of unmanned plane express delivery automatically | |
| CN106651108A (en) | Method for scheduling airport vehicles according to flight information | |
| CN104408975B (en) | Aircraft conflict extrication method and apparatus | |
| CN109934532B (en) | Route planning method and related device for bidirectional transportation | |
| CN110516871B (en) | Dynamic vehicle path optimization method based on fuzzy rolling time domain control strategy | |
| CN113570247A (en) | Multi-objective optimization method for distribution of stand-to-halt positions based on resource limited condition | |
| CN110322106A (en) | A kind of multi-destination, multiple means of transports luggage fetch and deliver dispatching method | |
| CN110334976A (en) | A kind of computer implemented luggage handling system and method | |
| WO2022156797A1 (en) | Emergency alternate airport selection method based on collaborative optimization | |
| CN106485954A (en) | Approach path dynamic optimization method in busy termination environment based on Point Merge air route structure | |
| CN111127936B (en) | Dynamic vehicle scheduling and route planning method for shared bus | |
| CN109002923A (en) | A kind of intercity multimode travel route planing method | |
| CN105792134A (en) | Carpooling method and system | |
| CN116307542A (en) | Port entering sequencing method based on multi-metering point constraint and electronic terminal | |
| van Oosterom et al. | Dispatching a fleet of electric towing vehicles for aircraft taxiing with conflict avoidance and efficient battery charging | |
| CN104882029A (en) | 4D trajectory estimation-based real-time monitoring alarm method | |
| CN102890876B (en) | Flow ratio-based calculation method for area following interval limit value | |
| CN110334723A (en) | A kind of pair of increased luggage of dynamic fetches and delivers the luggage that order is scheduled and fetches and delivers dispatching method | |
| CN112418676B (en) | Method and device for throwing vehicle, readable storage medium and electronic equipment | |
| CN110046851B (en) | Unmanned vehicle logistics task allocation method based on Multi-Paxos | |
| CN107195192B (en) | A kind of recognition methods of vehicle-mounted orientation operating status |
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: 20230625 Address after: 610000, No. two, section 4, Jianshe North Road, Chengdu, Sichuan, Chenghua District Applicant after: Zhao Zhiwei Address before: No. 1807, 18th Floor, Building 1, No. 530, Middle Section, Tianfu Avenue, Chengdu High-tech Zone, China (Sichuan) Free Trade Pilot Zone, Chengdu, Sichuan, 610000 Applicant before: Chengdu Service Student Technology Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |