A method and system for optimizing takeout delivery routes at campus delivery stations

Abstract

The present invention relates to the field of food delivery technology, and specifically to a food delivery path optimization method and system for a campus delivery station, which obtains food delivery information; uses an ant colony algorithm to generate at least one food delivery path based on the distance between different delivery points in the food delivery information and the priority of each delivery path segment, and obtains the suitability of the food delivery path; obtains the rationality of different food delivery paths according to the food delivery information and the suitability, normalizes the rationality to obtain a normalized value of the rationality, and the food delivery path corresponding to the largest normalized value is the target food delivery path, and directs the delivery person to travel according to the target food delivery path. The present invention takes into account the road congestion that may occur during food delivery, the number of food deliveries at different delivery points, the required arrival time of food deliveries, etc., so that the food delivery path is more reasonable.

Description

Technical Field

[0001] The present invention relates to the technical field of food delivery, and in particular to a method and system for optimizing food delivery routes at a campus delivery station. Background Art

[0002] The campus food delivery market is booming, mainly due to the large student consumer group and their high-frequency consumption needs. Students pursue convenient and diversified dining. In situations where door-to-door food delivery services can save time and avoid crowded canteens, food delivery becomes the first choice. In terms of market size, with the development of Internet technology and the growth of mobile Internet users, the campus food delivery market continues to expand and is expected to maintain rapid growth in the next few years.

[0003] A survey of the campus food delivery market shows that market demand remains strong, and students have high expectations for fast, accurate, and convenient delivery services and high-quality catering services. The survey found that the diversified menu selection, personalized services, and food safety guarantees of food delivery platforms have become key factors in attracting students. At the same time, the launch of canteen food delivery services has also been welcomed by students, bringing new growth points to the market. In terms of the competitive landscape, major food delivery platforms are in fierce competition and need to continuously innovate service models and improve user experience to consolidate their market position.

[0004] With the massive increase in takeout orders, the punctuality of delivery personnel has gradually decreased. In order to improve user experience and on-time delivery of takeout, the delivery route should be arranged reasonably to ensure on-time delivery of takeout. The traditional method of arranging the delivery route of the delivery personnel is generated by using the ant colony algorithm based on the path distance relationship between different delivery points, which fails to take into account road congestion, the number of takeouts at different delivery points, and the required arrival time of takeouts. Therefore, the route arrangement for takeout delivery is not reasonable enough. Summary of the invention

[0005] In order to solve the technical problem that the takeaway delivery route arrangement is not reasonable, the purpose of the present invention is to provide a method for optimizing the takeaway delivery route of a campus delivery station. The technical solution adopted is as follows:

[0006] Get food delivery information;

[0007] An ant colony algorithm is used to generate at least one food delivery path based on the distances between different delivery points in the food delivery information and the priorities of each delivery path segment, and the suitability of the food delivery path is obtained. The priority is equivalent to the pheromone concentration in the ant colony algorithm, and the suitability is the probability of selecting the food delivery path obtained by the ant colony algorithm.

[0008] The rationality of different takeaway delivery paths is obtained according to the food delivery information and the degree of suitability, and the rationality is normalized to obtain a normalized value of the rationality. The food delivery path corresponding to the largest normalized value is the target food delivery path, and the delivery person is directed to drive according to the target food delivery path.

[0009] Further, obtaining the rationality of different takeaway delivery paths according to the takeaway delivery information and the suitability includes:

[0010] Obtain the delivery quantity of any delivery point in the takeaway delivery path, the sum of the time distances between the current time of each takeaway to be delivered at the delivery point and the corresponding preset delivery arrival time, and the ranking value of the delivery point in all delivery points included in the takeaway delivery path;

[0011] Obtain the product of the sum of the time distance and the ranking value, and divide the delivery quantity by the product to obtain the rationality of the delivery order arrangement of the delivery point;

[0012] Repeat the above process to obtain the rationality of the delivery order arrangement of each delivery point in the takeaway delivery path, add the rationality of the delivery order arrangement of each delivery point in turn, and then multiply it by the appropriateness to obtain the rationality of the takeaway delivery path;

[0013] Repeat the above steps to obtain the rationality of different takeaway delivery routes.

[0014] Furthermore, the process of obtaining the priority of each delivery path segment includes:

[0015] Get the historical target takeaway delivery route of the last takeaway delivery of the current takeaway delivery;

[0016] The priority of the selected delivery path segment in the historical target takeaway delivery path is increased, and the priority of the unselected delivery path segment in the historical target takeaway delivery path is reduced.

[0017] Further, increasing the priority of the selected delivery path segment in the historical target takeaway delivery path includes:

[0018] Obtaining a priority increase degree of any selected delivery path segment in the historical target takeaway delivery path, and normalizing the priority increase degree to obtain a priority increase degree normalized value;

[0019] Obtaining the priority of the selected delivery path segment;

[0020] After multiplying the priority by the normalized value of the degree of increase in the priority, the priority is added to obtain the updated current priority of the delivery path segment.

[0021] Further, obtaining the degree of increase in priority of any selected delivery path segment in the historical target takeaway delivery path includes:

[0022] Obtaining the degree of on-time arrival of the takeaway according to the takeaway delivery information;

[0023] The degree of increase in priority is obtained by multiplying the degree of rationality, the degree of on-time arrival of the takeaway, and the sum of the delivery quantities of the two delivery points connected by the selected delivery path segment.

[0024] Further, obtaining the degree of on-time arrival of the takeaway according to the takeaway delivery information includes:

[0025] Obtain the sum of the time distances between the actual delivery arrival time of each takeaway to be delivered at each delivery point and its corresponding preset delivery arrival time;

[0026] Multiplying the number of delivery points by the delivery quantity of the delivery points to obtain a multiplication result;

[0027] The sum of the time distances is divided by the multiplication result to obtain the degree of on-time arrival of the takeaway.

[0028] Further, reducing the priority of the unselected delivery path segment in the historical target takeaway delivery path includes:

[0029] Obtaining the priority reduction degree of the unselected delivery path segment in the historical target takeaway delivery path, and normalizing the priority reduction degree to obtain a normalized value of the priority reduction degree;

[0030] Obtaining the priority of the unselected delivery path segment;

[0031] Multiplying the priority by the normalized value of the priority reduction degree to obtain a priority reduction value;

[0032] The priority is subtracted from the priority reduction value to obtain the updated current priority of the delivery path segment.

[0033] Further, obtaining the priority reduction degree of the unselected delivery path segment in the historical target takeaway delivery path includes:

[0034] Obtaining the sum of the delivery quantities of the two delivery points connected by the delivery path segment;

[0035] Obtain the time distance between the time when the delivery person passed through the unselected delivery route segment during the last delivery of the current food delivery and the current time;

[0036] The time distance divided by the sum of the delivery quantities yields the degree of reduction in priority.

[0037] Furthermore, the food delivery information includes: delivery points, delivery routes, distances between different delivery points, priorities of each delivery route segment, the number of food to be delivered at each delivery point, and the time distance between the current time of each food to be delivered at the delivery point and the preset delivery arrival time.

[0038] The embodiment of the present invention further provides a takeaway delivery route optimization system for a campus delivery station, the system comprising:

[0039] An acquisition unit, used to acquire takeaway delivery information;

[0040] an algorithm unit, configured to generate at least one takeaway delivery path by using an ant colony algorithm based on the distances between different delivery points in the takeaway delivery information and the priorities of the delivery path segments, and obtain the suitability of the takeaway delivery path, wherein the priority is equivalent to the pheromone concentration in the ant colony algorithm, and the suitability is the probability of selecting the takeaway delivery path obtained by the ant colony algorithm;

[0041] A path unit is used to obtain the rationality of different takeaway delivery paths according to the takeaway delivery information and the suitability, normalize the rationality to obtain a normalized value of the rationality, and the takeaway delivery path corresponding to the largest normalized value is the target takeaway delivery path. The delivery person is directed to travel the path according to the target takeaway delivery path.

[0042] The present invention has the following beneficial effects:

[0043] In the present invention, first, food delivery information is obtained, and then, an ant colony algorithm is used to generate at least one food delivery path based on the distance between different delivery points in the food delivery information and the priority of each delivery path segment, and the suitability of the food delivery path is obtained. The priority is equivalent to the pheromone concentration in the ant colony algorithm, and the suitability is the probability of selecting the food delivery path obtained by the ant colony algorithm. At this time, the ant colony algorithm not only takes into account the distance between different delivery points, but also takes into account the priority of each delivery path segment. Therefore, the generated food delivery path is more reasonable, and the suitability of different food delivery paths is the probability of different food delivery paths being selected. Finally, the reasonableness of different food delivery paths is obtained according to the food delivery information and the suitableness, and the reasonableness is normalized to obtain the normalized value of the reasonableness. The food delivery path corresponding to the largest normalized value is the target food delivery path, and the delivery person is directed to travel according to the target food delivery path. That is to say, the degree of suitability is further modified to obtain the reasonableness of different takeaway delivery paths, and the one with the largest normalized value of reasonableness is selected as the target takeaway delivery path to direct the delivery personnel to deliver. By adopting the present invention, the takeaway delivery path arrangement takes into account possible road congestion, the number of takeaways at different delivery points, the required arrival time of takeaways, etc., and can be changed according to real-time conditions, making the takeaway delivery path more reasonable. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] In order to more clearly illustrate the technical solutions and advantages in the embodiments of the present invention or the prior art, the drawings required for use in the embodiments or the prior art descriptions are briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0045] Figure 1 A flow chart of a method for optimizing a takeaway delivery route at a campus delivery station provided by an embodiment of the present invention;

[0046] Figure 2 A schematic diagram of a takeaway delivery topology structure provided by an embodiment of the present invention;

[0047] Figure 3 A schematic diagram of a target takeaway delivery route provided by an embodiment of the present invention;

[0048] Figure 4 A flowchart of a reasonable degree acquisition process provided by an embodiment of the present invention;

[0049] Figure 5A flowchart of a priority acquisition process provided by an embodiment of the present invention;

[0050] Figure 6 A flow chart of a process for obtaining a delivery path segment with increased priority provided by one embodiment of the present invention;

[0051] Figure 7 A flowchart of a process for obtaining a priority increase degree provided by an embodiment of the present invention;

[0052] Figure 8 A flowchart of a process for obtaining the degree of on-time arrival of takeout food provided by one embodiment of the present invention;

[0053] Fig. 9 A flowchart of a process for obtaining a delivery path segment with reduced priority provided by one embodiment of the present invention;

[0054] Fig.10 A flowchart of a process for obtaining a priority reduction degree provided by an embodiment of the present invention;

[0055] Fig.11 A unit schematic diagram of a takeout delivery route optimization system for a campus delivery station provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0056] In order to further explain the technical means and effects adopted by the present invention to achieve the predetermined invention purpose, the following is a detailed description of the method and system for optimizing the delivery path of takeout at a campus collection and delivery station proposed by the present invention, in combination with the accompanying drawings and preferred embodiments, as well as its specific implementation method, structure, features and effects. In the following description, different "one embodiment" or "another embodiment" does not necessarily refer to the same embodiment. In addition, specific features, structures or characteristics in one or more embodiments may be combined in any suitable form.

[0057] Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.

[0058] The specific scheme of the method for optimizing the delivery path of takeout food at a campus delivery station provided by the present invention is described in detail below with reference to the accompanying drawings.

[0059] See also Figure 1 , which shows a flow chart of a method for optimizing a takeaway delivery path for a campus delivery station provided by an embodiment of the present invention, the method comprising:

[0060] S101. Obtain takeaway delivery information.

[0061] The food delivery information includes but is not limited to: delivery points, delivery routes, distances between different delivery points, priorities of each delivery route segment, the number of food to be delivered at each delivery point, and the time distance between the current time of each food to be delivered at the delivery point and the preset delivery arrival time.

[0062] All the delivery points within the school are marked on the map, and the length of the connecting paths between the delivery points is recorded. With a delivery point as a node and the length of a delivery path as a line, the topological structure of campus food delivery is constructed. The topological structure facilitates users to view data such as delivery points of food delivery information. The schematic diagram of the food delivery topological structure is shown in the figure below. Figure 2 shown.

[0063] S102. An ant colony algorithm is used to generate at least one food delivery path based on the distances between different delivery points in the food delivery information and the priorities of each delivery path segment, and the suitability of the food delivery path is obtained. The priority is equivalent to the pheromone concentration in the ant colony algorithm, and the suitability is the probability of selecting the food delivery path obtained by the ant colony algorithm.

[0064] Ant Colony Optimization (ACO) is an optimization algorithm that simulates the foraging behavior of ants in nature. It uses road distance and pheromones to obtain the target path. In the ant colony algorithm, the probability of each path can be obtained. These probabilities are calculated based on pheromone concentration and road distance. Specifically, when an ant chooses the next path, it will determine the probability of choosing a certain path through a certain calculation method (such as roulette selection method) based on the pheromone concentration at the current location and the distance of the reachable path.

[0065] The distance between different delivery points can be understood as the road distance. The priority of each delivery path segment is equivalent to the pheromone concentration. The higher the priority, the higher the pheromone concentration. The suitability of the takeaway delivery path is the probability of a certain path (takeaway delivery path) obtained in the ant colony algorithm.

[0066] It is an existing technology to use ant colony algorithm to generate at least one takeaway delivery path based on the distance between different delivery points and the priority of each delivery path segment, and to obtain the probability of each path, that is, the suitability, which will not be described in detail here.

[0067] The distance between different delivery points is fixed, while the priority of each delivery path segment is variable, increasing as the number of selections by the delivery personnel increases, and decreasing as the number of selections by the delivery personnel decreases.

[0068] Initially, the priority of each delivery path segment can be set to 1, and each delivery path segment changes with the number of selections by the delivery personnel. The update process of the priority of each delivery path segment will be described in detail in the subsequent embodiments and will not be repeated here.

[0069] The takeout delivery path consists of at least one delivery path segment.

[0070] S103. Obtain the rationality of different takeaway delivery routes based on the takeaway delivery information and the degree of suitability, normalize the rationality to obtain a normalized value of the rationality, and the takeaway delivery route corresponding to the largest normalized value is the target takeaway delivery route. Direct the delivery person's driving route based on the target takeaway delivery route.

[0071] In order to avoid the situation where the deliveryman is charged a large amount of fees due to a large number of delays in delivering takeouts at one time, in addition to considering the length of the delivery route, the delivery should also take into account the number of takeouts delivered at different delivery points and the time distance between the current time of different takeouts and the final arrival time set by the takeout delivery system. When a single delivery point has more takeout orders than other delivery points, in order to avoid delays in most of the takeout orders delivered by the deliveryman at one time, delivery points with more takeout orders should be given priority. When the delivered takeout orders include orders that are about to time out, in order to avoid user complaints or delivery timeout deductions, the orders that are about to time out should be given priority. Therefore, when obtaining multiple takeout delivery paths generated by the ant colony algorithm, the most reasonable takeout delivery path should be selected as the target takeout delivery path. Figure 3 A schematic diagram of a target takeaway delivery route provided by an embodiment of the present invention. Figure 3 The road selected for the delivery route in the map is the target takeaway delivery route, and the map directs the delivery person's driving route according to the target takeaway delivery route.

[0072] Figure 4 A flowchart of a reasonableness acquisition process provided by an embodiment of the present invention, wherein the reasonableness of different food delivery routes is acquired according to the food delivery information and the suitability, comprises:

[0073] S401. Obtain the delivery quantity of any delivery point in the takeaway delivery path, the sum of the time distances between the current time of each takeaway to be delivered at the delivery point and its corresponding preset delivery arrival time, and the ranking value of all delivery points included in the takeaway delivery path.

[0074] It should be noted that the arrangement order of all the delivery points included in the takeaway delivery route is based on the chronological order of the delivery points when the takeaway is delivered. For example, when the takeaway is delivered, the ranking value of the first delivery point arrived is 1.

[0075] The delivery quantity of the mth delivery point can be expressed as , the sum of the time distances can be expressed as , the ranking value can be expressed as m, the It is the time distance between the current time of the ith takeaway to be delivered at the mth delivery point and the preset delivery arrival time corresponding to the ith takeaway to be delivered.

[0076] S402. Obtain the product of the sum of the time distance and the ranking value, and divide the delivery quantity by the product to obtain the rationality of the delivery order arrangement of the delivery points.

[0077] The rationality of the distribution order arrangement of the mth distribution point can be expressed as:

[0078] ;

[0079] Among them, the rationality of the distribution order arrangement of the distribution point is also the rationality of the distribution order arrangement of the distribution point. Each distribution point has its corresponding rationality of the distribution order arrangement, so the rationality of the distribution point distribution order arrangement and the serial number of the distribution point can be represented by the same letter m.

[0080] S403. Repeat the above process to obtain the rationality of the delivery order arrangement of each delivery point in the takeaway delivery path, add the rationality of the delivery order arrangement of each delivery point in turn, and then multiply it by the suitability to obtain the rationality of the takeaway delivery path.

[0081] The rationality of the distribution order arrangement of each distribution point is added up in sequence to obtain:

[0082] ;

[0083] Among them, the is the number of delivery points of the takeaway delivery route described in Article k.

[0084] The reasonableness can be expressed as:

[0085] ;

[0086] Among them, the For the reasonable degree, the is the degree of suitability, k is the k-th food delivery route, and the value of k is 1 to the number of food delivery routes.

[0087] S404. Repeat the above steps to obtain the rationality of different food delivery routes.

[0088] Repeating the above steps can obtain the rationality of each takeout delivery route.

[0089] right Use sigmoid function to normalize and get , whose value range is (0, 1).

[0090] when The takeaway delivery path corresponding to the largest one is the target takeaway delivery path. The kth takeaway delivery path is determined to be the most reasonable, and the takeaway is delivered according to the arrangement of the target takeaway delivery path. The delivery person is directed to drive according to the target takeaway delivery path.

[0091] According to the ant colony algorithm, the collective behavior of an ant colony composed of a large number of ants shows a positive feedback phenomenon: the more ants that walk on a certain path, the greater the probability that the later ones will choose this path. The user distribution and road conditions during each food delivery can be used as a reference for the selection of food delivery routes in the future. The preference for different roads (roads that can be directly reached between two delivery points without passing through other delivery points) can be adjusted during delivery, so that the resulting food delivery route arrangement takes into account more situations and can be changed according to real-time conditions.

[0092] Figure 5 A flowchart of a process for obtaining a priority is provided in one embodiment of the present invention. The process for obtaining a priority of each delivery path segment includes:

[0093] S501. Obtain the historical target takeaway delivery path of the last takeaway delivery of the current takeaway delivery.

[0094] According to the ant colony algorithm, the collective behavior of an ant colony composed of a large number of ants shows a positive feedback phenomenon: the more ants walk on a certain path, the greater the probability that the later ones will choose this path. The user distribution and road conditions during each food delivery can be used as a reference for the subsequent food delivery route selection. The preference for different roads (roads that can be directly reached between two delivery points without passing through other delivery points) is adjusted during delivery, so that the arrangement of food delivery routes takes into account more situations and can be changed according to real-time conditions.

[0095] S502. Increase the priority of the selected delivery path segment in the historical target takeaway delivery path, and reduce the priority of the unselected delivery path segment in the historical target takeaway delivery path.

[0096] The selected delivery path segments in the historical target takeaway delivery path refer to the delivery path segments included in the historical target takeaway delivery path, and the unselected delivery path segments in the historical target takeaway delivery path refer to the delivery path segments not included in the historical target takeaway delivery path.

[0097] The process of obtaining the selected delivery path segment with increased priority and the process of obtaining the unselected delivery path segment with reduced priority in the historical target food delivery path are described in detail in the fifth embodiment and the eighth embodiment respectively, and will not be repeated here.

[0098] When arranging the delivery route for takeaway food, The delivery path corresponding to the largest one is the target delivery path. All roads in the target delivery path are selected in this delivery because the number of times these roads have been selected since the initial delivery has increased, and their priority should be increased. The larger the value, the more suitable the roads arranged this time are, and the more the preference of each selected road should increase. At the same time, when the on-time arrival of the food delivered this time is better, it means that the selected road is more suitable, and the preference of each selected road should increase more. The more food delivered at a certain delivery point, the more users there are at this delivery point, and the greater the possibility of choosing to pass through the road connecting this delivery point, the more priority the road connecting this delivery point should increase.

[0099] Figure 6 A flowchart of a process for obtaining a delivery path segment with increased priority provided by an embodiment of the present invention, wherein increasing the priority of a delivery path segment selected from the historical target takeaway delivery path includes:

[0100] S601. Obtain the priority increase degree of any selected delivery path segment in the historical target takeaway delivery path, and normalize the priority increase degree to obtain a normalized value of the priority increase degree.

[0101] The degree of increase in priority can be expressed as , the normalized value of the priority increase degree can be expressed as , whose value range is (0, 1).

[0102] The process of obtaining the degree of increase in priority is described in detail in the sixth embodiment and will not be repeated here.

[0103] The normalization process may be performed using a sigmoid function.

[0104] S602. Obtain the priority of the selected delivery path segment.

[0105] The priority of the delivery path segment can be expressed as , It is the historical priority, i.e. the priority of the last food delivery.

[0106] S603. After multiplying the priority by the normalized value of the priority increase degree, the priority is added to obtain the updated current priority of the delivery path segment.

[0107] The current priority can be expressed as:

[0108] ;

[0109] Among them, the is the current priority, The priority is increased by a degree normalization value.

[0110] Figure 7 A flowchart of a process for obtaining a priority increase degree provided by an embodiment of the present invention, wherein obtaining a priority increase degree of any selected delivery path segment in the historical target takeaway delivery path includes:

[0111] S701. Obtain the degree of on-time arrival of the takeaway according to the takeaway delivery information.

[0112] The process of obtaining the degree of on-time arrival of the takeaway food will be described in detail in the seventh embodiment and will not be repeated here.

[0113] S702. The degree of increase in priority is obtained by multiplying the degree of rationality, the degree of on-time arrival of the takeaway, and the sum of the delivery quantities of the two delivery points connected by the selected delivery path segment.

[0114] The degree of increase in priority can be expressed as:

[0115] ;

[0116] Among them, the is the degree of increase in priority, is the reasonable degree, G is the degree to which the takeaway arrives on time, It is the sum of the delivery quantities of the two delivery points connected by the delivery path segment p.

[0117] Figure 8 A flowchart of a process for obtaining the on-time arrival degree of takeout food provided by an embodiment of the present invention, wherein obtaining the on-time arrival degree of takeout food according to the takeout delivery information includes:

[0118] S801. Obtain the sum of the time distances between the actual delivery arrival time of each takeout to be delivered at each delivery point and its corresponding preset delivery arrival time.

[0119] The sum of the time distances can be expressed as:

[0120] ;

[0121] Wherein, m represents the mth distribution point, represents the time distance between the actual arrival time of the ith takeaway to be delivered at the mth delivery point and the preset arrival time of the ith takeaway to be delivered, is the delivery quantity of the mth delivery point, is the number of the delivery points.

[0122] S802. Multiply the number of the delivery points by the delivery quantity of the delivery points to obtain a multiplication result.

[0123] The multiplication result can be expressed as:

[0124] ;

[0125] Among them, the is the number of the distribution points, is the delivery quantity of the mth delivery point.

[0126] S803. Divide the sum of the time distances by the multiplication result to obtain the degree of on-time arrival of the takeaway.

[0127] The on-time arrival degree G of the takeaway can be expressed as:

[0128] ;

[0129] In order to better reflect the superiority of certain roads in delivery, not only should the preference of roads that are often passed by be increased, but also the priority of some roads that are not often passed by should be reduced. When some roads have not been passed by deliverymen for a long time, it proves that these roads are too remote, often congested or the roads are bumpy. The preference of these roads should be reduced, and the longer the time that they have not been passed by deliverymen, the smaller the preference of these roads should be. When the number of takeouts delivered by the delivery points connected to the unselected roads is smaller, it proves that the number of takeout users on this road is smaller, and the takeout delivery priority of this road should be reduced.

[0130] Fig. 9 A flowchart of a process for obtaining a delivery path segment with reduced priority provided by an embodiment of the present invention, wherein reducing the priority of a delivery path segment that is not selected in the historical target takeaway delivery path includes:

[0131] S901. Obtain the priority reduction degree of the unselected delivery path segment in the historical target takeaway delivery path, and normalize the priority reduction degree to obtain a normalized value of the priority reduction degree.

[0132] The process of obtaining the degree of priority reduction will be described in detail in the ninth embodiment and will not be repeated here.

[0133] The normalization method may include a sigmoid function or the like.

[0134] S902. Obtain the priority of the unselected delivery path segment.

[0135] Among them, the priority of the unselected delivery path segment can be expressed as , It is the historical priority, i.e. the priority of the last food delivery.

[0136] S903. Multiply the priority by the normalized value of the priority reduction degree to obtain a priority reduction value.

[0137] The normalized value of the priority reduction degree can be expressed as .

[0138] The priority reduction value can be expressed as .

[0139] S904. Subtract the priority reduction value from the priority to obtain the updated current priority of the delivery path segment.

[0140] The current priority It can be expressed as:

[0141] ;

[0142] Fig.10 A flowchart of a process for obtaining a priority reduction degree provided by an embodiment of the present invention, wherein obtaining a priority reduction degree of a delivery path segment that is not selected in the historical target takeaway delivery path comprises:

[0143] S1001. Obtain the sum of the delivery quantities of the two delivery points connected by the delivery path segment.

[0144] The sum of the delivery quantities can be expressed as , where p represents the pth delivery path segment, The smaller the value of is, the fewer takeaway users are on the p-th delivery path segment, and the preference should be smaller.

[0145] S1002. Obtain the time distance between the time when the deliveryman passed through the unselected delivery route segment during the last delivery of the current food delivery and the current time.

[0146] The time distance can be To indicate that The larger the value is, the more problematic the p-th delivery path segment is and the smaller its priority should be.

[0147] S1003. The time distance is divided by the sum of the delivery quantities to obtain the degree of reduction in priority.

[0148] The degree of reduction in priority It can be expressed as:

[0149] ;

[0150] Fig.11 A schematic diagram of a unit of a takeaway delivery route optimization system for a campus delivery station provided by an embodiment of the present invention, the system comprising:

[0151] The acquisition unit 1101 is used to acquire takeaway delivery information;

[0152] Algorithm unit 1102, used to generate at least one takeaway delivery path based on the distances between different delivery points in the takeaway delivery information and the priority of each delivery path segment using an ant colony algorithm, and obtain the suitability of the takeaway delivery path, wherein the priority is equivalent to the pheromone concentration in the ant colony algorithm, and the suitability is the probability of selecting the takeaway delivery path obtained by the ant colony algorithm;

[0153] The path unit 1103 is used to obtain the rationality of different takeaway delivery paths according to the takeaway delivery information and the suitability, normalize the rationality to obtain a normalized rationality value, and the takeaway delivery path corresponding to the largest normalized value is the target takeaway delivery path, and the delivery person is directed to follow the driving path according to the target takeaway delivery path.

[0154] The technical features and technical effects of the takeout delivery path optimization system for a campus delivery station proposed in an embodiment of the present invention are the same as the method proposed in an embodiment of the present invention, and will not be repeated here.

[0155] The present invention has the following beneficial effects:

[0156] In the present invention, first, food delivery information is obtained, and then, an ant colony algorithm is used to generate at least one food delivery path based on the distance between different delivery points in the food delivery information and the priority of each delivery path segment, and the suitability of the food delivery path is obtained. The priority is equivalent to the pheromone concentration in the ant colony algorithm, and the suitability is the probability of selecting the food delivery path obtained by the ant colony algorithm. At this time, the ant colony algorithm not only takes into account the distance between different delivery points, but also takes into account the priority of each delivery path segment. Therefore, the generated food delivery path is more reasonable, and the suitability of different food delivery paths is the probability of different food delivery paths being selected. Finally, the reasonableness of different food delivery paths is obtained according to the food delivery information and the suitableness, and the reasonableness is normalized to obtain the normalized value of the reasonableness. The food delivery path corresponding to the largest normalized value is the target food delivery path, and the delivery person is directed to travel according to the target food delivery path. That is to say, the degree of suitability is further modified to obtain the reasonableness of different takeaway delivery paths, and the one with the largest normalized value of reasonableness is selected as the target takeaway delivery path to direct the delivery personnel to deliver. By adopting the present invention, the takeaway delivery path arrangement takes into account possible road congestion, the number of takeaways at different delivery points, the required arrival time of takeaways, etc., and can be changed according to real-time conditions, making the takeaway delivery path more reasonable.

[0157] It should be noted that the sequence of the above embodiments of the present invention is only for description and does not represent the advantages and disadvantages of the embodiments. The processes depicted in the accompanying drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0158] The various embodiments in this specification are described in a progressive manner, and the same or similar parts between the various embodiments can be referenced to each other, and each embodiment focuses on the differences from other embodiments.

Claims

1. A method for optimizing the delivery path of takeout food at a campus delivery station, characterized in that: The method comprises: Get takeaway delivery information; An ant colony algorithm is used to generate at least one food delivery path based on the distances between different delivery points in the food delivery information and the priorities of each delivery path segment, and the suitability of the food delivery path is obtained. The priority is equivalent to the pheromone concentration in the ant colony algorithm, and the suitability is the probability of selecting the food delivery path obtained by the ant colony algorithm. The rationality of different food delivery routes is obtained according to the food delivery information and the suitability, and the rationality is normalized to obtain a rationality normalized value. The food delivery route corresponding to the largest normalized value is the target food delivery route, and the delivery person is directed to drive a route according to the target food delivery route; The rationality of obtaining different takeaway delivery paths according to the takeaway delivery information and the suitability includes: Obtain the delivery quantity of any delivery point in the takeaway delivery path, the sum of the time distances between the current time of each takeaway to be delivered at the delivery point and the corresponding preset delivery arrival time, and the ranking value of the delivery point in all delivery points included in the takeaway delivery path; Obtain the product of the sum of the time distance and the ranking value, and divide the delivery quantity by the product to obtain the rationality of the delivery order arrangement of the delivery point; Repeat the above process to obtain the rationality of the delivery order arrangement of each delivery point in the takeaway delivery path, add the rationality of the delivery order arrangement of each delivery point in turn, and then multiply it by the appropriateness to obtain the rationality of the takeaway delivery path; Repeat the above steps to obtain the rationality of different takeaway delivery routes.

2. The method for optimizing the delivery path of takeout food at a campus delivery station as claimed in claim 1, characterized in that: The process of obtaining the priority of each delivery path segment includes: Get the historical target takeaway delivery route of the last takeaway delivery of the current takeaway delivery; The priority of the selected delivery path segment in the historical target takeaway delivery path is increased, and the priority of the unselected delivery path segment in the historical target takeaway delivery path is reduced.

3. The method for optimizing the delivery path of takeout food at a campus delivery station as claimed in claim 2, characterized in that: Increasing the priority of the selected delivery path segment in the historical target takeaway delivery path includes: Obtaining a priority increase degree of any selected delivery path segment in the historical target takeaway delivery path, and normalizing the priority increase degree to obtain a priority increase degree normalized value; Obtaining the priority of the selected delivery path segment; After multiplying the priority by the normalized value of the degree of increase in the priority, the priority is added to obtain the updated current priority of the delivery path segment.

4. The method for optimizing the delivery path of takeout food at a campus delivery station as claimed in claim 3, characterized in that: Obtaining the degree of increase in priority of any selected delivery path segment in the historical target takeaway delivery path includes: Obtaining the degree of on-time arrival of the takeaway according to the takeaway delivery information; The degree of increase in priority is obtained by multiplying the degree of rationality, the degree of on-time arrival of the takeaway, and the sum of the delivery quantities of the two delivery points connected by the selected delivery path segment.

5. The method for optimizing the delivery path of takeout food at a campus delivery station as claimed in claim 4, characterized in that: Obtaining the degree of on-time arrival of takeout food according to the takeout food delivery information includes: Obtain the sum of the time distances between the actual delivery arrival time of each takeaway to be delivered at each delivery point and its corresponding preset delivery arrival time; Multiplying the number of delivery points by the delivery quantity of the delivery points to obtain a multiplication result; The sum of the time distances is divided by the multiplication result to obtain the degree of on-time arrival of the takeaway.

6. The method for optimizing the delivery path of takeout food at a campus delivery station as claimed in claim 2, characterized in that: Reducing the priority of the unselected delivery path segment in the historical target takeaway delivery path includes: Obtaining the priority reduction degree of the unselected delivery path segment in the historical target takeaway delivery path, and normalizing the priority reduction degree to obtain a normalized value of the priority reduction degree; Obtaining the priority of the unselected delivery path segment; Multiplying the priority by the normalized value of the priority reduction degree to obtain a priority reduction value; The priority is subtracted from the priority reduction value to obtain the updated current priority of the delivery path segment.

7. The method for optimizing the delivery path of takeout food at a campus delivery station as claimed in claim 6, characterized in that: Obtaining the priority reduction degree of the unselected delivery path segment in the historical target takeaway delivery path includes: Obtaining the sum of the delivery quantities of the two delivery points connected by the delivery path segment; Obtain the time distance between the time when the delivery person passed through the unselected delivery route segment during the last delivery of the current food delivery and the current time; The time distance divided by the sum of the delivery quantities yields the degree of reduction in priority.

8. The method for optimizing the delivery path of takeout food at a campus delivery station as claimed in claim 1, characterized in that: The food delivery information includes: delivery points, delivery routes, distances between different delivery points, priorities of each delivery route segment, the number of food to be delivered at each delivery point, and the time distance between the current time of each food to be delivered at the delivery point and the preset delivery arrival time.

9. A takeaway delivery route optimization system for campus delivery stations, characterized in that: The system comprises: An acquisition unit, used to acquire takeaway delivery information; an algorithm unit, configured to generate at least one takeaway delivery path by using an ant colony algorithm based on the distances between different delivery points in the takeaway delivery information and the priorities of the delivery path segments, and obtain the suitability of the takeaway delivery path, wherein the priority is equivalent to the pheromone concentration in the ant colony algorithm, and the suitability is the probability of selecting the takeaway delivery path obtained by the ant colony algorithm; a path unit, for obtaining the rationality of different takeaway delivery paths according to the takeaway delivery information and the suitability, normalizing the rationality to obtain a normalized rationality value, the takeaway delivery path corresponding to the largest normalized value being the target takeaway delivery path, and directing the delivery person to drive a path according to the target takeaway delivery path; The rationality of obtaining different takeaway delivery paths according to the takeaway delivery information and the suitability includes: Obtain the delivery quantity of any delivery point in the takeaway delivery path, the sum of the time distances between the current time of each takeaway to be delivered at the delivery point and the corresponding preset delivery arrival time, and the ranking value of the delivery point in all delivery points included in the takeaway delivery path; Obtain the product of the sum of the time distance and the ranking value, and divide the delivery quantity by the product to obtain the rationality of the delivery order arrangement of the delivery point; Repeat the above process to obtain the rationality of the delivery order arrangement of each delivery point in the takeaway delivery path, add the rationality of the delivery order arrangement of each delivery point in turn, and then multiply it by the appropriateness to obtain the rationality of the takeaway delivery path; Repeat the above steps to obtain the rationality of different takeaway delivery routes.

Images