CN110428192B - Community distribution path planning method and device - Google Patents
Community distribution path planning method and device Download PDFInfo
- Publication number
- CN110428192B CN110428192B CN201910198255.6A CN201910198255A CN110428192B CN 110428192 B CN110428192 B CN 110428192B CN 201910198255 A CN201910198255 A CN 201910198255A CN 110428192 B CN110428192 B CN 110428192B
- Authority
- CN
- China
- Prior art keywords
- community
- distribution
- path
- information
- node
- 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
- 238000009826 distribution Methods 0.000 title claims abstract description 229
- 238000013439 planning Methods 0.000 title claims abstract description 55
- 238000000034 method Methods 0.000 title claims abstract description 37
- 238000012937 correction Methods 0.000 claims description 24
- 238000003860 storage Methods 0.000 claims description 12
- 239000011159 matrix material Substances 0.000 claims description 11
- 238000010276 construction Methods 0.000 claims description 9
- 230000004048 modification Effects 0.000 claims description 5
- 238000012986 modification Methods 0.000 claims description 5
- 238000012163 sequencing technique Methods 0.000 claims description 4
- 230000003993 interaction Effects 0.000 abstract description 6
- 230000008569 process Effects 0.000 description 6
- 238000012384 transportation and delivery Methods 0.000 description 3
- 238000011156 evaluation Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000007792 addition Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000000877 morphologic effect Effects 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a community distribution path planning method and a device, after a community distribution path model is constructed and community information sent by a client terminal is received, a community distribution path is planned based on the community information and the constructed community distribution path model, a user inputs user community information by using the client terminal, including but not limited to community basic information, roadblock information, community life experience information, residential building basic information, user room structure information, community surrounding road condition information, user real-time information and the like, the community distribution path is planned for a distributor based on the community information, so that the distributor can use a distribution terminal to distribute according to a community distribution map, in the community logistics interaction mode, the user inputs community information according to the actual condition of the community aiming at each distribution, the best guidance of community distribution can be provided for the distributor by combining the specific condition of the community, avoiding the difficulties that may be encountered in the last hundred meters of logistics, thereby improving the distribution efficiency.
Description
Technical Field
The invention belongs to the technical field of logistics, and particularly relates to a community distribution path planning method and device.
Background
According to data published by the Chinese logistics and procurement association, the total logistics cost of China in 2012 reaches 9.4 trillion, which accounts for 18% of the total value of national production. According to the research of Chinese electronic commerce, the logistics terminal distribution cost of China accounts for more than 30% of the total logistics cost in 2014, the one-time distribution failure rate is about 12%, and the overall satisfaction of online shopping express services is 38.9%.
In electronic commerce logistics, packages are delivered from the last one hundred meters away from customers after long-distance transportation, so that the efficiency of delivering the packages to the customers is greatly reduced due to unforeseen complex conditions, and the electronic commerce logistics mainly show that goods delivery timeliness is poor, the goods loss rate is high, the service quality is low, the delivery cost is high, and the like.
The lack of information makes couriers encounter various difficulties in making the last one hundred meters deliveries, such as: the vehicle is around; the traffic-obstructing road conditions such as downtown city exist in the community; due to strict property management of a residential area or an office building, a dispatcher is difficult to enter and cannot send express to a receiver; due to the change of the user time window, the pickup cannot be finished in the piece sending time, and secondary distribution is needed; in the process of dispatching large logistics such as household appliances, the last hundred meters of problems are more obvious, the efficiency of dispatching the large logistics is influenced, and dispatching personnel can suffer from the problems that the passageway cannot be passed, the house door cannot enter and the like when completing the door-entering service of orders such as a refrigerator, a color TV and the like, so that articles are damaged or forced to retreat, and the efficiency of the logistics dispatching process is reduced.
Disclosure of Invention
The application provides a community distribution path planning method and device, and solves the technical problem that distribution efficiency is low in last one hundred meters of distribution of existing logistics.
In order to solve the technical problems, the application adopts the following technical scheme:
a community distribution path planning method is provided, which comprises the following steps: receiving community information sent by a client terminal; community-based distribution path model
，
planning a time-optimal path in the initial community distribution path and the optimal path as a community distribution path; wherein,
when the path of the community is the shortest,
for use from the doorway of a residential building to the doorway of a user,
when the utility model is used from the community door to the residential building door,
in order to obtain the distance between the community nodes,
average time from the door of the residential building to the door of the user; i represents a user, j represents the number of community distribution route books, and k represents a building number.
Further, before constructing the community distribution path model, the method further comprises: adjacent matrix for constructing community distribution path
(ii) a Wherein,
is the distance between any two nodes in the community.
Further, before constructing the adjacency matrix of the community distribution path, the method further comprises: determining nodes in the community; the nodes include inflection points and intersections.
Further, determining an inflection point in the community specifically includes: for any node, determining a starting point and an end point according to the forward distance and the backward distance of the node; determining the vertical distance from the node to a connecting line of a starting point and a terminal point; determining whether the node is an inflection point according to the ratio of the vertical distance to the distance between the starting point and the end point; determining the access in the community specifically comprises: determining the number of non-separated roads for any node; when the number of roads of the node which are not separated from the node is 4, determining the node as a crossing; when the number of roads of the node which are not separated from the node is 2, determining a starting point and an end point according to the forward distance and the backward distance of the node, determining the vertical distance from the node to a connecting line of the starting point and the end point, and determining whether the node is an inflection point according to the ratio of the vertical distance to the distance between the starting point and the end point.
Further, after planning a time-optimal path of the initial community distribution path and the optimal path as a community distribution path, the method further includes: receiving community correction information, optimizing a community distribution path based on the community correction information and the community distribution path model, and performing priority sequencing on the optimized community distribution path and the storage path.
The community distribution path planning device comprises a community distribution path model building module and a community distribution path planning module; the community distribution path model construction module is used for constructing a community distribution path model
，
Further, the device also comprises an adjacency matrix construction module which is used for constructing an adjacency matrix of the community distribution path
(ii) a Wherein,
is the distance between any two nodes in the community.
Further, the apparatus further comprises a node determining module, configured to determine a node in the community; the nodes include inflection points and intersections.
Further, the node determination module comprises an inflection point determination unit and an intersection determination unit; the inflection point determining unit is used for determining an inflection point in the community: for any node, determining a starting point and an end point according to the forward distance and the backward distance of the node; determining the vertical distance from the node to a connecting line of a starting point and a terminal point; determining whether the node is an inflection point according to the ratio of the vertical distance to the distance between the starting point and the end point; the intersection determining unit is used for determining an intersection in the community: determining the number of non-separated roads for any node; when the number of roads of the node which are not separated from the node is 4, determining the node as a crossing; when the number of roads of the node which are not separated from the node is 2, determining a starting point and an end point according to the forward distance and the backward distance of the node, determining the vertical distance from the node to a connecting line of the starting point and the end point, and determining whether the node is an inflection point according to the ratio of the vertical distance to the distance between the starting point and the end point.
Further, the device also comprises a community information correction module and a path sequencing module; the community information correction module is used for pushing a community information correction window, receiving community correction information and correcting the community distribution path based on the community correction information; and the path sorting module is used for sorting the community distribution paths and the storage paths according to the priority of the distribution time after the distribution based on the community distribution paths is completed.
Compared with the prior art, the application has the advantages and positive effects that: in the community distribution path planning method and device, after a community distribution path model is built and community information sent by a client terminal is received, a community distribution path is planned based on the community information and the built community distribution path model, a user inputs user community information including but not limited to community basic information, roadblock information, community life experience information, residential building basic information, user room structure information, community surrounding road condition information, user real-time information and the like by using the client terminal, so that the community distribution path planning device plans a community distribution path for a distributor based on the community information, the distributor can use the distribution terminal to distribute according to a community distribution map, in the community logistics interaction mode, the community information is input by the user according to the actual condition of the community aiming at each distribution, the best guidance of community distribution can be provided for the distributor by combining the specific condition of the community, various difficulties possibly encountered in the last hundred meters of logistics are avoided, so that the distribution efficiency is improved, and the technical problem of low distribution efficiency of the existing logistics in the last hundred meters is solved.
Other features and advantages of the present application will become more apparent from the detailed description of the embodiments of the present application when taken in conjunction with the accompanying drawings.
Drawings
Fig. 1 is a flowchart of a community distribution path planning method proposed in the present application;
FIG. 2 is an architecture diagram of a community logistics interaction system as applied in the present application;
fig. 3 is a schematic view of an application interface of a client terminal according to the present application.
Detailed Description
The following description of the embodiments of the present application will be made in detail with reference to the accompanying drawings.
The community distribution path planning method is mainly used for the final 100 m community distribution of large logistics and is realized based on a community logistics interaction system shown in fig. 3, the community logistics interaction system is composed of a client terminal 1, a service terminal 2 and distribution terminals 3, the client terminal is operated by a user, the service terminal is a logistics management terminal, and the distribution terminals are operated and used by distributors. The community distribution path planning method is applied to the service terminal, so that the community distribution path planning device provided by the application corresponds to the service terminal.
Specifically, the community distribution path planning method provided by the application, as shown in fig. 1, includes the following steps:
step S11: receiving community information sent by a client terminal; and step S12:
community-based distribution path model
，
The client terminal 1 comprises a community information acquisition module for receiving community information input by a client; specifically, at a client terminal, a user can input community information through a provided input interface; here, the community information includes, but is not limited to, community basic information, roadblock information, community life experience information, residential building basic information, user room configuration information, community surrounding road condition information, and/or user real-time information, and as shown in fig. 3, the client terminal provides an input mode based on options, and the user can input information on whether there is an elevator in the community, whether there is an underground garage in the community, whether there is a special roadblock around the community, whether there is temporary construction around the community, whether there is a person outside the community to enter, and the width of a gate according to a prompt, and after collecting the community information input by the user, the client terminal sends the community information to the service terminal 2 based on network connection.
Step S13: and planning the initial community distribution path and the time-optimal path in the optimal path as a community distribution path.
After receiving the community information, the service terminal 2 plans an initial community distribution path jointly by combining with community initial information obtained in a mode of signing a contract with the community or visiting the community before and combining with a community distribution path model, after the initial community distribution path is planned, the service terminal 2 estimates distribution time of the initial community distribution path and compares the estimated distribution time with the distribution time of an optimal path in a storage path, and selects a path with the shortest distribution time as a final community planning path to be sent to the distribution terminal 3, wherein the storage path is a community distribution path in a distribution event occurring before current distribution.
The distribution terminal 3 generates and displays a community distribution map based on the community distribution path related information, so that a distributor can complete community distribution based on the community distribution map, and the community distribution map is generated based on the community information, the distance between a community gate and a residential building, whether the community has a parking lot or not, whether a special fault road section exists in the community or not, whether an elevator exists in the residential building or not can be considered, so that the distributor can clearly determine a distribution process, know obstacles and special conditions possibly encountered in a distribution process, realize the technical effect of providing the best guidance of community distribution for the distributor by combining the specific conditions of the community, avoid various difficulties possibly encountered in the last hundred meters of logistics, improve the distribution efficiency, and solve the technical problem of low distribution efficiency of the existing logistics in the last hundred meters of distribution.
Specifically, after receiving the community information, the service terminal 2 is based on the community information and the community distribution route model
，
In the above, the community node distance is obtained by constructing an adjacency matrix of the community distribution path:
The node includes an inflection point and an intersection, the inflection point refers to a turn of a road, and the intersection refers to an intersection of two or more roads.
According to the initial community information, the inflection point is determined in the following way: determining a starting point and an end point according to the forward distance and the backward distance; for any node, determining the vertical distance from the node to a connecting line of a starting point and a terminal point; and determining whether the node is an inflection point according to the ratio of the vertical distance to the distance between the starting point and the end point. Specifically, for any node, the distance lengths in the forward direction and the backward direction are respectively set as BA and AC, the starting point of BA is set as b, the end point of AC is set as a, in order to finish the judgment of the inflection point significance degree, a length threshold value is set as 10m, and if the forward length and the backward length of the node are smaller than the threshold value, the position in the forward direction and the backward direction is set as the end point; calculating the distance L between the ab starting point and the ab finishing point; in order to judge the significance degree of the inflection point, the vertical distance h between the node and the ab is calculated, the significance index of the other inflection point is c, so that c = h/L, and a significance threshold value is set to be K according to actual conditions, and if c > K, the node is the inflection point.
According to the initial community information, determining the path in the community according to the following mode: determining the number of non-separated roads for any node; when the number of roads of the node which are not separated from the node is 4, determining the node as a crossing; when the number of roads of the node which are not separated from the node is 2, determining a starting point and an end point according to the forward distance and the backward distance of the node, determining the vertical distance from the node to a connecting line of the starting point and the end point, and determining whether the node is an inflection point according to the ratio of the vertical distance to the distance between the starting point and the end point. Specifically, according to the spatial characteristics of the road intersections, extracting intersection points among all roads in the community, setting each intersection point as i, and totally having n intersection points, starting from i, inquiring all roads which are not separated from the intersection points, marking each road and storing the road into a linked list namelist to form a dictionary of the community intersection; for an i-node, all non-separated road elements are set as candidate intersections if the number of the non-separated elements is less than 2, and the candidate intersections are added into namelist, if the number of the added namelist elements is 2, the significance index c of the node is calculated in a turning point significance index calculation mode, if c is larger than K, the node is considered as an intersection and added into a dictionary of the intersection, and if the number of the added namelist elements is larger than 2, the node is considered as an intersection and added into the dictionary.
After step S13, the community distribution path planning method proposed by the present application further includes step S14: receiving community correction information, and step S15: optimizing the community distribution path based on the community correction information and the community distribution path model, and step S16: and carrying out priority sequencing on the optimized community distribution path and the storage path.
As shown in fig. 2, in the embodiment of the present application, the distribution terminal 3 further includes a distribution evaluation module 32, configured to modify, after the distributor completes distribution based on the community distribution map, the community information input by the user based on a prompt on a display interface, that is, in a distribution process, if the community information input by the user is found to be missed or wrong, the distributor modifies the community information based on the distribution evaluation module, and after receiving the input community modification information, the distribution terminal sends the community modification information to the service terminal, so that the community path planning module 21 modifies the community distribution path for subsequent distribution by using the community distribution path model based on the community modification information.
Specifically, the modified community distribution paths are stored, and are subjected to priority sorting with the distribution paths stored in the service terminal according to the previous distribution, for example, the distribution time is shortest, for example, the distribution average speed is highest, for example, the distribution path has the least special fault, or the like, or the above manners are combined to perform priority sorting, and the optimal distribution path can be pushed to the distributor according to the priority sorting when the distribution is performed next time.
Considering the error of the route deviation, the method sets the route similarity threshold value in the background database
After the distributor carries out one distribution operation, the system is used for the distribution path
Calculating distribution route according to spatial characteristics and morphological structure of road intersection and corner
And the current optimal distribution path
Degree of similarity of
(ii) a If it is
≤
The matching degree of the new path and the optimal path is within the tolerance range, and then the method is used for calculating the matching degree of the new path and the optimal path
And
comparing, judging the priority of the new path, and adding it into the original sequence if it is
And if the current community distribution path is not stored, reducing the redundant data volume of the system.
In consideration of the repeatability of the community information of the client terminal, in order to reduce the complexity of inputting the community information by a user and improve the user service satisfaction degree, in the embodiment of the application, after receiving the community correction information, the community correction information is compared with the stored community information, and when the matching degree of the community correction information and the stored community information is smaller than a set threshold value, the community correction information is marked as default community information; that is, the information matching degree threshold is set in the background database
After the system finishes the matching of the order information of the user terminal and the distribution terminal every time, the corrected community information is used
Matching with database history information when
≥
Then, the ith information is defined as the known correct information, and the user input process is carried out laterIn the method, the ith information can not be filled, so that the information filling amount of a user is reduced.
Based on the above proposed community distribution path planning method, the present application further proposes a community distribution path planning apparatus, which corresponds to the service terminal 2, specifically, as shown in fig. 2, includes a community distribution path model building module 43 and a community distribution path planning module 21; the community distribution path model construction module 43 is used for constructing a community distribution path model
The community distribution path planning apparatus provided by the present application further includes an adjacency matrix construction module 44, configured to construct an adjacency matrix of the community distribution path
(ii) a Wherein,
as a communityThe spacing between any two nodes.
The community distribution path planning device provided by the application further comprises a node determination module 45, which is used for determining nodes in the community; the nodes include inflection points and intersections.
Specifically, the node determination module 45 includes a inflection point determination unit 451 and an intersection determination unit 452; the inflection point determination unit 451 is configured to determine an intra-community inflection point: for any node, determining a starting point and an end point according to the forward distance and the backward distance of the node; determining the vertical distance from the node to a connecting line of a starting point and a terminal point; determining whether the node is an inflection point according to the ratio of the vertical distance to the distance between the starting point and the end point; the intersection determination unit 452 is configured to determine an intersection within a community: determining the number of non-separated roads for any node; when the number of roads of the node which are not separated from the node is 4, determining the node as a crossing; when the number of roads of the node which are not separated from the node is 2, determining a starting point and an end point according to the forward distance and the backward distance of the node, determining the vertical distance from the node to a connecting line of the starting point and the end point, and determining whether the node is an inflection point according to the ratio of the vertical distance to the distance between the starting point and the end point.
The community distribution path planning device provided by the application further comprises a community information correction module 25 and a path sorting module 27; the community information correction module 25 is configured to push a community information correction window, receive community correction information, and correct a community distribution path based on the community correction information; the path sorting module 27 is configured to sort the community distribution paths and the storage paths according to the priority of the distribution time after the distribution based on the community distribution paths is completed.
The specific community distribution path planning method of the community distribution path planning apparatus has been described in detail in the above community distribution path planning method, and is not described herein again.
In the method and the device for planning the community distribution path, after a community distribution path model is built and community information sent by a client terminal is received, the community distribution path is planned based on the community information and the built community distribution path model, a user inputs user community information by using the client terminal, including but not limited to community basic information, roadblock information, community life experience information, residential building basic information, user room structure information, community surrounding road condition information, user real-time information and the like, so that the community distribution path planning device plans the community distribution path for a distributor based on the community information, the distributor can use the distribution terminal to distribute according to a community distribution map, in the community logistics interaction mode, the user inputs community information according to the actual condition of the community aiming at each distribution, the best guidance of the community distribution can be provided for the distributor by combining the specific condition of the community, various difficulties possibly encountered in the last hundred meters of logistics are avoided, so that the distribution efficiency is improved, and the technical problem of low distribution efficiency of the existing logistics in the last hundred meters is solved.
It should be noted that the above description is not intended to limit the present invention, and the present invention is not limited to the above examples, and those skilled in the art should also make changes, modifications, additions or substitutions within the spirit and scope of the present invention.
Claims (10)
1. The community distribution path planning method is characterized by comprising the following steps:
the method comprises the steps that a client terminal provides an input interface and prompts input of community information, wherein the community information comprises community basic information, roadblock information, community life experience information, residential building basic information, user room structure information, community surrounding road condition information and/or user real-time information; the user inputs community information of whether an elevator exists in the community, whether an underground garage exists in the community, whether special roadblocks exist around the community, whether temporary construction exists around the community, whether external personnel in the community can enter and/or the width of a gate according to the prompt;
receiving community information sent by a client terminal;
community-based distribution path model
，
planning a time-optimal path in the initial community distribution path and the optimal path as a community distribution path; the optimal path is the estimated distribution time of the initial community distribution path, the distribution time of the optimal path in the storage path is compared, the path with the shortest distribution time is selected as the final community planning path to be sent to the distribution terminal, and the storage path is the community distribution path in the distribution event occurring before the current distribution;
wherein,
when the path of the community is the shortest,
for use from the doorway of a residential building to the doorway of a user,
when the utility model is used from the community door to the residential building door,
in order to obtain the distance between the community nodes,
average time from the door of the residential building to the door of the user; i represents a user, j represents the number of community distribution routes, and k represents a building number;
and the distribution terminal generates and displays a community distribution map based on the final community planning path, so that a distributor can connect the distance between a community door and a residential building, whether the community has a parking lot, whether a special fault road section exists in the community, and/or whether the residential building has an elevator based on the community distribution map.
2. The community distribution path planning method according to claim 1, wherein before constructing the community distribution path model, the method further comprises:
adjacent matrix for constructing community distribution path
(ii) a Wherein,
is the distance between any two nodes in the community.
3. The community distribution path planning method according to claim 2, wherein before constructing the adjacency matrix of the community distribution path, the method further comprises: determining nodes in the community; the nodes include inflection points and intersections.
4. The community distribution path planning method according to claim 3, wherein the determining of the inflection point in the community specifically comprises:
for any node, determining a starting point and an end point according to the forward distance and the backward distance of the node;
determining the vertical distance from the node to a connecting line of a starting point and a terminal point;
determining whether the node is an inflection point according to the ratio of the vertical distance to the distance between the starting point and the end point;
determining the access in the community specifically comprises:
determining the number of non-separated roads for any node;
when the number of roads of the node which are not separated from the node is 4, determining the node as a crossing; when the number of roads of the node which are not separated from the node is 2, determining a starting point and an end point according to the forward distance and the backward distance of the node, determining the vertical distance from the node to a connecting line of the starting point and the end point, and determining whether the node is an inflection point according to the ratio of the vertical distance to the distance between the starting point and the end point.
5. The community distribution path planning method according to claim 1, wherein after planning a time-optimal path of the initial community distribution path and the optimal path as the community distribution path, the method further comprises: receiving community correction information, optimizing a community distribution path based on the community correction information and the community distribution path model, and performing priority sequencing on the optimized community distribution path and the storage path.
6. The community distribution path planning device is characterized by comprising a community distribution path model building module and a community distribution path planning module;
the community distribution path model construction module is used for constructing a community distribution path model
，
The community distribution path planning module is used for receiving community information sent by the client terminal;
generating an initial community distribution path based on the community information and the community distribution path model, and planning a time-optimal path in the initial community distribution path and the optimal path as a community distribution path; the optimal path is the estimated distribution time of the initial community distribution path, the distribution time of the initial community distribution path is compared with the distribution time of the optimal path in a storage path, the path with the shortest distribution time is selected as a final community planning path to be sent to a distribution terminal, and the storage path is the community distribution path in a distribution event occurring before current distribution;
wherein,
when the path of the community is the shortest,
for use from the doorway of a residential building to the doorway of a user,
when the utility model is used from the community door to the residential building door,
the distance between the nodes in the community is,
average time from the door of the residential building to the door of the user; i represents a user, j represents the number of community distribution routes, and k represents a building number;
the client terminal provides an input interface and prompts input of community information, wherein the community information comprises community basic information, roadblock information, community life experience information, residential building basic information, user room structure information, community surrounding road condition information and/or user real-time information; the user inputs community information of whether an elevator exists in the community, whether an underground garage exists in the community, whether special roadblocks exist around the community, whether temporary construction exists around the community, whether external personnel in the community can enter and/or the width of a gate according to the prompt; the distribution terminal generates and displays a community distribution map based on the final community planning path, so that a distributor can connect the distance between a community gate and a residential building based on the community distribution map, whether the community has a parking lot, whether a special fault road section exists in the community, and/or whether the residential building has an elevator.
7. The community distribution path planning apparatus according to claim 6, further comprising an adjacency matrix construction module for constructing an adjacency matrix of the community distribution path
(ii) a Wherein,
is the distance between any two nodes in the community.
8. The community distribution path planning apparatus according to claim 6, further comprising a node determination module configured to determine nodes in a community; the nodes include inflection points and intersections.
9. The community distribution path planning apparatus according to claim 8, wherein the node determining module includes an inflection point determining unit and an intersection determining unit;
the inflection point determining unit is used for determining an inflection point in the community: for any node, determining a starting point and an end point according to the forward distance and the backward distance of the node; determining the vertical distance from the node to a connecting line of a starting point and a terminal point; determining whether the node is an inflection point according to the ratio of the vertical distance to the distance between the starting point and the end point;
the intersection determining unit is used for determining an intersection in the community: determining the number of non-separated roads for any node; when the number of roads of the node which are not separated from the node is 4, determining the node as a crossing; when the number of roads of the node which are not separated from the node is 2, determining a starting point and an end point according to the forward distance and the backward distance of the node, determining the vertical distance from the node to a connecting line of the starting point and the end point, and determining whether the node is an inflection point according to the ratio of the vertical distance to the distance between the starting point and the end point.
10. The community distribution path planning apparatus according to claim 6, further comprising a community information modification module and a path sorting module;
the community information correction module is used for pushing a community information correction window, receiving community correction information and correcting the community distribution path based on the community correction information; and the path sorting module is used for sorting the community distribution paths and the storage paths according to the priority of the distribution time after the distribution based on the community distribution paths is completed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910198255.6A CN110428192B (en) | 2019-03-15 | 2019-03-15 | Community distribution path planning method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910198255.6A CN110428192B (en) | 2019-03-15 | 2019-03-15 | Community distribution path planning method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110428192A CN110428192A (en) | 2019-11-08 |
| CN110428192B true CN110428192B (en) | 2022-06-14 |
Family
ID=68408359
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910198255.6A Active CN110428192B (en) | 2019-03-15 | 2019-03-15 | Community distribution path planning method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110428192B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104766188A (en) * | 2014-01-02 | 2015-07-08 | 中国移动通信集团江苏有限公司 | Logistics distribution method and logistics distribution system |
| CN107977739A (en) * | 2017-11-22 | 2018-05-01 | 深圳北斗应用技术研究院有限公司 | Optimization method, device and the equipment in logistics distribution path |
| CN109033484A (en) * | 2018-03-30 | 2018-12-18 | 东莞产权交易中心 | A kind of large size community's inner conduit path planning system and method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170116564A1 (en) * | 2011-01-30 | 2017-04-27 | Beijing Co-Link Word Technology Co. Ltd | Method and system for transferring object across one or more geographical areas |
-
2019
- 2019-03-15 CN CN201910198255.6A patent/CN110428192B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104766188A (en) * | 2014-01-02 | 2015-07-08 | 中国移动通信集团江苏有限公司 | Logistics distribution method and logistics distribution system |
| CN107977739A (en) * | 2017-11-22 | 2018-05-01 | 深圳北斗应用技术研究院有限公司 | Optimization method, device and the equipment in logistics distribution path |
| CN109033484A (en) * | 2018-03-30 | 2018-12-18 | 东莞产权交易中心 | A kind of large size community's inner conduit path planning system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110428192A (en) | 2019-11-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110059857A (en) | Community distribution path recommended method and device | |
| CN110046745B (en) | Community distribution path optimization method and device | |
| CN110060001A (en) | Community's logistics interactive system | |
| CN106779163B (en) | Customized public transport network optimization method based on intelligent search | |
| CN105674995A (en) | Method for acquiring commuting route based on user's travel locus, and apparatus thereof | |
| CN107944611B (en) | Cross-mode combined travel planning method for personalized travel demand | |
| CN112378415B (en) | Scheduling planning method, device and equipment for tools and appliances | |
| CN104217605A (en) | Bus arrival time estimation method and device | |
| CN110097218B (en) | Unmanned commodity distribution method and system in time-varying environment | |
| CN114170797B (en) | Method, device, equipment, medium and product for identifying traffic restriction intersection | |
| CN110060000A (en) | Community distribution path generating method and device | |
| CN109308574A (en) | A kind of flexible bus dispatching method in internet of real-time response half | |
| CN107341551A (en) | A kind of electric vehicle leasing system and its management method | |
| CN116108169A (en) | Hot wire work order intelligent dispatching method based on knowledge graph | |
| CN108647821A (en) | A kind of differential evolution logistics distribution method for optimizing route based on Parameter Self-learning | |
| CN113128788A (en) | Power emergency material conveying path optimization method and device and storage medium | |
| WO2022262741A9 (en) | Efficient gps trajectory map matching method | |
| CN114021763A (en) | Intelligent parking space reservation method and system | |
| CN110674990B (en) | Instant distribution path selection method and system with sliding window updating mechanism | |
| CN110991794B (en) | Urban rail and public transport two-network fusion level evaluation method | |
| CN110428192B (en) | Community distribution path planning method and device | |
| CN111882915A (en) | On-demand bus route planning method adopting composite algorithm and interactive model | |
| WO2019119457A1 (en) | Model factor calculation-based method and device for dynamic vehicle pickup-and-delivery route planning | |
| CN112801354A (en) | Route planning method and device | |
| CN110827563B (en) | Parking guidance system and method based on most reliable path |
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 | ||
| CB02 | Change of applicant information |
Address after: 266101 Haier Industrial Park, Haier Road, Laoshan District, Shandong, Qingdao, China Applicant after: Ririshun Supply Chain Technology Co.,Ltd. Address before: 266101 Haier Industrial Park, Haier Road, Laoshan District, Shandong, Qingdao, China Applicant before: QINGDAO RIRISHUN LOGISTICS Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |