CN108985694A - Method and apparatus for determining home-delivery center address - Google Patents

Method and apparatus for determining home-delivery center address Download PDF

Info

Publication number
CN108985694A
CN108985694A CN201810786397.XA CN201810786397A CN108985694A CN 108985694 A CN108985694 A CN 108985694A CN 201810786397 A CN201810786397 A CN 201810786397A CN 108985694 A CN108985694 A CN 108985694A
Authority
CN
China
Prior art keywords
home
delivery
delivery center
center
resource consumption
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
Application number
CN201810786397.XA
Other languages
Chinese (zh)
Other versions
CN108985694B (en
Inventor
范竣翔
陈科第
周淼
孟泉
王蔚
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Baidu Netcom Science and Technology Co Ltd
Original Assignee
Beijing Baidu Netcom Science and Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Baidu Netcom Science and Technology Co Ltd filed Critical Beijing Baidu Netcom Science and Technology Co Ltd
Priority to CN201810786397.XA priority Critical patent/CN108985694B/en
Publication of CN108985694A publication Critical patent/CN108985694A/en
Application granted granted Critical
Publication of CN108985694B publication Critical patent/CN108985694B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • 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

Abstract

The embodiment of the present application discloses the method and apparatus for determining home-delivery center address.One specific embodiment of this method includes: to obtain the dispatching address of History Order, the dispatching address of History Order is clustered to obtain at least one and is clustered, using initial home-delivery center and the center to cluster as candidate home-delivery center, the position data of address and delivery service object based on candidate home-delivery center, calculate the transport resource consumption that the unit transport amount of each delivery service object is distributed to by candidate home-delivery center, transport resource consumption based on the unit transport amount for being distributed to each delivery service object by candidate home-delivery center, the position data and dispatching demand of delivery service object, the maximum dispensed amounts of each candidate home-delivery center, calculate total transport resource consumption of each candidate home-delivery center, determine the address for making the address target home-delivery center of the candidate home-delivery center of the smallest preset number of the sum of total transport resource consumption, it should Embodiment improves the accuracy of Location of Distribution Centre.

Description

Method and apparatus for determining home-delivery center address
Technical field
The invention relates to field of computer technology, and in particular to logistics technology more particularly, to determines The method and apparatus of home-delivery center address.
Background technique
Logistics distribution center is a node nearest apart from client in logistics system, therefore, solid shop and electric business The delivery process of platform all relies on logistics distribution center network.The address relationship of home-delivery center is to dispatching efficiency and entire logistics The normal operation of system, therefore the address choice of home-delivery center is a link more crucial in logistics system.
Select logistics distribution center address when, currently used main method be provided based on expertise it is optimal Programme, however expertise is subjective, lacks the standard of unified quantization, reliability has to be hoisted.
Summary of the invention
The embodiment of the present application proposes the method and apparatus for determining home-delivery center address.
In a first aspect, the embodiment of the present application provides a kind of method for determining home-delivery center address, comprising: acquisition is gone through The dispatching address of history order；The dispatching address of History Order is clustered, at least one is obtained and clusters；It will be fixed initial Home-delivery center and the center to cluster are as candidate home-delivery center, address and delivery service based on the candidate home-delivery center obtained The position data of object, the transport resource for calculating the unit transport amount for being distributed to each delivery service object by candidate home-delivery center disappear Consumption；Transport resource consumption based on the unit transport amount for being distributed to each delivery service object by candidate home-delivery center has obtained The position data and dispatching demand of each delivery service object taken and the maximum dispensed amounts of each candidate home-delivery center, calculate Total transport resource consumption of each candidate home-delivery center determines so that the sum of total transport resource consumption the smallest preset number The address of candidate home-delivery center is the address of target home-delivery center.
In some embodiments, the above-mentioned dispatching address to History Order clusters, and obtains at least one and clusters, packet It includes: determining several value range that clusters；Using the minimum value to cluster in several value ranges as the initial number that currently clusters, execute Search operation, search operation include: that the dispatching address based on the several pairs of History Orders that currently cluster carries out global clustering, are calculated global The Bayesian Information amount of cluster result, Bayesian Information amount are used to characterize the likelihood degree of cluster result and actual distribution；It compares The Bayesian Information amount for the global clustering result for currently clustering several and the upper one Bayesian Information amount for clustering several, if currently clustering The Bayesian Information amount of several global clustering results is greater than the upper one Bayesian Information amount for clustering several, to based on the number that currently clusters Global clustering result in each class cluster carry out Local Clustering, each class cluster in global clustering result is divided at least two A submanifold calculates the Bayesian Information amount of each submanifold, and compares Bayes's letter based on the global clustering result for currently clustering several The sum of the Bayesian Information amount of each submanifold in breath amount and Local Clustering result；If based on the global clustering result for currently clustering several Bayesian Information amount is less than the sum of the Bayesian Information amount of each submanifold in Local Clustering result, then using submanifold as based on current poly- The cluster result of number of clusters, and by the sum of Bayesian Information amount of all submanifolds as the Bayesian Information amount for currently clustering several；If Bayesian Information amount based on the global clustering result for currently clustering several is greater than Bayes's letter of each submanifold in Local Clustering result The sum of breath amount, then using global clustering result as based on several cluster result that currently clusters, and several overall situation that will currently cluster is gathered The Bayesian Information amount of class result is as the Bayesian Information amount for currently clustering several；Whether the current number that clusters of judgement reaches the number that clusters Value range in maximum value；If the judging result of search operation is currently to cluster to count not up to cluster in several value ranges Maximum value, increase and currently cluster number, execute search operation.
In some embodiments, above-mentioned based on the unit transport amount for being distributed to each delivery service object by candidate home-delivery center Transport resource consumption, each delivery service object obtained position data and dispatching demand and each candidate dispatching The maximum dispensed amounts at center calculate total transport resource consumption of each candidate home-delivery center, determine so that total transport resource consumption The address of the candidate home-delivery center of the smallest preset number of the sum of amount is the address of target home-delivery center, comprising: based on by initial Home-delivery center is distributed to the transport resource consumption of unit transport amount and the matching for delivery service object of each delivery service object Demand, the maximum dispensed amounts of initial home-delivery center are sent, total transport resource consumption of the initial home-delivery center of preset number is calculated The sum of amount；Determine the smallest delivery service object set of the sum of the total transport resource consumption for making the initial home-delivery center of preset number It closes, based in the smallest delivery service object set of the sum of the total transport resource consumption for making the initial home-delivery center of preset number The position data of each delivery service object determines the dispatching range of the initial home-delivery center of preset number；Based on by preset number Other candidate home-delivery centers within the scope of the dispatching of a initial home-delivery center are distributed to the unit transport amount of each delivery service object Transport resource consumption, the dispatching demand of delivery service object, the initial home-delivery center of preset number dispatching within the scope of Other candidate home-delivery centers maximum dispensed amounts, other calculated within the scope of the dispatching of the initial home-delivery center of preset number wait Total transport resource consumption of home-delivery center is selected, and other times within the scope of the dispatching based on the initial home-delivery center of preset number Total transport resource consumption of home-delivery center is selected, determines total fortune after initial home-delivery center to be replaced with to other candidate home-delivery centers The sum of defeated consumed resource；Based on the sum of total transport resource consumption of the initial home-delivery center of preset number, and will be initial Home-delivery center replaces with the sum of total transport resource consumption after other candidate home-delivery centers, determines so that total transport resource disappears The address of the candidate home-delivery center of the smallest preset number of the sum of consumption is the address of target home-delivery center.
In some embodiments, total transport resource of the candidate home-delivery center of other within the scope of the dispatching of initial home-delivery center Consumption further includes the default consumed resource of other candidate home-delivery centers within the scope of the dispatching for construct initial home-delivery center.
In some embodiments, the above method further include: determine the delivery service object set of target home-delivery center.
Second aspect, the embodiment of the present application provide a kind of for determining the device of home-delivery center address, comprising: obtain single Member is configured to obtain the dispatching address of History Order；Cluster cell is configured to the dispatching address to History Order and gathers Class obtains at least one and clusters；Computing unit is configured to using fixed initial home-delivery center and the center to cluster as time Home-delivery center is selected, the position data of address and delivery service object based on the candidate home-delivery center obtained is calculated by candidate Home-delivery center is distributed to the transport resource consumption of the unit transport amount of each delivery service object；Processing unit is configured to base Transport resource consumption, respectively matching of having obtained in the unit transport amount for being distributed to each delivery service object by candidate home-delivery center It send the position data of service object and dispenses the maximum dispensed amounts of demand and each candidate home-delivery center, calculate each candidate and match Total transport resource consumption at center is sent, is determined so that the candidate dispatching of the sum of total transport resource consumption the smallest preset number The address at center is the address of target home-delivery center.
In some embodiments, above-mentioned cluster cell is further configured to the dispatching to History Order as follows Address is clustered, and is obtained at least one and is clustered: determining several value range that clusters；By the minimum in several value ranges that clusters Value executes search operation as the initial number that currently clusters, and search operation includes: several to be matched to History Order based on currently clustering It send address to carry out global clustering, calculates the Bayesian Information amount of global clustering result, Bayesian Information amount is for characterizing cluster knot The likelihood degree of fruit and actual distribution；The Bayesian Information amount for comparing the global clustering result for currently clustering several clusters with upper one Several Bayesian Information amount, if the Bayesian Information amount for the global clustering result for currently clustering several is greater than upper one several shellfish that clusters This information content of leaf carries out Local Clustering to based on each class cluster in the global clustering result for currently clustering several, by global clustering As a result each class cluster in is divided at least two submanifolds, calculates the Bayesian Information amount of each submanifold, and compares based on current poly- The sum of the Bayesian Information amount of each submanifold in the Bayesian Information amount and Local Clustering result of the global clustering result of number of clusters；If base It is less than the Bayesian Information of each submanifold in Local Clustering result in the Bayesian Information amount for the global clustering result for currently clustering several The sum of amount is then made using submanifold as based on several cluster result that currently clusters, and by the sum of Bayesian Information amount of all submanifolds For the Bayesian Information amount for currently clustering several；If the Bayesian Information amount based on the global clustering result for currently clustering several is greater than office The sum of the Bayesian Information amount of each submanifold in portion's cluster result, then using global clustering result as based on several cluster that currently clusters As a result, and using the Bayesian Information amount for the global clustering result for currently clustering several as the Bayesian Information amount for currently clustering several； Whether the current number that clusters of judgement reaches the maximum value to cluster in several value ranges；If the judging result of search operation is current poly- Number of clusters is not up to the maximum value to cluster in several value ranges, increases the number that currently clusters, and executes search operation.
In some embodiments, above-mentioned processing unit is further configured to determine as follows so that total transport money The address of the candidate home-delivery center of the smallest preset number of the sum of source consumption is the address of target home-delivery center: based on by initial Home-delivery center is distributed to the transport resource consumption of unit transport amount and the matching for delivery service object of each delivery service object Demand, the maximum dispensed amounts of initial home-delivery center are sent, total transport resource consumption of the initial home-delivery center of preset number is calculated The sum of amount；Determine the smallest delivery service object set of the sum of the total transport resource consumption for making the initial home-delivery center of preset number It closes, based in the smallest delivery service object set of the sum of the total transport resource consumption for making the initial home-delivery center of preset number The position data of each delivery service object determines the dispatching range of the initial home-delivery center of preset number；Based on by preset number Other candidate home-delivery centers within the scope of the dispatching of a initial home-delivery center are distributed to the unit transport amount of each delivery service object Transport resource consumption, the dispatching demand of delivery service object, the initial home-delivery center of preset number dispatching within the scope of Other candidate home-delivery centers maximum dispensed amounts, other calculated within the scope of the dispatching of the initial home-delivery center of preset number wait Total transport resource consumption of home-delivery center is selected, and other times within the scope of the dispatching based on the initial home-delivery center of preset number Total transport resource consumption of home-delivery center is selected, determines total fortune after initial home-delivery center to be replaced with to other candidate home-delivery centers The sum of defeated consumed resource；Based on the sum of total transport resource consumption of the initial home-delivery center of preset number, and will be initial Home-delivery center replaces with the sum of total transport resource consumption after other candidate home-delivery centers, determines so that total transport resource disappears The address of the candidate home-delivery center of the smallest preset number of the sum of consumption is the address of target home-delivery center.
In some embodiments, total transport resource of the candidate home-delivery center of other within the scope of the dispatching of initial home-delivery center Consumption further includes the default consumed resource of other candidate home-delivery centers within the scope of the dispatching for construct initial home-delivery center.
In some embodiments, above-mentioned apparatus further include: determination unit is configured to determine the dispatching of target home-delivery center Service object's set.
The third aspect, the embodiment of the present application provide a kind of electronic equipment, comprising: one or more processors；Storage dress It sets, for storing one or more programs, when one or more programs are executed by one or more processors, so that one or more A processor realizes the method for determining home-delivery center address provided such as first aspect.
Fourth aspect, the embodiment of the present application provide a kind of computer readable storage medium, are stored thereon with computer journey Sequence, wherein the method for determining home-delivery center address that first aspect provides is realized when program is executed by processor.
The method and apparatus for determining home-delivery center address of the above embodiments of the present application, by obtaining History Order Address is dispensed, then the dispatching address of History Order is clustered, at least one is obtained and clusters, it later will be fixed initial Home-delivery center and the center to cluster are as candidate home-delivery center, address and delivery service based on the candidate home-delivery center obtained The position data of object, the transport resource for calculating the unit transport amount for being distributed to each delivery service object by candidate home-delivery center disappear Consumption, transport resource consumption finally based on the unit transport amount for being distributed to each delivery service object by candidate home-delivery center, The position data and dispatching demand of each delivery service object obtained and the maximum dispensed amounts of each candidate home-delivery center, The total transport resource consumption for calculating each candidate home-delivery center determines so that the sum of total transport resource consumption the smallest present count The address of mesh candidate home-delivery center is the address of target home-delivery center, realizes the potential geographical location based on History Order point Cloth feature locating delivery center, improves the accuracy of the home-delivery center determined, the money of home-delivery center can also be effectively reduced Source consumption.
Detailed description of the invention
By reading a detailed description of non-restrictive embodiments in the light of the attached drawings below, the application's is other Feature, objects and advantages will become more apparent upon:
Fig. 1 is that the embodiment of the present application can be applied to exemplary system architecture figure therein；
Fig. 2 is the flow chart according to one embodiment of the method for determining home-delivery center address of the application；
Fig. 3 is to carry out in the method for determining home-delivery center address according to the application to the dispatching address of History Order A kind of flow diagram of optional implementation of cluster operation；
Fig. 4 is the determination according to the application so that the candidate dispatching of the smallest preset number of the sum of total transport resource consumption The address at center is a kind of flow diagram of optional implementation of the address of target home-delivery center；
Fig. 5 is a structural schematic diagram of the device for determining home-delivery center address of the application；
Fig. 6 is adapted for the structural schematic diagram for the computer system for realizing the electronic equipment of the embodiment of the present application.
Specific embodiment
The application is described in further detail with reference to the accompanying drawings and examples.It is understood that this place is retouched The specific embodiment stated is used only for explaining related invention, rather than the restriction to the invention.It also should be noted that in order to Convenient for description, part relevant to related invention is illustrated only in attached drawing.
It should be noted that in the absence of conflict, the features in the embodiments and the embodiments of the present application can phase Mutually combination.The application is described in detail below with reference to the accompanying drawings and in conjunction with the embodiments.
Fig. 1 is shown can be using the application for determining the method for home-delivery center address or for determining home-delivery center The exemplary system architecture 100 of the device of address.
As shown in Figure 1, system architecture 100 may include terminal device 101,102,103, network 104 and server 105.Network 104 between terminal device 101,102,103 and server 105 to provide the medium of communication link.Network 104 may include various connection types, such as wired, wireless communication link or fiber optic cables etc..
User 110 can be used terminal device 101,102,103 and be interacted with server 105 by network 104, with reception or Send message etc..Various data interactions can be installed on terminal device 101,102,103, such as search engine client, Figure client, instant communication software, addressing application etc..
Terminal device 101,102,103 can be with display and support the various electronic equipments of internet access, packet Include but be not limited to smart phone, tablet computer, smartwatch, laptop, above-knee pocket computer, E-book reader Deng.
Server 105, which can be, provides the query service device of addressing service for terminal device, and server 105 can be to terminal The addressing request that equipment 101,102,103 issues is parsed, and determines destination address according to parsing result, and can will determine The relevant information of destination address terminal device 101,102,103 is fed back to by network 104.
It should be noted that for determining that the method for home-delivery center address can be by servicing provided by the embodiment of the present application Device 105 executes, correspondingly, for determining that the device of home-delivery center address can be set in server 105.
It should be noted that server can be hardware, it is also possible to software.When server is hardware, may be implemented At the distributed server cluster that multiple servers form, individual server also may be implemented into.It, can when server is software To be implemented as multiple softwares or software module (such as providing multiple software modules of Distributed Services), also may be implemented into Single software or software module.It is not specifically limited herein.
It should be understood that the terminal device, network, the number of server in Fig. 1 are only schematical.According to realization need It wants, can have any number of terminal device, network, server.
With continued reference to Fig. 2, it illustrates an implementations according to the method for determining home-delivery center address of the application The process 200 of example.The method for being used to determine home-delivery center address, comprising the following steps:
Step 201, the dispatching address of History Order is obtained.
In the present embodiment, above-mentioned for determining the available submission addressing of the executing subject of the method for home-delivery center address The History Order in addressing region that the user of request is submitted, and with extracting from History Order the dispatching of each order Location.Herein, addressing region can be the region that above-mentioned user specifies, and can be the area for covering certain geographical position range Domain, for example, Haidian District, Beijing City.
When user submits addressing to request, all history in the addressing region for requesting selected address can be submitted to order together It is single.The History Order can be History Order under the wired upper/line of institute of the dispatching address in selected region.Dispensing address can To characterize the harvest address of dispatching destination namely order.
In some optional implementations of the present embodiment, above-mentioned executing subject can be from being stored with History Order information Electronic equipment obtain History Order dispatching address.Such as connection can be established with the server of storage History Order information, And History Order information is received from the server of storage History Order information, dispatching address is extracted from History Order information. Optionally, dispatching address can be indicated with geographical position coordinates.
Step 202, the dispatching address of History Order is clustered, obtains at least one and clusters.
In the present embodiment, the dispatching address for the History Order that step 201 can be obtained using various clustering methods into Row cluster.The dispatching address being closer can be subdivided into and be clustered to be same, will be subdivided into apart from farther away dispatching address Different clusters.Specifically, the distance between each dispatching address can be directly based upon to be clustered, it can also be according to acquired The Density Distribution of the dispatching address of all History Orders is clustered, and the machine learning model of such as neural network can also be used It is clustered.Cluster obtain each cluster may include at least one dispense address data point.
Cluster when, can determine at least two cluster centres first, the dispatching address that then will acquire cluster respectively to In clustering representated by each cluster centre.It, can also according to the distribution of the same middle data point that clusters and not in cluster process Cluster quantity and the center that clusters are adjusted with the distance between data point between clustering, and obtain accurate cluster result.Such as it can Selection of land, the position of the quantity that can be clustered with iteration adjustment and the center that clusters, the distribution of data point and difference are poly- in same cluster When the distance between data point meets preset condition in cluster, stops iteration adjustment operation, obtain cluster result.
Step 203, using fixed initial home-delivery center and the center that clusters as candidate home-delivery center, based on having obtained Candidate home-delivery center address and delivery service object position data, calculate and be distributed to respectively by candidate home-delivery center with taking The transport resource consumption of the unit transport amount of business object.
After the dispatching address according to History Order is clustered, the center that at least one obtained clusters can be made It for candidate home-delivery center, while also regarding fixed initial home-delivery center as candidate home-delivery center, is selected from candidate home-delivery center It selects suitable one or more as target home-delivery center.Herein, it has been determined that initial home-delivery center can be it is built or Home-delivery center currently in use.In step 202 when clustering the available center that clusters address, such as the seat at the center that clusters Mark, the address of initial home-delivery center can obtain in advance.
The targeted user object of the delivery service that delivery service object can be to provide, can be preset user User object in object set.Such as delivery service object may include the user object for issuing History Order request, may be used also To include the user object for not issuing order request.The position data of delivery service object can be obtained in advance, such as can be with Its position data is obtained using the dispatching address of History Order as the address for the delivery service object for generating History Order, it can be with Obtain the position of the inhabitation address or work address that did not issued the user object of order request as corresponding delivery service object Set data.
Then it can calculate and be dispensed by candidate according to the address of candidate home-delivery center and the position data of delivery service object Center is distributed to the transport resource consumption of the unit transport amount of each delivery service object.
It in the present embodiment, can be according to each candidate address of home-delivery center and the positional number of each delivery service object According to distance of the calculating from each candidate home-delivery center to each delivery service object, then according to each candidate home-delivery center to respectively The distance of a delivery service object determines the transport that the unit transport amount of each delivery service object is distributed to by candidate home-delivery center Consumed resource.Wherein, the transport resource consumption of unit transport amount can be and obtain in advance in unit distance.Transport resource Consumption can be the stock number of transport cargo consumption, including but not limited to freight, the electric power resource for transporting consumption, petroleum Resource.Such as quantity of energy (amount of gasoline of the consumption as needed for one kilometer of running car, electric vehicle consumed needed for every kilometer of transport The electric power resource amount of consumption, every kilometer traffic expense needed for one kilometer of traveling etc.) it can obtain in advance.In this way, can root According to the transport resource consumption of the unit transport amount for being distributed to each delivery service object by candidate home-delivery center obtained in advance, with And calculated each candidate home-delivery center calculates to be distributed to by each candidate home-delivery center and respectively match to the distance of each delivery service object Send the transport resource consumption of the unit transport amount of service object.It can will be specifically distributed to respectively to match by candidate home-delivery center and taken Be engaged in object unit transport amount transport resource consumption with corresponding each candidate home-delivery center to corresponding each delivery service pair The distance of elephant is multiplied, and the transport resource for obtaining the unit transport amount for being distributed to each delivery service object by each candidate home-delivery center disappears Consumption.
Step 204, the transport resource based on the unit transport amount for being distributed to each delivery service object by candidate home-delivery center Consumption, the position data of each delivery service object obtained and dispatching demand and the maximum of each candidate home-delivery center Dispensed amounts calculate total transport resource consumption of each candidate home-delivery center, determine so that the sum of total transport resource consumption minimum The candidate home-delivery center of preset number address be target home-delivery center address.
In the present embodiment, the dispatching demand of each delivery service object can also be obtained, such as can be to delivery service The History Order of object is counted, and determines demand of the dispatching object in historical time section, and then according to historical time section Interior demand determines current dispatching demand.The dispatching demand can be counted with the preset period, such as three months. The maximum dispensed amounts of each candidate home-delivery center can also be pre-configured with.Then, the candidate home-delivery center of preset number can be selected, All delivery service objects are distributed to the dispatching of the candidate home-delivery center selected.Match for example, three can be selected Center A, B, C are sent, 100 all delivery service objects are respectively allocated to the dispatching range of three home-delivery centers A, B, C, i.e., Dispatching range 100 delivery service objects of covering of three home-delivery centers A, B, C, and dispatching range A, B of three home-delivery centers, C is not overlapped.Later, what can be calculated according to step 203 is distributed to each delivery service pair by each candidate home-delivery center The transport resource consumption of the unit transport amount of elephant calculates total transport resource consumption of each candidate home-delivery center selected. The candidate home-delivery center selected can be specifically distributed to its unit transport amount for dispensing each delivery service object in range Transport resource consumption is multiplied with the dispensed amounts of corresponding each delivery service object, obtains total transport of each candidate home-delivery center Consumed resource.
When calculating total transport resource consumption, therefore, to assure that the maximum dispensed amounts of each candidate home-delivery center can satisfy The maximum dispensed amounts of the dispatching demand of all delivery service objects of the candidate home-delivery center, i.e., each candidate home-delivery center are not small In the sum of the dispensed amounts that the candidate centers are each delivery service object.It is also desirable to ensure that delivery service center can satisfy The demand of each delivery service object guarantees the sum of dispensed amounts that each candidate centers selected are same delivery service object no Less than the dispatching demand of the delivery service object.
It can sum to total transport resource consumption of the candidate home-delivery center selected, the candidate dispatching selected The sum of total transport resource consumption at center.
Later, the candidate home-delivery center of preset number can be reselected, is calculated reselects according to the method described above The sum of total transport resource consumption of candidate home-delivery center, the total transport resource for comparing the candidate home-delivery center selected every time disappears The sum of consumption, selecting the candidate home-delivery center of the smallest preset number of total transport resource consumption is target home-delivery center, will be total Address of the address of the candidate home-delivery center of the smallest preset number of transport resource consumption as target home-delivery center.
The method and apparatus for determining home-delivery center address of the above embodiments of the present application, by obtaining History Order Address is dispensed, then the dispatching address of History Order is clustered, at least one is obtained and clusters, it later will be fixed initial Home-delivery center and the center to cluster are as candidate home-delivery center, address and delivery service based on the candidate home-delivery center obtained The position data of object, the transport resource for calculating the unit transport amount for being distributed to each delivery service object by candidate home-delivery center disappear Consumption, transport resource consumption finally based on the unit transport amount for being distributed to each delivery service object by candidate home-delivery center, The position data and dispatching demand of each delivery service object obtained and the maximum dispensed amounts of each candidate home-delivery center, The total transport resource consumption for calculating each candidate home-delivery center determines so that the sum of total transport resource consumption the smallest present count The address of mesh candidate home-delivery center is the address of target home-delivery center, realizes the potential geographical location based on History Order point Cloth feature locating delivery center, improves the accuracy of the home-delivery center determined, the money of home-delivery center can also be effectively reduced Source consumption.
In some embodiments, it can be executed using the method for global clustering combination Local Clustering above-mentioned to History Order Dispatching address is clustered, and the step of at least one clusters is obtained.Specifically, referring to FIG. 3, it illustrates according to the application's The optional realization side of one kind of cluster operation is carried out in method for determining home-delivery center address to the dispatching address of History Order The flow diagram of formula.As shown in figure 3, the process 300 that cluster operation is carried out to the dispatching address of History Order of the present embodiment, It may comprise steps of:
Step 301, several value range that clusters is determined.
It is possible, firstly, to several value range that clustered according to settings such as historical experience, administrative divisions, which can To include minimum value kmin and maximum value kmax.Wherein kmin and kmax is positive integer, and kmin≤kmax.Such as it is a certain Municipal administration region is divided into 5 subregions, then several value range that clusters can be set as the natural number range comprising 5, such as 2-8。
Step 302, using the minimum value to cluster in several value ranges as the initial number that currently clusters, search behaviour is executed Make.
Then, several k_ that currently cluster can be based on to search for using minimum value kmin as initial several k_cur that currently cluster The optimum cluster result of cur.
Specifically, search operation may include step 3021, step 3022, step 3023, step 3024 and step 3025。
In step 3021, the dispatching address based on the several pairs of History Orders that currently cluster carries out global clustering, calculates global The Bayesian Information amount of cluster result.
In the present embodiment, using several k_cur that currently cluster, the dispatching address for the History Order that step 201 is obtained is made For data point to be clustered, global clustering is executed.The operating process of global clustering is as follows:
Firstly, if randomly selecting several k_cur that currently cluster from data point to be clustered currently without the center of clustering A data point is as the initial center that clusters；Then, each data point to be clustered is tied to nearest from the data point gather Under cluster center, all data points bound under the center that each clusters form one and cluster；Later, it clusters to each, it is poly- to calculate this The centre coordinate of all data points in cluster, and calculated centre coordinate is updated to the coordinate at the center that clusters to cluster.Weight Execute again it is above-mentioned by each data point to be clustered be tied to it is nearest from the data point clustering under center and clustering to each, count The centre coordinate of the interior all data points that cluster is calculated, and calculated centre coordinate is updated to the seat at the center that clusters to cluster Target operation, until cluster result is restrained.Herein, cluster result convergence can be when updating each center to cluster, gather Variable quantity when cluster centre coordinate is updated relative to the last time is less than preset offset.
The operation that the centre coordinate that clusters that clustered, updated is bound by repeating data point can obtain the overall situation most Excellent cluster result.
After obtaining global clustering result, the Bayesian Information amount of global clustering result can be calculated.Wherein, Bayes Information content is used to characterize the likelihood degree of cluster result and actual distribution.Herein, Bayesian Information amount is according to BIC (pattra leaves This information criterion) be calculated.BIC model selection in by encourage model accuracy, punish model complexity come Guarantee that the model solved is bonded truth as far as possible, prevents over-fitting.In the present embodiment, mould applied by BIC criterion The accuracy of type is cluster result and the likelihood function being really distributed for measuring data point, and the value of function is bigger, then shows A possibility that true distribution of data point is consistent with the result that clusters is bigger.The complexity of model is then the freedom employed in clustering The quantity of parameter may include the number that clusters, the coordinate at the center that clusters, the mean value for the corresponding data point distribution that each clusters and side Difference etc..
A kind of calculation of optional Bayesian Information amount are as follows:
Wherein, parameter phi expression clusters scheme, and BIC (φ) indicates to cluster the Bayesian Information amount of scheme φ,It indicates For the scheme φ that clusters, all data points all obey the log likelihood of this scheme, pφIndicate that the scheme of clustering is included The number of free parameter, R indicate to participate in the quantity of the data point to cluster.If BIC (φ1) > BIC (φ2), then cluster scheme φ1Better than φ2。
In step 3022, the Bayesian Information amount for the global clustering result that comparison currently clusters several and the upper number that clusters Bayesian Information amount, if the Bayesian Information amount for the global clustering result for currently clustering several be greater than upper one several pattra leaves that clusters This information content carries out Local Clustering to based on each class cluster in the global clustering result for currently clustering several, by global clustering knot Each class cluster in fruit is divided at least two submanifolds, calculates the Bayesian Information amount of each submanifold, and compares and be based on currently clustering The sum of the Bayesian Information amount of each submanifold in the Bayesian Information amount and Local Clustering result of several global clustering results.
Can compare the global clustering result for currently clustering several Bayesian Information amount and upper one several Bayes that clusters Information content.Can compare the Bayesian Information amount of the global clustering result for currently clustering several with upper one cluster it is several under it is optimal The Bayesian Information amount for the scheme that clusters, that is, compare the Bayesian Information amount and upper one for the global clustering result for currently clustering several A several maximum Bayesian Information amount that clusters.If the number that currently clusters is kmin, the upper one Bayesian Information amount for clustering several It can be 0.
If the Bayesian Information amount that comparison result is the global clustering result for currently clustering several is greater than the upper number that clusters Bayesian Information amount, then show that the global clustering result for currently clustering several is that the optimal overall situation clusters result.It then can be right Local Clustering is carried out based on each class cluster in the global clustering result for currently clustering several, by each class in global clustering result Cluster is divided at least two submanifolds.I.e. to based on each class cluster in the global clustering result for currently clustering several, it can be taken out In data point clustered with the number that clusters for N (N >=2), obtain at least two submanifolds.It later can be using complete with above-mentioned calculating The identical method of Bayesian Information amount for the class cluster that office's cluster obtains calculates the Bayesian Information amount of each submanifold in same class cluster, obtains To BIC1, BIC2 ..., BICN.
The Bayesian Information amount for the global clustering result for currently clustering several can be compared later and several part that currently clusters Obtained the sum of the Bayesian Information amount of all submanifolds is clustered, that is, compares the Bayesian Information amount BIC of the global scheme φ that clusters (φ) and the class cluster of global clustering result is divided into the sum of the Bayesian Information amount of clustering schemes of N submanifold BIC1+BIC2 +…+BICN。
In step 3023, if the Bayesian Information amount based on the global clustering result for currently clustering several is less than Local Clustering As a result the sum of the Bayesian Information amount of each submanifold in, then using submanifold as based on several cluster result that currently clusters, and will be current The sum of several Bayesian Information amount of all submanifolds cluster as the Bayesian Information amount for currently clustering several.
If BIC (φ) < BIC1+BIC2+ ...+BICN, can be using Local Clustering result as the cluster currently to cluster As a result, and by the sum of Bayesian Information amount of each submanifold in the Local Clustering result for currently clustering several as several shellfish that currently clusters This information content of leaf.
In step 3024, if the Bayesian Information amount based on the global clustering result for currently clustering several is greater than Local Clustering As a result the sum of the Bayesian Information amount of each submanifold in, then using global clustering result as based on several cluster result that currently clusters, And using the Bayesian Information amount for the global clustering result for currently clustering several as the Bayesian Information amount for currently clustering several.
If BIC (φ) > BIC1+BIC2+ ...+BICN, show that the cluster accuracy of global clustering result is higher, it can be with Using global clustering result as several cluster result that currently clusters, by global clustering result (using the cluster result of scheme φ) Bayesian Information amount BIC (φ) as the Bayesian Information amount for currently clustering several.
In step 3025, whether the current number that clusters of judgement reaches the maximum value to cluster in several value ranges.
After determining the cluster result for currently clustering several and Bayesian Information amount, it can be determined that whether the number that currently clusters Reach the maximum value to cluster in several value ranges, that is, judges whether k_cur is more than or equal to kmax.
In above-mentioned search operation, by global clustering, the Bayesian Information amount of comparison global clustering result is gathered with upper one The Bayesian Information amount of the cluster result of number of clusters, and in the Bayesian Information amount for the global clustering result for currently clustering several greater than upper When the Bayesian Information amount of one several cluster result that clusters, further progress Local Clustering is found several based on currently clustering More preferably cluster scheme, can further promote the accuracy for the result that clusters.
The above-mentioned process 300 that cluster operation is carried out to the dispatching address of History Order further include:
Step 303, if the judging result of search operation is currently to cluster to count in several value range that not up to clusters most Big value, increases the number that currently clusters, then executes search operation, i.e. return step 3021.
If the judging result of step 3025 is the maximum value for counting and not up to clustering in several value ranges that currently clusters, can To increase the number that currently clusters, such as several k_cur that will currently cluster add one, obtain the new number that currently clusters, and return is worked as based on new Before the number that clusters search for the optimal scheme that clusters.
The method that cluster operation is carried out to the dispatching address of History Order of the present embodiment, by same several internal ratios that cluster To global clustering result and local cluster result, cluster result is compared between the different numbers that clusters, searches out Bayesian Information Measure the maximum scheme that clusters, the available result that more accurately clusters.
Fig. 4 shows some of the above-mentioned steps 204 of the method for determining home-delivery center address of the embodiment of the present application The flow diagram of optional implementation.As shown in figure 4, a kind of process 400 of optional implementation of above-mentioned steps 204 can To include:
Step 401, the transport resource based on the unit transport amount for being distributed to each delivery service object by initial home-delivery center The dispatching demand of consumption and delivery service object, the maximum dispensed amounts of initial home-delivery center, at the beginning of calculating preset number The sum of total transport resource consumption of beginning home-delivery center.
The sum of total transport resource consumption of the initial home-delivery center of preset number can be calculated first.Assuming that preset number K initial home-delivery centers are respectively s1, s2, s3..., sK, the sum of delivery service object is n, from home-delivery center siIt is distributed to The transport resource consumption for sending the unit transport amount of service object j isHome-delivery center siTo the dispensed amounts of delivery service object (freight volume) isHome-delivery center siMaximum dispensed amounts beThe dispatching demand of delivery service object j is Dj, then K The sum of the total gross traffic of initial home-delivery center U are as follows:
Wherein, formula (3) indicates that all home-delivery centers are that the dispensed amounts that any one delivery service object j is provided are not small In the demand of delivery service object j；Formula (4) indicates home-delivery center siThe dispensed amounts provided for all delivery service objects are not More than home-delivery center siMaximum dispensed amounts.
Based on above-mentioned formula (2), (3), (4), (5), by solving the minimum value of U, i.e. min (U), it can be deduced that default The minimum value of the sum of total transport resource consumption of number K initial home-delivery centers.
Step 402, the smallest dispatching of the sum of the total transport resource consumption for making the initial home-delivery center of preset number is determined Service object's set, based on the smallest delivery service of the sum of the total transport resource consumption for making the initial home-delivery center of preset number The position data of each delivery service object in object set determines the dispatching range of the initial home-delivery center of preset number.
After solution obtains the distribution project of minimum value of U, each initial home-delivery center s in the program can be determinediInstitute The delivery service object set N of servicei.There can be intersection between service object's set of different initial home-delivery centers.Then may be used With according to making in the smallest distribution project of the sum of total transport resource consumption U, each initial home-delivery center serviced with taking The position data of all delivery service objects, determines the dispatching range of each initial home-delivery center in business object set.The dispatching Range can be the range of geographic area, can be for example, by using the coordinate representation of the marginal point of geographic area.
Step 403, matched based on other candidate home-delivery centers within the scope of the dispatching by the initial home-delivery center of preset number It send the transport resource consumption of the unit transport amount to each delivery service object, the dispatching demand of delivery service object, preset The maximum dispensed amounts of other candidate home-delivery centers within the scope of the dispatching of the initial home-delivery center of number, at the beginning of calculating preset number Total transport resource consumption of other candidate home-delivery centers within the scope of the dispatching of beginning home-delivery center, and based at the beginning of preset number Total transport resource consumption of other candidate home-delivery centers within the scope of the dispatching of beginning home-delivery center, determines initial home-delivery center The sum of total transport resource consumption after replacing with other candidate home-delivery centers.
In the present embodiment, the dispatching range for each the initial home-delivery center that can be found out to step 402, will be in dispatching Other candidate home-delivery centers that the heart is changed within the scope of the dispatching are distributed to respectively based on the candidate home-delivery center after change with taking That is engaged in after the transport resource consumption of unit transport amount of object, the dispatching demand of delivery service object, change candidate dispenses The maximum dispensed amounts at center, total transport resource consumption of the candidate home-delivery center after calculating change, based at the beginning of preset number Total transport resource consumption of other candidate home-delivery centers within the scope of the dispatching of beginning home-delivery center, determines initial home-delivery center The sum of total transport resource consumption after replacing with other candidate home-delivery centers.
Specifically, other candidate centers can be randomly choosed within the scope of the dispatching of initial home-delivery center to match as this Send the new home-delivery center in range, then the new home-delivery center is distributed to the freight volume of each delivery service object with it is corresponding Unit transport amount transport resource consumption be multiplied, obtain total transport resource consumption of the new home-delivery center.It is right later Total transport resource consumption of the new home-delivery center of updated preset number corresponding with the initial home-delivery center of preset number Summation obtains replacing with initial home-delivery center the sum of total transport resource consumption after other new candidate home-delivery centers.
Assuming that initial home-delivery center siDispatching range be Ni, dispense range NiIn other candidate home-delivery centers constitute collection Close Li, LiIn first of candidate home-delivery center be tl, then with tlWhen for new home-delivery center, total transport resource in range is dispensed Consumption is
It is above-mentionedWithIt respectively indicates from home-delivery center tlTo the freight volume and unit transport amount of delivery service object j Transport resource consumption.
Optionally, total transport resource consumption of the candidate home-delivery center of other within the scope of the dispatching of above-mentioned initial home-delivery center Amount further includes the default consumed resource of other candidate home-delivery centers within the scope of the dispatching for construct initial home-delivery center.Assuming that structure Build home-delivery center tlDefault consumed resource beIt can then obtain according to formula (7) with tlWhen for new home-delivery center, match Total transport resource consumption in range is sent to be
Solution formula (8) is it can be concluded that initial home-delivery center si The minimum value of corresponding total transport resource consumption:
Then the minimum value c of total transport resource amount when being selected home-delivery center with home-delivery center can be calculatedsiWith IfHome-delivery center is then updated to c 'tl；IfIt is s after then home-delivery center updatesi。
The home-delivery center within the scope of the dispatching of the home-delivery center of each initial home-delivery center is updated respectively, is obtained new Preset number home-delivery center { s 'i, i=1,2 ..., K can calculate total transport of new preset number home-delivery center The sum of consumed resource.
Step 404, the sum of total transport resource consumption based on the initial home-delivery center of preset number, and will initially match It send center to replace with the sum of total transport resource consumption after other candidate home-delivery centers, determines so that total transport resource consumption The address of the candidate home-delivery center of the smallest preset number of the sum of amount is the address of target home-delivery center.
(it can initially will be matched according to the sum of total transport resource consumption of new preset number home-delivery center later Center is sent to replace with total transport resource consumption after other candidate home-delivery centers), it is provided using formula (2), (3), (4), (5) Method solve new preset number home-delivery center total transport resource consumption minimum value, compare new preset number Total transport resource consumption of minimum value and the preset number initial home-delivery center of total transport resource consumption of home-delivery center Minimum value, if to be less than preset number initial for the minimum value of total transport resource consumption of new preset number home-delivery center The minimum value of total transport resource consumption of home-delivery center can then determine new preset number home-delivery center for target dispatching Center；If the minimum value of total transport resource consumption of new preset number home-delivery center is greater than the initial dispatching of preset number The minimum value of total transport resource consumption at center can then determine that the initial home-delivery center of preset number is in target dispatching The heart.And then the address of target home-delivery center can be determined according to the address of the candidate home-delivery center obtained.
In some optional implementations of the present embodiment, step 403 and step 404, Zhi Daozong can be repeated Until the minimum value of transport resource consumption cannot decline, optimal Address Selection of Distributing Center is obtained.
By above-mentioned determination so that the ground of the candidate home-delivery center of the smallest preset number of the sum of total transport resource consumption Location is the method flow 400 of the address of target home-delivery center, effectively can determine total transport resource from candidate home-delivery center The sum of amount the smallest preset number target home-delivery center, guarantees the addressing scheme of the home-delivery center determined standard with higher Exactness.
Optionally, when solving the sum of minimum total transport resource consumption, the method that can be provided according to formula (2) is true Make the delivery service object set of each home-delivery center.Then after determining preset quantity target home-delivery center, it can determine The delivery service object set of each target home-delivery center out.The method of the present embodiment can be provided and more accurately be dispensed as a result, Scheme.
With further reference to Fig. 5, as the realization to method shown in above-mentioned each figure, this application provides one kind to match for determination One embodiment of the device of centre address is sent, the Installation practice is corresponding to embodiment of the method shown in Fig. 4 with Fig. 2, should Device specifically can be applied in various electronic equipments.
As shown in figure 5, the device 500 for determining home-delivery center address of the present embodiment includes: acquiring unit 501, gathers Class unit 502, computing unit 503 and processing unit 504.Wherein, acquiring unit 501 is configured to obtain matching for History Order Send address；Cluster cell 502 is configured to the dispatching address to History Order and clusters, and obtains at least one and clusters；It calculates Unit 503 is configured to using fixed initial home-delivery center and the center that clusters as candidate home-delivery center, based on having obtained Candidate home-delivery center address and delivery service object position data, calculate and be distributed to respectively by candidate home-delivery center with taking The transport resource consumption of the unit transport amount of business object；Processing unit 504 is configured to be based on to be dispensed by candidate home-delivery center To the position data of the transport resource consumption of the unit transport amount of each delivery service object, each delivery service object obtained With the maximum dispensed amounts of dispatching demand and each candidate home-delivery center, the total transport resource for calculating each candidate home-delivery center disappears Consumption determines so that the address of the candidate home-delivery center of the sum of total transport resource consumption the smallest preset number is target dispatching The address at center.
In some embodiments, above-mentioned cluster cell 502 can be further configured to as follows order history Single dispatching address is clustered, and is obtained at least one and is clustered: determining several value range that clusters first；Then it will cluster several Minimum value in value range executes search operation as the initial number that currently clusters.Search operation includes: to be based on currently clustering The dispatching address of several pairs of History Orders carries out global clustering, calculates the Bayesian Information amount of global clustering result, Bayesian Information Measure the likelihood degree for characterizing cluster result and actual distribution；Compare the Bayes's letter for the global clustering result for currently clustering several Breath amount and the upper one Bayesian Information amount for clustering several, if the Bayesian Information amount for the global clustering result for currently clustering several is greater than The upper one Bayesian Information amount for clustering several carries out part to based on each class cluster in the global clustering result for currently clustering several Cluster, is divided at least two submanifolds for each class cluster in global clustering result, calculates the Bayesian Information amount of each submanifold, and Compare the Bayes of each submanifold in Bayesian Information amount and Local Clustering result based on the global clustering result for currently clustering several The sum of information content；If the Bayesian Information amount based on the global clustering result for currently clustering several is less than each son in Local Clustering result The sum of Bayesian Information amount of cluster, then using submanifold as based on several cluster result that currently clusters, and by the pattra leaves of all submanifolds The sum of this information content is as the Bayesian Information amount for currently clustering several；If the pattra leaves based on the global clustering result for currently clustering several The sum of the Bayesian Information amount of this in Local Clustering result each submanifold of containing much information, then using global clustering result as based on working as Before cluster several cluster results, and it is the Bayesian Information amount for the global clustering result for currently clustering several is several as currently clustering Bayesian Information amount；Whether the current number that clusters of judgement reaches the maximum value to cluster in several value ranges.If last search operation Judging result be the number not up to maximum values that cluster in several value ranges that currently cluster, increase the number that currently clusters, execution is searched Rope operation.
In some embodiments, above-mentioned processing unit 504 can be further configured to determine as follows so that The address of the candidate home-delivery center of the smallest preset number of the sum of total transport resource consumption is the address of target home-delivery center: base Transport resource consumption and delivery service in the unit transport amount for being distributed to each delivery service object by initial home-delivery center Dispatching demand, the maximum dispensed amounts of initial home-delivery center of object calculate total transport of the initial home-delivery center of preset number The sum of consumed resource；Determine that the sum of total transport resource consumption for making the initial home-delivery center of preset number is the smallest with taking Business object set, based on the smallest delivery service pair of the sum of total transport resource consumption for making the initial home-delivery center of preset number As the position data of each delivery service object in set, the dispatching range of the initial home-delivery center of preset number is determined；Based on by Other candidate home-delivery centers within the scope of the dispatching of the initial home-delivery center of preset number are distributed to the list of each delivery service object A initially home-delivery center of the position transport resource consumption of freight volume, the dispatching demand of delivery service object, preset number matches The maximum dispensed amounts for sending other candidate home-delivery centers in range calculate within the scope of a initially dispatching of home-delivery center of preset number Other candidate home-delivery centers total transport resource consumption, and within the scope of the dispatching based on the initial home-delivery center of preset number Other candidate home-delivery centers total transport resource consumption, determine and initial home-delivery center replaced with into other candidate home-delivery centers The sum of total transport resource consumption afterwards；Based on the sum of total transport resource consumption of the initial home-delivery center of preset number, with And initial home-delivery center is replaced with to the sum of total transport resource consumption after other candidate home-delivery centers, it determines so that total fortune The address of the candidate home-delivery center of the smallest preset number of the sum of defeated consumed resource is the address of target home-delivery center.
In some embodiments, total transport resource of the candidate home-delivery center of other within the scope of the dispatching of initial home-delivery center Consumption can also include the default resource consumption of other candidate home-delivery centers within the scope of the dispatching for construct initial home-delivery center Amount.
In some embodiments, device 500 can also comprise determining that unit, be configured to determine target home-delivery center Delivery service object set.
It should be appreciated that all units recorded in device 500 and each step phase in the method described referring to figs. 2 to Fig. 4 It is corresponding.It is equally applicable to device 500 and unit wherein included above with respect to the operation and feature of method description as a result, herein It repeats no more.
The device 500 for being used to determine home-delivery center address of the above embodiments of the present application, obtains history by acquiring unit The dispatching address of order, subsequent cluster cell cluster the dispatching address of History Order, obtain at least one and cluster, later Computing unit is matched using fixed initial home-delivery center and the center to cluster as candidate home-delivery center based on the candidate obtained The address at center and the position data of delivery service object are sent, calculates and each delivery service object is distributed to by candidate home-delivery center The transport resource consumption of unit transport amount, last processing unit are based on being distributed to each delivery service object by candidate home-delivery center The transport resource consumption of unit transport amount, the position data of each delivery service object obtained and dispatching demand, with And the maximum dispensed amounts of each candidate home-delivery center, total transport resource consumption of each candidate home-delivery center is calculated, is determined so that total The address of the candidate home-delivery center of the smallest preset number of the sum of transport resource consumption is the address of target home-delivery center, is realized Potential location distribution feature location home-delivery center based on History Order, improves the accurate of the home-delivery center determined Property, the consumed resource of home-delivery center can also be effectively reduced.
Below with reference to Fig. 6, it illustrates the computer systems 600 for the electronic equipment for being suitable for being used to realize the embodiment of the present application Structural schematic diagram.Electronic equipment shown in Fig. 6 is only an example, function to the embodiment of the present application and should not use model Shroud carrys out any restrictions.
As shown in fig. 6, computer system 600 includes central processing unit (CPU) 601, it can be read-only according to being stored in Program in memory (ROM) 602 is loaded into the program in random access storage device (RAM) 603 from storage section 608 And execute various movements appropriate and processing.In RAM 603, also it is stored with system 600 and operates required various program sum numbers According to.CPU 601, ROM 602 and RAM 603 are connected with each other by bus 604.Input/output (I/O) interface 605 also connects To bus 604.
I/O interface 605 is connected to lower component: the importation 606 including keyboard, mouse etc.；It is penetrated including such as cathode The output par, c 607 of spool (CRT), liquid crystal display (LCD) etc. and loudspeaker etc.；Storage section 608 including hard disk etc.； And the communications portion 609 of the network interface card including LAN card, modem etc..Communications portion 609 via such as because The network of spy's net executes communication process.Driver 610 is also connected to I/O interface 605 as needed.Detachable media 611, it is all Such as disk, CD, magneto-optic disk, semiconductor memory are mounted on as needed on driver 610, in order to read from thereon Computer program out is mounted into storage section 608 as needed.
Particularly, in accordance with an embodiment of the present disclosure, it may be implemented as computer above with reference to the process of flow chart description Software program.For example, embodiment of the disclosure includes a kind of computer program product comprising be carried on computer-readable medium On computer program, which includes the program code for method shown in execution flow chart.In such reality It applies in example, which can be downloaded and installed from network by communications portion 609, and/or from detachable media 611 are mounted.When the computer program is executed by central processing unit (CPU) 601, executes and limited in the present processes Above-mentioned function.It should be noted that the computer-readable medium of the application can be computer-readable signal media or meter Calculation machine readable storage medium storing program for executing either the two any combination.Computer readable storage medium for example can be --- but not Be limited to --- electricity, magnetic, optical, electromagnetic, infrared ray or semiconductor system, device or device, or any above combination.Meter The more specific example of calculation machine readable storage medium storing program for executing can include but is not limited to: have the electrical connection, just of one or more conducting wires Taking formula computer disk, hard disk, random access storage device (RAM), read-only memory (ROM), erasable type may be programmed read-only storage Device (EPROM or flash memory), optical fiber, portable compact disc read-only memory (CD-ROM), light storage device, magnetic memory device, Or above-mentioned any appropriate combination.In this application, computer readable storage medium can be it is any include or storage journey The tangible medium of sequence, the program can be commanded execution system, device or device use or in connection.And at this In application, computer-readable signal media may include in a base band or as carrier wave a part propagate data-signal, Wherein carry computer-readable program code.The data-signal of this propagation can take various forms, including but unlimited In electromagnetic signal, optical signal or above-mentioned any appropriate combination.Computer-readable signal media can also be that computer can Any computer-readable medium other than storage medium is read, which can send, propagates or transmit and be used for By the use of instruction execution system, device or device or program in connection.Include on computer-readable medium Program code can transmit with any suitable medium, including but not limited to: wireless, electric wire, optical cable, RF etc. are above-mentioned Any appropriate combination.
The calculating of the operation for executing the application can be write with one or more programming languages or combinations thereof Machine program code, programming language include object oriented program language-such as Java, Smalltalk, C++, also Including conventional procedural programming language-such as " C " language or similar programming language.Program code can be complete It executes, partly executed on the user computer on the user computer entirely, being executed as an independent software package, part Part executes on the remote computer or executes on a remote computer or server completely on the user computer.It is relating to And in the situation of remote computer, remote computer can pass through the network of any kind --- including local area network (LAN) or extensively Domain net (WAN)-be connected to subscriber computer, or, it may be connected to outer computer (such as provided using Internet service Quotient is connected by internet).
Flow chart and block diagram in attached drawing are illustrated according to the system of the various embodiments of the application, method and computer journey The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation A part of one module, program segment or code of table, a part of the module, program segment or code include one or more use The executable instruction of the logic function as defined in realizing.It should also be noted that in some implementations as replacements, being marked in box The function of note can also occur in a different order than that indicated in the drawings.For example, two boxes succeedingly indicated are actually It can be basically executed in parallel, they can also be executed in the opposite order sometimes, and this depends on the function involved.Also it to infuse Meaning, the combination of each box in block diagram and or flow chart and the box in block diagram and or flow chart can be with holding The dedicated hardware based system of functions or operations as defined in row is realized, or can use specialized hardware and computer instruction Combination realize.
Being described in unit involved in the embodiment of the present application can be realized by way of software, can also be by hard The mode of part is realized.Described unit also can be set in the processor, for example, can be described as: a kind of processor packet Include acquiring unit, cluster cell, computing unit and processing unit.Wherein, the title of these units not structure under certain conditions The restriction of the pairs of unit itself, for example, acquiring unit is also described as " obtaining the list of the dispatching address of History Order Member ".
As on the other hand, present invention also provides a kind of computer-readable medium, which be can be Included in device described in above-described embodiment；It is also possible to individualism, and without in the supplying device.Above-mentioned calculating Machine readable medium carries one or more program, when said one or multiple programs are executed by the device, so that should Device: the dispatching address of History Order is obtained；The dispatching address of History Order is clustered, at least one is obtained and clusters；It will Fixed initial home-delivery center and the center to cluster are as candidate home-delivery center, the ground based on the candidate home-delivery center obtained The position data of location and delivery service object calculates the unit transport amount that each delivery service object is distributed to by candidate home-delivery center Transport resource consumption；Transport resource based on the unit transport amount for being distributed to each delivery service object by candidate home-delivery center Consumption, the position data of each delivery service object obtained and dispatching demand and the maximum of each candidate home-delivery center Dispensed amounts calculate total transport resource consumption of each candidate home-delivery center, determine so that the sum of total transport resource consumption minimum The candidate home-delivery center of preset number address be target home-delivery center address.
Above description is only the preferred embodiment of the application and the explanation to institute's application technology principle.Those skilled in the art Member is it should be appreciated that invention scope involved in the application, however it is not limited to technology made of the specific combination of above-mentioned technical characteristic Scheme, while should also cover in the case where not departing from foregoing invention design, it is carried out by above-mentioned technical characteristic or its equivalent feature Any combination and the other technical solutions formed.Such as features described above and (but being not limited to) disclosed herein have it is similar The technical characteristic of function is replaced mutually and the technical solution that is formed.

Claims (12)

1. a kind of method for determining home-delivery center address, comprising:
Obtain the dispatching address of History Order；
The dispatching address of the History Order is clustered, at least one is obtained and clusters；
Using fixed initial home-delivery center and the center to cluster as candidate home-delivery center, matched based on the candidate obtained The address at center and the position data of delivery service object are sent, calculates and each delivery service pair is distributed to by the candidate home-delivery center The transport resource consumption of the unit transport amount of elephant；
Transport resource consumption based on the unit transport amount for being distributed to each delivery service object by the candidate home-delivery center, The position data and dispatching demand of each delivery service object obtained and the maximum dispensed amounts of each candidate home-delivery center, meter The total transport resource consumption for calculating each candidate home-delivery center determines so that the sum of total transport resource consumption the smallest preset number The address of a candidate home-delivery center is the address of target home-delivery center.
2. being obtained according to the method described in claim 1, wherein, the dispatching address to the History Order clusters At least one clusters, comprising:
Determine several value range that clusters；
Using the minimum value to cluster in several value ranges as the initial number that currently clusters, search operation is executed, it is described to search Rope operates
Based on currently clustering, several dispatching addresses to the History Order carry out global clustering, calculate the pattra leaves of global clustering result This information content, the Bayesian Information amount are used to characterize the likelihood degree of cluster result and actual distribution；
The Bayesian Information amount and the upper one Bayesian Information amount for clustering several of the global clustering result for currently clustering several are compared, if The Bayesian Information amount for the global clustering result for currently clustering several is greater than the upper one Bayesian Information amount for clustering several, to based on working as Before cluster several global clustering result in each class cluster carry out Local Clustering, by global clustering result each class cluster divide For at least two submanifolds, the Bayesian Information amount of each submanifold is calculated, and is compared based on the global clustering result for currently clustering several The sum of the Bayesian Information amount of each submanifold in Bayesian Information amount and Local Clustering result；
If the Bayesian Information amount based on the global clustering result for currently clustering several is less than the shellfish of each submanifold in Local Clustering result The sum of this information content of leaf, then using the submanifold as based on several cluster result that currently clusters, and by the Bayes of all submanifolds The sum of information content is as the Bayesian Information amount for currently clustering several；
If the Bayesian Information amount based on the global clustering result for currently clustering several is greater than the shellfish of each submanifold in Local Clustering result The sum of this information content of leaf, then using the global clustering result as based on several cluster result that currently clusters, and will be described current The Bayesian Information amount for the global clustering result for clustering several is as the Bayesian Information amount for currently clustering several；
Judgement currently clusters to count whether reach the maximum value to cluster in several value ranges；
If the judging result of search operation is the not up to described maximum value to cluster in several value ranges of number that currently clusters, increase Currently cluster number, executes described search operation.
It is described based on being distributed to each delivery service by the candidate home-delivery center 3. according to the method described in claim 1, wherein The transport resource consumption of the unit transport amount of object, the position data of each delivery service object obtained and dispatching demand Amount and the maximum dispensed amounts of each candidate home-delivery center, calculate total transport resource consumption of each candidate home-delivery center, and determination makes The address for obtaining the candidate home-delivery center of the smallest preset number of the sum of total transport resource consumption is the address of target home-delivery center, Include:
Transport resource consumption based on the unit transport amount for being distributed to each delivery service object by the initial home-delivery center, with And dispatching demand, the maximum dispensed amounts of the initial home-delivery center of the delivery service object, at the beginning of calculating preset number The sum of total transport resource consumption of beginning home-delivery center；
Determine the smallest delivery service object of the sum of the total transport resource consumption for making the initial home-delivery center of the preset number Set, based on the smallest delivery service object of the sum of the total transport resource consumption for making the initial home-delivery center of the preset number The position data of each delivery service object in set determines the dispatching range of the initial home-delivery center of the preset number；
It is distributed to respectively to match based on other candidate home-delivery centers within the scope of the dispatching by the initial home-delivery center of preset number and take The transport resource consumption of unit transport amount of business object, the dispatching demand of delivery service object, preset number are initially matched The maximum dispensed amounts for sending other candidate home-delivery centers within the scope of the dispatching at center calculate the initial home-delivery center of preset number Total transport resource consumption of other candidate home-delivery centers in range is dispensed, and based in the initial dispatching of the preset number Total transport resource consumption of other candidate home-delivery centers within the scope of the dispatching of the heart, determines and replaces the initial home-delivery center For the sum of total transport resource consumption after other described candidate home-delivery centers；
It is replaced based on the sum of total transport resource consumption of the initial home-delivery center of preset number, and by the initial home-delivery center The sum of total transport resource consumption after being changed to other described candidate home-delivery centers, determine so that total transport resource consumption it Address with the candidate home-delivery center of the smallest preset number is the address of target home-delivery center.
4. other candidate home-delivery centers according to the method described in claim 3, wherein, within the scope of the dispatching of initial home-delivery center Total transport resource consumption further include other candidate home-delivery centers within the scope of the dispatching for construct the initial home-delivery center Default consumed resource.
5. the method according to claim 3 or 4, wherein the method also includes:
Determine the delivery service object set of the target home-delivery center.
6. a kind of for determining the device of home-delivery center address, comprising:
Acquiring unit is configured to obtain the dispatching address of History Order；
Cluster cell is configured to cluster the dispatching address of the History Order, obtains at least one and cluster；
Computing unit is configured to using fixed initial home-delivery center and the center to cluster as candidate home-delivery center, The position data of address and delivery service object based on the candidate home-delivery center obtained is calculated by the candidate home-delivery center It is distributed to the transport resource consumption of the unit transport amount of each delivery service object；
Processing unit is configured to based on the unit transport amount for being distributed to each delivery service object by the candidate home-delivery center In transport resource consumption, the position data of each delivery service object obtained and dispatching demand and each candidate dispatching The maximum dispensed amounts of the heart calculate total transport resource consumption of each candidate home-delivery center, determine so that total transport resource consumption The sum of the candidate home-delivery center of the smallest preset number address be target home-delivery center address.
7. device according to claim 6, wherein the cluster cell is further configured to as follows to institute The dispatching address for stating History Order is clustered, and is obtained at least one and is clustered:
Determine several value range that clusters；
Using the minimum value to cluster in several value ranges as the initial number that currently clusters, search operation is executed, it is described to search Rope operates
Based on currently clustering, several dispatching addresses to the History Order carry out global clustering, calculate the pattra leaves of global clustering result This information content, the Bayesian Information amount are used to characterize the likelihood degree of cluster result and actual distribution；
The Bayesian Information amount and the upper one Bayesian Information amount for clustering several of the global clustering result for currently clustering several are compared, if The Bayesian Information amount for the global clustering result for currently clustering several is greater than the upper one Bayesian Information amount for clustering several, to based on working as Before cluster several global clustering result in each class cluster carry out Local Clustering, by global clustering result each class cluster divide For at least two submanifolds, the Bayesian Information amount of each submanifold is calculated, and is compared based on the global clustering result for currently clustering several The sum of the Bayesian Information amount of each submanifold in Bayesian Information amount and Local Clustering result；
If the Bayesian Information amount based on the global clustering result for currently clustering several is less than the shellfish of each submanifold in Local Clustering result The sum of this information content of leaf, then using the submanifold as based on several cluster result that currently clusters, and by the Bayes of all submanifolds The sum of information content is as the Bayesian Information amount for currently clustering several；
If the Bayesian Information amount based on the global clustering result for currently clustering several is greater than the shellfish of each submanifold in Local Clustering result The sum of this information content of leaf, then using the global clustering result as based on several cluster result that currently clusters, and will be described current The Bayesian Information amount for the global clustering result for clustering several is as the Bayesian Information amount for currently clustering several；
Judgement currently clusters to count whether reach the maximum value to cluster in several value ranges；
If the judging result of search operation is the not up to described maximum value to cluster in several value ranges of number that currently clusters, increase Currently cluster number, executes described search operation.
8. device according to claim 6, wherein the processing unit is further configured to determine as follows So that the address of the candidate home-delivery center of the smallest preset number of the sum of total transport resource consumption is the ground of target home-delivery center Location:
Transport resource consumption based on the unit transport amount for being distributed to each delivery service object by the initial home-delivery center, with And dispatching demand, the maximum dispensed amounts of the initial home-delivery center of the delivery service object, at the beginning of calculating preset number The sum of total transport resource consumption of beginning home-delivery center；
Determine the smallest delivery service object of the sum of the total transport resource consumption for making the initial home-delivery center of the preset number Set, based on the smallest delivery service object of the sum of the total transport resource consumption for making the initial home-delivery center of the preset number The position data of each delivery service object in set determines the dispatching range of the initial home-delivery center of the preset number；
It is distributed to respectively to match based on other candidate home-delivery centers within the scope of the dispatching by the initial home-delivery center of preset number and take The transport resource consumption of unit transport amount of business object, the dispatching demand of delivery service object, preset number are initially matched The maximum dispensed amounts for sending other candidate home-delivery centers within the scope of the dispatching at center calculate the initial home-delivery center of preset number Total transport resource consumption of other candidate home-delivery centers in range is dispensed, and based in the initial dispatching of the preset number Total transport resource consumption of other candidate home-delivery centers within the scope of the dispatching of the heart, determines and replaces the initial home-delivery center For the sum of total transport resource consumption after other described candidate home-delivery centers；
It is replaced based on the sum of total transport resource consumption of the initial home-delivery center of preset number, and by the initial home-delivery center The sum of total transport resource consumption after being changed to other described candidate home-delivery centers, determine so that total transport resource consumption it Address with the candidate home-delivery center of the smallest preset number is the address of target home-delivery center.
9. device according to claim 8, wherein other candidate home-delivery centers within the scope of the dispatching of initial home-delivery center Total transport resource consumption further include other candidate home-delivery centers within the scope of the dispatching for construct the initial home-delivery center Default consumed resource.
10. device according to claim 8 or claim 9, wherein described device further include:
Determination unit is configured to determine the delivery service object set of the target home-delivery center.
11. a kind of electronic equipment, comprising:
One or more processors；
Storage device, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of processors are real Now such as method as claimed in any one of claims 1 to 5.
12. a kind of computer readable storage medium, is stored thereon with computer program, wherein described program is executed by processor Shi Shixian method for example as claimed in any one of claims 1 to 5.
CN201810786397.XA 2018-07-17 2018-07-17 Method and device for determining distribution center address Active CN108985694B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810786397.XA CN108985694B (en) 2018-07-17 2018-07-17 Method and device for determining distribution center address

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810786397.XA CN108985694B (en) 2018-07-17 2018-07-17 Method and device for determining distribution center address

Publications (2)

Publication Number Publication Date
CN108985694A true CN108985694A (en) 2018-12-11
CN108985694B CN108985694B (en) 2022-04-22

Family

ID=64549477

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810786397.XA Active CN108985694B (en) 2018-07-17 2018-07-17 Method and device for determining distribution center address

Country Status (1)

Country Link
CN (1) CN108985694B (en)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109615137A (en) * 2018-12-13 2019-04-12 合肥工业大学智能制造技术研究院 The Optimization Method for Location-Selection dispensed for cloud under cloud logistics environment
CN109657027A (en) * 2018-12-19 2019-04-19 金瓜子科技发展（北京）有限公司 A kind of method, apparatus, storage medium and electronic equipment clustering addressing
CN110348678A (en) * 2019-05-31 2019-10-18 口碑(上海)信息技术有限公司 Dispense the scheduling of resource and resource regulating method and device for vegetable dispatching
CN111582794A (en) * 2020-05-07 2020-08-25 优信数享（北京）信息技术有限公司 Logistics node site selection method and device
CN111738539A (en) * 2020-02-28 2020-10-02 北京京东乾石科技有限公司 Goods picking task allocation method, device, equipment and medium
CN112258105A (en) * 2020-10-15 2021-01-22 拉扎斯网络科技（上海）有限公司 Distribution address compliance detection and compliance distribution range information obtaining method and device
CN112819395A (en) * 2019-11-15 2021-05-18 北京沃东天骏信息技术有限公司 Distribution mode determining method, device, medium and equipment based on matrix representation
CN112949884A (en) * 2019-12-10 2021-06-11 顺丰科技有限公司 Article waybill processing method and device, computer equipment and storage medium
CN113762864A (en) * 2021-01-06 2021-12-07 北京京东振世信息技术有限公司 Logistics site location method and device
CN114386500A (en) * 2021-12-31 2022-04-22 苏州市公安局 Infectious disease sampling point selection method, device, equipment and storage medium
CN117649164A (en) * 2024-01-30 2024-03-05 四川宽窄智慧物流有限责任公司 Gradient distribution method and system for overall cargo management
CN111738539B (en) * 2020-02-28 2024-04-19 北京京东乾石科技有限公司 Method, device, equipment and medium for distributing picking tasks

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110317927A1 (en) * 2010-06-29 2011-12-29 Canon Kabushiki Kaisha Clustering processing apparatus and clustering processing method
CN103473612A (en) * 2013-09-06 2013-12-25 周伟华 Site selection and transportation optimization method for super-large scale logistics distribution
CN103686923A (en) * 2013-12-26 2014-03-26 华北电力大学 Target-tracking-oriented wireless sensor cluster energy managing method
CN105373909A (en) * 2015-12-04 2016-03-02 江苏省现代企业信息化应用支撑软件工程技术研发中心 Logistics dispensing center addressing method based on simulation software
CN106127327A (en) * 2016-05-17 2016-11-16 北京京东尚科信息技术有限公司 Dispensing bus station position method and system based on GIS
CN107451673A (en) * 2017-06-14 2017-12-08 北京小度信息科技有限公司 Dispense region partitioning method and device
CN107590242A (en) * 2017-09-14 2018-01-16 北京三快在线科技有限公司 A kind of address information processing method and device
WO2018077031A1 (en) * 2016-10-24 2018-05-03 菜鸟智能物流控股有限公司 Method and related apparatus for resource allocation
CN108171452A (en) * 2017-12-08 2018-06-15 苏宁云商集团股份有限公司 A kind of express delivery point addressing method and device

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110317927A1 (en) * 2010-06-29 2011-12-29 Canon Kabushiki Kaisha Clustering processing apparatus and clustering processing method
CN103473612A (en) * 2013-09-06 2013-12-25 周伟华 Site selection and transportation optimization method for super-large scale logistics distribution
CN103686923A (en) * 2013-12-26 2014-03-26 华北电力大学 Target-tracking-oriented wireless sensor cluster energy managing method
CN105373909A (en) * 2015-12-04 2016-03-02 江苏省现代企业信息化应用支撑软件工程技术研发中心 Logistics dispensing center addressing method based on simulation software
CN106127327A (en) * 2016-05-17 2016-11-16 北京京东尚科信息技术有限公司 Dispensing bus station position method and system based on GIS
WO2018077031A1 (en) * 2016-10-24 2018-05-03 菜鸟智能物流控股有限公司 Method and related apparatus for resource allocation
CN107451673A (en) * 2017-06-14 2017-12-08 北京小度信息科技有限公司 Dispense region partitioning method and device
CN107590242A (en) * 2017-09-14 2018-01-16 北京三快在线科技有限公司 A kind of address information processing method and device
CN108171452A (en) * 2017-12-08 2018-06-15 苏宁云商集团股份有限公司 A kind of express delivery point addressing method and device

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109615137A (en) * 2018-12-13 2019-04-12 合肥工业大学智能制造技术研究院 The Optimization Method for Location-Selection dispensed for cloud under cloud logistics environment
CN109657027A (en) * 2018-12-19 2019-04-19 金瓜子科技发展（北京）有限公司 A kind of method, apparatus, storage medium and electronic equipment clustering addressing
CN109657027B (en) * 2018-12-19 2020-11-03 金瓜子科技发展（北京）有限公司 Clustering and address selecting method and device, storage medium and electronic equipment
CN110348678A (en) * 2019-05-31 2019-10-18 口碑(上海)信息技术有限公司 Dispense the scheduling of resource and resource regulating method and device for vegetable dispatching
CN112819395A (en) * 2019-11-15 2021-05-18 北京沃东天骏信息技术有限公司 Distribution mode determining method, device, medium and equipment based on matrix representation
CN112949884B (en) * 2019-12-10 2023-04-07 顺丰科技有限公司 Article waybill processing method and device, computer equipment and storage medium
CN112949884A (en) * 2019-12-10 2021-06-11 顺丰科技有限公司 Article waybill processing method and device, computer equipment and storage medium
CN111738539A (en) * 2020-02-28 2020-10-02 北京京东乾石科技有限公司 Goods picking task allocation method, device, equipment and medium
CN111738539B (en) * 2020-02-28 2024-04-19 北京京东乾石科技有限公司 Method, device, equipment and medium for distributing picking tasks
CN111582794A (en) * 2020-05-07 2020-08-25 优信数享（北京）信息技术有限公司 Logistics node site selection method and device
CN112258105A (en) * 2020-10-15 2021-01-22 拉扎斯网络科技（上海）有限公司 Distribution address compliance detection and compliance distribution range information obtaining method and device
CN113762864A (en) * 2021-01-06 2021-12-07 北京京东振世信息技术有限公司 Logistics site location method and device
CN114386500A (en) * 2021-12-31 2022-04-22 苏州市公安局 Infectious disease sampling point selection method, device, equipment and storage medium
CN117649164A (en) * 2024-01-30 2024-03-05 四川宽窄智慧物流有限责任公司 Gradient distribution method and system for overall cargo management
CN117649164B (en) * 2024-01-30 2024-04-16 四川宽窄智慧物流有限责任公司 Gradient distribution method and system for overall cargo management

Also Published As

Publication number Publication date
CN108985694B (en) 2022-04-22

Similar Documents

Publication Publication Date Title
CN108985694A (en) Method and apparatus for determining home-delivery center address
CN109003028A (en) Method and apparatus for dividing logistics region
CN104756467B (en) CDN traffic managements in cloud
CN104756444B (en) CDN load balances in cloud
CN109426885A (en) Order allocation method and device
CN108960694A (en) Dispense area determination method and device
CN113239317B (en) Method and device for determining order performance warehouse
CN110443533A (en) Commodity divide storehouse storage method, device, electronic equipment and computer-readable medium
CN108734559A (en) A kind of order processing method and apparatus
CN109636490A (en) Real-time predicting method, the advertisement valuation method and system of ad conversion rates
CN109345166B (en) Method and apparatus for generating information
CN109697637A (en) Object type determines method, apparatus, electronic equipment and computer storage medium
CN110400184A (en) Method and apparatus for generating information
CN109740873A (en) Distribution method, device, medium and the electronic equipment of declaration form
CN113128744A (en) Distribution planning method and device
CN109583945A (en) A kind of method and apparatus of advertising resource distribution
CN109978213A (en) A kind of task path planning method and device
CN110516985A (en) Warehouse selection method, system, computer system and computer readable storage medium storing program for executing
CN109075987A (en) Optimize digital assembly analysis system
CN111371879B (en) Network path management method, device, system, service architecture and electronic equipment
CN108665312A (en) Method and apparatus for generating information
EP3301638A1 (en) Method for automatic property valuation
CN109978421A (en) Information output method and device
CN111429237A (en) Order price determining method and device, server and storage medium
CN110222064A (en) Data processing method, device, electronic equipment and readable storage medium storing program for executing

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