CN112950248A - Logistics network point site selection method and device, computer equipment and readable storage medium - Google Patents
Logistics network point site selection method and device, computer equipment and readable storage medium Download PDFInfo
- Publication number
- CN112950248A CN112950248A CN201911268509.3A CN201911268509A CN112950248A CN 112950248 A CN112950248 A CN 112950248A CN 201911268509 A CN201911268509 A CN 201911268509A CN 112950248 A CN112950248 A CN 112950248A
- Authority
- CN
- China
- Prior art keywords
- point
- position points
- points
- target
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000010187 selection method Methods 0.000 title abstract description 11
- 238000000034 method Methods 0.000 claims abstract description 51
- 238000012545 processing Methods 0.000 claims description 30
- 238000004590 computer program Methods 0.000 claims description 15
- 238000012216 screening Methods 0.000 claims description 10
- 208000013715 atelosteogenesis type I Diseases 0.000 claims 5
- 230000008569 process Effects 0.000 description 8
- 238000005516 engineering process Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 238000011161 development Methods 0.000 description 2
- 230000000452 restraining effect Effects 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007717 exclusion Effects 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 238000002372 labelling Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000003068 static effect 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
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0201—Market modelling; Market analysis; Collecting market data
- G06Q30/0204—Market segmentation
- G06Q30/0205—Location or geographical consideration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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
Abstract
The application relates to a method and a device for selecting a site of a logistics network, computer equipment and a readable storage medium. The logistics network site selection method comprises the following steps: acquiring the dot information of a plurality of candidate position points in a target range; the mesh point information is used for representing attribute information and cost information of each candidate position point and distance information between each candidate position point; selecting a necessary position point from the candidate position points according to a preset necessary condition; acquiring site selection constraint conditions of logistics network points; selecting an address from the candidate position points according to the site information, the address selection constraint condition and the position point required to be selected to obtain a target position point meeting the address selection constraint condition; the target location point includes the mandatory location point. By adopting the method, the site selection efficiency of the logistics network can be improved.
Description
Technical Field
The invention relates to the technical field of logistics network site selection, in particular to a logistics network site selection method, a logistics network site selection device, computer equipment and a readable storage medium.
Background
In recent years, with the rapid development of internet technology, the logistics industry also enters a rapid development period. The site selection problem is widely applied to a plurality of industries including the logistics industry, and whether the site selection is successful or not directly determines the success or not of a business model in most business practices.
At present, the site selection of the logistics network points of most logistics enterprises is carried out manually based on the personal experience of site selection personnel. However, the above manual addressing method may have low addressing efficiency.
Disclosure of Invention
In view of the foregoing, it is necessary to provide a method, an apparatus, a computer device and a readable storage medium for locating a logistics site, which can improve the locating efficiency of the logistics site.
In a first aspect, an embodiment of the present application provides a method for locating an internet site of a logistics site, where the method for locating an internet site of a logistics site includes:
acquiring the dot information of a plurality of candidate position points in a target range; the mesh point information is used for representing attribute information and cost information of each candidate position point and distance information between each candidate position point;
selecting a necessary position point from the candidate position points according to a preset necessary condition;
acquiring site selection constraint conditions of logistics network points;
selecting an address from the candidate position points according to the site information, the address selection constraint condition and the position point required to be selected to obtain a target position point meeting the address selection constraint condition; the target location point includes the mandatory location point.
In one embodiment, the selecting a candidate location point from the candidate location points according to a preset candidate condition includes:
screening candidate position points of which the number of target objects included in the attribute information is larger than a first preset threshold value from the plurality of candidate position points;
and taking the candidate position points obtained by screening as the requisite position points.
In one embodiment, the address selection constraint condition comprises a cost constraint condition and a business constraint condition; the obtaining a target location point meeting the site selection constraint condition by site selection from the candidate location points according to the site selection information, the site selection constraint condition and the required location point comprises:
selecting a plurality of groups of position points meeting the service constraint condition from the candidate position points according to the network point information, the service constraint condition and the position points required to be selected; each group of position points comprises the position points required to be selected;
according to the cost constraint condition, selecting a group of position points meeting the cost constraint condition from the plurality of groups of position points as the target position points; the cost constraint condition is a group of position points with the minimum investment cost in the plurality of groups of position points.
In one embodiment, after the selecting, according to the cost constraint condition, a set of location points that satisfies the cost constraint condition from the plurality of sets of location points as the target location point, the method further includes:
and if a plurality of groups of position points with the minimum investment cost are obtained from the plurality of groups of position points, selecting one group of position points with the minimum difference between the target processing piece quantity and the actual processing piece quantity from the plurality of groups of position points with the minimum investment cost as the target position point.
In one embodiment, the business constraints include at least inventory resource reuse constraints.
In one embodiment, the method further comprises:
determining a plurality of interest surfaces AOI in a target range in map data;
removing AOIs which are not necessarily covered from the plurality of AOIs to obtain a plurality of candidate position points; the necessarily uncovered AOI is an AOI whose throughput is less than a second preset threshold.
In one embodiment, the method further comprises:
acquiring longitude and latitude information of the target position point, longitude and latitude information of stock resources included by the target position point and longitude and latitude information of a target object in attribute information of the target position point;
and drawing the target position point, the stock resource and the target object in map data by adopting a Leafflet library of an R language so as to visually display the target position point.
In a second aspect, an embodiment of the present application provides an apparatus for site selection of a logistics node, where the apparatus includes:
the first acquisition module is used for acquiring the dot information of a plurality of candidate position points in a target range; the mesh point information is used for representing attribute information and cost information of each candidate position point and distance information between each candidate position point;
the selection module is used for selecting the necessary position points from the candidate position points according to the preset necessary condition;
the second acquisition module is used for acquiring the site selection constraint conditions of the logistics network;
the site selection module is used for selecting a site from the candidate position points according to the network point information, the site selection constraint condition and the position point required to be selected to obtain a target position point meeting the site selection constraint condition; the target location point includes the mandatory location point.
In a third aspect, an embodiment of the present application provides a computer device, including a memory and a processor, where the memory stores a computer program, and the processor implements the steps of the method according to the first aspect when executing the computer program.
In a fourth aspect, embodiments of the present application provide a computer-readable storage medium, on which a computer program is stored, which, when executed by a processor, implements the steps of the method according to the first aspect.
The beneficial effects brought by the technical scheme provided by the embodiment of the application at least comprise:
acquiring the dot information of a plurality of candidate position points in a target range; the mesh point information is used for representing attribute information and cost information of each candidate position point and distance information between each candidate position point; selecting a necessary position point from the candidate position points according to a preset necessary condition; acquiring site selection constraint conditions of logistics network points; selecting an address from the candidate position points according to the site information, the address selection constraint condition and the position point required to be selected to obtain a target position point meeting the address selection constraint condition; the target location point includes the mandatory location point. Therefore, according to the site information of the candidate position points, the site selection constraint conditions of the logistics sites and the position points required to be selected, the target position point is obtained from the site selection of the candidate position points, namely the logistics site is obtained by site selection; the situation of low site selection efficiency caused by manual site selection based on personal experience of site selection personnel in the traditional technology is avoided. The method and the device can improve the site selection efficiency of the logistics network points, and introduce the necessary position points in the site selection process, so that the site selection rationality of the logistics network points is improved.
Drawings
Fig. 1 is an application environment diagram of a method for site selection of a logistics site according to an embodiment;
fig. 2 is a schematic flow chart of a method for site selection of a logistics site according to an embodiment;
fig. 3 is a schematic flow chart of a method for site selection of a logistics site according to an embodiment;
fig. 4 is a schematic flowchart of a method for site selection of a logistics site according to an embodiment;
fig. 5 is a schematic flow chart of a method for site selection of a logistics site according to an embodiment;
fig. 6 is a schematic flow chart of a method for site selection of a logistics site according to an embodiment;
fig. 7 is a schematic flowchart of a method for site selection of a logistics site according to an embodiment;
fig. 8 is a block diagram of an embodiment of a network addressing device.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
The method for selecting the address of the logistics site provided by the application can be applied to the computer device shown in fig. 1, the computer device can be a server, and the internal structure diagram of the computer device can be shown in fig. 1. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer device is used for storing data of the stream network point addressing method.
The embodiment of the application provides a method and a device for site selection of a logistics network, a computer device and a readable storage medium, and aims to solve the technical problem of low site selection efficiency caused by manual site selection based on personal experience of site selection personnel when a logistics enterprise selects a site at the logistics network in the traditional technology. The following describes in detail the technical solutions of the present application and how the technical solutions of the present application solve the above technical problems by embodiments and with reference to the drawings. The following specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.
It should be noted that, in the method for locating a logistics site provided in the embodiment of the present application, an execution main body may be a logistics site locating device, and the logistics site locating device may be implemented as part or all of a computer device in a software, hardware, or a combination of software and hardware. In the following method embodiments, the execution subject is a computer device as an example.
Referring to fig. 2, a schematic flow chart of an addressing method for an logistics site provided in an embodiment of the present application is shown, as shown in fig. 2, the addressing method for the logistics site in the embodiment may include the following steps:
step S100, acquiring the mesh point information of a plurality of candidate position points in the target range.
The mesh point information is used to indicate attribute information, cost information, and distance information between the candidate position points.
In this embodiment, the target range is an address selection range for currently performing address selection of a logistics site, the target range includes a plurality of AOIs (Area of Interest), the AOIs can be regarded as two or three buildings, and the computer device selects a plurality of candidate location points from the plurality of AOIs included in the target range as basic candidate units of the address selection method of the logistics site of this embodiment.
The computer device acquires mesh point information of a plurality of candidate position points. In this embodiment, the computer device obtains an AOI property table, an available fund table, and an inter-AOI spherical distance table from a big data platform and a GIS (Geographic Information System), where the AOI property table includes attribute Information of each candidate location point, the available fund table includes cost Information of each candidate location point, and the inter-AOI spherical distance table includes distance Information between each candidate location point.
The AOI property table specifically comprises attribute information such as organization relation information, receiving and dispatching quantity information, timeliness index information, identification information of existence of stock resources, target object distribution information and the like of AOI in a target range; the stock resources comprise business stations, express cabinets and the like in a target range, and the target object distribution information can be competitor distribution information. The available funds table includes the maximum investment costs set for each candidate location point. The spherical distance table between AOIs comprises spherical distance information between every two AOIs in a target range.
Step S200, selecting the optional position points from the candidate position points according to the preset optional condition.
In this embodiment, the necessary conditions may be: in the target object distribution information included in the attribute information of the candidate position point, that is, in the competitor distribution information, the number of competitors is greater than the set threshold. For example, the number of competitors is greater than 4. In other embodiments, the optional condition may also be that the actual processing load of the candidate position point is greater than a set threshold, and the like, and the embodiment is not particularly limited herein.
The computer device selects, from the plurality of candidate position points, a candidate position point whose number of target objects included in the attribute information is larger than a threshold value as a must-select position point.
And step S300, acquiring site selection constraint conditions of the logistics network points.
In this embodiment, the logistics node is a user-oriented logistics node.
In the traditional technology, most logistics outlets of logistics enterprises are required to have O-type and M-type functions simultaneously, wherein the O-type function is an operation-type function capable of performing processes such as warehouse management, express sorting and labeling, connection and the like, the M-type function is a market-type function for providing receiving and dispatching services for users, and the traditional O/M coupled outlet mode not only has low operation efficiency, but also seriously affects service experience of customers. In this embodiment, the logistics network is a user-oriented logistics network, that is, an M-type network, and improves the service experience of the client compared with the conventional O/M-coupled network mode.
In this embodiment, the service mode of the M-type network point may be a self-service station and/or an express cabinet, that is, a self-service station or an express cabinet may be released, or a self-service station and an express cabinet may be released simultaneously.
In this embodiment, the site selection constraint condition of the logistics network may be set by site selection personnel. As an embodiment, the addressing constraints may include cost constraints, service location scope constraints, processing component quantity constraints, inventory resource reuse constraints, and the like.
And step S400, selecting an address from the candidate position points according to the network point information, the address selection constraint condition and the position point required to be selected, and obtaining a target position point meeting the address selection constraint condition.
Wherein the target location points include mandatory location points.
And the computer equipment acquires target position points meeting the site selection constraint condition from a plurality of candidate position points in the target range according to the network point information of each candidate position point and the required position points, wherein the target position points comprise the required position points, and the target position points are finally selected logistics network points.
The embodiment obtains the dot information of a plurality of candidate position points in the target range; the mesh point information is used for representing attribute information and cost information of each candidate position point and distance information among the candidate position points; selecting a necessary position point from the candidate position points according to a preset necessary condition; acquiring site selection constraint conditions of logistics network points; selecting an address from a plurality of candidate position points according to the network point information, the address selection constraint condition and the position point required to be selected, and obtaining a target position point meeting the address selection constraint condition; the target location points include the mandatory location points. Therefore, according to the site information of the candidate position points, the site selection constraint conditions of the logistics sites and the position points required to be selected, the target position point is obtained from the site selection of the candidate position points, namely the logistics site is obtained by site selection; the situation of low site selection efficiency caused by manual site selection based on personal experience of site selection personnel in the traditional technology is avoided. The embodiment can improve the site selection efficiency of the logistics network points, and the site selection reasonability of the logistics network points is improved by introducing the position points required to be selected during site selection.
Fig. 3 is a schematic flow chart of a stream site selection method according to another embodiment. On the basis of the embodiment shown in fig. 2, as shown in fig. 3, in the present embodiment, the step S200 includes a step S210 and a step S220, specifically:
step S210, screening candidate position points whose number of target objects included in the attribute information is greater than a first preset threshold from the plurality of candidate position points.
In this embodiment, the computer device takes the target object in the attribute information, that is, the candidate position point whose number of competitors is greater than a certain threshold value, as the requisite position point according to the attribute information of each candidate position point included in the AOI property table. For example, a candidate position point with a competitor number greater than 4 is used as a candidate position point, that is, if the competitor number corresponding to a candidate position point is greater than 4, the candidate position point must be selected as a target position point.
And step S220, taking the candidate position points obtained by screening as the necessary position points.
And the computer equipment takes the candidate position points with the number of the target objects obtained by screening being larger than a first preset threshold value as the necessary position points. Therefore, in the logistics network site selection process, the requisite selection condition based on competitor distribution information is introduced, and the target position points obtained by site selection comprise the requisite selection position points, so that the selected target position points can compete in a straight-line manner, the rationality of site selection is improved, and the market share of logistics enterprises is promoted.
Fig. 4 is a schematic flow chart of a stream site selection method according to another embodiment. On the basis of the embodiment shown in fig. 2, as shown in fig. 4, in the present embodiment, the step S400 includes a step S410 and a step S420, specifically:
and step S410, selecting a plurality of groups of position points meeting the business constraint condition from the candidate position points according to the network point information, the business constraint condition and the position points required to be selected.
Wherein each group of location points comprises the requisite location points.
In this embodiment, the address selection constraint condition includes a cost constraint condition and a service constraint condition. The business constraint condition comprises a service position range constraint condition, a processing component quantity constraint condition and an inventory resource multiplexing constraint condition. In other embodiments, the business constraint condition at least includes an inventory resource reuse constraint condition, and the embodiment is not limited herein.
The self-service station or the express cabinet has respective limited service ranges, and the service position range constraint condition is used for constraining the service range of each candidate position point; the self-service station or the express cabinet respectively has different maximum processing quantity, maximum heavy goods processing quantity and maximum value-added service processing quantity, and the processing quantity constraint condition is used for constraining the processing quantity of each candidate position point; the stock resource reuse constraint conditions comprise the existing business station reuse constraint and the existing express cabinet reuse constraint, and if the business stations exist in the candidate position points at present and the candidate position points comprising the business stations are selected as the target position points, the business stations can be reused when the target position points are put into use; if the express delivery cabinet is currently in the candidate position point and the candidate position point including the express delivery cabinet is selected as the target position point, the target position point can directly reuse the existing express delivery cabinet when the express delivery cabinet is put into use.
According to step S200, the computer device selects a candidate location point from the plurality of candidate location points to obtain a set of candidate location points. Further, the computer device selects a necessarily covered position point from the plurality of candidate position points according to a preset necessarily covered condition.
As an embodiment, the required coverage condition can be associated with the number of competitors, the quality of service and the self-consignment ratio corresponding to each candidate location point, wherein the quality of service includes dispatch success rate, hasty rate and hasty rate. For example, the candidate position points with the number of competitors larger than 1, the daily average total piece quantity larger than 20, the dispatch success rate smaller than 70%, the hasten rate larger than 0.01% or the hasten rate larger than 0.01% are used as the necessary covered position points. It is to be understood that the optional condition and the covered condition may be set by themselves in implementation, and are not particularly limited herein. Thus, the computer device selects the covered position points from the candidate position points to obtain a group of covered position points.
In this embodiment, the service constraint condition specifically includes the following constraint conditions. Wherein x isiThe ith candidate position point is selected as a target position point by the computer equipment, and the self-service station is released at the target position point; v. ofiThe computer equipment selects the ith candidate position point as a target position point, and puts an express delivery cabinet at the target position point; y isijAnd indicating whether the ith candidate position point covers the jth candidate position point, wherein i is a positive integer not greater than N, and N is the number of the candidate position points in the target range.
1) And (3) releasing constraint conditions of the selected position points:
xi+vi1for i in ═ 1for i in { mandatory position point }
2) Putting constraint conditions of covered position points:
wherein if the ith candidate position point covers the jth necessarily covered position point, then yijJ is a positive integer not greater than the number of essential covered location points.
3) Stock resource reuse constraint conditions:
xi*current_flagi0for i in (candidate position point) }
Wherein current _ flagiIndicating whether the ith candidate position point has a business stop or not, if current _ flagiAnd 1 indicates that the ith candidate position point has an operating station.
4) Maximum throughput capability constraint:
selecting candidate position points without business stations as target position points, and putting in self-service stations and/or express delivery cabinets:
the total _ amount represents the total processing quantity, the hub _ capacity _ x represents the maximum total processing quantity of the self-service station, and the hub _ capacity _ v represents the maximum total processing quantity of the express cabinet.
Selecting candidate position points of the existing business stations as target position points, and putting in self-service stations and/or express delivery cabinets:
5) maximum heavy goods handling capacity constraint:
selecting candidate position points without business stations as target position points, and putting in self-service stations and/or express delivery cabinets:
the hub _ account represents the summary of the heavy-piece handling capacity, the hub _ capacity _ x represents the maximum heavy-piece handling capacity of the self-service station, and the hub _ capacity _ v represents the maximum heavy-piece handling capacity of the express cabinet.
Selecting candidate position points of the existing business stations as target position points, and putting in self-service stations and/or express delivery cabinets:
6) maximum value-added service handling capacity constraint:
selecting candidate position points without business stations as target position points, and putting in self-service stations and/or express delivery cabinets:
wherein, the input _ account represents the summary of the processing premium high-value-added pieces, the input _ hub _ capacity _ x represents the maximum processing premium high-value-added pieces of the self-service station, and the input _ hub _ capacity _ v represents the maximum processing premium high-value-added pieces of the express cabinet.
Selecting candidate position points of the existing business stations as target position points, and putting in self-service stations and/or express delivery cabinets:
7) service location range constraint:
selecting candidate position points without business stations as target position points, and putting in self-service stations and/or express delivery cabinets:
yij*distij≤xi*hub_radius_x+vihub _ radius _ v for i in { candidate position point } for j in { candidate position point } if current _ flagi＝＝0
Wherein, distijThe distance between the ith candidate position point and the jth candidate position point is represented, hub _ radius _ x represents the maximum service radius of the self-service station, and hub _ radius _ v represents the maximum service radius of the express cabinet.
Selecting candidate position points of the existing business stations as target position points, and putting in self-service stations and/or express delivery cabinets:
yij*distij≤xi*hub_radius_x+vihub _ radius _ x for i in { candidate position point } for j in { candidate position point } if current _ flagi＝＝1
8) Selecting a mutual exclusion constraint condition:
xi+viis less than or equal to 1for i in (candidate position points)
9) Unique covered constraint:
10) set coverage constraints:
xi+vi≥yijfor i in { candidate position point } for j in { candidate position point }
11) Self-covering constraint:
yii＝＝xi+vifor i in { candidate position point }
12) The maximum total investment cost constraint condition is as follows:
cost≤max_cost
cost represents the investment cost corresponding to each set of position points, and max _ cost represents the maximum investment cost.
The computer equipment restrains the candidate position points, the optional position points and the network point information of the essential covered position points according to the restraining conditions listed in the 1) to 12), and selects a plurality of groups of position points meeting the service restraining conditions, wherein each group of position points comprises the essential position points.
Step S420, according to the cost constraint condition, a group of location points satisfying the cost constraint condition is selected from the plurality of groups of location points as a target location point.
The cost constraint condition is a group of position points with the minimum investment cost in the plurality of groups of position points.
And minimizing the cost constraint condition, namely minimizing the total input cost of the self-service station and/or the express cabinet which are put in at each candidate position point. And selecting a group of position points with the minimum total input cost from the plurality of groups of position points as target position points by the computer equipment according to the cost constraint condition.
In this embodiment, the computer device obtains the investment costs corresponding to each group of location points, and the investment cost corresponding to each group of location points can be calculated by using formula 1:
cost — cost _1+ cost _2 formula 1
The cost _1 represents that the candidate position points without the express cabinet are selected as target position points, and the self-service station and/or the express cabinet are released, and the cost _1 is obtained by calculation according to a formula 2:
the cost _ x represents the monthly rent investment cost of the self-service station, the cost _ v represents the monthly rent investment cost of the express cabinet, and the nest _ flag represents the monthly rent investment cost of the express cabinetiWhether the ith candidate position point has an express cabinet or not is shown, and if the nest _ flag indicates that the ith candidate position point has the express cabinetiIf the position point is 1, the express cabinet exists at the ith candidate position point.
The cost _2 represents that the candidate position points of the existing express delivery cabinets are selected as target position points, and self-service stations and/or the express delivery cabinets are released, and the cost _2 is obtained by calculation according to a formula 3:
it can be understood that, if there is an express cabinet, the drop-in of the express cabinet at the target location point is 0.
M is an infinite constant in order to emphasize that cost is a core optimization objective.
After the input cost corresponding to each group of position points is obtained, the computer device further selects a group of position points with the minimum input cost from the plurality of groups of position points as the target position point.
In this embodiment, the computer device obtains the dot information of a plurality of candidate position points within the target range; selecting a necessary position point from the candidate position points according to a preset necessary condition; acquiring site selection constraint conditions of logistics network points; selecting a plurality of groups of position points meeting the service constraint condition from a plurality of candidate position points according to the network point information, the service constraint condition and the position points required to be selected; each group of position points comprises the position points required to be selected; selecting a group of position points meeting the cost constraint condition from the plurality of groups of position points as target position points according to the cost constraint condition; therefore, a large number of small user-oriented logistics outlets are built by taking the density, the size and the weight as the coverage principle, and the service experience of the user is improved; stock resource strategies such as a multiplexing business station and an express cabinet are introduced, resources are checked out, and investment is minimized; a competitor distribution means is introduced in the site selection process, so that the selected target position points compete in a straight-line mode, and the market share is improved.
Fig. 5 is a schematic flow chart of a stream site selection method according to another embodiment. On the basis of the embodiment shown in fig. 4, after step S420, the method for selecting addresses by using stream nodes further includes step S500, specifically:
in step S500, when the plurality of sets of position points having the smallest input cost are acquired from the plurality of sets of position points, one set of position points having the smallest difference between the target processed workpiece amount and the actual processed workpiece amount is selected as the target position point from the plurality of sets of position points having the smallest input cost.
In this embodiment, if there are a plurality of sets of position points with the minimum and equal investment cost, a constraint condition is introduced to minimize the difference between the target processing amount and the actual processing amount, where the target processing amount is the maximum processing amount.
The difference value surplus _ capacity between the maximum processing piece quantity and the actual processing piece quantity can be calculated by adopting the following formula 4:
a reference _ capacity _1+ reference _ capacity _2 equation 4
The specification _ capacity _1 represents that a candidate position point without a business station is selected as a target position point, and a self-service station and/or an express cabinet are/is released, and the specification _ capacity _1 is obtained by calculation according to a formula 5:
the hub _ capacity _ x represents the maximum total processing quantity of the self-service station, the hub _ capacity _ v represents the maximum total processing quantity of the express cabinet, and the total _ account represents the total processing quantity summary.
The summary _ capacity _2 represents that the candidate position points of the existing business stations are selected as target position points, and self-service stations and/or express cabinets are released, and the summary _ capacity _1 is obtained by calculation according to a formula 6:
the computer device takes the position point with the minimum recurrence _ capacity value as the target position point in the multiple groups of position points with the minimum and equal investment cost, thereby, under the premise of giving priority to investment cost, the candidate position points which can be covered or not covered are also taken as covered position points as much as possible by minimizing the difference between the maximum processing piece quantity and the actual processing piece quantity, and the service range is expanded.
Fig. 6 is a schematic flow chart of a stream site selection method according to another embodiment. On the basis of the embodiment shown in fig. 2, the method for selecting an address of a logistics site of the present embodiment further includes step S610 and step S620, specifically:
step S610, in the map data, a plurality of interest surfaces AOI within the target range are determined.
In this embodiment, the computer device determines, in the map data, a plurality of interest plane AOIs within the target range, that is, determines all AOIs within the target range.
And step S620, removing AOIs which are not covered necessarily from the plurality of AOIs to obtain a plurality of candidate position points.
Wherein the AOI which is not necessarily covered is the AOI of which the processing load is less than a second preset threshold value.
The necessarily uncovered AOI may be an AOI that processes a quantity less than a second preset threshold, or a location point that has no quantity. The computer equipment eliminates position points which are not covered necessarily from the AOIs to obtain a plurality of candidate position points, then obtains network point information of the candidate position points in a target range, selects the position points which are necessary to select from the candidate position points according to a preset condition which is necessary to select, obtains an addressing constraint condition of the logistics network point, and selects an address from the candidate position points according to the network point information, the addressing constraint condition and the position points which are necessary to select to obtain a target position point meeting the addressing constraint condition; therefore, the rationality of the site selection of the logistics network points is improved.
Fig. 7 is a schematic flow chart of a stream site selection method according to another embodiment. On the basis of the embodiment shown in fig. 2, the method for selecting addresses of logistics nodes in this embodiment further includes step S710 and step S720, specifically:
step S710, acquiring longitude and latitude information of the target position point, longitude and latitude information of stock resources included in the target position point and longitude and latitude information of a target object in the attribute information of the target position point.
And step S720, drawing the target position point, the stock resource and the target object in the map data by adopting a Leafflet library of the R language so as to visually display the target position point.
In the embodiment, after acquiring longitude and latitude information of a target position point, longitude and latitude information of stock resources included in the target position point and longitude and latitude information of a target object in attribute information of the target position point, computer equipment draws the target position point, the stock resources and the target object in map data by adopting a Leafflet library of an R language; for example, an irregular closed polygon is adopted to represent a target position point, the outline of the target position point is represented, different icons are used to represent a newly-thrown self-service station, an express delivery cabinet, a self-service station generated by multiplexing an existing business station, a multiplexing existing express delivery cabinet, competitor distribution information around the target position point, and the like, so that an siting worker can clearly and intuitively check an siting result.
It should be understood that although the various steps in the flow charts of fig. 2-7 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 2-7 may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performance of the sub-steps or stages is not necessarily sequential, but may be performed in turn or alternating with other steps or at least some of the sub-steps or stages of other steps.
In one embodiment, as shown in fig. 8, there is provided a stream site selection device, including:
a first obtaining module 10, configured to obtain mesh point information of multiple candidate location points in a target range; the mesh point information is used for representing attribute information and cost information of each candidate position point and distance information between each candidate position point;
a selecting module 20, configured to select a necessary selection position point from the multiple candidate position points according to a preset necessary selection condition;
a second obtaining module 30, configured to obtain an address selection constraint condition of a logistics node;
an addressing module 40, configured to address from the multiple candidate location points according to the website information, the addressing constraint condition, and the location point required to be addressed, so as to obtain a target location point meeting the addressing constraint condition; the target location point includes the mandatory location point.
Optionally, the selecting module 20 includes:
the screening unit is used for screening candidate position points of which the number of target objects included in the attribute information is larger than a first preset threshold value from the plurality of candidate position points;
and the determining unit is used for taking the candidate position points obtained by screening as the necessary position points.
Optionally, the address selection constraint condition includes a cost constraint condition and a service constraint condition; the address selecting module 40 includes:
a first addressing unit, configured to select multiple sets of location points that satisfy the service constraint condition from the multiple candidate location points according to the mesh point information, the service constraint condition, and the required location point; each group of position points comprises the position points required to be selected;
a second address selection unit, configured to select, according to the cost constraint condition, a group of location points that satisfy the cost constraint condition from the multiple groups of location points as the target location point; the cost constraint condition is a group of position points with the minimum investment cost in the plurality of groups of position points.
Optionally, the address selecting module 40 further includes:
and a third addressing unit configured to, if a plurality of sets of position points with the smallest investment cost are obtained from the plurality of sets of position points, select, as the target position point, a set of position points with the smallest difference between the target processed item amount and the actual processed item amount from the plurality of sets of position points with the smallest investment cost.
Optionally, the business constraint condition at least comprises an inventory resource reuse constraint condition.
Optionally, the apparatus further comprises:
the determining module is used for determining a plurality of interest surfaces AOI in the target range in the map data;
a removing module, configured to remove AOIs that are not necessarily covered from the multiple AOIs, so as to obtain multiple candidate location points; the necessarily uncovered AOI is an AOI whose throughput is less than a second preset threshold.
Optionally, the apparatus further comprises:
the third acquisition module is used for acquiring the longitude and latitude information of the target position point, the longitude and latitude information of stock resources included in the target position point and the longitude and latitude information of a target object in the attribute information of the target position point;
and the drawing module is used for drawing the target position point, the stock resource and the target object in map data by adopting a Leafflet library of an R language so as to visually display the target position point.
The device for locating a website of a logistics network node provided in this embodiment can implement the embodiment of the method for locating a website of a logistics network node, and the implementation principle and the technical effect are similar, and are not described herein again.
For the specific limitations of the logistics site selection device, reference may be made to the above limitations on the logistics site selection method, and details are not described here. All or part of the modules in the logistics network site selection device can be realized by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, there is also provided a computer device as shown in fig. 1, which may be a server. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer equipment is used for storing the site selection data of the logistics points. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method of site selection for a network point of a logistics.
Those skilled in the art will appreciate that the architecture shown in fig. 1 is a block diagram of only a portion of the architecture associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, and that a computing device may in particular include more or less components than those shown, or combine certain components, or have a different arrangement of components.
In one embodiment, a computer device is provided, comprising a memory and a processor, the memory having a computer program stored therein, the processor implementing the following steps when executing the computer program:
acquiring the dot information of a plurality of candidate position points in a target range; the mesh point information is used for representing attribute information and cost information of each candidate position point and distance information between each candidate position point; selecting a necessary position point from the candidate position points according to a preset necessary condition; acquiring site selection constraint conditions of logistics network points; selecting an address from the candidate position points according to the site information, the address selection constraint condition and the position point required to be selected to obtain a target position point meeting the address selection constraint condition; the target location point includes the mandatory location point.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware related to instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms, such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Ramb microsecond direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and bus dynamic RAM (RDRAM).
In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of:
acquiring the dot information of a plurality of candidate position points in a target range; the mesh point information is used for representing attribute information and cost information of each candidate position point and distance information between each candidate position point; selecting a necessary position point from the candidate position points according to a preset necessary condition; acquiring site selection constraint conditions of logistics network points; selecting an address from the candidate position points according to the site information, the address selection constraint condition and the position point required to be selected to obtain a target position point meeting the address selection constraint condition; the target location point includes the mandatory location point.
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above examples only show some embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. A method for site selection of a logistics network point, the method comprising:
acquiring the dot information of a plurality of candidate position points in a target range; the mesh point information is used for representing attribute information and cost information of each candidate position point and distance information between each candidate position point;
selecting a necessary position point from the candidate position points according to a preset necessary condition;
acquiring site selection constraint conditions of logistics network points;
selecting an address from the candidate position points according to the site information, the address selection constraint condition and the position point required to be selected to obtain a target position point meeting the address selection constraint condition; the target location point includes the mandatory location point.
2. The method according to claim 1, wherein the selecting a candidate location point from the candidate location points according to a preset candidate condition comprises:
screening candidate position points of which the number of target objects included in the attribute information is larger than a first preset threshold value from the plurality of candidate position points;
and taking the candidate position points obtained by screening as the requisite position points.
3. The method according to claim 1 or 2, wherein the addressing constraints comprise cost constraints and business constraints; the obtaining a target location point meeting the site selection constraint condition by site selection from the candidate location points according to the site selection information, the site selection constraint condition and the required location point comprises:
selecting a plurality of groups of position points meeting the service constraint condition from the candidate position points according to the network point information, the service constraint condition and the position points required to be selected; each group of position points comprises the position points required to be selected;
according to the cost constraint condition, selecting a group of position points meeting the cost constraint condition from the plurality of groups of position points as the target position points; the cost constraint condition is a group of position points with the minimum investment cost in the plurality of groups of position points.
4. The method according to claim 3, wherein after selecting a set of location points from the plurality of sets of location points that satisfies the cost constraint as the target location point according to the cost constraint, further comprising:
and if a plurality of groups of position points with the minimum investment cost are obtained from the plurality of groups of position points, selecting one group of position points with the minimum difference between the target processing piece quantity and the actual processing piece quantity from the plurality of groups of position points with the minimum investment cost as the target position point.
5. The method of claim 3, wherein the traffic constraints comprise at least inventory resource reuse constraints.
6. The method of claim 1, further comprising:
determining a plurality of interest surfaces AOI in a target range in map data;
removing AOIs which are not necessarily covered from the plurality of AOIs to obtain a plurality of candidate position points; the necessarily uncovered AOI is an AOI whose throughput is less than a second preset threshold.
7. The method of claim 1, further comprising:
acquiring longitude and latitude information of the target position point, longitude and latitude information of stock resources included by the target position point and longitude and latitude information of a target object in attribute information of the target position point;
and drawing the target position point, the stock resource and the target object in map data by adopting a Leafflet library of an R language so as to visually display the target position point.
8. A stream site selection apparatus, comprising:
the first acquisition module is used for acquiring the dot information of a plurality of candidate position points in a target range; the mesh point information is used for representing attribute information and cost information of each candidate position point and distance information between each candidate position point;
the selection module is used for selecting the necessary position points from the candidate position points according to the preset necessary condition;
the second acquisition module is used for acquiring the site selection constraint conditions of the logistics network;
the site selection module is used for selecting a site from the candidate position points according to the network point information, the site selection constraint condition and the position point required to be selected to obtain a target position point meeting the site selection constraint condition; the target location point includes the mandatory location point.
9. A computer device comprising a memory and a processor, the memory storing a computer program, wherein the processor implements the steps of the method of any one of claims 1 to 7 when executing the computer program.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911268509.3A CN112950248A (en) | 2019-12-11 | 2019-12-11 | Logistics network point site selection method and device, computer equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911268509.3A CN112950248A (en) | 2019-12-11 | 2019-12-11 | Logistics network point site selection method and device, computer equipment and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112950248A true CN112950248A (en) | 2021-06-11 |
Family
ID=76234118
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911268509.3A Pending CN112950248A (en) | 2019-12-11 | 2019-12-11 | Logistics network point site selection method and device, computer equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112950248A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114669379A (en) * | 2022-05-30 | 2022-06-28 | 南京信息工程大学 | Paper article recovery device based on GIS and delivery position selection method thereof |
| CN116451503A (en) * | 2023-05-15 | 2023-07-18 | 宁波安得智联科技有限公司 | Logistics platform facility site selection method, device, equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101814174A (en) * | 2010-04-07 | 2010-08-25 | 北京交通大学 | Optimization method of agricultural material chain operation logistics center site selection |
| US20160055572A1 (en) * | 2014-08-19 | 2016-02-25 | Alibaba Group Holding Limited | Processing Commodity Transaction and Logistics Solution |
| CN108520344A (en) * | 2018-03-27 | 2018-09-11 | 华南农业大学 | A kind of construction method of intelligent express delivery cabinet system for client concentrated area |
-
2019
- 2019-12-11 CN CN201911268509.3A patent/CN112950248A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101814174A (en) * | 2010-04-07 | 2010-08-25 | 北京交通大学 | Optimization method of agricultural material chain operation logistics center site selection |
| US20160055572A1 (en) * | 2014-08-19 | 2016-02-25 | Alibaba Group Holding Limited | Processing Commodity Transaction and Logistics Solution |
| CN108520344A (en) * | 2018-03-27 | 2018-09-11 | 华南农业大学 | A kind of construction method of intelligent express delivery cabinet system for client concentrated area |
Non-Patent Citations (4)
| Title |
|---|
| 刘智勇;: "B2C电子商务物流配送中心选址模型研究", 物流科技, no. 10 * |
| 张光明;王路;: "快递服务网点选址模型研究", 江苏科技大学学报(自然科学版), no. 02, pages 199 - 203 * |
| 李珍萍;毛小寸;: "多需求多类型自提点选址分配问题", 计算机集成制造系统, no. 11 * |
| 许婷;韩宝明;: "基于Fuzzy理论的区域配送中心选址模型对比分析", 物流科技, no. 08 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114669379A (en) * | 2022-05-30 | 2022-06-28 | 南京信息工程大学 | Paper article recovery device based on GIS and delivery position selection method thereof |
| CN114669379B (en) * | 2022-05-30 | 2022-09-23 | 南京信息工程大学 | Paper article recovery device based on GIS and delivery position selection method thereof |
| CN116451503A (en) * | 2023-05-15 | 2023-07-18 | 宁波安得智联科技有限公司 | Logistics platform facility site selection method, device, equipment and storage medium |
| CN116451503B (en) * | 2023-05-15 | 2023-11-07 | 宁波安得智联科技有限公司 | Logistics platform facility site selection method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7072054B2 (en) | Methods and equipment for sorting cargo | |
| CN109840648B (en) | Method and device for outputting bin information | |
| CN107123012B (en) | Method and system for automatically selecting delivery address | |
| CN112950248A (en) | Logistics network point site selection method and device, computer equipment and readable storage medium | |
| CN111898221A (en) | Address selection method and device and computer readable storage medium | |
| CN113259144A (en) | Storage network planning method and device | |
| CN110858347A (en) | Method and device for logistics distribution and order distribution | |
| CN109325599A (en) | A kind of data processing method, server and computer-readable medium | |
| CN114154745A (en) | Intelligent material allocation method and device | |
| CN112950119A (en) | Method, device, equipment and storage medium for splitting instant logistics order | |
| CN114254845A (en) | Warehouse site selection method and device, computer equipment and storage medium | |
| CN112465371B (en) | Resource data distribution method, device and equipment | |
| CN110889738B (en) | Order distribution method and device | |
| CN111144659B (en) | Logistics scheduling method and device, computer equipment and storage medium | |
| CN112132476A (en) | Case allocation method, device, equipment and storage medium | |
| CN111815244A (en) | Inventory data processing method, device, equipment and medium | |
| CN114492934A (en) | Method and device for selecting addresses of warehouse | |
| CN110992123B (en) | Order distribution method and device | |
| CN108197158A (en) | A kind of information acquisition method and its equipment | |
| CN114493772A (en) | Order processing method and device, electronic equipment and readable storage medium | |
| CN111080393A (en) | Transaction matching method and device | |
| CN113554380A (en) | Method and device for positioning articles in warehouse-out process | |
| CN114549106A (en) | Method and device for displaying merchant information, storage medium and electronic equipment | |
| CN112633698A (en) | Hotel order scheduling processing method and system | |
| CN112926907A (en) | Warehouse inventory layout method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |