CN111582794B - Logistics node site selection method and device - Google Patents
Logistics node site selection method and device Download PDFInfo
- Publication number
- CN111582794B CN111582794B CN202010378772.4A CN202010378772A CN111582794B CN 111582794 B CN111582794 B CN 111582794B CN 202010378772 A CN202010378772 A CN 202010378772A CN 111582794 B CN111582794 B CN 111582794B
- Authority
- CN
- China
- Prior art keywords
- city
- node
- determining
- cities
- historical order
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000010187 selection method Methods 0.000 title description 2
- 238000010586 diagram Methods 0.000 claims abstract description 32
- 238000000034 method Methods 0.000 claims abstract description 30
- 238000012545 processing Methods 0.000 claims description 22
- 230000005540 biological transmission Effects 0.000 claims description 10
- 238000004904 shortening Methods 0.000 abstract description 3
- 238000004590 computer program Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 3
- 230000018109 developmental process Effects 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000032683 aging Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Databases & Information Systems (AREA)
- Game Theory and Decision Science (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Remote Sensing (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application provides a method and a device for selecting a physical distribution node. The method comprises the following steps: according to the sending address and the receiving address of the historical order, the optimal initial city and the optimal destination city of the historical order can be determined by combining a preset city network diagram, and then according to the optimal initial city and the optimal destination city respectively corresponding to each historical order, the city flow value respectively corresponding to each city can be determined, and further according to the city flow value respectively corresponding to each city, the city which can be used as a logistics node can be determined. By adopting the method, because the historical order information is consulted, the determined city which can be used as the logistics node meets the actual requirement, thereby improving the rationality of the logistics node site selection, shortening the logistics transportation time and saving the logistics transportation cost.
Description
Technical Field
The application relates to the technical field of logistics, in particular to a method and a device for selecting a physical distribution node.
Background
The modern society has a road all around, promotes the development of logistics industry, and at present, logistics has become a new field of 21 st century economic development and is one of the most important economic growth points. The whole logistics system comprises a plurality of aspects such as logistics transportation, logistics nodes, logistics information management, logistics time control and the like, wherein the logistics nodes are commonly used for storing goods and have a warehouse management function. If the physical distribution node is reasonable, the physical distribution cost is directly affected.
At present, the logistics nodes are usually arranged in large cities, such as first-line cities, but with the continuous development of logistics industry, the original logistics nodes cannot meet the service requirements, so that the number of the logistics nodes needs to be increased. However, if the location of the logistics nodes is determined at will, the situation that the location of the logistics nodes is unreasonable easily occurs, so that the problems of prolonging the logistics transportation time and increasing the logistics transportation cost are easily caused.
Based on the above, there is a need for a method for selecting a physical distribution node, which is used for solving the problems of unreasonable physical distribution node address, easy extension of physical distribution transportation time and high physical distribution transportation cost in the prior art.
Disclosure of Invention
The application provides a method and a device for selecting physical distribution nodes, which can be used for solving the technical problems that physical distribution transportation time is prolonged and physical distribution transportation cost is increased due to unreasonable physical distribution node address selection in the prior art.
In a first aspect, an embodiment of the present application provides a method for selecting a location of a logistics node, where the method includes:
acquiring a historical order sample set, wherein the historical order sample set comprises a plurality of historical orders, and each historical order comprises an issuing address of the historical order and a receiving address of the historical order;
For the first historical order, determining at least one candidate starting city from the node cities according to the positions of the node cities and the delivery addresses of the first historical order; and determining at least one candidate destination city from the node cities according to the positions of the node cities and the receiving addresses of the first historical orders; and determining an optimal starting city from the at least one candidate starting city and determining an optimal destination city from the at least one candidate destination city according to a preset city network diagram; the first historical order is any one of the plurality of historical orders;
Determining city flow values corresponding to the node cities according to the optimal starting city and the optimal destination city corresponding to each historical order respectively;
and determining the city which can be used as the logistics node from the node cities according to the city flow value corresponding to each node city.
With reference to the first aspect, in an implementation manner of the first aspect, determining at least one candidate starting city from the node cities according to the location of each node city and the address of the first historical order, includes:
Determining a first distance between the transmission address of the first historical order and each node city according to the position of each node city and the transmission address of the first historical order;
Ranking the node cities from small to large according to the first distance, and determining the node cities with the top N digits as the candidate initial cities; n is an integer greater than or equal to 1.
With reference to the first aspect, in an implementation manner of the first aspect, determining at least one candidate destination city from the node cities according to the location of each node city and the destination address of the first historical order includes:
Determining a second distance between the receiving address of the first historical order and each node city according to the position of each node city and the receiving address of the first historical order;
Ranking the node cities from small to large according to the second distance, and determining the node cities with M positions before ranking as the candidate destination cities; m is an integer greater than or equal to 1.
With reference to the first aspect, in an implementation manner of the first aspect, according to a preset city network diagram, determining a best starting city from the at least one candidate starting city, and determining a best destination city from the at least one candidate destination city includes:
Determining at least one feasible transportation route between the candidate starting city and the candidate destination city according to the preset city network diagram;
Determining an optimal transportation route from the at least one feasible transportation route according to the transportation distance of each feasible transportation route and the number of transit cities corresponding to each feasible transportation route;
And determining a starting city corresponding to the optimal transportation route as the optimal starting city, and determining a destination city corresponding to the optimal transportation route as the optimal destination city.
With reference to the first aspect, in an implementation manner of the first aspect, determining, according to a best start city and a best destination city corresponding to each historical order, a city flow value corresponding to each node city includes:
According to the optimal initial city corresponding to each historical order, determining that each node city is a first numerical value of the optimal initial city;
determining a second numerical value of each node city as the optimal destination city according to the optimal destination city corresponding to each historical order;
and determining a city flow value corresponding to each node city according to the first value and the second value.
With reference to the first aspect, in an implementation manner of the first aspect, determining, according to a city flow value corresponding to each node city, a city that can be a logistics node from the node cities includes:
ranking the node cities according to the city flow values from high to low according to the city flow values corresponding to the node cities;
Judging whether the first-ranking node city is used as a logistics node, if not, determining the first-ranking node city as a city capable of being used as the logistics node;
if the first node city is used as the logistics node, judging whether the last node city is used as the logistics node until determining that the last node city can be used as the logistics node.
In a second aspect, an embodiment of the present application provides an apparatus for locating a logistics node, where the apparatus includes:
the system comprises an acquisition unit, a storage unit and a storage unit, wherein the acquisition unit is used for acquiring a historical order sample set, the historical order sample set comprises a plurality of historical orders, and each historical order comprises an issuing address of the historical order and a receiving address of the historical order;
The processing unit is used for determining at least one candidate starting city from the node cities according to the positions of the node cities and the delivery addresses of the first historical orders aiming at the first historical orders; and determining at least one candidate destination city from the node cities according to the positions of the node cities and the receiving addresses of the first historical orders; and determining an optimal starting city from the at least one candidate starting city and determining an optimal destination city from the at least one candidate destination city according to a preset city network diagram; the first historical order is any one of the plurality of historical orders;
The processing unit is further used for determining city flow values respectively corresponding to the node cities according to the optimal starting city and the optimal destination city respectively corresponding to each historical order; and determining the city which can be used as the logistics node from the node cities according to the city flow value corresponding to each node city.
With reference to the second aspect, in an implementation manner of the second aspect, the processing unit is specifically configured to:
Determining a first distance between the transmission address of the first historical order and each node city according to the position of each node city and the transmission address of the first historical order; ranking the node cities from small to large according to the first distance, and determining the node cities with the top N digits as the candidate initial cities; n is an integer greater than or equal to 1.
With reference to the second aspect, in an implementation manner of the second aspect, the processing unit is specifically configured to:
Determining a second distance between the receiving address of the first historical order and each node city according to the position of each node city and the receiving address of the first historical order; ranking the node cities from small to large according to the second distance, and determining the node cities with M positions before ranking as the candidate destination cities; m is an integer greater than or equal to 1.
With reference to the second aspect, in an implementation manner of the second aspect, the processing unit is specifically configured to:
Determining at least one feasible transportation route between the candidate starting city and the candidate destination city according to the preset city network diagram; determining an optimal transportation route from the at least one feasible transportation route according to the transportation distance of each feasible transportation route and the number of transit cities corresponding to each feasible transportation route; and determining a starting city corresponding to the optimal transportation route as the optimal starting city, and determining a destination city corresponding to the optimal transportation route as the optimal destination city.
With reference to the second aspect, in an implementation manner of the second aspect, the processing unit is specifically configured to:
According to the optimal initial city corresponding to each historical order, determining that each node city is a first numerical value of the optimal initial city; determining a second numerical value of each node city as the optimal destination city according to the optimal destination city corresponding to each historical order; and determining a city flow value corresponding to each node city according to the first value and the second value.
With reference to the second aspect, in an implementation manner of the second aspect, the processing unit is specifically configured to:
Ranking the node cities according to the city flow values from high to low according to the city flow values corresponding to the node cities; judging whether the first-order node city is used as a logistics node, and if the first-order node city is not used as the logistics node, determining the first-order node city as a city which can be used as the logistics node; and if the first-ranking node city is used as a logistics node, judging whether the last-ranking node city is used as the logistics node or not until determining that the last-ranking node city can be used as the logistics node.
In a third aspect, an embodiment of the present application provides an electronic device, including:
a memory for storing program instructions;
and the processor is used for calling and executing the program instructions in the memory so as to realize the method for selecting the physical distribution node address according to the first aspect.
In a fourth aspect, an embodiment of the present application provides a storage medium, where a computer program is stored, and when at least one processor of an address selecting device of a physical distribution node executes the computer program, the address selecting device of the physical distribution node executes the address selecting method of the physical distribution node according to the first aspect.
In the embodiment of the application, according to the sending address and the receiving address of the historical order and in combination with a preset city network diagram, the optimal initial city and the optimal destination city of the historical order can be determined, further, according to the optimal initial city and the optimal destination city respectively corresponding to each historical order, the city flow value respectively corresponding to each city can be determined, and further, according to the city flow value respectively corresponding to each city, the city which can be used as a logistics node can be determined. By adopting the method, because the historical order information is consulted, the determined city which can be used as the logistics node meets the actual requirement, thereby improving the rationality of the logistics node site selection, shortening the logistics transportation time and saving the logistics transportation cost.
Drawings
FIG. 1 is a schematic diagram of an urban network map to which embodiments of the present application are applicable;
Fig. 2 is a schematic flow chart corresponding to an address selecting method of a logistics node according to an embodiment of the present application;
FIG. 3 is a schematic diagram of a first distance between an sender address and a node city according to an embodiment of the present application;
FIG. 4 is a schematic diagram of a second distance between a destination address and a node city according to an embodiment of the present application;
Fig. 5 is a schematic structural diagram of a physical distribution node addressing device according to an embodiment of the present application.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present application more apparent, the embodiments of the present application will be described in further detail with reference to the accompanying drawings.
A possible urban network diagram to which embodiments of the present application are applicable will be described first with reference to fig. 1.
Referring to fig. 1, a schematic diagram of an urban network map to which an embodiment of the present application is applicable is shown. Wherein,Representing node cities that are not logistics nodes, such as city a, city B, city C, city F, city G, city H, and city I shown in fig. 1; /(I)Representing a node city that has been a logistics node, such as city E shown in fig. 1. The node city refers to a city which can be used as a logistics node, and is generally a first-line city or a second-line city.
The connection line between two node cities represents a road (hereinafter referred to as a "path") with direct communication between the two node cities, for example, a path is respectively formed between a city a shown in fig. 1 and a city D or a city E; a passage is arranged between the city B and the city E and between the city B and the city F respectively; a passage is arranged between the city C and the city F; the city D is respectively provided with a passage with the city A, the city E and the city G; the city E is respectively provided with a passage with the city A, the city B, the city D, the city F, the city G and the city H; the city F is respectively provided with a passage with the city B, the city C, the city E and the city I; a passage is arranged between the city G and the city D and between the city G and the city E respectively; a passage is arranged between the city H and the city E and between the city H and the city I respectively; there is a path between city I and city F and city H, respectively.
As can be seen from fig. 1, city E is a city that is a logistics node, which means that city E has a logistics warehouse that can store goods for transporting them to other cities.
For example, if the recipient address of an order is city I, then the order needs to be sent from city E to city I. Taking the urban network diagram shown in fig. 1 as an example, the transportation routes of the order have three routes: first, city E, city B, city F, city I; second, city E→city F→city I; third, city E→city H→city I. No matter which route, at least one transit city needs to be routed to reach city I, and the more transit cities, the later the time the order reaches the receiving city, so that the timeliness of the order can be affected.
In order to increase order timeliness, logistics warehouse can be set up in other cities, that is, other cities can also be used as logistics nodes. For example, if city F or city H is used as the logistics node, the order can be directly sent from city F or city H to city I without passing through to transit the city, or even city I can be used as the logistics node, and then the order can be directly picked up. However, the more cities that can be used as logistics nodes, the larger the funds required for construction and maintenance, and a reasonable logistics node location method is needed, so that the two problems of order aging improvement and funds reduction can be balanced.
Based on this, fig. 2 schematically shows a flow diagram corresponding to an address selecting method of a logistics node according to an embodiment of the present application. As shown in fig. 2, the method specifically comprises the following steps:
Step 201, a historical order sample set is obtained.
Step 202, determining at least one candidate starting city from the node cities according to the positions of the node cities and the delivery addresses of the first history orders aiming at the first history orders.
And 203, determining at least one candidate destination city from the node cities according to the positions of the node cities and the receiving addresses of the first historical orders.
Step 204, determining the best starting city from at least one candidate starting city according to the preset city network diagram.
Step 205, determining the best destination city from at least one candidate destination city according to the preset city network diagram.
And 206, determining city flow values corresponding to the node cities according to the optimal starting city and the optimal destination city corresponding to each historical order.
And step 207, determining the city which can be used as the logistics node from the node cities according to the city flow value corresponding to each node city.
In the embodiment of the application, according to the sending address and the receiving address of the historical order and in combination with a preset city network diagram, the optimal initial city and the optimal destination city of the historical order can be determined, further, according to the optimal initial city and the optimal destination city respectively corresponding to each historical order, the city flow value respectively corresponding to each city can be determined, and further, according to the city flow value respectively corresponding to each city, the city which can be used as a logistics node can be determined. By adopting the method, because the historical order information is consulted, the determined city which can be used as the logistics node meets the actual requirement, thereby improving the rationality of the logistics node site selection, shortening the logistics transportation time and saving the logistics transportation cost.
Specifically, in step 201, a historical order sample set may include a plurality of historical orders. Historical orders refer to orders over a period of time, and orders from a month to two months can be selected generally, with closer orders being more significant for the location of the logistics nodes.
It should be noted that the time length for acquiring the historical order is not limited in the present application, and a person skilled in the art may acquire a suitable historical order according to experience and practical situations, for example, may acquire a historical order of one month in the past, or may acquire a historical order of half year in the past.
Each historical order may include an issue address of the historical order and a receiver address of the historical order. The issue address of the historical order refers to the issue address of the historical order, which may be accurate to a specific street, cell, even house numbers, such as, for example, the sender address may be "XX province XX" XX road XX number of XX street XX of city XX region. The receiving address of the historical order refers to the receiving address of the historical order, and the receiving address can be accurate to specific streets, communities and even house numbers.
As shown in table 1, is one example of a historical order. The sending address of the history order 1 is 'XX line XX of the first street in New area of Pudong in Shanghai, and the receiving address of the history order 1 is' XX line XX of the fourth street in Guangzhou, guangdong; the sending address of the history order 2 is 'the third street XX cell of the drum building area of Nanjing, jiangsu province', and the receiving address of the history order 2 is 'the second street XX cell X XXX room of the Korean area of Beijing'; the sending address of the history order 3 is 'XX line XXX number of Zhenjiang city in Jiangsu province', and the receiving address of the history order 2 is 'X-piece XX room of XX cell in Jieyang city in Guangdong province'.
Table 1: one example of a historical order
| Historical orders | Issuing address of historical order | Receiver address of historical order |
| Historical order 1 | XX road XX number of first street XX in new region of Shanghai city Pudong | XX road XXX number of the fourth street XX road in the paper area of Guangzhou, guangdong province |
| Historical order 2 | Third street XX cell of drum building area in Nanjing, jiangsu province | XX cell X-span XXX room of second street XX cell in Chaoyang area in Beijing city |
| Historical order 3 | XX road XXX of Zhenjiang city in Jiangsu province | XX district X-XX room in Jieyang city of Guangdong province |
In step 202, the node city may include a city that is not a logistics node, and considering that the sending address or the receiving address of the historical order may be located anywhere nationwide, the sending address or the receiving address of the historical order may not be the city that is a logistics node due to the convenience of traffic, and if the city that is a logistics node is discharged outside the node city, the historical order needs to be screened, which has a large workload. Thus, a node city may also include a city that has been a logistics node.
Considering that the issue address of the history order may not be located in the node city, but rather in a three-wire city or four-wire city, etc., it is necessary to determine the node city that is closer to the issue address of the history order as a candidate starting city.
There are various ways of determining the candidate starting city from the node cities, in one example, according to the position of each node city and the delivery address of the first historical order, a first distance between the delivery address of the first historical order and each node city is determined, then each node city can be ranked from small to large according to the first distance, and the node cities with the top N digits are determined as the candidate starting cities. Wherein, N is an integer greater than or equal to 1, and the specific numerical value of N can be determined by a person skilled in the art according to experience and actual conditions, and is not particularly limited; the first historical order may be any one of a plurality of historical orders.
The first distance between the delivery address of the first historical order and each node city can be obtained according to a map database, for example, the first distance can be determined through a map database such as a Goldmap, a hundred-degree map and the like.
Exemplary, referring to the city network diagram shown in fig. 1, as shown in fig. 3, a schematic diagram of a first distance between an address of an sender and a node city according to an embodiment of the present application is shown. As can be seen from fig. 3, the first distance between the issue address of the history order and city a is 100km, the first distance between the issue address of the history order and city B is 350km, the first distance between the issue address of the history order and city C is 800km, the first distance between the issue address of the history order and city D is 150km, the first distance between the issue address of the history order and city E is 75km, the first distance between the issue address of the history order and city F is 500km, the first distance between the issue address of the history order and city G is 50km, the first distance between the issue address of the history order and city H is 300km, and the first distance between the issue address of the history order and city I is 1000 km.
Each node city can be ranked from small to large according to the first distance, and the obtained ranking is as follows: city G < City E < City A < City D < City H < City B < City F < City C < City I.
Assuming n=3, then the top 3 node cities may be determined as candidate starting cities, i.e., the candidate starting cities include city G, city E, and city a.
In another example, a first distance between the sender address of the first historical order and each node city is determined according to the location of each node city and the sender address of the first historical order, and then, the node city with the first distance smaller than the preset threshold value can be determined as the candidate starting city.
Illustratively, still taking the example shown in fig. 3 as an example, assuming that the preset threshold is 80km, a node city having a first distance less than 80km may be determined as a candidate starting city, i.e., the candidate starting city includes city G and city E.
In step 203, it is also considered that the destination address of the historical order may not be located in the node city, but rather in the three-wire city or four-wire city, etc., and therefore, it is necessary to determine the node city that is closer to the destination address of the historical order as the candidate destination city.
There are various ways of determining candidate destination cities from the node cities, in one example, a second distance between the destination address of the first historical order and each node city is determined according to the position of each node city and the destination address of the first historical order, then each node city can be ranked from small to large according to the second distance, and the node cities with the M top ranks are determined as candidate destination cities. Wherein, M is an integer greater than or equal to 1, and the specific numerical value of M can be determined by a person skilled in the art according to experience and practical conditions, and is not particularly limited.
The second distance between the destination address of the first historical order and each node city may be obtained from a map database, for example, a map database such as a Goldmap, a hundred degree map, or the like, and the second distance may be determined.
Exemplary, as shown in fig. 4, a schematic diagram of a second distance between a destination address and a node city according to an embodiment of the present application is provided. As can be seen from fig. 4, the first distance between the pick-up address of the history order and city B is 1200km, the first distance between the pick-up address of the history order and city B is 700km, the first distance between the pick-up address of the history order and city C is 100km, the first distance between the pick-up address of the history order and city D is 1500km, the first distance between the pick-up address of the history order and city E is 500km, the first distance between the pick-up address of the history order and city F is 75km, the first distance between the pick-up address of the history order and city G is 1000km, the first distance between the pick-up address of the history order and city H is 150km, and the first distance between the pick-up address of the history order and city I is 50km.
Each node city can be ranked from small to large according to the second distance, and the obtained ranking is as follows: city I < city F < city C < city H < city E < city B < city G < city A < city D.
Assuming that m=3, then the top 3-digit node city may be determined as the candidate destination city, i.e., the candidate destination city includes city I, city F, and city C.
In another example, a second distance between the receiving address of the first historical order and each node city is determined according to the position of each node city and the receiving address of the first historical order, and then, the node city with the second distance smaller than the preset threshold value can be determined as the candidate destination city.
Illustratively, still taking the example shown in fig. 4 as an example, assuming that the preset threshold is 80km, a node city having a second distance less than 80km may be determined as a candidate destination city, i.e., the candidate destination city includes city I and city F.
In steps 204 and 205, considering that there may be more than one candidate origin city and more than one candidate destination city, there may be a plurality of possible transportation routes between different candidate origin cities and different candidate destination cities, and from among the plurality of possible transportation routes, the optimal transportation route may be determined.
Specifically, at least one feasible transportation route between the candidate starting city and the candidate destination city may be determined according to a preset city network diagram, then, an optimal transportation route may be determined from the at least one feasible transportation route according to a transportation distance of each feasible transportation route and the number of transit cities corresponding to each feasible transportation route, and finally, the starting city corresponding to the optimal transportation route may be determined as an optimal starting city, and the destination city corresponding to the optimal transportation route may be determined as an optimal destination city.
In one example, after the transportation distance of the feasible transportation route and the number of transit cities corresponding to the feasible transportation route are normalized, the optimal transportation route is determined by combining a weight value corresponding to the transportation distance of the feasible transportation route and a weight value corresponding to the number of transit cities corresponding to the feasible transportation route.
Specifically, the method can be determined by the following formula (1):
P i＝mi×w1+ni×w2 formula (1)
In the formula (1), P i is an evaluation value of the i-th possible transportation route; m i is a value obtained by normalizing the transport distance of the ith feasible transport route; n i is a value obtained by normalizing the number of transit cities corresponding to the ith feasible transportation route; w 1 is a weight value preset for the transportation distance of the ith feasible transportation route; w 2 is a weight value preset for the number of transit cities corresponding to the ith feasible transportation route; i is an integer greater than or equal to 1.
Further, the feasible transportation route corresponding to the minimum value P i is determined as the optimal transportation route.
It should be noted that, the weight value corresponding to the transportation distance of the feasible transportation route and the weight value corresponding to the number of transit cities corresponding to the feasible transportation route may be determined by those skilled in the art according to experience and actual conditions, and are not limited in particular.
Taking the example illustrated in fig. 3 and 4 as an example, assuming that the candidate starting city includes city G, city E, and city a, and the candidate destination city includes city I, city F, and city C, the city network diagram is based on the content shown in fig. 1, and the feasible transportation route between the candidate starting city and the candidate destination city is as follows: (1) From city G to city I (route is set: city G→city E→city H→city I); (2) From city G to city F (route is set: city G→city E→city F); (3) From city G to city C (route is set: city G→city E→city F→city C); (4) From city E to city I (route is set: city E→city H→city I); (5) From city E to city F (route is set: city E→city F); (6) From city E to city C (route is set: city E→city F→city C); (7) From city A to city I (route is set as city A→city E→city H→city I); (8) From city A to city F (route is set: city A. Fwdarw. City E. Fwdarw. City F); (9) From city A to city C (route is set: city A. Fwdarw. City E. Fwdarw. City F. City C).
It should be noted that, there may be more than one route from one city to another, and for convenience of description, only one route (i.e., the set route) is used as the above. This is also true in practical logistics transportation where the route traveled by the transport vehicle is often fixed, although there are multiple routes from one city to another.
Further, after determining 9 possible transportation routes, the above example determines the transportation distance of each possible transportation route and the number of transit cities corresponding to each possible transportation route, and then adopts the calculation method provided by the formula (1), so as to determine the optimal transportation route. Assuming that the optimal transportation route is: from city E to city F, then the best starting city may be determined to be city E and the best destination city to be city F.
In other possible examples, the feasible transportation route with the shortest transportation distance may be determined as the optimal transportation route, or the feasible transportation route with the smallest number of transit cities may be determined as the optimal transportation route, which is not particularly limited.
In step 206, a first value of each node city being the best starting city may be determined according to the best starting city corresponding to each historical order; and, a second value that each node city is the best destination city can be determined according to the best destination city corresponding to each history order; further, a city flow value corresponding to each node city may be determined based on the first value and the second value.
Specifically, the city flow value corresponding to the node city may be determined by formula (2):
l j＝Xj+Yj formula (2)
In the formula (2), L j is a city flow value corresponding to the jth node city; x j is a first value corresponding to the jth node city; y j is the second value corresponding to the j-th node city.
In step 207, after determining the city flow value corresponding to each node city, a city that can be a logistics node can be determined.
In the implementation process, according to the city flow value corresponding to each node city, ranking the node cities from high to low according to the city flow value; then judging whether the first-ranking node city is used as a logistics node, and if the first-ranking node city is not used as the logistics node, determining the first-ranking node city as a city which can be used as the logistics node; if the first node city is already used as the logistics node, judging whether the last node city is already used as the logistics node until determining that the last node city can be used as the logistics node.
The following are examples of the apparatus of the present application that may be used to perform the method embodiments of the present application. For details not disclosed in the embodiments of the apparatus of the present application, please refer to the embodiments of the method of the present application.
Fig. 5 schematically illustrates a structural schematic diagram of an address selecting device for a logistics node according to an embodiment of the present application. As shown in FIG. 5, the device has the function of realizing the method for selecting the physical distribution node, and the function can be realized by hardware or by executing corresponding software by the hardware. The apparatus may include: an acquisition unit 501 and a processing unit 502.
An obtaining unit 501, configured to obtain a historical order sample set, where the historical order sample set includes a plurality of historical orders, and each historical order includes an issue address of a historical order and a receipt address of the historical order;
the processing unit 502 is configured to determine, for the first historical order, at least one candidate starting city from the node cities according to the location of each node city and the delivery address of the first historical order; and determining at least one candidate destination city from the node cities according to the positions of the node cities and the receiving addresses of the first historical orders; and determining an optimal starting city from the at least one candidate starting city and determining an optimal destination city from the at least one candidate destination city according to a preset city network diagram; the first historical order is any one of the plurality of historical orders;
The processing unit 502 is further configured to determine, according to an optimal starting city and an optimal destination city corresponding to each historical order, city flow values corresponding to each node city respectively; and determining the city which can be used as the logistics node from the node cities according to the city flow value corresponding to each node city.
Optionally, the processing unit 502 is specifically configured to:
Determining a first distance between the transmission address of the first historical order and each node city according to the position of each node city and the transmission address of the first historical order; ranking the node cities from small to large according to the first distance, and determining the node cities with the top N digits as the candidate initial cities; n is an integer greater than or equal to 1.
Optionally, the processing unit 502 is specifically configured to:
Determining a second distance between the receiving address of the first historical order and each node city according to the position of each node city and the receiving address of the first historical order; ranking the node cities from small to large according to the second distance, and determining the node cities with M positions before ranking as the candidate destination cities; m is an integer greater than or equal to 1.
Optionally, the processing unit 502 is specifically configured to:
Determining at least one feasible transportation route between the candidate starting city and the candidate destination city according to the preset city network diagram; determining an optimal transportation route from the at least one feasible transportation route according to the transportation distance of each feasible transportation route and the number of transit cities corresponding to each feasible transportation route; and determining a starting city corresponding to the optimal transportation route as the optimal starting city, and determining a destination city corresponding to the optimal transportation route as the optimal destination city.
Optionally, the processing unit 502 is specifically configured to:
According to the optimal initial city corresponding to each historical order, determining that each node city is a first numerical value of the optimal initial city; determining a second numerical value of each node city as the optimal destination city according to the optimal destination city corresponding to each historical order; and determining a city flow value corresponding to each node city according to the first value and the second value.
Optionally, the processing unit 502 is specifically configured to:
Ranking the node cities according to the city flow values from high to low according to the city flow values corresponding to the node cities; judging whether the first-order node city is used as a logistics node, and if the first-order node city is not used as the logistics node, determining the first-order node city as a city which can be used as the logistics node; and if the first-ranking node city is used as a logistics node, judging whether the last-ranking node city is used as the logistics node or not until determining that the last-ranking node city can be used as the logistics node.
In the embodiment of the application, according to the sending address and the receiving address of the historical order and in combination with a preset city network diagram, the optimal initial city and the optimal destination city of the historical order can be determined, further, according to the optimal initial city and the optimal destination city respectively corresponding to each historical order, the city flow value respectively corresponding to each city can be determined, and further, according to the city flow value respectively corresponding to each city, the city which can be used as a logistics node can be determined. Therefore, the embodiment of the application refers to the historical order information, so that the determined city which can be used as the logistics node meets the actual requirement, the rationality of the logistics node site selection can be improved, the logistics transportation time can be shortened, and the logistics transportation cost can be saved.
In an exemplary embodiment, there is also provided a computer-readable storage medium having stored therein a computer program or a smart contract that is loaded and executed by a node to implement the transaction method provided by the above embodiment. Alternatively, the above-mentioned computer readable storage medium may be a Read-Only Memory (ROM), a random-access Memory (Random Access Memory, RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, or the like.
It will be apparent to those skilled in the art that the techniques of embodiments of the present application may be implemented in software plus a necessary general purpose hardware platform. Based on such understanding, the technical solutions in the embodiments of the present application may be embodied in essence or what contributes to the prior art in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the embodiments or some parts of the embodiments of the present application.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any adaptations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It is to be understood that the present disclosure is not limited to the precise arrangements and instrumentalities shown in the drawings, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.
Claims (8)
1. A method for locating a logistics node, the method comprising:
acquiring a historical order sample set, wherein the historical order sample set comprises a plurality of historical orders, and each historical order comprises an issuing address of the historical order and a receiving address of the historical order;
For the first historical order, determining at least one candidate starting city from the node cities according to the positions of the node cities and the delivery addresses of the first historical order; and determining at least one candidate destination city from the node cities according to the positions of the node cities and the receiving addresses of the first historical orders; and determining an optimal starting city from the at least one candidate starting city and determining an optimal destination city from the at least one candidate destination city according to a preset city network diagram; the first historical order is any one of the plurality of historical orders;
According to the optimal initial city corresponding to each historical order, determining that each node city is a first numerical value of the optimal initial city;
determining a second numerical value of each node city as the optimal destination city according to the optimal destination city corresponding to each historical order;
determining a city flow value corresponding to each node city according to the first value and the second value;
determining a city which can be used as a logistics node from the node cities according to the city flow value corresponding to each node city;
Wherein the determining, according to the preset city network diagram, the best starting city from the at least one candidate starting city and the best destination city from the at least one candidate destination city includes:
Determining at least one feasible transportation route between the candidate starting city and the candidate destination city according to the preset city network diagram;
Determining an optimal transportation route from the at least one feasible transportation route according to the transportation distance of each feasible transportation route and the number of transit cities corresponding to each feasible transportation route;
And determining a starting city corresponding to the optimal transportation route as the optimal starting city, and determining a destination city corresponding to the optimal transportation route as the optimal destination city.
2. The method of claim 1, wherein determining at least one candidate starting city from among the node cities based on the location of the node cities and the address of the origin of the first historical order comprises:
Determining a first distance between the transmission address of the first historical order and each node city according to the position of each node city and the transmission address of the first historical order;
Ranking the node cities from small to large according to the first distance, and determining the node cities with the top N digits as the candidate initial cities; n is an integer greater than or equal to 1.
3. The method of claim 1, wherein determining at least one candidate destination city from among the node cities based on the location of the node cities and the recipient address of the first historical order comprises:
Determining a second distance between the receiving address of the first historical order and each node city according to the position of each node city and the receiving address of the first historical order;
Ranking the node cities from small to large according to the second distance, and determining the node cities with M positions before ranking as the candidate destination cities; m is an integer greater than or equal to 1.
4. A method according to any one of claims 1 to 3, wherein determining a city from the node cities that can be a logistics node based on the city flow value corresponding to each node city comprises:
ranking the node cities according to the city flow values from high to low according to the city flow values corresponding to the node cities;
Judging whether the first-ranking node city is used as a logistics node, if not, determining the first-ranking node city as a city capable of being used as the logistics node;
if the first node city is used as the logistics node, judging whether the last node city is used as the logistics node until determining that the last node city can be used as the logistics node.
5. A physical distribution node locating device, applied to a physical distribution node locating method as claimed in any one of claims 1 to 4, characterized in that the device comprises:
the system comprises an acquisition unit, a storage unit and a storage unit, wherein the acquisition unit is used for acquiring a historical order sample set, the historical order sample set comprises a plurality of historical orders, and each historical order comprises an issuing address of the historical order and a receiving address of the historical order;
The processing unit is used for determining at least one candidate starting city from the node cities according to the positions of the node cities and the delivery addresses of the first historical orders aiming at the first historical orders; and determining at least one candidate destination city from the node cities according to the positions of the node cities and the receiving addresses of the first historical orders; and determining an optimal starting city from the at least one candidate starting city and determining an optimal destination city from the at least one candidate destination city according to a preset city network diagram; the first historical order is any one of the plurality of historical orders;
The processing unit is further used for determining city flow values respectively corresponding to the node cities according to the optimal starting city and the optimal destination city respectively corresponding to each historical order; determining a city which can be used as a logistics node from the node cities according to the city flow value corresponding to each node city;
Wherein, the processing unit is specifically configured to: according to the optimal initial city corresponding to each historical order, determining that each node city is a first numerical value of the optimal initial city; determining a second numerical value of each node city as the optimal destination city according to the optimal destination city corresponding to each historical order; and determining a city flow value corresponding to each node city according to the first value and the second value;
Wherein, the processing unit is specifically further configured to: determining at least one feasible transportation route between the candidate starting city and the candidate destination city according to the preset city network diagram; determining an optimal transportation route from the at least one feasible transportation route according to the transportation distance of each feasible transportation route and the number of transit cities corresponding to each feasible transportation route; and determining a starting city corresponding to the optimal transportation route as the optimal starting city, and determining a destination city corresponding to the optimal transportation route as the optimal destination city.
6. The apparatus of claim 5, wherein the processing unit is specifically configured to:
Determining a first distance between the transmission address of the first historical order and each node city according to the position of each node city and the transmission address of the first historical order; ranking the node cities from small to large according to the first distance, and determining the node cities with the top N digits as the candidate initial cities; n is an integer greater than or equal to 1.
7. The apparatus of claim 5, wherein the processing unit is specifically configured to:
Determining a second distance between the receiving address of the first historical order and each node city according to the position of each node city and the receiving address of the first historical order; ranking the node cities from small to large according to the second distance, and determining the node cities with M positions before ranking as the candidate destination cities; m is an integer greater than or equal to 1.
8. The apparatus according to any one of claims 5 to 7, wherein the processing unit is specifically configured to:
Ranking the node cities according to the city flow values from high to low according to the city flow values corresponding to the node cities; judging whether the first-order node city is used as a logistics node, and if the first-order node city is not used as the logistics node, determining the first-order node city as a city which can be used as the logistics node; and if the first-ranking node city is used as a logistics node, judging whether the last-ranking node city is used as the logistics node or not until determining that the last-ranking node city can be used as the logistics node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010378772.4A CN111582794B (en) | 2020-05-07 | 2020-05-07 | Logistics node site selection method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010378772.4A CN111582794B (en) | 2020-05-07 | 2020-05-07 | Logistics node site selection method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111582794A CN111582794A (en) | 2020-08-25 |
| CN111582794B true CN111582794B (en) | 2024-06-07 |
Family
ID=72112081
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010378772.4A Active CN111582794B (en) | 2020-05-07 | 2020-05-07 | Logistics node site selection method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111582794B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108171452A (en) * | 2017-12-08 | 2018-06-15 | 苏宁云商集团股份有限公司 | A kind of express delivery point addressing method and device |
| CN108985694A (en) * | 2018-07-17 | 2018-12-11 | 北京百度网讯科技有限公司 | Method and apparatus for determining home-delivery center address |
| CN110033336A (en) * | 2018-01-11 | 2019-07-19 | 北京京东尚科信息技术有限公司 | Method and apparatus for determining address |
| CN110990789A (en) * | 2019-12-02 | 2020-04-10 | 中国民航工程咨询有限公司 | Planning and site selection method and system for freight airport |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11158017B2 (en) * | 2016-12-28 | 2021-10-26 | Sap Se | Warehouse management system |
-
2020
- 2020-05-07 CN CN202010378772.4A patent/CN111582794B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108171452A (en) * | 2017-12-08 | 2018-06-15 | 苏宁云商集团股份有限公司 | A kind of express delivery point addressing method and device |
| CN110033336A (en) * | 2018-01-11 | 2019-07-19 | 北京京东尚科信息技术有限公司 | Method and apparatus for determining address |
| CN108985694A (en) * | 2018-07-17 | 2018-12-11 | 北京百度网讯科技有限公司 | Method and apparatus for determining home-delivery center address |
| CN110990789A (en) * | 2019-12-02 | 2020-04-10 | 中国民航工程咨询有限公司 | Planning and site selection method and system for freight airport |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111582794A (en) | 2020-08-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109034481B (en) | Constraint programming-based vehicle path problem modeling and optimizing method with time window | |
| CN108133619B (en) | Parking lot parking prediction method and device, storage medium and terminal equipment | |
| CN108960976B (en) | Method, device and storage medium for processing reservation order | |
| CN108090722A (en) | A kind of logistics network station recognition equipment and recognition methods based on GPS | |
| CN111062530A (en) | Weighted graph-based multi-place logistics distribution route recommendation method | |
| CN111582794B (en) | Logistics node site selection method and device | |
| Gaul et al. | Solving the dynamic dial-a-ride problem using a rolling-horizon event-based graph | |
| CN110738528A (en) | Preprocessing method and system for regular freight rates | |
| CN110689180A (en) | Intelligent route planning method and system based on geographic position | |
| US20020067728A1 (en) | Route guidance service using the internet | |
| CN112215453A (en) | Inventory information processing method and device, electronic equipment and storage medium | |
| CN111415113A (en) | False express bill number identification method and device, computer equipment and storage medium | |
| CN116542591A (en) | Multi-mode intermodal route optimization method considering uncertain conditions | |
| CN111353759B (en) | Dynamic calculation method, device, equipment and storage medium for line transportation cost | |
| CN114897468A (en) | Logistics cargo transportation tracking system based on Internet of things | |
| CN114090554A (en) | Division method for position and live balance area of resident travel OD | |
| CN114998078A (en) | Urban bus departure frequency optimization method considering carbon emission | |
| RU2747711C1 (en) | Information processing device, energy independent media and system | |
| US11321661B1 (en) | Method for building and filtering carrier shipment routings | |
| CN114742507A (en) | Vehicle cargo loading method and device, computer equipment and storage medium | |
| KR100869755B1 (en) | Logistics delivery method using a highway | |
| Chucre et al. | Taxi, please! a nearest neighbor query in time-dependent road networks | |
| CN111382907A (en) | Method, system, computer device and storage medium for planning lane | |
| CN113793062A (en) | Order dispatching method for improving order efficiency under network appointment vehicle transport capacity | |
| CN113821736B (en) | Method, device, equipment and medium for predicting vehicle destination based on prefix tree |
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 |