CN115271354A - Service electronic fence dynamic planning method and system based on delivery unit - Google Patents
Service electronic fence dynamic planning method and system based on delivery unit Download PDFInfo
- Publication number
- CN115271354A CN115271354A CN202210726894.7A CN202210726894A CN115271354A CN 115271354 A CN115271354 A CN 115271354A CN 202210726894 A CN202210726894 A CN 202210726894A CN 115271354 A CN115271354 A CN 115271354A
- Authority
- CN
- China
- Prior art keywords
- delivery
- unit
- units
- seed
- traffic
- 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
- 238000012384 transportation and delivery Methods 0.000 title claims abstract description 391
- 238000013439 planning Methods 0.000 title claims abstract description 33
- 238000000034 method Methods 0.000 title claims abstract description 26
- 238000001914 filtration Methods 0.000 claims description 13
- 239000000203 mixture Substances 0.000 claims description 9
- 241001632427 Radiola Species 0.000 claims 2
- 238000010586 diagram Methods 0.000 description 8
- 230000003252 repetitive effect Effects 0.000 description 6
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 230000009286 beneficial effect Effects 0.000 description 4
- 238000007726 management method Methods 0.000 description 4
- 238000004458 analytical method Methods 0.000 description 2
- 241001632422 Radiola linoides Species 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000007246 mechanism Effects 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
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
The invention discloses a delivery unit-based dynamic business electronic fence planning method and a delivery unit-based dynamic business electronic fence planning system. On the premise of setting the number of delivery fences, the invention rapidly plans and calculates the space range of the delivery fences, so that the planned delivery fences can dynamically adapt to the space-time change characteristics of logistics business, the accuracy and timeliness of logistics picking are improved, and reasonable, scientific and dynamic configuration of human resources is realized.
Description
Technical Field
The invention relates to the technical field of logistics industry, and particularly discloses a service electronic fence dynamic planning method and system based on delivery units.
Background
With the continuous development of the logistics industry, logistics has been deeply applied to many fields such as production, life and the like, and logistics business management affairs are heavier and heavier. The logistics cable-drop and consignment business is divided into different levels in space according to the jurisdiction range, and then the logistics cable-drop and consignment business is classified into different delivery departments and delivery section lanes according to the space positions of cable-drop business customers; the consignment goods are sent to corresponding delivery mechanisms in a hierarchical mode, and finally the goods are sent to a receiver or a proxy through logistics personnel at the tail end delivery passage. Therefore, the space analysis method and the space analysis technology have an important role in logistics management, and particularly have an important influence on delivery timeliness and accuracy due to the reasonability of space occupation range (fence) division. At present, delivery fences in logistics management in China are mostly finished by manual drawing of management personnel according to experience and an actual traffic network. Delivery fences painted manually have the problems of crossing, overlapping, incomplete coverage and the like in space, and traffic is unbalanced among the delivery fences, so that delivery timeliness is affected. More importantly, delivery fences manually painted are slow to update, long in adjustment period, difficult to adapt to logistics services which change rapidly in space and time, difficult to dynamically plan the number and space range of the delivery fences, and not beneficial to reasonable and scientific scheduling of human resources in the delivery industry.
Therefore, the existing delivery fences manually drawn are slow to update and long in adjustment period, are difficult to adapt to the logistics business which changes rapidly in space and time, are difficult to dynamically plan the number and the space range of the delivery fences, are not beneficial to the reasonable and scientific scheduling of human resources in the delivery industry, and are the technical problems to be solved urgently at present.
Disclosure of Invention
The invention provides a delivery unit-based dynamic service electronic fence planning method and system, and aims to solve the technical problems that the existing delivery fence which is manually drawn is slow to update, long in adjustment period, difficult to adapt to logistics services which change rapidly in time and space, difficult to dynamically plan the number and space range of the delivery fence, and not beneficial to reasonable and scientific scheduling of human resources in the delivery industry.
One aspect of the invention relates to a delivery unit-based dynamic planning method for a business electronic fence, which comprises the following steps:
a delivery point generating step, namely generating a delivery point element set by using historical data of the successful delivery service, and searching delivery unit data according to the coverage relation of a delivery part fence;
dividing delivery units and selecting seed units, and setting the seed unit of each delivery unit cluster by using a k-means spatial clustering algorithm and unit traffic;
searching and combining the adjacent units, namely searching the adjacent non-merging units of the seed units by using a recursive search method, and stopping recursive search when the service volume of the combined seed units reaches the upper limit;
merging the rest delivery units, namely merging the delivery units which are not merged into the seed units which are adjacent and have the minimum traffic, and forming a delivery section fence by the merged seed units so as to realize the dynamic planning of the delivery fence.
Further, the delivery point generating step includes:
filtering the data of the committed business contained in the delivery department fence in a statistical period by using the historical data of the committed business and using a space coverage operator to form a data set of the committed business of the delivery department;
extracting data with non-repeated space coordinates from the composed delivery part proper service data set to form a delivery part non-repeated delivery point data set;
and counting the amount of the delivered service of each delivery point, storing the counted amount of the delivered service as a service attribute into the delivery point, and generating the delivery point of the delivery part.
Further, the step of dividing the delivery unit and the selected seed unit comprises:
using road network data and a space inclusion operator to filter delivery units contained in a delivery department fence to form a delivery department delivery unit set;
and dividing the delivery unit set of the delivery part into delivery unit clusters consistent with the number of the section channels by using a k-means spatial clustering algorithm according to the set number of the section channels planned by the delivery part.
Further, the adjoining unit searching and merging step includes:
selecting the unit with the largest traffic in each delivery unit cluster as a seed unit, searching delivery units which are adjacent to the seed unit and are not merged under the constraint of the upper limit of the traffic by taking the seed unit as the center, and selecting the delivery unit closest to the center point of the seed delivery unit from the delivery units and merging the delivery units into the seed unit;
and summarizing the traffic of the two units, updating the traffic into the attribute of the traffic of the combined seed unit, judging whether the traffic of the combined seed unit is equal to or more than the upper limit of the traffic of the delivery passage or not in order to avoid unlimited combination, and stopping recursive search if the traffic of the combined seed unit reaches the upper limit.
Further, in the step of merging the rest delivery units, after all the seed units stop searching, whether delivery units which are not merged to the seed units exist is judged, if yes, adjacent seed units of the non-merged units are searched, the seed unit with the minimum traffic is searched, and the non-merged delivery units are merged into the adjacent seed units with the minimum traffic.
Another aspect of the present invention relates to a dynamic planning system for a service electronic fence based on a delivery unit, comprising:
the delivery point generating module is used for generating a delivery point element set by utilizing the historical data of the successful delivery service and searching delivery unit data according to the coverage relation of a delivery part fence;
the delivery unit dividing and selecting seed unit module is used for setting the seed unit of each delivery unit cluster by using a k-means spatial clustering algorithm and unit traffic;
the adjacent unit searching and merging module is used for searching an adjacent un-merged unit of the seed unit by using a recursive searching method, and stopping recursive searching when the service volume of the merged seed unit reaches the upper limit;
and the merging residual delivery unit module is used for merging the delivery units which are not merged into the seed units which are adjacent and have the minimum traffic, and the merged seed units become a delivery section fence so as to realize the dynamic planning of the delivery fence.
Further, the delivery point generating module comprises:
the first composition submodule is used for filtering the dully-delivered service data contained in the delivery department fence in the statistical period by using the historical data of the dully-delivered service and using a space coverage operator to form a delivery department duly-delivered service data set;
the second component submodule is used for extracting data with non-repeated space coordinates from the composed delivery part successful delivery service data set to form a delivery part non-repeated delivery point data set;
and the statistic submodule is used for counting the amount of the delivered traffic of each delivery point, storing the counted amount of the delivered traffic as the traffic attribute into the delivery point and generating the delivery point of the delivery part.
Further, the divide delivery unit and selected seed unit module comprises:
the third composition submodule is used for filtering delivery units contained in a delivery department fence by using road network data and a space containing operator to form a delivery department delivery unit set;
and the division submodule is used for dividing the delivery unit set of the delivery part into delivery unit clusters consistent with the number of the section channels by using a k-means spatial clustering algorithm according to the number of the section channels planned by the set delivery part.
Further, the neighbor unit searching and merging module includes:
the merging submodule is used for selecting a unit with the largest traffic in each delivery unit cluster as a seed unit, searching delivery units which are adjacent to the seed unit and are not merged under the constraint of the upper limit of the traffic by taking the seed unit as the center, and selecting the delivery unit closest to the center point of the seed delivery unit from the delivery units and merging the delivery units into the seed unit;
and the judgment sub-module is used for summarizing the traffic of the two units and updating the traffic into the attribute of the traffic of the combined seed unit, and in order to avoid unlimited combination, whether the traffic of the combined seed unit is equal to or more than the upper limit of the traffic of the delivery passage needs to be judged, and if the traffic of the combined seed unit reaches the upper limit, the recursive search is stopped.
Further, the merging remaining delivery unit module is specifically configured to determine whether delivery units that are not merged to the seed unit exist after all the seed units stop searching, if so, search for an adjacent seed unit of the non-merged unit, find a seed unit with the minimum traffic from the adjacent seed unit, and merge the non-merged delivery unit into the seed unit with the minimum traffic.
The beneficial effects obtained by the invention are as follows:
the invention provides a delivery unit-based dynamic planning method and system for a business electronic fence, wherein the method comprises a delivery point generating step, a delivery unit dividing and seed unit selecting step, an adjoining unit searching and merging step and a residual delivery unit merging step, and comprises the steps of filtering and counting the data of the delivered business by means of a space covering operator, extracting data with non-repetitive space coordinates from results, forming a non-repetitive delivery point data set and realizing the statistics of the delivered business amount of delivery points; filtering delivery units contained in a delivery department fence by means of road network data and space containing operators to form a delivery department delivery unit set; dividing delivery units in the delivery part into a specified number of unit clusters by means of a spatial clustering k-means algorithm; and taking the seed unit as a center, and sequentially searching delivery units which are adjacent to each other, not returned and are closest to the seed unit under the constraint of the upper limit of the traffic. On the premise of setting the number of delivery fences, the space range of the delivery fences is quickly planned and calculated, the problems that manually drawn delivery fences are slow to update and long in adjustment period are solved, and the delivery fences planned by the method can adapt to the space-time change characteristics of logistics business; the problems that delivery fences manually painted are slow to update and long in adjustment period are solved, and the delivery fences planned by the method can adapt to the space-time change characteristics of logistics business; the problem of uneven traffic among manually-painted delivery fences is solved, the number and the space range of the delivery fences are dynamically planned, and the accuracy and the timeliness of logistics picking are improved; the problems of crossing, overlapping, incomplete coverage and the like of delivery fences manually drawn are solved, and reasonable, scientific and dynamic configuration of human resources is realized.
Drawings
Fig. 1 is a schematic flow chart of an embodiment of a dynamic service electronic fence planning method based on delivery units according to the present invention;
fig. 2 is a functional block diagram of an embodiment of a dynamic planning system for a service electronic fence based on a delivery unit according to the present invention;
FIG. 3 is a functional block diagram of one embodiment of a delivery point generation module shown in FIG. 2;
FIG. 4 is a functional block diagram of one embodiment of the compartmentalized delivery units and selected seed unit modules shown in FIG. 2;
FIG. 5 is a functional block diagram of an embodiment of the neighbor search and merge module shown in FIG. 2.
The reference numbers illustrate:
10. a delivery point generating module; 20. dividing delivery units and selecting seed unit modules; 30. an adjacency unit search and merging module; 40. merging the rest delivery unit modules; 11. a first composition submodule; 12. a second composition submodule; 13. a statistic submodule; 21. a third component sub-module; 22. dividing sub-modules; 31. combining the submodules; 32. and a judgment submodule.
Detailed Description
In order to better understand the technical scheme, the technical scheme is described in detail in the following with reference to the attached drawings of the specification and specific embodiments.
As shown in fig. 1 and fig. 2, a first embodiment of the present invention provides a method for dynamically planning a service electronic fence based on delivery units, including the following steps:
step S100, a delivery point generating step, namely generating a delivery point element set by using the historical data of the committed business, and searching delivery unit data according to the coverage relation of a delivery department fence.
Specifically, step S100 includes:
and S110, filtering the data of the committed businesses contained in the delivery department fence in the statistical period by using the historical data of the committed businesses and using a space coverage operator to form a data set of the committed businesses of the delivery department.
And step S120, extracting data with non-repeated space coordinates from the composed delivery department successful service data set to form a delivery department non-repeated delivery point data set.
Step S130, the amount of the appropriate traffic of each delivery point is counted, the counted amount of the appropriate traffic is stored as the traffic attribute into the delivery point, and the delivery point of the delivery department is generated.
S200, dividing delivery units and selecting seed units, and setting the seed units of each delivery unit cluster by using a k-means spatial clustering algorithm and unit traffic.
Specifically, step S200 includes:
s210, filtering delivery units contained in a delivery department fence by using road network data and space containing operators to form a delivery department delivery unit set;
and S220, dividing the delivery unit set of the delivery part into delivery unit clusters consistent with the number of the section channels by using a k-means spatial clustering algorithm according to the set number of the section channels planned by the delivery part.
And S300, searching and combining the adjacent units, namely searching the adjacent non-merging units of the seed units by using a recursive search method, and stopping recursive search when the traffic of the combined seed units reaches the upper limit.
Specifically, step S300 includes:
and S310, selecting the unit with the largest traffic in each delivery unit cluster as a seed unit, searching delivery units which are adjacent to the seed unit and are not merged under the constraint of the upper limit of the traffic by taking the seed unit as the center, and selecting the delivery unit closest to the center point of the seed delivery unit from the delivery units and merging the delivery units into the seed unit.
Step S320, summarizing the traffic of the two units, updating the traffic into the attribute of the merged seed unit traffic, and judging whether the merged seed unit traffic is equal to or more than the upper limit of the traffic of the delivery passage or not in order to avoid unlimited merging, if so, stopping recursive search.
And S400, merging the rest delivery units, namely merging the delivery units which are not merged into the seed units which are adjacent and have the minimum traffic, and forming a delivery section fence by the merged seed units so as to realize the dynamic planning of the delivery fence.
And after all the seed units stop searching, judging whether delivery units which are not merged to the seed units exist, if so, searching adjacent seed units of the non-merged units, searching the seed units with the minimum traffic from the adjacent seed units, and merging the non-merged delivery units into the adjacent seed units with the minimum traffic.
Compared with the prior art, the dynamic planning method for the service electronic fence based on the delivery unit comprises a delivery point generation step, a delivery unit division and seed unit selection step, an adjacent unit searching and merging step and a residual delivery unit merging step, wherein the filtering statistics is carried out on the data of the delivered service by means of a space covering operator, the data with non-repetitive space coordinates are extracted from results, a non-repetitive delivery point data set is formed, and the statistics of the delivered service volume of the delivery point is realized; filtering delivery units contained in delivery department fences by means of road network data and space containing operators to form a delivery department delivery unit set; dividing delivery units in the delivery part into a specified number of unit clusters by means of a spatial clustering k-means algorithm; and taking the seed unit as a center, and sequentially searching delivery units which are adjacent to each other, not returned and are closest to the seed unit under the constraint of the upper limit of the traffic. On the premise of setting the number of delivery fences, the space range of the delivery fences is rapidly planned and calculated, the problems that manually painted delivery fences are slow to update and long in adjustment period are solved, and the delivery fences planned by the embodiment can adapt to space-time change characteristics of logistics services; the situations that delivery fences manually painted are slow to update and long in adjustment period are solved, and the delivery fences planned by the embodiment can adapt to space-time change characteristics of logistics business; the problem that the service volume is uneven among delivery fences manually painted is solved, the number and the space range of the delivery fences are dynamically planned, and the accuracy and the timeliness of the logistics collecting and throwing are improved; the problems of crossing, overlapping, incomplete covering and the like of delivery fences manually painted in space are solved, and reasonable, scientific and dynamic configuration of human resources is realized.
Referring to fig. 2, fig. 2 is a functional block diagram of an embodiment of a delivery unit-based dynamic service electronic fence planning system provided by the present invention, in the embodiment, the delivery unit-based dynamic service electronic fence planning system includes a delivery point generating module 10, a delivery unit dividing and selecting seed unit module 20, an adjacent unit searching and merging module 30, and a remaining delivery unit merging module 40, wherein the delivery point generating module 10 is configured to generate a delivery point element set by using historical data of a committed transaction, and deliver unit data according to a coverage relationship of a delivery department fence; a delivery unit dividing and selecting seed unit module 20 for setting the seed unit of each delivery unit cluster by using a k-means spatial clustering algorithm and unit traffic volume; an adjacency unit searching and merging module 30, configured to use a recursive search method to find an adjacency un-merged unit of a seed unit, and stop recursive search when the traffic of the merged seed unit reaches an upper limit; and the residual merging delivery unit module 40 is used for merging the non-merged delivery units into the seed units which are adjacent and have the minimum traffic, and the merged seed units become a delivery section fence so as to realize the dynamic planning of the delivery fence.
The merge remaining delivery unit module 40 is specifically configured to, after all the seed units stop searching, determine whether there is a delivery unit that is not merged to a seed unit, if there is a delivery unit that is not merged to a seed unit, search for an adjacent seed unit of the non-merged unit, find a seed unit with the minimum traffic from the adjacent seed units, and merge the non-merged delivery unit into the adjacent seed unit with the minimum traffic.
Further, please refer to fig. 3, fig. 3 is a functional module schematic diagram of an embodiment of the delivery point generating module shown in fig. 2, in this embodiment, the delivery point generating module 10 includes a first component submodule 11, a second component submodule 12 and a statistical submodule 13, where the first component submodule 11 is configured to filter, by using a spatial coverage operator, the put-to-place service data included in the delivery part fence in the statistical period to form a delivery part put-to-place service data set; the second composition submodule 12 is used for extracting data with non-repeated space coordinates from the composed delivery part committed service data set to form a delivery part non-repeated delivery point data set; and a statistic submodule 13, configured to count the amount of the committed traffic of each delivery point, store the counted amount of the committed traffic as a traffic attribute in the delivery point, and generate a delivery point of the delivery department.
Preferably, referring to fig. 4, fig. 4 is a functional module schematic diagram of an embodiment of the divided delivery units and selected seed unit modules shown in fig. 2, in this embodiment the divided delivery units and selected seed unit modules 20 comprise a third composition sub-module 21 and a division sub-module 22, wherein the third composition sub-module 21 is configured to filter delivery units comprised by the delivery department pens using the road network data and the spatial inclusion operator, constituting a set of delivery department delivery units; and the dividing submodule 22 is used for dividing the delivery unit set into delivery unit clusters consistent with the number of the section channels by using a k-means space clustering algorithm according to the set number of the section channels planned by the delivery unit.
Further, please refer to fig. 5, fig. 5 is a functional module schematic diagram of an embodiment of the adjacent unit searching and merging module shown in fig. 2, in this embodiment, the adjacent unit searching and merging module 30 includes a merging sub-module 31 and a judging sub-module 32, where the merging sub-module 31 is configured to select a unit with the largest traffic in each delivery unit cluster as a seed unit, search delivery units adjacent to and not merged with the seed unit under the constraint of an upper limit of traffic with the seed unit as a center, and select a delivery unit closest to the center point of the seed delivery unit from the delivery units and merge the delivery units into the seed unit; and the judging submodule 32 is used for summarizing the traffic of the two units, updating the traffic into the attribute of the traffic of the combined seed unit, judging whether the traffic of the combined seed unit is equal to or more than the upper limit of the traffic of the delivery passage or not in order to avoid unlimited combination, and stopping recursive search if the upper limit is reached.
Compared with the prior art, the dynamic planning system for the service electronic fence based on the delivery unit comprises a delivery point generating module 10, a delivery unit dividing and selecting seed unit module 20, an adjoining unit searching and merging module 30 and a residual delivery unit merging module 40, filters and counts the data of the delivered service by means of a space covering operator, extracts data with non-repetitive space coordinates from a result, forms a non-repetitive delivery point data set, and realizes the statistics of the delivered service amount of the delivery point; filtering delivery units contained in delivery department fences by means of road network data and space containing operators to form a delivery department delivery unit set; dividing delivery units in the delivery part into unit clusters with specified number by means of a spatial clustering k-means algorithm; and taking the seed unit as a center, and sequentially searching delivery units which are adjacent to and not returned and are closest to the seed unit under the constraint of the upper limit of the traffic. On the premise of setting the number of delivery fences, the space range of the delivery fences is quickly planned and calculated, the problems that delivery fences manually drawn are slow to update and long in adjustment period are solved, and the delivery fences planned by the embodiment can adapt to space-time change characteristics of logistics services; the situations that delivery fences manually painted are slow to update and long in adjustment period are solved, and the delivery fences planned by the embodiment can adapt to space-time change characteristics of logistics business; the problem of uneven traffic among manually-painted delivery fences is solved, the number and the space range of the delivery fences are dynamically planned, and the accuracy and the timeliness of logistics picking are improved; the problems of crossing, overlapping, incomplete covering and the like of delivery fences manually painted in space are solved, and reasonable, scientific and dynamic configuration of human resources is realized.
As shown in fig. 1 to 5, the present invention mainly includes four links: and (1) generating delivery points by using the successful delivery historical service data. (2) And dividing delivery units by using a spatial clustering k-means algorithm and setting seed units. (3) Under the constraint of the upper traffic limit of the delivery segment, the adjacent and nearest units of the seed unit are searched recursively and merged with the seed unit. (4) The delivery units that are not merged are merged into the seed unit that is contiguous and has the least traffic.
Example 1 delivery Point Generation procedure
Firstly, loading historical data of the dulled business within a given delivery department fence range and within a statistical period, and then extracting client positions with different coordinate values from the position coordinates of the dulled business clients to form a delivery point data set. The generated delivery points are service client position points with different space positions and are mathematically expressed as uniqueness of coordinate values.
In a PostGIS spatial database, when a delivery point data table is created, coordinate value uniqueness constraint is defined so as to ensure the uniqueness of delivery point coordinates. In addition, a coordinate value unique structured query statement is used, a delivery record with a unique coordinate value is read from a space-time data table of the commissioned service, and the delivery record is stored in a delivery point data table.
Example 2 dividing delivery units and selecting seed units step
Firstly, a spatial clustering algorithm is used, and delivery units are divided into unit clusters with the designated delivery fence number according to the spatial distribution characteristics of the delivery units; and then in each unit cluster, inquiring the delivery unit with the largest statistical traffic by using the spatial coverage relation between the delivery unit and the delivery point, and setting the delivery unit as a seed unit.
In a PostGIS database, the space division of delivery units is realized by using the self-carried k-means function; then, using a space coverage query statement and a total summary statement of the PostGIS to calculate the service volume of the delivery unit; and finally, setting the seed attribute of the unit with the largest traffic in each unit cluster as logic true.
Example 3 neighbor cell search and Merge
Respectively taking the seed unit as a center, searching for a nearest non-merged delivery unit adjacent to the seed unit, and merging the unit and the seed unit to obtain a new seed unit; meanwhile, the total traffic of the two units is calculated and updated to a new seed subunit; and further judging whether the traffic reaches or exceeds the upper limit of the traffic of the delivery segment, and if so, stopping searching.
In a PostGIS database, a PostGIS adjacency query function is used for searching delivery units adjacent to the seed units, meanwhile, a function is calculated by using a polygonal geometric center of the PostGIS to obtain geometric centers of the seed units and the delivery units, then, the adjacency units with the minimum geometric center distance are merged into the seed units, so that recursive growth and expansion of the seed units are realized, and finally, postGIS data updating statements are used for updating the later seed units and the summarized traffic to a seed unit record.
Example 4 merging remaining delivery units
After all seed units have stopped searching, it is determined whether there are delivery units that are not merged into a seed unit. If so, searching the adjacent seed units of the non-merged units, and searching the seed unit with the minimum traffic from the adjacent seed units and merging the seed unit with the seed unit.
In a PostGIS database, a structured query statement is used for querying delivery units which are not merged into any seed unit, and then a PostGIS adjacent query function and a numerical minimum function are used for searching the seed unit which is adjacent to the seed unit and has the minimum service volume; then, using a polygon merging function of the PostGIS to merge the unit into a corresponding seed unit; and finally, updating the updated seed unit to the seed unit record by using an updating statement of the PostGIS. Therefore, the delivery fence dynamic planning method based on the delivery units is realized.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including the preferred embodiment and all changes and modifications that fall within the scope of the invention. It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (10)
1. A dynamic planning method for a service electronic fence based on a delivery unit is characterized by comprising the following steps:
a delivery point generating step of generating a delivery point element set by using historical data of the successful delivery service and searching delivery unit data according to the coverage relation of a delivery department fence;
dividing delivery units and selecting seed units, and setting the seed unit of each delivery unit cluster by using a k-means spatial clustering algorithm and unit traffic;
searching and merging the adjacent units, namely searching the adjacent non-merged units of the seed units by using a recursive search method, and stopping recursive search when the service volume of the merged seed units reaches the upper limit;
merging the rest delivery units, namely merging the delivery units which are not merged into the seed units which are adjacent and have the minimum traffic, and forming the merged seed units into a delivery section fence to realize the dynamic planning of the delivery fence.
2. The method for dynamic planning of a service electronic fence based on delivery units as claimed in claim 1 wherein said step of generating delivery points comprises:
filtering the data of the committed business contained in the delivery department fence in a statistical period by using the historical data of the committed business and using a space coverage operator to form a data set of the committed business of the delivery department;
extracting data with non-repeated space coordinates from the composed delivery department committed service data set to form a delivery department non-repeated delivery point data set;
and counting the amount of the successful delivery service of each delivery point, storing the counted amount of the successful delivery service as a service volume attribute into the delivery point, and generating the delivery point of the delivery part.
3. The method for dynamic planning of a service electronic fence based on delivery units as claimed in claim 1 wherein said step of dividing delivery units and selecting seed units comprises:
using road network data and a space inclusion operator to filter delivery units contained in a delivery department fence to form a delivery department delivery unit set;
and dividing the delivery unit set of the delivery department into delivery unit clusters consistent with the number of the section channels by using a k-means spatial clustering algorithm according to the set number of the section channels planned by the delivery department.
4. The method for dynamic planning of service electronic fences based on delivery units according to claim 1, wherein the adjoining unit searching and merging step includes:
selecting the unit with the largest traffic in each delivery unit cluster as a seed unit, searching delivery units which are adjacent to the seed unit and are not merged under the constraint of the upper limit of the traffic by taking the seed unit as the center, and selecting the delivery unit closest to the center point of the seed delivery unit from the delivery units and merging the delivery units into the seed unit;
and summarizing the traffic of the two units, updating the traffic into the attribute of the merged seed unit traffic, judging whether the merged seed unit traffic is equal to or greater than the upper limit of the traffic of the delivery section to avoid unlimited merging, and stopping recursive search if the merged seed unit traffic reaches the upper limit.
5. The method for dynamic planning of service electronic fence based on delivery units as claimed in claim 1, wherein in the step of merging the remaining delivery units, after all seed units stop searching, judging whether there are delivery units which are not merged to the seed unit, if so, searching for adjacent seed units of non-merged units, and finding the seed unit with the minimum traffic from the adjacent seed units, and merging the non-merged delivery units into the seed units with the minimum traffic.
6. A dynamic planning system for business electronic fence based on delivery unit is characterized in that the system comprises:
a delivery point generating module (10) which is used for generating a delivery point element set by using the historical data of the committed business and searching delivery unit data according to the coverage relation of a delivery department fence;
a delivery unit dividing and selecting seed unit module (20) for setting the seed unit of each delivery unit cluster by using a k-means spatial clustering algorithm and unit traffic volume;
the adjacent unit searching and merging module (30) is used for searching adjacent non-merging units of the seed units by using a recursive searching method, and stopping recursive searching when the service volume of the merged seed units reaches the upper limit;
and the residual delivery unit merging module (40) is used for merging the delivery units which are not merged into the seed units which are adjacent and have the minimum traffic, and the merged seed units become a delivery section fence so as to realize the dynamic planning of the delivery fence.
7. A delivery unit based service electronic fence dynamic planning system according to claim 6, characterized in that the delivery point generating module (10) comprises:
the first composition submodule (11) is used for filtering the dully-delivered service data contained in the delivery department fence in the statistical period by using the historical data of the dully-delivered service and using a space coverage operator to form a delivery department duly-delivered service data set;
the second component submodule (12) is used for extracting data with non-repeated space coordinates from the composed delivery part data set of the properly delivered services to form a delivery part data set with non-repeated delivery points;
and the statistic submodule (13) is used for counting the amount of the appropriate-delivery traffic of each delivery point, storing the counted amount of the appropriate-delivery traffic as a traffic attribute into the delivery point, and generating the delivery point of the delivery part.
8. The delivery unit-based business electronic fence dynamic planning system of claim 6 wherein the divide delivery units and select seed units module (20) comprises:
a third composition submodule (21) for filtering delivery units contained in the delivery department pens using road network data and space inclusion operators to form a delivery department delivery unit set;
and the division submodule (22) is used for dividing the delivery unit set of the delivery part into delivery unit clusters consistent with the number of the section channels by using a k-means spatial clustering algorithm according to the set number of the section channels planned by the delivery part.
9. A delivery unit based service electronic fence dynamic planning system according to claim 6 characterized in that said adjacency unit search and merge module (30) comprises:
the merging submodule (31) is used for selecting a unit with the largest traffic in each delivery unit cluster as a seed unit, searching delivery units which are adjacent to the seed unit and are not merged under the constraint of the upper limit of the traffic by taking the seed unit as the center, and selecting the delivery unit closest to the center point of the seed delivery unit from the delivery units and merging the delivery units into the seed unit;
and the judging submodule (32) is used for summarizing the traffic of the two units and updating the traffic into the attribute of the traffic of the combined seed unit, and in order to avoid unlimited combination, whether the traffic of the combined seed unit is equal to or more than the upper limit of the traffic of the delivery passage needs to be judged, and if the traffic of the combined seed unit reaches the upper limit, the recursive search is stopped.
10. Delivery unit based service electronic fence dynamic planning system according to claim 6, characterized in that the merge remaining delivery unit module (40) is specifically configured to determine whether there are delivery units that are not merged to a seed unit after all seed units stop searching, if so, search for neighboring seed units of non-merged units and find therefrom the seed unit with the smallest traffic and merge the non-merged delivery units into the neighboring seed unit with the smallest traffic.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210726894.7A CN115271354B (en) | 2022-06-24 | 2022-06-24 | Service electronic fence dynamic planning method and system based on delivery unit |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210726894.7A CN115271354B (en) | 2022-06-24 | 2022-06-24 | Service electronic fence dynamic planning method and system based on delivery unit |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115271354A true CN115271354A (en) | 2022-11-01 |
| CN115271354B CN115271354B (en) | 2023-08-25 |
Family
ID=83761153
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210726894.7A Active CN115271354B (en) | 2022-06-24 | 2022-06-24 | Service electronic fence dynamic planning method and system based on delivery unit |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115271354B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118014514A (en) * | 2024-01-17 | 2024-05-10 | 南京泛泰数字科技研究院有限公司 | Service management system and method based on electronic fence |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107194513A (en) * | 2017-05-26 | 2017-09-22 | 中南大学 | A kind of optimization method for solving full channel logistics distribution |
| US9792576B1 (en) * | 2016-10-24 | 2017-10-17 | International Business Machines Corporation | Operating a plurality of drones and trucks in package delivery |
| CN107305577A (en) * | 2016-04-25 | 2017-10-31 | 北京京东尚科信息技术有限公司 | Correct-distribute address date processing method and system based on K-means |
| CN107392374A (en) * | 2017-07-21 | 2017-11-24 | 顺丰科技有限公司 | A kind of task parcel optimization method, system, equipment |
| CN110363453A (en) * | 2018-03-26 | 2019-10-22 | 北京京东振世信息技术有限公司 | Distribution information method for visualizing and device |
| CN110490510A (en) * | 2019-07-08 | 2019-11-22 | 北京三快在线科技有限公司 | A kind of logistics distribution route generation method and device |
| CN110555448A (en) * | 2018-05-30 | 2019-12-10 | 顺丰科技有限公司 | Method and system for subdividing dispatch area |
| CN111428991A (en) * | 2020-03-20 | 2020-07-17 | 北京百度网讯科技有限公司 | Method and device for determining delivery vehicles |
| CN112966893A (en) * | 2021-01-30 | 2021-06-15 | 华为技术有限公司 | Logistics network planning method and device |
| CN113743845A (en) * | 2020-05-29 | 2021-12-03 | 京东城市(北京)数字科技有限公司 | Distribution area dividing method and device, electronic device and storage medium |
| CN113935528A (en) * | 2021-10-13 | 2022-01-14 | 广州市钱大妈农产品有限公司 | Intelligent scheduling method and device, computer equipment and storage medium |
| CN114048924A (en) * | 2021-11-29 | 2022-02-15 | 合肥工业大学 | Multi-distribution center site selection-distribution path planning method based on hybrid genetic algorithm |
| CN114331220A (en) * | 2022-03-01 | 2022-04-12 | 北京邮电大学 | Passenger vehicle transport vehicle scheduling method and device based on order dynamic priority |
-
2022
- 2022-06-24 CN CN202210726894.7A patent/CN115271354B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107305577A (en) * | 2016-04-25 | 2017-10-31 | 北京京东尚科信息技术有限公司 | Correct-distribute address date processing method and system based on K-means |
| US9792576B1 (en) * | 2016-10-24 | 2017-10-17 | International Business Machines Corporation | Operating a plurality of drones and trucks in package delivery |
| CN107194513A (en) * | 2017-05-26 | 2017-09-22 | 中南大学 | A kind of optimization method for solving full channel logistics distribution |
| CN107392374A (en) * | 2017-07-21 | 2017-11-24 | 顺丰科技有限公司 | A kind of task parcel optimization method, system, equipment |
| CN110363453A (en) * | 2018-03-26 | 2019-10-22 | 北京京东振世信息技术有限公司 | Distribution information method for visualizing and device |
| CN110555448A (en) * | 2018-05-30 | 2019-12-10 | 顺丰科技有限公司 | Method and system for subdividing dispatch area |
| CN110490510A (en) * | 2019-07-08 | 2019-11-22 | 北京三快在线科技有限公司 | A kind of logistics distribution route generation method and device |
| CN111428991A (en) * | 2020-03-20 | 2020-07-17 | 北京百度网讯科技有限公司 | Method and device for determining delivery vehicles |
| CN113743845A (en) * | 2020-05-29 | 2021-12-03 | 京东城市(北京)数字科技有限公司 | Distribution area dividing method and device, electronic device and storage medium |
| CN112966893A (en) * | 2021-01-30 | 2021-06-15 | 华为技术有限公司 | Logistics network planning method and device |
| CN113935528A (en) * | 2021-10-13 | 2022-01-14 | 广州市钱大妈农产品有限公司 | Intelligent scheduling method and device, computer equipment and storage medium |
| CN114048924A (en) * | 2021-11-29 | 2022-02-15 | 合肥工业大学 | Multi-distribution center site selection-distribution path planning method based on hybrid genetic algorithm |
| CN114331220A (en) * | 2022-03-01 | 2022-04-12 | 北京邮电大学 | Passenger vehicle transport vehicle scheduling method and device based on order dynamic priority |
Non-Patent Citations (5)
| Title |
|---|
| L.N.PATTANAIK ET AL.: "Application of Clustering Algorithms for Locating Distribution Centers of Logistics System", 《PROCEEDINGS OF 6TH INTERNATIONAL CONFERENCE ON RECENT TRENDS IN COMPUTING》 * |
| TIANSHI LIU ET AL.: "Selection Optimization Modeling of Logistics Site and Applications", 《2020 5TH INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE, COMPUTER TECHNOLOGY AND TRANSPORTATION (ISCTT)》 * |
| 于晓寒 等: "基于带约束K-means聚类的城市快递配送区域划分", 《哈尔滨商业大学学报(自然科学版)》, vol. 32, no. 05 * |
| 刘成豪: "城市区域物流配送优化问题的研究", 《中国优秀硕士学位论文全文数据库 经济与管理科学辑(月刊)》, no. 08 * |
| 李志国: "基于改进K均值聚类算法的物流配送中心优化选址", 《中国优秀硕士学位论文全文数据库 信息科技辑(月刊)》, no. 03 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118014514A (en) * | 2024-01-17 | 2024-05-10 | 南京泛泰数字科技研究院有限公司 | Service management system and method based on electronic fence |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115271354B (en) | 2023-08-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110599090B (en) | Warehouse-out management method, server and storage medium | |
| CN111091328A (en) | Warehouse entry management method and management device | |
| CN110515990A (en) | Data query methods of exhibiting and inquiry display systems | |
| CN103186986B (en) | Method and device used for terminal to display road conditions, and equipment | |
| CN115271354A (en) | Service electronic fence dynamic planning method and system based on delivery unit | |
| CN109325671A (en) | A kind of online method for allocating tasks of space-time crowdsourcing and system | |
| CN109636013A (en) | Distribution range generation method and device, electronic equipment and storage medium | |
| CN114926098B (en) | Urban and rural life circle rapid demarcation method and system based on mobile positioning data | |
| CN109254901A (en) | A kind of Monitoring Indexes method and system | |
| CN111737325A (en) | Power data analysis method and device based on big data technology | |
| CN111401801A (en) | Processing system and method for determining decentralized storage of target article warehouse | |
| CN113592440A (en) | Intelligent logistics pickup analysis system and method based on big data | |
| CN113850541A (en) | Inventory-driven optical cable order distribution method based on SQL database | |
| US7412494B2 (en) | Merging partial query results into a single result | |
| CN103729419A (en) | Method for managing dynamic spectra on basis of query on data of database | |
| CN109933568A (en) | A kind of industry big data platform system and its querying method | |
| KR100742683B1 (en) | Area division system | |
| KR20050049522A (en) | Area dividing system | |
| CN111259308B (en) | Bus network hub evaluation method based on multiple mapping | |
| CN116431624A (en) | Service network point distribution method, device, equipment and storage medium | |
| CN111461617B (en) | Inventory counting method and device, computer equipment and storage medium | |
| CN110428627B (en) | Bus trip potential area identification method and system | |
| CN110210797B (en) | Method and apparatus for determining production coverage area and computer readable storage medium | |
| CN110442660B (en) | Bus network length calculation method for intelligent bus system | |
| CN105912598A (en) | Method and system for determining high-frequency regions for roadside stall business in urban streets |
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 |