CN111144675A - Partition planning method, device, equipment and storage medium - Google Patents
Partition planning method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN111144675A CN111144675A CN201811307587.5A CN201811307587A CN111144675A CN 111144675 A CN111144675 A CN 111144675A CN 201811307587 A CN201811307587 A CN 201811307587A CN 111144675 A CN111144675 A CN 111144675A
- Authority
- CN
- China
- Prior art keywords
- distribution
- hub
- handover
- center
- planning
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 31
- 238000005192 partition Methods 0.000 title claims description 5
- 230000007246 mechanism Effects 0.000 claims abstract description 80
- 238000012546 transfer Methods 0.000 claims abstract description 16
- 238000012216 screening Methods 0.000 claims description 11
- 238000004590 computer program Methods 0.000 claims description 3
- 238000012545 processing Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000032683 aging Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- 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/0637—Strategic management or analysis, e.g. setting a goal or target of an organisation; Planning actions based on goals; Analysis or evaluation of effectiveness of goals
-
- 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)
- Educational Administration (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 invention relates to the field of logistics, in particular to a method, a device, equipment and a storage medium for planning a parcel, wherein the method for planning the parcel comprises the following steps: acquiring distributed data of a distributed center in a planned area and handover data of the distributed center and a corresponding handover mechanism; pre-distributing the service relationship between the handover mechanism and the distribution center under a preset rule; and collecting all pre-distribution schemes and corresponding transportation costs, and selecting a service relationship combination of a distribution center and a handover mechanism with the lowest total transportation cost as a plot planning. The method is suitable for regional division containing a plurality of distribution centers, such as aviation hubs, land transportation hubs, transfer stations of different levels, warehouses in the express logistics industry, and even regional division of customer service points.
Description
Technical Field
The present invention relates to the field of logistics, and in particular, to a method, an apparatus, a device, and a storage medium for partition planning.
Background
Express delivery logistics industry hub is the key node in the whole chain of delivery, generally speaking in a great spatial region, can have a plurality of hub centers, and a plurality of hub centers can blame different some regions in this space.
After a plurality of distribution center points of a certain area are determined, because the areas, the devices and the like of a plurality of distribution centers are possibly different, aiming at the distribution conditions of different distribution centers and regional businesses, the whole area is accurately divided into actual problems really facing the operation process of the distribution centers in the express logistics industry. Unreasonable plot planning schemes can result in reduced fast-parts timeliness and increased distribution center operating costs.
Through comprehensive retrieval and examination of related patent documents and scientific and technical paper documents, the general outline of the current parcel planning method for the distributed center of the express logistics industry is as follows:
the existing regional division method mainly aims at the regional division problem in various industrial fields such as administrative, economic and ecological environments, the related problems of the express logistics industry cannot be well solved by the existing regional division method due to the difference of industries and scenes in the logistics industry, and at present, related technical documents or schemes aiming at the problem of the distributed central area planning in the express logistics industry are basically absent, and a plurality of enterprise regional planning experts in the related express logistics industry are investigated to know that related work is mainly carried out aiming at the distributed central area planning or according to the business experience of planning personnel, multi-version scheme trial and the like, so that the existing manual planning method has a large optimization space in the aspects of scientificity and the implementation cost of the schemes.
Disclosure of Invention
In order to solve the above technical problems, an object of the present invention is to provide a method, an apparatus, a device and a storage medium for tile planning.
According to an aspect of the present invention, there is provided a method of tile planning, comprising:
acquiring distributed data of a distributed center in a planned area and handover data of the distributed center and a corresponding handover mechanism;
pre-distributing the service relationship between the handover mechanism and the distribution center under a preset rule;
and collecting all pre-distribution schemes and corresponding transportation costs, and selecting a service relationship combination of a distribution center and a handover mechanism with the lowest total transportation cost as a plot planning.
Further, the pre-allocating the service relationship between the subordinate handover mechanism and each distribution center under the preset rule includes:
randomly distributing a distribution center for each subordinate handover mechanism to obtain a pre-distribution scheme, judging whether the pre-distribution scheme meets a preset rule, and if so, outputting the pre-distribution scheme.
Further, the preset rule includes at least one of: each transfer mechanism is only served by one hub and distribution center, and the maximum express receiving and dispatching quantity of the hub and distribution center is not less than the express receiving and dispatching quantity of the subordinate transfer mechanism served by the hub and distribution center.
Further, collecting all pre-allocation schemes and corresponding transportation costs includes:
collecting the output pre-distribution schemes and corresponding transportation cost, respectively comparing the currently collected pre-distribution schemes with the collected pre-distribution schemes, and removing the currently collected pre-distribution schemes if the currently collected pre-distribution schemes are the same as one collected pre-distribution scheme;
and judging whether the number of the collected pre-distribution schemes stops increasing or not, and if so, terminating the collection to form a scheme set.
Further, the total transportation cost includes the sum of the transportation costs of each hub and each hinge mechanism in the service relationship combination of the hub and the handover mechanism;
the transportation cost comprises the sum of transportation fees of the handover mechanism and the distribution center based on the distributed data.
Further, the distributed data includes at least one of: the area, longitude and latitude, hardware equipment, shift setting, equipment efficiency, stowage vehicle types, single vehicle loading capacity, single vehicle loading rate and unit transportation cost of the distribution center;
and/or
The handover data comprises at least one of express item detail data, subordinate handover mechanism shift setting and longitude and latitude.
According to an aspect of the present invention, there is provided a tile planning apparatus comprising
The data acquisition module is configured for acquiring distributed data of a distributed center in a planned area and handover data of the distributed center and a corresponding handover mechanism;
the pre-distribution module is configured for pre-distributing the service relationship between the handover mechanism and the distribution center under a preset rule;
and the scheme screening module is configured for acquiring all pre-distribution schemes and corresponding transportation costs, and selecting the service relationship combination of the hub and distribution center with the lowest total transportation cost and the handover mechanism as the plot planning.
Further, the pre-allocation module comprises:
a first distribution unit configured to randomly distribute a hub to each subordinate handover mechanism to obtain a pre-distribution scheme,
the first judgment unit is configured to judge whether the pre-allocation scheme meets a preset rule, and if so, the pre-allocation scheme is output.
Further, the preset rule includes at least one of:
each transfer mechanism is only served by one hub and distribution center, and the maximum express receiving and dispatching quantity of the hub and distribution center is not less than the express receiving and dispatching quantity of the subordinate transfer mechanisms served by the hub and distribution center.
Further, the scheme screening module comprises:
the acquisition unit is used for acquiring and outputting a pre-distribution scheme and corresponding transportation cost;
the screening unit is configured for comparing the currently acquired pre-distribution scheme with the acquired pre-distribution schemes, and removing the currently acquired pre-distribution scheme if the currently acquired pre-distribution scheme is the same as one of the acquired pre-distribution schemes;
and the second judgment unit is configured to judge whether the number of the collected pre-distribution schemes stops increasing or not, and if so, the collection is stopped to form the scheme set.
Further, the total transportation cost includes the sum of the transportation costs of each hub and each hinge mechanism in the service relationship combination of the hub and the handover mechanism;
the transportation cost comprises the sum of transportation expenses of the handover mechanism and the distribution center based on the distributed data.
Further, the distributed data includes at least one of: the area, longitude and latitude, hardware equipment, shift setting, equipment efficiency, stowage vehicle types, single vehicle loading capacity, single vehicle loading rate and unit transportation cost of the distribution center;
and/or
The handover data comprises at least one of express item detail data, subordinate handover mechanism shift setting and longitude and latitude.
According to another aspect of the invention, there is provided an apparatus comprising
One or more processors;
a memory for storing one or more programs;
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of the above.
According to another aspect of the invention, there is provided a computer readable storage medium storing a computer program which, when executed by a processor, implements a method as defined in any one of the above.
Compared with the prior art, the invention has the following beneficial effects:
1. the method for planning the parcel areas aims at the problem of area planning of the distribution center of the express logistics industry, screens out the service relation between a subordinate handover mechanism in the planned area and each distribution center in a pre-distribution scheme based on the transportation cost to obtain the parcel area planning, and is suitable for area division containing a plurality of distribution centers, such as an aviation hub, a land transportation hub, different-level transfer sites and warehouses of the express logistics industry, and even area division of customer service points.
2. The parcel planning system disclosed by the invention creates a targeted algorithm model, screens out the service relationship between a subordinate handover mechanism and each distribution center in the planned area in a pre-distribution scheme based on the transportation cost to obtain the parcel planning, can reduce the possibility of occurrence of operation failure rate of the distribution centers, is beneficial to healthy and normal operation, reduces the whole site operation cost, improves the timeliness level of the delivery and sorting of express items, and improves the service satisfaction level of end customers.
3. The equipment of the embodiment of the invention can quickly calculate the total transportation cost of each pre-distribution scheme by executing the plot planning method through the processor, and screens out the pre-distribution scheme with the minimum transportation cost to obtain the service relationship between the subordinate handover mechanism and each distribution center in the planned area, namely the plot plan.
4. The present invention is convenient for the use and popularization of a voice communication apparatus by a computer-readable medium storing a computer program that is operated to exert the advantages of a deep convolutional network and stores the voice communication method implemented when being executed by a processor.
Drawings
FIG. 1 is a flow chart of the present invention.
Detailed Description
In order to better understand the technical scheme of the invention, the invention is further explained by combining the specific embodiment and the attached drawings of the specification.
Example 1:
the embodiment provides a partition planning device, which comprises a data acquisition module, a pre-distribution module and a scheme screening module;
the data acquisition module is configured for acquiring distributed data of a distributed center in a planned area and handover data of the distributed center and a corresponding handover mechanism; the collective data includes at least one of: the area, longitude and latitude, hardware equipment, shift setting, equipment efficiency, stowage vehicle types, the single vehicle loading capacity, the single vehicle loading rate and the unit transportation cost of each vehicle type of the distribution center;
the handover data comprises at least one of express item detail data, subordinate handover mechanism shift setting and longitude and latitude.
The pre-allocation module comprises:
a first distribution unit configured to randomly distribute a hub to each subordinate handover mechanism to obtain a pre-distribution scheme,
the first judgment unit is configured to judge whether the pre-allocation scheme meets a preset rule, and if so, the pre-allocation scheme is output.
The preset rule includes at least one of:
each transfer mechanism is only served by one hub and distribution center, and the maximum express receiving and dispatching quantity of the hub and distribution center is not less than the express receiving and dispatching quantity of the subordinate transfer mechanisms served by the hub and distribution center.
The operation failure means that the express is not finished according to the set aging treatment, the maximum express receiving and dispatching amount of the distributed center is not less than the express receiving and dispatching amount of the subordinate handover mechanism which is served by the distributed center, and the relation between the site treatment efficiency and the site actual treatment amount is coordinated, so that the possibility can be reduced.
The scheme screening module comprises:
the acquisition unit is used for acquiring and outputting a pre-distribution scheme and corresponding transportation cost;
the screening unit is configured for comparing the currently acquired pre-distribution scheme with the acquired pre-distribution schemes, and removing the currently acquired pre-distribution scheme if the currently acquired pre-distribution scheme is the same as one of the acquired pre-distribution schemes;
and the second judgment unit is configured to judge whether the number of the collected pre-distribution schemes stops increasing or not, and if so, the collection is stopped to form the scheme set.
The total transportation cost comprises the sum of the transportation cost of each hub and each hinge mechanism in the service relationship combination of the hub and the handover mechanism;
the transportation cost comprises the sum of transportation cost of the handing-over mechanism and the distributed center based on distributed data, and specifically comprises the following steps:
cij＝Find(i,j){11∶q11,12∶q12,…ij∶qij}
wherein,
α denotes the cost per kilometer of the vehicle,
cijrepresenting the number of tasks of each type and different shifts per unit time of all the lower-level hand-over mechanisms,
theta represents the load capacity of the bicycle,
epsilon represents the loading rate of a single vehicle,
dhibelongs to continuous variable, which represents the navigation distance from the h-hub to the i-handover mechanism,
yhibelongs to a variable of 0-1 and indicates whether the h-distributed center serves an i-handover mechanism or not;
ij is the code of the shift,
qijthe number of the pieces of the jth shift of the ith transfer mechanism,
i,j＝1,2,3…n。
the parcel planning method corresponding to the parcel planning device comprises the following steps:
s1: acquiring distributed data of a distributed center in a planned area and handover data of the distributed center and a corresponding handover mechanism; the collective data includes at least one of: the area, longitude and latitude, hardware equipment, shift setting, equipment efficiency, stowage vehicle types, the single vehicle loading capacity, the single vehicle loading rate and the unit transportation cost of each vehicle type of the distribution center.
The handover data comprises at least one of express item detail data, subordinate handover mechanism shift setting and longitude and latitude.
The information set by the shift can be used for dividing the relation between the express receiving and dispatching quantity of the subordinate handing-over mechanism covered by a certain field in a specific time period and the maximum express receiving and dispatching quantity of the field in the specific time period, so that the maximum sorting capacity of the field can be favorably exerted, namely, the processing time of express is favorably shortened, and the sorting timeliness level is improved.
The information such as the quantity of the received and dispatched items of different subordinate handover mechanisms, the spatial distribution density of the received and dispatched items, the peak time of the restored received and dispatched items and the like can be known through express item detail data.
S2: the service relationship between the handover mechanism and each distribution center is pre-distributed under a preset rule, and the method specifically comprises the following steps:
s2-1: randomly distributing a hub center for each subordinate handover mechanism to obtain a pre-distribution scheme,
the preset rule includes at least one of: each transfer mechanism is only served by one hub, and the maximum express receiving and dispatching quantity of the hub is not less than the express receiving and dispatching quantity of the subordinate transfer mechanism served by the hub.
S2-2, judging whether the pre-allocation scheme meets the preset rule, if so, outputting the pre-allocation scheme.
S3: collecting all pre-distribution schemes, and screening out the service relationship between subordinate handover mechanisms and various distribution centers in the planning area in the pre-distribution schemes based on the transportation cost to obtain the plot planning, which is specifically divided into the following steps:
s3-1: collecting an output pre-distribution scheme and corresponding transportation cost;
s3-2: comparing the current collection pre-distribution scheme with the collected pre-distribution schemes, and removing the current collection pre-distribution scheme if the current collection pre-distribution scheme is the same as one collected pre-distribution scheme;
s3-3: and judging whether the number of the collected pre-distribution schemes stops increasing or not, and if so, stopping collecting to form a scheme set.
The above process is illustrated by the following examples:
step 1:
step 1.1
{ "City": A "," distribution center ": A", "b", "c" }
Step 1.2
{ "hub": a ",
"area of the hub (square meter)": 7000",
"hub center longitude": 112.204",
"distributed central latitude": 32.165",
"equipment footprint (square meter)": 1500",
"equipment unit performance": 6000",
"number of shifts (class)": 7",
"Individual shift duration (hours)" to "2",
"stowage vehicle type": a 7T large truck,
"bicycle load (kg)": 1000,
"single-vehicle loading rate": 70 percent of the total weight of the mixture,
"unit transportation cost (yuan)", "6.29", }
Step 2:
step 2.1
{ "City": a "," lower level interface mechanism "[" 1","2","3"," … … ","107"," 108","109"] }
Step 2.2
The { "handover mechanism": 1",
the 'shift' to '1D',
"dispatch amount": 450",
"in-take": 50",
"longitude": 112.504",
"latitude": 32.565 }
Specifically, the data form in step S3 is given as an example as follows:
in the formula (1), e represents the processing efficiency of the hub a within a shift time, and can play a reasonable constraint role on the scale of the covering piece area, namely the total piece quantity of the area covered by a certain site cannot exceed the maximum piece quantity processed by the site so as to avoid overload operation and express piece delay.
s is the site area of the hub a, s 'is the floor area of the individual equipment in the hub, e' is the unit time throughput of the equipment, and t is the shift duration.
cij＝Find(i,j){11∶q11,12∶q12,…ij∶qijI, j ═ 1,2,3 … n formula (2)
C in formula (2)ijThe number of tasks of each type and different shift in unit time of all the subordinate handover means is represented, i is the code of the subordinate handover means, j is the code of the shift, q is the number of the shiftijThe number of pieces is the jth shift of the ith lower transfer mechanism.
And step 3:
an operation and research mixed integer planning method is adopted to construct a distribution center plot planning model, and a related optimal scheme is solved, wherein the method specifically comprises the following steps:
1,2,3 … H1, 2,3 … J epsilon [1,2,3 … 24] formula (7)
In equation (3) above, the objective function represents the total transportation cost between the handover mechanism to and from the hub; the optimal scheme is to calculate the total transportation cost of each pre-distribution scheme, screen out the pre-distribution scheme with the minimum total transportation cost to obtain the service relationship between the subordinate handover mechanisms and each distribution center in the planning area, and then obtain the plot plan.
With respect to the constraints:
formula (4) represents that the total quantity of the components which can be processed by the hub is equal to the sum of the quantities of the components of the cross-connecting mechanisms which are served by the hub;
equation (5) indicates that each handover mechanism must be and is served by only one hub;
formula (6) represents all the hub, the total amount of treatment of which needs to be less than or equal to the theoretical treatment efficiency;
the expressions (7) and (8) indicate that I denotes a handover mechanism index, H denotes a distribution center index, and J denotes a shift within a day
Wherein,
α denotes the cost per kilometer of the vehicle, QhRepresenting the actual processing amount of the h-distributed center;
theta represents the bicycle load; epsilon represents the loading rate of the bicycle;
dhithe navigation distance from the h-distribution center to the i-connection mechanism is represented by a continuous variable;
yhibelongs to the variable 0-1 and indicates whether the h-hub serves the i-handover mechanism.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by a person skilled in the art that the scope of the invention as referred to in the present application is not limited to the embodiments with a specific combination of the above-mentioned features, but also covers other embodiments with any combination of the above-mentioned features or their equivalents without departing from the inventive concept. For example, the features described above have similar functions to (but are not limited to) those disclosed in this application.
Claims (14)
1. A method of tile planning, comprising:
acquiring distributed data of a distributed center in a planned area and handover data of the distributed center and a corresponding handover mechanism;
pre-distributing the service relationship between the handover mechanism and the distribution center under a preset rule;
and collecting all pre-distribution schemes and corresponding transportation costs, and selecting a service relationship combination of a distribution center and a handover mechanism with the lowest total transportation cost as a plot planning.
2. The parcel planning method according to claim 1, wherein pre-allocating service relationships between subordinate handover mechanisms and the respective hubs under a preset rule comprises:
and randomly distributing a distribution center for each subordinate handover mechanism to obtain a pre-distribution scheme, judging whether the pre-distribution scheme meets a preset rule, and if so, outputting the pre-distribution scheme.
3. The parcel planning method according to claim 1 or 2,
the preset rule includes at least one of:
each transfer mechanism is only served by one hub and distribution center, and the maximum express receiving and dispatching quantity of the hub and distribution center is not less than the express receiving and dispatching quantity of the subordinate transfer mechanisms served by the hub and distribution center.
4. The parcel planning method according to claim 1,
collecting all pre-allocation plans and corresponding transportation costs, including:
acquiring output pre-distribution schemes and corresponding transportation cost, respectively comparing the currently acquired pre-distribution schemes with the acquired pre-distribution schemes, and removing the currently acquired pre-distribution schemes if the currently acquired pre-distribution schemes are the same as one of the acquired pre-distribution schemes;
and judging whether the number of the collected pre-distribution schemes stops increasing or not, and if so, terminating the collection to form a scheme set.
5. The plot planning method of claim 1, wherein the total transportation cost comprises a sum of transportation costs of each hub and the articulation mechanism in a service relationship combination of the hub and the interface mechanism;
the transportation cost comprises the sum of transportation expenses of the handover mechanism and the distribution center based on the distributed data.
6. The parcel planning method of claim 1, wherein the distributed data comprises at least one of: the area, longitude and latitude, hardware equipment, shift setting, equipment efficiency, stowage vehicle types, the single vehicle loading capacity, the single vehicle loading rate and the unit transportation cost of each vehicle type of the distribution center; and/or
The handover data comprises at least one of express item detail data, subordinate handover mechanism shift setting and longitude and latitude.
7. A partition planning apparatus, comprising
The data acquisition module is configured for acquiring distributed data of a distributed center in a planned area and handover data of the distributed center and a corresponding handover mechanism;
the pre-distribution module is configured for pre-distributing the service relationship between the handover mechanism and the distribution center under a preset rule;
and the scheme screening module is configured for acquiring all pre-distribution schemes and corresponding transportation costs, and selecting the service relationship combination of the hub and distribution center with the lowest total transportation cost and the handover mechanism as the plot planning.
8. The parcel planning apparatus of claim 7, wherein the pre-allocation module comprises:
a first distribution unit configured to randomly distribute a hub to each subordinate handover mechanism to obtain a pre-distribution scheme,
the first judgment unit is configured to judge whether the pre-allocation scheme meets a preset rule, and if so, the pre-allocation scheme is output.
9. The parcel planning apparatus of claim 7,
the preset rule includes at least one of:
each transfer mechanism is only served by one hub and distribution center, and the maximum express receiving and dispatching quantity of the hub and distribution center is not less than the express receiving and dispatching quantity of the subordinate transfer mechanisms served by the hub and distribution center.
10. The parcel planning apparatus of claim 8, wherein the scheme screening module comprises:
the acquisition unit is used for acquiring and outputting a pre-distribution scheme and corresponding transportation cost;
the screening unit is configured to compare the currently acquired pre-allocation schemes with the acquired pre-allocation schemes, and if the currently acquired pre-allocation schemes are the same as one of the acquired pre-allocation schemes, the screening unit is removed;
and the second judgment unit is configured to judge whether the number of the collected pre-distribution schemes stops increasing or not, and if so, the collection is stopped to form the scheme set.
11. The plot plan of claim 10, wherein the total transportation cost comprises a sum of transportation costs for each hub and articulation mechanism in a service relationship combination of hub and interface mechanism;
the transportation cost comprises the sum of transportation expenses of the handover mechanism and the distribution center based on the distributed data.
12. The parcel planning apparatus of claim 7,
the collective data includes at least one of: the area, longitude and latitude, hardware equipment, shift setting, equipment efficiency, stowage vehicle types, the single vehicle loading capacity, the single vehicle loading rate and the unit transportation cost of each vehicle type of the distribution center;
and/or
The handover data comprises at least one of express item detail data, subordinate handover mechanism shift setting and longitude and latitude.
13. An apparatus, characterized in that the apparatus comprises:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-6.
14. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811307587.5A CN111144675B (en) | 2018-11-05 | 2018-11-05 | Method, device, equipment and storage medium for planning fragment area |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811307587.5A CN111144675B (en) | 2018-11-05 | 2018-11-05 | Method, device, equipment and storage medium for planning fragment area |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111144675A true CN111144675A (en) | 2020-05-12 |
| CN111144675B CN111144675B (en) | 2023-11-28 |
Family
ID=70515634
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811307587.5A Active CN111144675B (en) | 2018-11-05 | 2018-11-05 | Method, device, equipment and storage medium for planning fragment area |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111144675B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114066345A (en) * | 2020-08-10 | 2022-02-18 | 上海顺如丰来技术有限公司 | Method, device, server and storage medium for planning transit transportation |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101593322A (en) * | 2009-06-30 | 2009-12-02 | 北京交通大学 | Quick goods dispensing, collection plan are determined method and apparatus |
| CN107133375A (en) * | 2017-03-23 | 2017-09-05 | 北京航空航天大学 | It is a kind of that the facility addressing optimal method approached is linearized based on Euclidean distance |
| CN107341628A (en) * | 2016-12-30 | 2017-11-10 | 闽江学院 | A kind of axis-spoke logistics network Hub Location and distribution method based on probability Tabu search algorithm |
-
2018
- 2018-11-05 CN CN201811307587.5A patent/CN111144675B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101593322A (en) * | 2009-06-30 | 2009-12-02 | 北京交通大学 | Quick goods dispensing, collection plan are determined method and apparatus |
| CN107341628A (en) * | 2016-12-30 | 2017-11-10 | 闽江学院 | A kind of axis-spoke logistics network Hub Location and distribution method based on probability Tabu search algorithm |
| CN107133375A (en) * | 2017-03-23 | 2017-09-05 | 北京航空航天大学 | It is a kind of that the facility addressing optimal method approached is linearized based on Euclidean distance |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114066345A (en) * | 2020-08-10 | 2022-02-18 | 上海顺如丰来技术有限公司 | Method, device, server and storage medium for planning transit transportation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111144675B (en) | 2023-11-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105575108B (en) | A kind of intelligent public transportation dispatching method for running | |
| Lee et al. | A hybrid hub-and-spoke postal logistics network with realistic restrictions: A case study of Korea Post | |
| CN110659839A (en) | Intelligent logistics stowage scheduling method | |
| CN106779176A (en) | Electric taxi fills electrically-charging equipment configuration and constant volume method in station soon | |
| CN106803136A (en) | A kind of fresh dispatching real-time optimization method based on genetic algorithm | |
| CN103927639A (en) | Steel product logistics system and scheduling method thereof based on real-time information | |
| CN113379102A (en) | Multi-network trunk transport optimization method, computer equipment and storage medium | |
| CN115239223A (en) | Allocation center task scheduling method, device, equipment and storage medium | |
| CN111667103B (en) | Method, device, equipment and storage medium for destination-based logistics scheduling | |
| CN111985699A (en) | Dispatching method and device for chemical transportation | |
| CN108764800A (en) | Method for realizing rapid delivery of packages based on crowdsourcing public transportation system | |
| CN111325370A (en) | Dispatching task allocation method, device, equipment and storage medium | |
| CN112085271A (en) | Crowdsourcing mode-based traditional industry cluster goods collection path optimization method | |
| CN111144675A (en) | Partition planning method, device, equipment and storage medium | |
| CN112184092A (en) | Logistics node determination method, device, server and storage medium | |
| Zak et al. | Multiple criteria optimization method for the vehicle assignment problem in a bus transportation company | |
| Fischer et al. | Distributed, knowledge-based, reactive scheduling of transportation tasks | |
| Lin et al. | Zone pricing for time-definite LTL freight transportation with elastic demand | |
| CN112633603B (en) | Method for adjusting distribution density of dustbin and visualization system thereof | |
| CN115081819A (en) | Scheduling method, scheduling device, electronic equipment and storage medium | |
| Vasyanin et al. | A Methodology of the Mathematical Modeling for Perspective Development of Nodes and Transport Routes in the Multicommodity Hierarchical Network. I. Optimization Problems | |
| CN113935593A (en) | Method for calculating matching degree of urban rail transit transport capacity and passenger flow demand | |
| Zhou et al. | Location Model of Pallet Service Centers Based on the Pallet Pool Mode | |
| Basallo-Triana et al. | Intermodal hub network design with generalized capacity constraints and non-synchronized train–truck operations | |
| Kunert | Design for Stability in Transport Logistics-Definition, Concepts and Evaluation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |