CN111144675B - Method, device, equipment and storage medium for planning fragment area - Google Patents
Method, device, equipment and storage medium for planning fragment area Download PDFInfo
- Publication number
- CN111144675B CN111144675B CN201811307587.5A CN201811307587A CN111144675B CN 111144675 B CN111144675 B CN 111144675B CN 201811307587 A CN201811307587 A CN 201811307587A CN 111144675 B CN111144675 B CN 111144675B
- Authority
- CN
- China
- Prior art keywords
- distributed
- planning
- handover
- center
- hub
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 33
- 238000003860 storage Methods 0.000 title claims abstract description 7
- 239000012634 fragment Substances 0.000 title description 2
- 230000007246 mechanism Effects 0.000 claims abstract description 85
- 238000009826 distribution Methods 0.000 claims description 17
- 238000012216 screening Methods 0.000 claims description 10
- 230000006870 function Effects 0.000 claims description 4
- 238000004590 computer program Methods 0.000 claims description 3
- 238000012546 transfer Methods 0.000 abstract description 2
- 230000032683 aging Effects 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000004904 shortening Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/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 application relates to the field of logistics, in particular to a method, a device, equipment and a storage medium for planning a region, wherein the method for planning the region comprises the following steps: acquiring distributed data of a distributed center in a planning area and handover data of the distributed center and a corresponding handover mechanism; pre-distributing the service relationship between the handover mechanism and the distributed center under a preset rule; all pre-allocation schemes and corresponding transportation costs are collected, and the service relation combination of the distributed center with the lowest total transportation cost and the handover mechanism is selected as the section planning. The method is suitable for regional division containing a plurality of distributed centers, such as aviation hub, land hub, different levels of transfer fields and warehouses in the express logistics industry, and even regional division of customer service points.
Description
Technical Field
The present application relates to the field of logistics, and in particular, to a method, apparatus, device, and storage medium for planning a region.
Background
The express logistics industry distributed center is a key node in a distribution full chain, and generally, in a large space area, a plurality of distributed center points exist, and the distributed centers are responsible for different point areas in the space.
After a plurality of distributed center points of a certain area are determined, because the areas, the equipment and the like of the distributed centers may be different, how to accurately divide the whole area according to the distribution conditions of different distributed centers and regional services is really a practical problem in the operation process of the distributed centers in the express logistics industry. An unreasonable sector planning scheme can lead to reduced express aging and increased cost of operation of the distribution center.
By comprehensively searching and examining and reading related patent documents and scientific paper documents, the current method for planning the distributed central area in the express logistics industry is outlined as follows:
the existing regional division method mainly aims at regional division problems in various industries such as administrative, economic and ecological environments, the logistics industry can not well solve related problems of the express logistics industry due to the differences of industries and scenes, related technical documents or schemes for the regional planning problem of the distributed center of the express logistics industry are not known at present, a plurality of enterprise regional planning specialists in the related express logistics industry are researched to know that related work is carried out on the regional planning of the distributed center at present mainly or according to the service experience of planners, multi-version scheme try and other methods, and therefore, the conventional manual planning method has a large optimization space in the aspects of scientificity and the implementation cost of schemes.
Disclosure of Invention
In order to solve the technical problems, the application aims to provide a method, a device, equipment and a storage medium for planning a region.
According to one aspect of the present application, there is provided a tile planning method, including:
acquiring distributed data of a distributed center in a planning area and handover data of the distributed center and a corresponding handover mechanism;
pre-distributing the service relationship between the handover mechanism and the distributed center under a preset rule;
all pre-allocation schemes and corresponding transportation costs are collected, and the service relation combination of the distributed center with the lowest total transportation cost and the handover mechanism is selected as the section planning.
Further, pre-distributing service relations between the lower-level handover mechanism and each distributed center under a preset rule, including:
and randomly distributing a distributed center for each lower-level 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 the following: each delivery mechanism is only served by one distributed center, and the maximum express delivery quantity of the distributed center is not smaller than the express delivery quantity of the lower delivery mechanism served by the distributed center.
Further, collecting all pre-allocation schemes and corresponding transportation costs, including:
the method comprises the steps of collecting an output pre-allocation scheme and corresponding transportation cost, respectively comparing the current collected pre-allocation scheme with collected pre-allocation schemes, and removing if the current collected pre-allocation scheme is the same as one of the collected pre-allocation schemes;
judging whether the number of the collected pre-allocation schemes stops increasing, if so, terminating collection to form a scheme set.
Further, the total transportation cost comprises the sum of the transportation cost of each distributed center and the hinging mechanism in the service relation combination of the distributed center and the handing-over mechanism;
the transportation costs include a sum of transportation costs of the delivery mechanism and the distribution center based on the distributed data.
Further, the distributed data includes at least one of: area, longitude and latitude, hardware equipment, shift setting, equipment efficiency, loading capacity of a bicycle of each type, loading rate of the bicycle and unit transportation cost of the bicycle of each type;
and/or
The handover data comprises at least one of express mail detail data, lower-level handover mechanism shift setting and longitude and latitude.
According to one aspect of the present application, there is provided a tile planning apparatus comprising
The data acquisition module is configured to acquire distributed data of a distributed center in a planning area and handover data of the distributed center and a corresponding handover mechanism;
the pre-allocation module is configured to pre-allocate the service relationship between the handover mechanism and the distribution center under a preset rule;
and the scheme screening module is configured to collect all pre-allocation schemes and corresponding transportation costs, and select the service relation combination of the distribution center with the lowest total transportation cost and the handover mechanism as the section planning.
Further, the pre-allocation module includes:
a first distribution unit configured to randomly distribute a hub to each subordinate handover mechanism to obtain a pre-distribution scheme,
the first judging unit is configured to judge whether the pre-allocation scheme meets a preset rule, and if yes, the pre-allocation scheme is output.
Further, the preset rule includes at least one of the following:
each delivery mechanism is only served by one distributed center, and the maximum express delivery quantity of the distributed center is not smaller than the express delivery quantity of the lower delivery mechanism served by the distributed center.
Further, the scheme screening module includes:
the acquisition unit is configured to acquire an output pre-allocation scheme and corresponding transportation cost;
the screening unit is configured to compare the currently acquired pre-allocation scheme with the acquired pre-allocation schemes, and remove the currently acquired pre-allocation scheme if the currently acquired pre-allocation scheme is the same as one of the acquired pre-allocation schemes;
and the second judging unit is configured to judge whether the number of the collected pre-allocation schemes stops increasing, and if so, the collection is terminated to form a scheme set.
Further, the total transportation cost comprises the sum of the transportation cost of each distributed center and the hinging mechanism in the service relation combination of the distributed center and the handing-over mechanism;
the transportation costs include a sum of transportation costs of the delivery mechanism and the distribution center based on the distributed data.
Further, the distributed data includes at least one of: area, longitude and latitude, hardware equipment, shift setting, equipment efficiency, loading capacity of a bicycle of each type, loading rate of the bicycle and unit transportation cost of the bicycle of each type;
and/or
The handover data comprises at least one of express mail detail data, lower-level handover mechanism shift setting and longitude and latitude.
According to another aspect of the present application, 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 preceding claims.
According to another aspect of the present application, there is provided a computer readable storage medium storing a computer program which when executed by a processor implements a method as claimed in any one of the above.
Compared with the prior art, the application has the following beneficial effects:
1. according to the region planning method, aiming at the region planning problem of the distribution center of the express logistics industry, the service relationship between a lower-level delivery mechanism and each distribution center in the planning region is screened out based on the transportation cost in a pre-allocation scheme, so that the region planning is obtained, and the method is suitable for region division containing a plurality of distribution centers, such as aviation hubs, land hubs, different-level transfer fields and warehouses in the express logistics industry, and even region division of customer service points.
2. According to the patch planning system, a targeted algorithm model is created, service relations between a subordinate handover mechanism and each distributed center in a planning area are screened out in a pre-allocation scheme based on transportation cost, so that patch planning is achieved, the possibility of occurrence of operation failure rate of the distributed centers can be reduced, healthy and normal operation of the patch planning system is facilitated, the overall site operation cost is reduced, the transportation and sorting timeliness level of express items is improved, and the service satisfaction level of terminal clients is improved.
3. The device of the example of the application can rapidly calculate the total transportation cost of each pre-allocation scheme by executing the patch planning method through the processor, and screen the pre-allocation scheme with the minimum transportation cost to obtain the service relationship between the subordinate handover mechanism and each distribution center in the planning area, thus obtaining the patch planning.
4. The application is convenient for the use and popularization of the voice communication device by storing the voice communication method realized when being executed by the processor through the computer readable medium storing the computer program, and the program is operated to exert the advantages of the deep convolution network.
Drawings
FIG. 1 is a flow chart of the present application.
Detailed Description
For a better understanding of the technical solution of the present application, the present application will be further described with reference to the following specific examples and the accompanying drawings.
Example 1:
the embodiment provides a slice planning device, which comprises a data acquisition module, a pre-allocation module and a scheme screening module;
the data acquisition module is configured to acquire distributed data of a distributed center in a planning area and handover data of the distributed center and a corresponding handover mechanism; the distributed data includes at least one of: area, longitude and latitude, hardware equipment, shift setting, equipment efficiency, loading capacity of a bicycle of each type, loading rate of the bicycle and unit transportation cost of the bicycle of each type;
the handover data comprises at least one of express mail detail data, lower-level 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 judging unit is configured to judge whether the pre-allocation scheme meets a preset rule, and if yes, the pre-allocation scheme is output.
The preset rule comprises at least one of the following:
each delivery mechanism is only served by one distributed center, and the maximum express delivery quantity of the distributed center is not smaller than the express delivery quantity of the lower delivery mechanism served by the distributed center.
The operation fault means that the express items are not completed according to the established aging treatment, the maximum express item receiving and transmitting amount of the distributed center is not smaller than the express item receiving and transmitting amount of a lower-level delivery mechanism served by the distributed center, and the relation between the field treatment efficiency and the field actual treatment amount is coordinated, so that the possibility can be reduced.
The scheme screening module comprises:
the acquisition unit is configured to acquire an output pre-allocation scheme and corresponding transportation cost;
the screening unit is configured to compare the currently acquired pre-allocation scheme with the acquired pre-allocation schemes, and remove the currently acquired pre-allocation scheme if the currently acquired pre-allocation scheme is the same as one of the acquired pre-allocation schemes;
and the second judging unit is configured to judge whether the number of the collected pre-allocation schemes stops increasing, and if so, the collection is terminated to form a scheme set.
The total transportation cost comprises the sum of the transportation cost of each distributed center and the hinging mechanism in the service relation combination of the distributed center and the handing-over mechanism;
the transportation cost comprises the sum of transportation cost of the delivery mechanism and the distributed center based on distributed data, and is specifically as follows:
c ij ＝Find(i,j){11∶q 11 ,12∶q 12 ,…ij∶q ij }
wherein,
alpha represents the cost per kilometer of the vehicle,
c ij representing the number of tasks for each type of different shifts per unit time for all subordinate hand-over institutions,
θ represents the loading amount of the bicycle,
epsilon represents the loading rate of the bicycle,
d hi belongs to continuous variables, represents the navigation distance from the h-distribution center to the i-handing-over mechanism,
y hi belongs to 0-1 variable, and indicates whether the h-hub serves the i-handover mechanism;
ij is the code of the shift number,
q ij for the component amount of the jth shift of the ith delivery mechanism,
i,j＝1,2,3…n。
a corresponding method for planning a region of a region planning device comprises the following steps:
s1: acquiring distributed data of a distributed center in a planning area and handover data of the distributed center and a corresponding handover mechanism; the distributed data includes at least one of: area, longitude and latitude, hardware equipment, shift setting, equipment efficiency, loading vehicle type, single vehicle loading capacity of each vehicle type, single vehicle loading rate and unit transportation cost of the distributed center.
The handover data comprises at least one of express mail detail data, lower-level handover mechanism shift setting and longitude and latitude.
The information set by the shift can cut the relation between the receiving and dispatching amount of the express mail covered by a certain field in a specific time period and the receiving and dispatching amount of the maximum express mail in the field, thereby being beneficial to exerting the maximum sorting capability of the field, namely shortening the processing time of the express mail and improving the sorting ageing level.
The information of the amount of the received and dispatched parts, the space distribution density of the amount of the received and dispatched parts, the peak time of recovering the amount of the received and dispatched parts and the like of different lower-level delivery mechanisms can be known through the express detail data.
S2: under the preset rule, pre-distributing the service relationship between the handover mechanism and each distributed center, which comprises the following steps:
s2-1: randomly distributing a distributed center to each subordinate handover mechanism to obtain a pre-distribution scheme,
the preset rule comprises at least one of the following: each delivery mechanism is only served by one distributed center, and the maximum express delivery quantity of the distributed center is not smaller than the express delivery quantity of the lower delivery mechanism served by the distributed center.
S2-2, judging whether the pre-allocation scheme meets a preset rule or not, and if so, outputting the pre-allocation scheme.
S3: collecting all pre-allocation schemes, screening out service relations between a subordinate handover mechanism and each distributed center in a planning area based on transportation cost in the pre-allocation schemes, and obtaining a sheet area plan, wherein the sheet area plan comprises the following steps of:
s3-1: collecting an output pre-allocation scheme and corresponding transportation cost;
s3-2: comparing the current acquisition pre-allocation scheme with the acquired pre-allocation schemes, and removing if the current acquisition pre-allocation scheme is the same as one of the acquired pre-allocation schemes;
s3-3: judging whether the number of the collected pre-allocation schemes stops increasing, if so, terminating collection to form a scheme set.
The following examples illustrate the above method:
step 1:
step 1.1
{ "City": "A", "distributed center": [ "a", "b", "c" ] }
Step 1.2
{ "hub": a ",
"distributed center area (square meter)" "7000",
"distributed center longitude": "112.204",
"distributed center latitude": "32.165",
"equipment floor space (square meter)" "1500",
"Equipment Unit efficacy (piece)" "6000",
"number of shifts (shift)" "7",
"single shift duration (hours)" "2",
"load vehicle model": "7T large truck",
"bicycle load (kg)": 1000,
"bicycle loading rate": 70 percent,
"unit transportation cost (element)": "6.29", }
Step 2:
step 2.1
{ "City": "a", "lower level handover mechanism": [ "1", "2", "3", "… …", "107", "108", "109" ] }
Step 2.2
{ "handover mechanism": 1",
"shift" is "1D",
"quantity of delivery" is "450",
"quantity of received parts" is "50",
"longitude": "112.504",
"latitude": "32.565", }
Specifically, the data format in step S3 gives the following exemplary illustration:
in formula (1), e represents the processing efficiency of the distributed center a in a shift time, and a reasonable constraint can be exerted on the scale of the coverage area, namely the total part amount of the area covered by a certain place cannot exceed the maximum part amount of the area, so that the excessive load operation is avoided, and express part delay is caused.
s is the area of the distribution center a, s 'is the area of the single equipment in the distribution center, e' is the unit time throughput of the equipment, and t is the shift time.
c ij ＝Find(i,j){11∶q 11 ,12∶q 12 ,…ij∶q ij I, j=1, 2,3 … n formula (2)
C in formula (2) ij Representing the task number of different classes in unit time of all subordinate handover mechanisms, i is the code of the subordinate handover mechanism, j is the code of the class, q ij The component amount of the jth shift is the ith subordinate delivery mechanism.
Step 3:
an operation-based mixed integer programming method is adopted to construct a distributed center area programming model, and a related optimal scheme is solved, and the method specifically comprises the following steps:
i=1, 2,3 … h=1, 2,3 … J e [1,2,3 … ] formula (7)
In the above model, formula (3), the objective function represents the total transportation cost of the interfacing mechanism to and from the hub; and the optimal scheme is to calculate the total transportation cost of each pre-allocation scheme, screen out the pre-allocation scheme with the minimum total transportation cost to obtain the service relationship between the subordinate handover mechanism and each distribution center in the planning area, and obtain the sheet area planning.
Regarding the constraint:
formula (4) represents that the total part count that the hub can handle is equal to the sum of the part counts of the delivery mechanism it serves;
equation (5) indicates that each of the handover authorities must be and is serviced by only one hub;
formula (6) represents all distributed centers, and the total treatment amount is less than or equal to the theoretical treatment efficiency;
formulas (7) (8) represent I representing a handover mechanism index, H representing a distribution center index, J representing a shift in the day
Wherein,
alpha represents the cost per kilometer of the vehicle; q (Q) h Representing the actual processing piece quantity of the h distributed center;
θ represents the loading of the bicycle; epsilon represents the loading rate of the bicycle;
d hi belongs to continuous variables and represents the navigation distance from the h distribution center to the i handover mechanism;
y hi belongs to 0-1 variable and indicates whether the h-hub serves the i-handover mechanism.
The above description is only illustrative of the preferred embodiments of the present application and of the principles of the technology employed. It will be appreciated by persons skilled in the art that the scope of the application referred to in the present application is not limited to the specific combinations of the technical features described above, but also covers other technical features formed by any combination of the technical features described above or their equivalents without departing from the inventive concept. Such as the features described above, have similar functions to those disclosed in the present application (but are not limited to).
Claims (14)
1. A method for tile planning, comprising:
acquiring distributed data of a distributed center in a planning area and handover data of the distributed center and a corresponding handover mechanism;
pre-distributing the service relationship between the handover mechanism and the distributed center under a preset rule;
collecting all pre-allocation schemes and corresponding transportation costs, and selecting a service relation combination of a distributed center with the lowest total transportation cost and a handover mechanism as a patch planning;
wherein the objective function of the total transportation cost is
；
The constraint condition is that
；
In the above formula, i denotes the code of the lower delivery mechanism, h denotes the code of the hub, j denotes the code of the shift,representing the cost of a vehicle for one kilometer,/-, for>Indicating the number of tasks of different classes per unit time of all subordinate handover mechanisms, < +.>Representing the loading capacity of a bicycle,/->Indicating bicycle loading rate,/->Belonging to continuous variables representing the navigation distance of the h-hub to the i-handover mechanism, +.>Belonging to the 0-1 variable, indicating whether the h-hub serves the i-handover mechanism or not, +.>Representing the actual throughput of the h-hub.
2. The method of claim 1, wherein pre-assigning service relationships between the subordinate handover mechanism and each hub under a preset rule comprises:
and randomly distributing a distributed center for each lower-level 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 method for tile planning as claimed in claim 1 or 2, wherein,
the preset rule comprises at least one of the following:
each delivery mechanism is only served by one distributed center, and the maximum express delivery quantity of the distributed center is not smaller than the express delivery quantity of the lower delivery mechanism served by the distributed center.
4. The method of tile planning as claimed in claim 1, wherein,
collecting all pre-allocation schemes and corresponding transportation costs, including:
the method comprises the steps of collecting an output pre-allocation scheme and corresponding transportation cost, respectively comparing the current collected pre-allocation scheme with collected pre-allocation schemes, and removing if the current collected pre-allocation scheme is the same as one of the collected pre-allocation schemes;
judging whether the number of the collected pre-allocation schemes stops increasing, if so, terminating collection to form a scheme set.
5. The tile planning method of claim 1, wherein the total transportation cost comprises a sum of transportation costs for each hub and delivery facility in a service relationship combination of the hub and delivery facility;
the transportation costs include a sum of transportation costs of the delivery mechanism and the distribution center based on the distributed data.
6. The tile planning method of claim 1, wherein the aggregate data comprises at least one of: area, longitude and latitude, hardware equipment, shift setting, equipment efficiency, loading capacity of a bicycle of each type, loading rate of the bicycle and unit transportation cost of the bicycle of each type; and/or
The handover data comprises at least one of express mail detail data, lower-level handover mechanism shift setting and longitude and latitude.
7. A device for planning a region is characterized by comprising
The data acquisition module is configured to acquire distributed data of a distributed center in a planning area and handover data of the distributed center and a corresponding handover mechanism;
the pre-allocation module is configured to pre-allocate the service relationship between the handover mechanism and the distribution center under a preset rule;
the scheme screening module is configured to collect all pre-allocation schemes and corresponding transportation costs, and select the service relation combination of the distribution center with the lowest total transportation cost and the handover mechanism as the section planning;
wherein the objective function of the total transportation cost is
；
The constraint condition is that
；
In the above formula, i denotes the code of the lower delivery mechanism, h denotes the code of the hub, j denotes the code of the shift,representing the cost of a vehicle for one kilometer,/-, for>Indicating the number of tasks of different classes per unit time of all subordinate handover mechanisms, < +.>Representing the loading capacity of a bicycle,/->Indicating bicycle loading rate,/->Belongs to continuous variables, represents the navigation distance from the h-distribution center to the i-handing-over mechanism,/>belonging to the 0-1 variable, indicating whether the h-hub serves the i-handover mechanism or not, +.>Representing the actual throughput of the h-hub.
8. The tile 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 judging unit is configured to judge whether the pre-allocation scheme meets a preset rule, and if yes, the pre-allocation scheme is output.
9. The tile planning apparatus of claim 7, wherein,
the preset rule comprises at least one of the following:
each delivery mechanism is only served by one distributed center, and the maximum express delivery quantity of the distributed center is not smaller than the express delivery quantity of the lower delivery mechanism served by the distributed center.
10. The tile planning apparatus of claim 8, wherein the solution screening module comprises:
the acquisition unit is configured to acquire an output pre-allocation scheme and corresponding transportation cost;
the screening unit is configured to compare the currently acquired pre-allocation scheme with the acquired pre-allocation schemes, and remove the currently acquired pre-allocation scheme if the currently acquired pre-allocation scheme is the same as one of the acquired pre-allocation schemes;
and the second judging unit is configured to judge whether the number of the collected pre-allocation schemes stops increasing, and if so, the collection is terminated to form a scheme set.
11. The sector planning apparatus of claim 10, wherein the total transportation cost comprises a sum of transportation costs for each hub and articulating mechanism in a service relationship combination of hub and articulating mechanism;
the transportation costs include a sum of transportation costs of the delivery mechanism and the distribution center based on the distributed data.
12. The tile planning apparatus of claim 7, wherein,
the distributed data includes at least one of: area, longitude and latitude, hardware equipment, shift setting, equipment efficiency, loading capacity of a bicycle of each type, loading rate of the bicycle and unit transportation cost of the bicycle of each type;
and/or
The handover data comprises at least one of express mail detail data, lower-level handover mechanism shift setting and longitude and latitude.
13. An electronic device, the electronic device 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 claims 1-6.
14. A computer readable storage medium storing a computer program, which when executed by a processor implements the method of 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 CN111144675A (en) | 2020-05-12 |
| CN111144675B true 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) |
Families Citing this family (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 |
Family Cites Families (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 |
| CN107341628B (en) * | 2016-12-30 | 2021-04-27 | 闽江学院 | Hub and spoke type logistics network hub station site selection and distribution method based on probability tabu algorithm |
| CN107133375B (en) * | 2017-03-23 | 2020-07-07 | 北京航空航天大学 | Facility site selection optimization method based on Euclidean distance linear approximation |
-
2018
- 2018-11-05 CN CN201811307587.5A patent/CN111144675B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN111144675A (en) | 2020-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108171452B (en) | Express delivery point addressing method and device | |
| EP1177503B1 (en) | System for indexing pedestrian traffic | |
| CN105556554A (en) | Multiple device correlation | |
| CN108038578B (en) | Public bicycle static scheduling method based on demand prediction and central radiation network | |
| CN111709613A (en) | Task automatic allocation method and device based on data statistics and computer equipment | |
| CN107645393A (en) | Determine the method, apparatus and system of the black-box system input and output degree of association | |
| CN112559167B (en) | Method for optimizing base station maintenance resource allocation based on Voronoi dynamic diagram | |
| Barabino et al. | An offline framework for handling automatic passenger counting raw data | |
| CN102487523A (en) | User compliant analysis method and device | |
| CN102722577A (en) | Method and device for determining dynamic weights of indexes | |
| CN108280795A (en) | The screening technique of highway green channel exception vehicle based on dynamic data base | |
| CN111144675B (en) | Method, device, equipment and storage medium for planning fragment area | |
| CN114386720A (en) | Logistics system scheduling management method, system, terminal equipment and storage medium | |
| Chan et al. | North Carolina’s experience in development of pavement performance prediction and modeling | |
| US20020133302A1 (en) | Environmental performance improvement support system and environmental performance improvement support method | |
| CN114841788A (en) | Engineering project construction management completion settlement overall process management system | |
| CN111754053A (en) | Thermodynamic information feedback method and device, computer equipment and storage medium | |
| Bell et al. | Forecasting construction staffing for transportation agencies | |
| CN110413902A (en) | The online recommended method in vehicle salvage shop, device, equipment and storage medium | |
| CN110689381B (en) | Early warning method and device | |
| CN110210707B (en) | Entropy weight method based point automatic scheduling efficiency evaluation method and system | |
| CN111445051B (en) | Express mail traffic prediction method, prediction system and express mail employee scheduling method | |
| CN101605339A (en) | Monitoring of network bandwidth resources operating position and prompt system and method | |
| CN110555558A (en) | line quality optimization system and method | |
| CN113159613B (en) | Automatic order dispatching method based on charging pile service provider capability |
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 |