CN111461430A - Method and device for generating route information - Google Patents
Method and device for generating route information Download PDFInfo
- Publication number
- CN111461430A CN111461430A CN202010245163.1A CN202010245163A CN111461430A CN 111461430 A CN111461430 A CN 111461430A CN 202010245163 A CN202010245163 A CN 202010245163A CN 111461430 A CN111461430 A CN 111461430A
- Authority
- CN
- China
- Prior art keywords
- processed
- point
- information
- taking
- initial
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 51
- 238000004590 computer program Methods 0.000 claims description 10
- 230000004044 response Effects 0.000 claims description 10
- 238000010586 diagram Methods 0.000 description 12
- 238000003860 storage Methods 0.000 description 10
- 230000006870 function Effects 0.000 description 7
- 238000004422 calculation algorithm Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000005457 optimization Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 239000003795 chemical substances by application Substances 0.000 description 3
- 238000005070 sampling Methods 0.000 description 3
- 230000002776 aggregation Effects 0.000 description 2
- 238000004220 aggregation Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 238000002485 combustion reaction Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 239000004065 semiconductor Substances 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)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (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)
- Navigation (AREA)
Abstract
The embodiment of the disclosure discloses a method and a device for generating route information, and belongs to the technical field of cloud computing. One embodiment of the method comprises: acquiring a network point information set to be processed, wherein the network point information set to be processed comprises a geographical position label; clustering to-be-processed website information in the to-be-processed website information set according to the geographical position label of the to-be-processed website information set, and determining at least one to-be-processed single-point-taking, wherein the to-be-processed single-point-taking comprises single-point-taking position information; and generating at least one list arranging route corresponding to the at least one to-be-processed single point according to the single point taking position information of the to-be-processed single point in the at least one to-be-processed single point. This embodiment is advantageous for improving the singulating efficiency.
Description
Technical Field
The embodiment of the disclosure relates to the technical field of computers, in particular to a method and a device for generating route information.
Background
Vehicle Routing Planning (VRP) is one of the most classical optimization problems in the field of logistics. Generally, in solving the problem, the decision variable to be optimized is the vehicle to which the delivery task of each customer should be allocated, and the optimization goal can be to minimize the number of used vehicles and the total travel distance of the vehicles.
Disclosure of Invention
The embodiment of the disclosure provides a method and a device for generating route information.
In a first aspect, an embodiment of the present disclosure provides a method for generating route information, the method including: acquiring a network point information set to be processed, wherein the network point information set to be processed comprises a geographical position label; clustering to-be-processed website information in the to-be-processed website information set according to the geographical position label of the to-be-processed website information set, and determining at least one to-be-processed single-point-taking, wherein the to-be-processed single-point-taking comprises single-point-taking position information; and generating at least one list arranging route corresponding to the at least one to-be-processed single point according to the single point taking position information of the to-be-processed single point in the at least one to-be-processed single point.
In some embodiments, the clustering the to-be-processed website information in the to-be-processed website information set according to the geographical location tag of the to-be-processed website information set to determine at least one to-be-processed point of taking includes: acquiring a site map corresponding to the geographical position label, and marking the site information to be processed contained in the site information set to be processed on the site map according to the position information to obtain an initial ordering map; and clustering the information of the to-be-processed websites on the initial list ranking map, and determining at least one to-be-processed single-point-taking point.
In some embodiments, the clustering the to-be-processed website information on the initial ranking map and determining at least one to-be-processed point to be taken includes: clustering the information of the to-be-processed network points on the initial ordering map to obtain at least one initial network point cluster; for an initial mesh point cluster in the at least one initial mesh point cluster, when the number of the mesh point information to be processed contained in the initial mesh point cluster is less than or equal to a set number threshold, marking the initial mesh point cluster as a to-be-processed single point, when the number of the mesh point information to be processed contained in the initial mesh point cluster is greater than the set number threshold, dividing the initial mesh point cluster into at least one sub-initial mesh point cluster, and marking the sub-initial mesh point cluster as the to-be-processed single point, wherein the number of the mesh point information to be processed contained in the sub-initial mesh point cluster is not greater than the set number threshold.
In some embodiments, the generating at least one list arranging route corresponding to the at least one to-be-processed single point according to the single point taking location information of the to-be-processed single point of the at least one to-be-processed single point comprises: acquiring at least one piece of single-taking stroke information, wherein the single-taking stroke information comprises a single-taking starting point and a single-taking coincident point; and matching the at least one piece of single taking stroke information with the unit taking position information of the to-be-processed single taking point in the at least one to-be-processed single taking point to obtain and generate at least one list arranging route.
In some embodiments, the matching the at least one piece of fetch single-stroke information with the fetch unit location information of the to-be-processed fetch single point of the at least one to-be-processed fetch single point to obtain and generate at least one sort-single route includes: in response to acquiring a constraint condition corresponding to the single-stroke taking information, merging the to-be-processed single-point taking points according to the constraint condition, wherein the constraint condition comprises at least one of the following items: time constraints and loading constraints.
In some embodiments, the matching the at least one piece of fetch single-stroke information with the fetch unit location information of the to-be-processed fetch single point of the at least one to-be-processed fetch single point to obtain and generate at least one sort-single route includes: and in response to the existence of a list arranging route which connects at least two to-be-processed single points in the at least one list arranging route, setting a priority for each to-be-processed single point in the at least two to-be-processed single points connected by the list arranging route according to the road network information, wherein the priority is used for representing a list taking sequence between the at least two to-be-processed single points connected by the list arranging route.
In a second aspect, an embodiment of the present disclosure provides an apparatus for generating route information, the apparatus including: the system comprises an information acquisition unit, a processing unit and a processing unit, wherein the information acquisition unit is configured to acquire a to-be-processed website information set, and the to-be-processed website information set comprises a geographical position tag; the to-be-processed single point taking determination unit is configured to cluster the to-be-processed website information in the to-be-processed website information set according to the geographical position label of the to-be-processed website information set, and determine at least one to-be-processed single point taking, wherein the to-be-processed single point taking comprises single point taking position information; and the route generating unit is configured to generate at least one list arranging route corresponding to the at least one to-be-processed single point taking point according to the single point taking position information of the to-be-processed single point taking point in the at least one to-be-processed single point taking point.
In some embodiments, the to-be-processed node includes location information, and the to-be-processed node-taking determination unit includes: an initial ordering map obtaining subunit, configured to obtain a dot map corresponding to the geographic position tag, and mark, according to the position information, to-be-processed dot information included in the to-be-processed dot information set on the dot map to obtain an initial ordering map; and the to-be-processed single point taking determination subunit is configured to cluster the to-be-processed website information on the initial list arranging map and determine at least one to-be-processed single point taking.
In some embodiments, the to-be-processed single-point-taking determination subunit includes: the initial website cluster acquisition module is configured to cluster the website information to be processed on the initial listing map to obtain at least one initial website cluster; and the to-be-processed point-picking determining module is configured to mark an initial point cluster as a to-be-processed point-picking when the number of the to-be-processed point information contained in the initial point cluster is less than or equal to a set number threshold, and divide the initial point cluster into at least one sub-initial point cluster and mark the sub-initial point cluster as a to-be-processed point-picking when the number of the to-be-processed point information contained in the initial point cluster is greater than the set number threshold, wherein the number of the to-be-processed point information contained in the sub-initial point cluster is not greater than the set number threshold.
In some embodiments, the route generation unit includes: a fetch single-stroke information obtaining subunit configured to obtain at least one fetch single-stroke information, where the fetch single-stroke information includes a fetch single-start point and a fetch single-repeat point; and the route generating subunit is configured to match the at least one piece of single taking route information with the unit taking position information of the to-be-processed single taking point in the at least one to-be-processed single taking point to obtain and generate at least one list arranging route.
In some embodiments, the route generation subunit includes: the to-be-processed point taking and merging module is used for responding to the constraint condition of acquiring the corresponding single taking stroke information and is configured to merge the to-be-processed point taking and merging according to the constraint condition, wherein the constraint condition comprises at least one of the following conditions: time constraints and loading constraints.
In some embodiments, the route generation subunit includes: the to-be-processed single point taking priority setting module is configured to set a priority for each to-be-processed single point taking in the at least two to-be-processed single points connected with the at least one single line according to the road network information in response to the existence of the single line arranging line connecting the at least two to-be-processed single points, wherein the priority is used for representing a list taking sequence between the at least two to-be-processed single points connected with the single line arranging line.
In a third aspect, an embodiment of the present disclosure provides an electronic device, including: one or more processors; a memory having one or more programs stored thereon, which when executed by the one or more processors, cause the one or more processors to perform the method for generating route information of the first aspect.
In a fourth aspect, an embodiment of the present disclosure provides a computer-readable medium, on which a computer program is stored, wherein the program, when executed by a processor, implements the method for generating route information of the first aspect described above.
The method and the device for generating the route information provided by the embodiment of the disclosure firstly acquire a network point information set to be processed; then, clustering the information of the to-be-processed website in the information set of the to-be-processed website according to the geographical position label of the information set of the to-be-processed website, and determining at least one to-be-processed single-taking point, so that the aggregative property of the single-taking can be effectively improved; and finally, generating at least one list arranging route corresponding to the at least one to-be-processed single point according to the single point taking position information of the to-be-processed single point in the at least one to-be-processed single point. Time constraint and loading constraint can be met, and the list arranging efficiency can be improved.
Drawings
Other features, objects and advantages of the disclosure will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
FIG. 1 is an exemplary system architecture diagram in which one embodiment of the present disclosure may be applied;
FIG. 2 is a flow diagram of one embodiment of a method for generating route information according to the present disclosure;
FIG. 3 is a schematic diagram of one application scenario of a method for generating route information according to the present disclosure;
FIG. 4 is a flow diagram of yet another embodiment of a method for generating route information according to the present disclosure;
FIG. 5 is a schematic block diagram illustrating one embodiment of an apparatus for generating route information according to the present disclosure;
FIG. 6 is a schematic diagram of an electronic device suitable for use in implementing embodiments of the present disclosure.
Detailed Description
The present disclosure is described in further detail below with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings.
It should be noted that, in the present disclosure, the embodiments and features of the embodiments may be combined with each other without conflict. The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 illustrates an exemplary system architecture 100 of a method for generating route information or an apparatus for generating route information to which embodiments of the present disclosure may be applied.
As shown in fig. 1, the system architecture 100 may include vehicles 101, 102, 103, a network 104, and a server 105. The network 104 is used to provide a medium for communication links between the vehicles 101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The vehicles 101, 102, 103 may be various vehicles having a plurality of data acquisition units and data processing units, including but not limited to electric vehicles, hybrid electric vehicles, and internal combustion engine vehicles, among others.
It should be noted that the method for generating route information provided by the embodiment of the present disclosure is generally performed by the server 105, and accordingly, the apparatus for generating route information is generally disposed in the server 105.
The server may be hardware or software. When the server is hardware, it may be implemented as a distributed server cluster formed by multiple servers, or may be implemented as a single server. When the server is software, it may be implemented as a plurality of software or software modules (for example, to provide distributed services), or may be implemented as a single software or software module, and is not limited specifically herein.
It should be understood that the number of vehicles, networks, and servers in FIG. 1 is merely illustrative. There may be any number of vehicles, networks, and servers, as desired for implementation.
With continued reference to fig. 2, a flow 200 of one embodiment of a method for generating route information in accordance with the present disclosure is shown. The method for generating route information includes the steps of:
In this embodiment, an executing subject (for example, the server 105 shown in fig. 1) of the method for generating route information may acquire the set of website information to be processed by a wired connection manner or a wireless connection manner. It should be noted that the wireless connection means may include, but is not limited to, a 3G/4G connection, a WiFi connection, a bluetooth connection, a WiMAX connection, a Zigbee connection, a uwb (ultra wideband) connection, and other wireless connection means now known or developed in the future.
The existing logistics industry faces the situation that the order quantity is large, and the transportation cost, the labor cost and other factors are considered. Common constraints include time constraints, vehicle load constraints, and vehicle mileage constraints. The logistics needs to consider the problems of optimal cost, balanced workload of workers, strong aggregation of goods (i.e. distribution in one parcel as much as possible), and the like. For this reason, the existing logistics ordering method includes constructing a vehicle path optimization problem and an adaptive large-scale neighborhood search problem to solve the ordering. However, the vehicle path optimization problem can only theoretically ensure that the optimal solution is obtained within a limited time, but in actual calculation, the calculation time is huge, and the problem only aims at a small scale; the self-adaptive large-scale neighborhood searching can effectively generate a relevant solution aiming at large-scale data, but the self-adaptive large-scale neighborhood searching is a heuristic process, so that on one hand, the time consumption is long, and the time is uncontrollable; on the other hand, the final result of the scheme for the self-adaptive large-scale neighborhood search problem is not strong in interpretability and is difficult to explain in an actual landing.
The execution main body firstly obtains the information set of the mesh points to be processed in various modes. The information of the to-be-processed network points in the information set of the to-be-processed network points can be prompt order taking information sent by each network point receiving an article to be sent so as to prompt an executing main body to take an order from the network point. For example, the point of the item to be sent may be a real supermarket, store, etc. And, the information set of the website to be processed may contain a geographical location tag. The geographical location tag may be used to indicate an actual location to which a to-be-processed website corresponding to the to-be-processed website information in the to-be-processed website information set belongs. The geo-location tag may be a certain area in reality (e.g., may be a certain district, a certain county, a certain city, etc.). A plurality of logistics points can be arranged under the area.
In practice, the position of each dot to be processed is highly random and irregular. Therefore, the executing main body of the application can perform operations such as clustering on the to-be-processed website information in the to-be-processed website information set according to the geographical position label of the to-be-processed website information set, so as to obtain at least one to-be-processed point corresponding to the to-be-processed website information set. The clustering method may be a partition method, a hierarchy method, a density algorithm, a graph theory clustering method, a grid algorithm, a model algorithm, etc., and is not described in detail herein. The point to be processed may include point to be taken information. The to-be-processed single point is a unit-taking position that the vehicles 101, 102, 103 need to reach, and the to-be-processed single point may be a network node or an area where a plurality of adjacent network nodes are located, which is determined according to the actual situation. The corresponding sampling unit position information may be position information of a dot, or position information of a region where a plurality of neighboring dots are located.
In some optional implementation manners of this embodiment, the to-be-processed website may include location information, and the clustering, according to the geographic location tag of the to-be-processed website information set, the to-be-processed website information in the to-be-processed website information set to determine at least one to-be-processed point to be taken may include the following steps:
the method comprises the steps of firstly, obtaining a site map corresponding to the geographical position label, and marking to-be-processed site information contained in the to-be-processed site information set on the site map according to position information to obtain an initial ordering map.
As can be seen from the above description, the geo-location tag is used to indicate an actual location. The execution subject can acquire a site map corresponding to the actual position according to the geographic position label. Then, the executive body can mark the information of the to-be-processed website on the website map according to the position information of the to-be-processed website to obtain an initial listing map. In practice, a network point map is usually constructed in advance, and a network point on the corresponding network point map may be a network point which needs to be singled or a network point which does not need to be singled. The to-be-processed mesh point is a mesh point which needs to be singled. The execution main body can mark the network points needing to be singled by highlighting and the like, and the network points not needing to be singled can not be displayed in the network point map. That is, the obtained initial listing map may be a site map marked with sites to be processed.
And secondly, clustering the information of the to-be-processed points on the initial list arranging map, and determining at least one to-be-processed point.
As can be seen from the above description, the network point of the article to be sent may be a real supermarket, a shop, or the like. Supermarkets and stores are generally arranged in areas with more people, such as residential areas and office areas, and in practice, the quantity of the supermarkets and the stores in the areas is large, so that the supermarkets and the stores have strong gathering performance. For this purpose, the executing agent may determine the corresponding to-be-processed sampling point according to the result of the clustering. The single point to be processed can be a mesh point, and can also be a region corresponding to a plurality of adjacent mesh points, so that the single point taking efficiency is improved.
In some optional implementation manners of this embodiment, the clustering the to-be-processed website information on the initial listing map to determine at least one to-be-processed point to be taken may include the following steps:
firstly, clustering the information of the to-be-processed website points on the initial listing map to obtain at least one initial website point cluster.
When the executive body clusters the information of the to-be-processed mesh points on the initial ordering map, the to-be-processed mesh points with a certain distance are generally classified into an initial mesh point cluster. That is, the initial dot cluster may characterize the optimal singleton location.
And secondly, regarding the initial mesh point cluster in the at least one initial mesh point cluster, when the number of the mesh point information to be processed contained in the initial mesh point cluster is less than or equal to a set number threshold, marking the initial mesh point cluster as a single point to be processed, when the number of the mesh point information to be processed contained in the initial mesh point cluster is greater than the set number threshold, dividing the initial mesh point cluster into at least one sub-initial mesh point cluster, and marking the sub-initial mesh point cluster as the single point to be processed, wherein the number of the mesh point information to be processed contained in the sub-initial mesh point cluster is not greater than the set number threshold.
For some small residential areas or office areas, the number of the nodes to be processed is also small; for some large residential or office areas, the number of sites to be treated is also high. While the loading of the vehicles 101, 102, 103 is typically limited. Therefore, the executive body can make an initial judgment on the number of the mesh point information to be processed contained in the initial mesh point cluster. Under the condition that the number of the express waybills of each to-be-processed network point is basically the same, the execution main body can evaluate the size of the initial network point cluster. When the number of the to-be-processed mesh point information included in the initial mesh point cluster is less than or equal to the set number threshold, the initial mesh point cluster can be considered to finish order taking through one vehicle. At this time, the execution subject may directly mark the initial dot cluster as a to-be-processed dot. When the number of the to-be-processed website information included in the initial website cluster is greater than a set number threshold, the initial website cluster can be considered to be incapable of completing the order taking through one vehicle. At this time, the execution subject may divide the initial mesh point cluster into at least one sub-initial mesh point cluster, and mark the sub-initial mesh point cluster as a to-be-processed sampling point. And the quantity of the information of the mesh points to be processed contained in the sub-initial mesh point cluster is not more than the set quantity threshold.
After the single point to be processed is obtained, the execution main body can generate a list arranging route of the single point to be processed according to the actual driving route or the road condition information at different time. After the order arranging route is obtained, the vehicles 101, 102 and 103 can get single points to be processed according to the order arranging route to get goods, and the order arranging efficiency is improved. .
In some optional implementation manners of this embodiment, the generating at least one list arranging route corresponding to the at least one to-be-processed single point according to the single point taking location information of the to-be-processed single point in the at least one to-be-processed single point may include:
the first step is to obtain at least one piece of single-trip information.
To order by the vehicles 101, 102, 103, the executing agent may first obtain at least one piece of order taking information. The one-trip information may be the maximum mileage of the vehicles 101, 102, 103, or may be the maximum travel time of the vehicles 101, 102, 103. The list taking information may include a list taking start point and a list taking focus point. In practice, the area corresponding to the site map may have a plurality of bins for issuing bills. Correspondingly, the order taking starting point and the order taking end point can be a warehouse on a site map, or the order taking starting point can be other positions, and the order taking end point can be the warehouse.
And secondly, matching the at least one piece of single taking stroke information with the unit taking position information of the to-be-processed single taking point in the at least one to-be-processed single taking point to obtain and generate at least one list arranging route.
The pick-up trip information may reflect the pick-up capabilities of the vehicles 101, 102, 103. The execution main body can match the single-taking-stroke information with the single-taking points to be processed to generate the list arranging route. The matching mode can be as follows: firstly, the distances between the vehicles 101, 102 and 103 and the single points to be processed are determined according to the single-taking starting points of the single-taking information, then the path planning is carried out according to the number of the vehicles 101, 102 and 103 and the number of the single points to be processed, and further a list arranging route is generated. The method for generating the ordering route may be other methods, and is not described in detail herein.
In some optional implementation manners of this embodiment, the matching the at least one piece of fetch unit information with fetch unit information of a to-be-processed fetch point in the at least one to-be-processed fetch point to obtain and generate at least one list arranging route may include: and in response to the obtained constraint condition corresponding to the single-stroke taking information, combining the to-be-processed single-point taking information according to the constraint condition.
In practice, there are certain restrictions on delivery time of the manifest, loading capacity of the vehicles 101, 102, 103, and the like. The execution main body needs to combine the to-be-processed single-taking points according to various constraint conditions so as to improve the single-taking efficiency as much as possible under the condition of meeting various constraint conditions. The execution main body can adopt various algorithms only, and an objective function is constructed through the constraint conditions to combine the single points to be processed. In the merging process, a situation that scattered dots exist in a certain to-be-processed single dot may occur. For example, some nodes are far away from residential areas or other nodes, and the to-be-processed single points are obtained after clustering, so the to-be-processed single points are usually located in areas where a plurality of to-be-processed nodes are located. And the to-be-processed point taking can not be set for scattered dots independently. At this time, the executing entity may perform clustering and merging on these scattered network points again, so as to improve the order taking aggregations, so as to improve the order taking efficiency of the vehicles 101, 102, 103. Wherein the constraint condition may include at least one of: time constraints and loading constraints.
In some optional implementation manners of this embodiment, the matching the at least one piece of fetch unit information with fetch unit information of a to-be-processed fetch point in the at least one to-be-processed fetch point to obtain and generate at least one list arranging route may include: and in response to the existence of a list arranging route which connects at least two to-be-processed single points, setting a priority for each to-be-processed single point in the at least two to-be-processed single points connected by the list arranging route according to the road network information.
In practice, there are cases where the vehicles 101, 102, 103 take a single-point order only at one standby, and there are cases where the vehicles 101, 102, 103 take a single-point order at a plurality of standby. When the vehicles 101, 102, 103 need to take orders at multiple to-be-processed single points, the executing agent may set priorities for the multiple to-be-processed single points according to actual road network information (for example, main road information, real-time road condition information, and the like), and instruct the vehicles 101, 102, 103 to take orders from the to-be-processed single points according to the priorities, so that the vehicles 101, 102, 103 can take orders from the to-be-processed single points at the shortest distance or in the shortest time. The priority can be used for representing the order of picking order between at least two to-be-processed picking single points connected by the single line.
With continued reference to fig. 3, fig. 3 is a schematic diagram of an application scenario of the method for generating route information according to the present embodiment. In the application scenario of fig. 3, the server 105 may obtain a set of to-be-processed website information. Then, the server 105 clusters the information of the to-be-processed website according to the geographical location tag of the information set of the to-be-processed website, and determines at least one to-be-processed point. Then, the server 105 generates at least one list arranging route according to the unit taking position information of the point to be taken to be processed. The server 105 may construct a fetch instruction according to the ordered route and send the fetch instruction to the vehicle 102 via the network 104. And the vehicle 102 gets the order from the order arranging route corresponding to the order taking instruction to the single point to be processed.
The method provided by the embodiment of the disclosure is generally applicable to a method and a device for generating route information, and comprises the steps of firstly acquiring a to-be-processed website information set; then, clustering the information of the to-be-processed website in the information set of the to-be-processed website according to the geographical position label of the information set of the to-be-processed website, and determining at least one to-be-processed single-taking point, so that the aggregative property of the single-taking can be effectively improved; and finally, generating at least one list arranging route corresponding to the at least one to-be-processed single point according to the single point taking position information of the to-be-processed single point in the at least one to-be-processed single point. Time constraint and loading constraint can be met, and the list arranging efficiency can be improved.
With further reference to fig. 4, a flow 400 of yet another embodiment of a method for generating route information is shown. The flow 400 of the method for generating route information includes the steps of:
The content of step 401 is the same as that of step 201, and is not described in detail here.
The content of step 402 is the same as that of step 202, and is not described in detail here.
The content of step 403 is the same as that of step 203, and is not described in detail here.
And step 404, sending a list fetching instruction according to the at least one list arranging route.
After the execution subject obtains the order line, the order fetching instruction can be sent to the corresponding vehicles 101, 102 and 103 in a wired or wireless mode. The order taking instruction is used for instructing the vehicles 101, 102 and 103 to take orders according to the order arranging route. Therefore, the vehicles 101, 102 and 103 can obtain the order arranging route in time, and the order taking efficiency of the vehicles 101, 102 and 103 is improved.
With further reference to fig. 5, as an implementation of the methods shown in the above figures, the present disclosure provides an embodiment of an apparatus for generating route information, which corresponds to the method embodiment shown in fig. 2, and which is particularly applicable to various electronic devices.
As shown in fig. 5, the apparatus 500 for generating route information of the present embodiment may include: an information acquisition unit 501, a to-be-processed single point taking determination unit 502, and a route generation unit 503. The information obtaining unit 501 is configured to obtain a to-be-processed website information set, where the to-be-processed website information set includes a geographic location tag; the to-be-processed single point taking determination unit 502 is configured to cluster the to-be-processed website information in the to-be-processed website information set according to the geographical location tag of the to-be-processed website information set, and determine at least one to-be-processed single point taking, where the to-be-processed single point taking includes single point taking location information; the route generating unit 503 is configured to generate at least one list arranging route corresponding to the at least one to-be-processed single point taking point according to the single point taking position information of the to-be-processed single point taking point in the at least one to-be-processed single point taking point.
In some optional implementations of this embodiment, the to-be-processed node includes location information, and the to-be-processed node determining unit 502 may include: an initial ordering map acquisition subunit (not shown) and a to-be-processed acquisition point determination subunit (not shown). The initial ordering map obtaining subunit is configured to obtain a dot map corresponding to the geographic position tag, and mark to-be-processed dot information included in the to-be-processed dot information set on the dot map according to position information to obtain an initial ordering map; the to-be-processed single point determination subunit is configured to cluster the to-be-processed website information on the initial list ranking map and determine at least one to-be-processed single point.
In some optional implementations of this embodiment, the to-be-processed single-point determination subunit may include: an initial mesh point cluster acquisition module (not shown in the figure) and a to-be-processed single point taking determination module (not shown in the figure). The system comprises an initial website cluster acquisition module, a list ranking module and a list ranking module, wherein the initial website cluster acquisition module is configured to cluster to-be-processed website information on the initial list ranking map to obtain at least one initial website cluster; the to-be-processed point-picking determining module is configured to, for an initial point cluster in the at least one initial point cluster, mark the initial point cluster as a to-be-processed point-picking when the number of to-be-processed point information included in the initial point cluster is less than or equal to a set number threshold, divide the initial point cluster into at least one sub-initial point cluster when the number of to-be-processed point information included in the initial point cluster is greater than the set number threshold, and mark the sub-initial point cluster as a to-be-processed point-picking, wherein the number of to-be-processed point information included in the sub-initial point cluster is not greater than the set number threshold.
In some optional implementation manners of this embodiment, the route generating unit 503 may include: a take one-trip information acquisition sub-unit (not shown) and a route generation sub-unit (not shown). The single-taking-stroke information acquisition subunit is configured to acquire at least one piece of single-taking-stroke information, and the single-taking-stroke information comprises a single-taking starting point and a single-taking coincident point; the route generating subunit is configured to match the at least one piece of order taking information with the order taking position information of the to-be-processed order taking point in the at least one to-be-processed order taking point, so as to generate at least one order arranging route.
In some optional implementations of this embodiment, the route generating subunit may include: a to-be-processed point-taking merging module (not shown in the figure), configured to merge the to-be-processed point-taking according to a constraint condition in response to obtaining the constraint condition corresponding to the single-taking trip information, where the constraint condition includes at least one of: time constraints and loading constraints.
In some optional implementations of this embodiment, the route generating subunit may include: the to-be-processed single point taking priority setting module (not shown in the figure) is configured to, in response to that a single point ranking route connecting at least two to-be-processed single points exists in the at least one single point ranking route, set a priority for each of the at least two to-be-processed single point taking points connected by the single point ranking route according to the road network information, where the priority is used to represent a list taking sequence between the at least two to-be-processed single point taking points connected by the single point ranking route.
The present embodiment also provides an electronic device, including: one or more processors; a memory having one or more programs stored thereon, which when executed by the one or more processors, cause the one or more processors to perform the above-described method for generating route information.
The present embodiment also provides a computer-readable medium, on which a computer program is stored, which program, when being executed by a processor, carries out the above-mentioned method for generating route information.
Referring now to FIG. 6, shown is a block diagram of a computer system 600 suitable for use with an electronic device (e.g., server 105 of FIG. 1) to implement an embodiment of the present disclosure. The electronic device shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 6, electronic device 600 may include a processing means (e.g., central processing unit, graphics processor, etc.) 601 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage means 608 into a Random Access Memory (RAM) 603. In the RAM603, various programs and data necessary for the operation of the electronic apparatus 600 are also stored. The processing device 601, the ROM 602, and the RAM603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
In general, input devices 606 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc., output devices 607 including, for example, a liquid crystal display (L CD), speaker, vibrator, etc., storage devices 608 including, for example, magnetic tape, hard disk, etc., and communication devices 609.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication means 609, or may be installed from the storage means 608, or may be installed from the ROM 602. The computer program, when executed by the processing device 601, performs the above-described functions defined in the methods of embodiments of the present disclosure.
It should be noted that the computer readable medium mentioned above in the embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In embodiments of the disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In embodiments of the present disclosure, however, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: acquiring a network point information set to be processed, wherein the network point information set to be processed comprises a geographical position label; clustering to-be-processed website information in the to-be-processed website information set according to the geographical position label of the to-be-processed website information set, and determining at least one to-be-processed single-point-taking, wherein the to-be-processed single-point-taking comprises single-point-taking position information; and generating at least one list arranging route corresponding to the at least one to-be-processed single point according to the single point taking position information of the to-be-processed single point in the at least one to-be-processed single point.
Computer program code for carrying out operations for embodiments of the present disclosure may be written in any combination of one or more programming languages, including AN object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present disclosure may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes an information acquisition unit, a to-be-processed single point acquisition determination unit, and a route generation unit. Where the names of these units do not in some cases constitute a limitation on the unit itself, for example, the route generation unit may also be described as a "unit that generates a vehicle-taken route".
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention in the present disclosure is not limited to the specific combination of the above-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is possible without departing from the inventive concept as defined above. For example, the above features and (but not limited to) the features disclosed in this disclosure having similar functions are replaced with each other to form the technical solution.
Claims (14)
1. A method for generating route information, comprising:
acquiring a network point information set to be processed, wherein the network point information set to be processed comprises a geographical position label;
clustering to-be-processed website information in the to-be-processed website information set according to the geographical position label of the to-be-processed website information set, and determining at least one to-be-processed single-taking point, wherein the to-be-processed single-taking point comprises single-taking position information;
and generating at least one list arranging route corresponding to the at least one to-be-processed single point according to the single point taking position information of the to-be-processed single point in the at least one to-be-processed single point.
2. The method of claim 1, wherein the mesh point to be processed includes location information, and
the clustering the information of the to-be-processed website in the information set of the to-be-processed website according to the geographical position label of the information set of the to-be-processed website, and determining at least one to-be-processed point-taking, comprises:
acquiring a site map corresponding to the geographic position label, and marking the site information to be processed contained in the site information set to be processed on the site map according to the position information to obtain an initial ordering map;
and clustering the information of the to-be-processed websites on the initial list ranking map, and determining at least one to-be-processed single-point-taking point.
3. The method of claim 2, wherein the clustering the to-be-processed website information on the initial ranking map and determining at least one to-be-processed point-taking comprises:
clustering the information of the to-be-processed website on the initial listing map to obtain at least one initial website cluster;
for an initial mesh point cluster in the at least one initial mesh point cluster, when the number of the mesh point information to be processed contained in the initial mesh point cluster is less than or equal to a set number threshold, marking the initial mesh point cluster as a to-be-processed single point, when the number of the mesh point information to be processed contained in the initial mesh point cluster is greater than the set number threshold, dividing the initial mesh point cluster into at least one sub-initial mesh point cluster, and marking the sub-initial mesh point cluster as the to-be-processed single point, wherein the number of the mesh point information to be processed contained in the sub-initial mesh point cluster is not greater than the set number threshold.
4. The method according to claim 1, wherein the generating at least one ranking route corresponding to the at least one to-be-processed single-taking point according to the single-taking position information of the to-be-processed single-taking point of the at least one to-be-processed single-taking point comprises:
acquiring at least one piece of single-taking stroke information, wherein the single-taking stroke information comprises a single-taking starting point and a single-taking coincident point;
and matching the at least one piece of single taking stroke information with the unit taking position information of the to-be-processed single taking point in the at least one to-be-processed single taking point to obtain and generate at least one list arranging route.
5. The method according to claim 4, wherein the matching the at least one piece of fetch single-stroke information with fetch unit location information of a to-be-processed fetch single point of the at least one to-be-processed fetch single point to obtain at least one sort-single route, comprises:
in response to the obtaining of the constraint condition corresponding to the single-stroke taking information, merging the to-be-processed single-stroke taking points according to the constraint condition, wherein the constraint condition comprises at least one of the following items: time constraints and loading constraints.
6. The method according to claim 4, wherein the matching the at least one piece of fetch single-stroke information with fetch unit location information of a to-be-processed fetch single point of the at least one to-be-processed fetch single point to obtain at least one sort-single route, comprises:
and in response to the existence of a list arranging route which connects at least two to-be-processed single points in the at least one list arranging route, setting a priority for each to-be-processed single point in the at least two to-be-processed single points connected with the list arranging route according to the road network information, wherein the priority is used for representing a list taking sequence between the at least two to-be-processed single points connected with the list arranging route.
7. An apparatus for generating route information, comprising:
the system comprises an information acquisition unit, a processing unit and a processing unit, wherein the information acquisition unit is configured to acquire a to-be-processed website information set, and the to-be-processed website information set comprises a geographical position tag;
the to-be-processed single point taking determination unit is configured to cluster the to-be-processed website information in the to-be-processed website information set according to the geographical position label of the to-be-processed website information set, and determine at least one to-be-processed single point taking unit, wherein the to-be-processed single point taking unit comprises single point taking position information;
and the route generating unit is configured to generate at least one list arranging route corresponding to the at least one to-be-processed single point taking point according to the single point taking position information of the to-be-processed single point taking point in the at least one to-be-processed single point taking point.
8. The apparatus of claim 7, wherein the mesh point to be processed comprises location information, and
the to-be-processed point taking determination unit comprises:
the initial ordering map obtaining subunit is configured to obtain a dot map corresponding to the geographic position label, and mark to-be-processed dot information contained in the to-be-processed dot information set on the dot map according to position information to obtain an initial ordering map;
and the to-be-processed single point taking determination subunit is configured to cluster the to-be-processed website information on the initial listing map and determine at least one to-be-processed single point taking.
9. The apparatus of claim 8, wherein the to-be-processed fetch point determining subunit comprises:
the initial website cluster acquisition module is configured to cluster the website information to be processed on the initial listing map to obtain at least one initial website cluster;
and the to-be-processed point-picking determining module is configured to mark an initial point cluster as a to-be-processed point-picking when the number of the to-be-processed point information contained in the initial point cluster is less than or equal to a set number threshold, and to divide the initial point cluster into at least one sub-initial point cluster and mark the sub-initial point cluster as a to-be-processed point-picking when the number of the to-be-processed point information contained in the initial point cluster is greater than the set number threshold, wherein the number of the to-be-processed point information contained in the sub-initial point cluster is not greater than the set number threshold.
10. The apparatus of claim 7, wherein the route generation unit comprises:
a fetch single-stroke information obtaining subunit configured to obtain at least one fetch single-stroke information, where the fetch single-stroke information includes a fetch single-start point and a fetch single-repeat point;
and the route generating subunit is configured to match the at least one piece of single taking route information with the unit taking position information of the to-be-processed single taking point in the at least one to-be-processed single taking point to obtain and generate at least one list arranging route.
11. The apparatus of claim 10, wherein the route generation subunit comprises:
the to-be-processed point taking and merging module is used for responding to a constraint condition for acquiring the corresponding single taking stroke information and is configured to merge the to-be-processed point taking and merging according to the constraint condition, wherein the constraint condition comprises at least one of the following conditions: time constraints and loading constraints.
12. The apparatus of claim 10, wherein the route generation subunit comprises:
the to-be-processed single point taking priority setting module is configured to set a priority for each to-be-processed single point taking in the at least two to-be-processed single points connected with the at least one single line according to the road network information in response to the existence of the single line arranging line connecting the at least two to-be-processed single points, wherein the priority is used for representing a single taking sequence between the at least two to-be-processed single points connected with the single line arranging line.
13. An electronic device, comprising:
one or more processors;
a memory having one or more programs stored thereon,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-6.
14. A computer-readable medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010245163.1A CN111461430A (en) | 2020-03-31 | 2020-03-31 | Method and device for generating route information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010245163.1A CN111461430A (en) | 2020-03-31 | 2020-03-31 | Method and device for generating route information |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111461430A true CN111461430A (en) | 2020-07-28 |
Family
ID=71683417
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010245163.1A Pending CN111461430A (en) | 2020-03-31 | 2020-03-31 | Method and device for generating route information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111461430A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113240175A (en) * | 2021-05-11 | 2021-08-10 | 北京百度网讯科技有限公司 | Distribution route generation method, distribution route generation device, storage medium, and program product |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109345166A (en) * | 2018-09-20 | 2019-02-15 | 北京百度网讯科技有限公司 | Method and apparatus for generating information |
| CN109816132A (en) * | 2017-11-20 | 2019-05-28 | 北京京东尚科信息技术有限公司 | Information generating method and device |
| CN110490510A (en) * | 2019-07-08 | 2019-11-22 | 北京三快在线科技有限公司 | A kind of logistics distribution route generation method and device |
| US10565543B1 (en) * | 2019-03-01 | 2020-02-18 | Coupang, Corp. | Systems, apparatuses, and methods of efficient route planning for e-commerce fulfillment |
-
2020
- 2020-03-31 CN CN202010245163.1A patent/CN111461430A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109816132A (en) * | 2017-11-20 | 2019-05-28 | 北京京东尚科信息技术有限公司 | Information generating method and device |
| CN109345166A (en) * | 2018-09-20 | 2019-02-15 | 北京百度网讯科技有限公司 | Method and apparatus for generating information |
| US10565543B1 (en) * | 2019-03-01 | 2020-02-18 | Coupang, Corp. | Systems, apparatuses, and methods of efficient route planning for e-commerce fulfillment |
| CN110490510A (en) * | 2019-07-08 | 2019-11-22 | 北京三快在线科技有限公司 | A kind of logistics distribution route generation method and device |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113240175A (en) * | 2021-05-11 | 2021-08-10 | 北京百度网讯科技有限公司 | Distribution route generation method, distribution route generation device, storage medium, and program product |
| CN113240175B (en) * | 2021-05-11 | 2024-02-02 | 北京百度网讯科技有限公司 | Distribution route generation method, distribution route generation device, storage medium, and program product |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107235276B (en) | Cargo method for carrying and device | |
| Shiri et al. | Optimization of drayage operations with time-window constraints | |
| Jaillet | A priori solution of a traveling salesman problem in which a random subset of the customers are visited | |
| CN108492068B (en) | Method and device for path planning | |
| WO2020164319A1 (en) | Goods pickup method and device | |
| CN104463516A (en) | Order/vehicle distribution based on order density | |
| CN109902990A (en) | A kind of supply chain logistics distribution routing planning system | |
| Wei et al. | Look-ahead insertion policy for a shared-taxi system based on reinforcement learning | |
| CN109345166B (en) | Method and apparatus for generating information | |
| CN111178810B (en) | Method and device for generating information | |
| US20180349850A1 (en) | Transport Plan Generating Method and Transport Plan Generating System | |
| JP2021531585A (en) | Scheduling method and scheduling device for self-guided transport vehicles | |
| Saeed et al. | Enhancing the service quality of transit systems in rural areas by flexible transport services | |
| Naumov et al. | Model of the delivery routes forming process as a service provided by forwarding companies | |
| Berghman et al. | Practical solutions for a dock assignment problem with trailer transportation | |
| Anderluh et al. | Sustainable logistics with cargo bikes—Methods and applications | |
| CN110807612A (en) | Method and device for determining residual capacity | |
| Chen et al. | Carbon-efficient scheduling problem of electric rubber-tyred gantry cranes in a container terminal | |
| CN113128743A (en) | Goods picking path planning method and device | |
| CN113887828B (en) | Intelligent supply chain production, transportation and marketing cooperation and real-time network planning method and device | |
| Qamsari et al. | A column generation approach for an inventory routing problem with fuzzy time windows | |
| CN110472918A (en) | Method and apparatus for output information | |
| CN112200336A (en) | Method and device for planning vehicle driving path | |
| CN111461430A (en) | Method and device for generating route information | |
| CN111428925B (en) | Method and device for determining distribution route |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200728 |
|
| RJ01 | Rejection of invention patent application after publication |