CN115049309A - Garbage collection and transportation route planning method and system - Google Patents

Garbage collection and transportation route planning method and system Download PDF

Info

Publication number
CN115049309A
CN115049309A CN202210850175.6A CN202210850175A CN115049309A CN 115049309 A CN115049309 A CN 115049309A CN 202210850175 A CN202210850175 A CN 202210850175A CN 115049309 A CN115049309 A CN 115049309A
Authority
CN
China
Prior art keywords
route
garbage
initial
point
initial set
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202210850175.6A
Other languages
Chinese (zh)
Other versions
CN115049309B (en
Inventor
王伟
蔡临宁
马锡铭
王晓芳
熊雪珍
刘璇
许正昊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhonghuajie Group Co ltd
Original Assignee
Zhonghuanjie Environment Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhonghuanjie Environment Co ltd filed Critical Zhonghuanjie Environment Co ltd
Priority to CN202210850175.6A priority Critical patent/CN115049309B/en
Publication of CN115049309A publication Critical patent/CN115049309A/en
Application granted granted Critical
Publication of CN115049309B publication Critical patent/CN115049309B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/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
    • 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/30—Administration of product recycling or disposal

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Tourism & Hospitality (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Development Economics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Sustainable Development (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)
  • Refuse Collection And Transfer (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Refuse-Collection Vehicles (AREA)

Abstract

The application relates to a method and a system for planning a garbage collection and transportation route, which belong to the technical field of garbage collection and transportation, and the method comprises the following steps: step S1: acquiring vehicle information and operation information, wherein the operation information comprises a starting point, a stopping point and a plurality of garbage points; step S2: connecting a plurality of garbage points with a starting point and a stopping point respectively to obtain a plurality of initial routes and integrating the initial routes into a first initial set; step S3: obtaining a plurality of garbage point pairs by connecting the garbage points pairwise, and sequencing the garbage point pairs to obtain a second initial set; step S4: obtaining a plurality of confirmed routes according to the first initial set, the second initial set and a preset route generation model, and returning the confirmed routes meeting preset conditions to the first initial set to become new initial routes; step S5: and calculating the total garbage amount of each initial route contained in the first initial set, and marking the initial route with the maximum total garbage amount as a working route and outputting the working route. This application has the effect of high-efficient receipts fortune rubbish.

Description

Garbage collection and transportation route planning method and system
Technical Field
The application relates to the technical field of garbage collection and transportation, in particular to a garbage collection and transportation route planning method and system.
Background
With the acceleration of the urbanization process in China, the original garbage collection and transportation operation cannot meet the high standard and high requirement of modern cities on the environmental quality. Therefore, it is necessary to find suitable methods for efficiently and rapidly collecting, transporting and disposing of the growing waste to efficiently operate the domestic waste collection and transportation system.
Disclosure of Invention
The application provides a method and a system for planning a garbage collection and transportation route, which have the characteristic of efficiently collecting and transporting garbage.
The application aims to provide a garbage collection and transportation route planning method.
The above object of the present application is achieved by the following technical solutions:
a method for planning a garbage collection and transportation route, comprising:
step S1: acquiring vehicle information and operation information of a target area, wherein the vehicle information comprises a receiving and transporting interval and a full capacity, the target area is an area to be subjected to garbage collection and transportation, and the operation information comprises a starting point, an ending point, a plurality of garbage points and the garbage amount of each garbage point contained in the target area;
step S2: connecting the plurality of garbage points with a starting point and a stopping point respectively to obtain a plurality of initial routes, and collecting the initial routes according to a preset arrangement sequence to form a first initial set;
step S3: obtaining a plurality of garbage point pairs by connecting the garbage points pairwise, and sequencing the garbage point pairs from small to large according to the distance values between the garbage point pairs to obtain a second initial set;
step S4: obtaining a plurality of confirmed routes according to the first initial set, the second initial set and a preset route generation model, and returning the confirmed routes meeting preset conditions to the first initial set to become new initial routes;
the step of obtaining a confirmed route includes:
step S41: calling the garbage point pair marks sorted in the second initial set and recorded as a new route;
step S42: calling initial routes where garbage points at two ends of the newly added route are located in the first initial set;
step S43: merging the initial route and the newly added route according to a preset merging rule to obtain a confirmed route;
step S44: judging whether the confirmed route meets a preset condition: the time consumed by the vehicle passing through the confirmation route is positioned in the receiving and transporting interval and the total garbage amount of the garbage points contained in the confirmation route does not exceed the full capacity;
step S45: if yes, returning the confirmed route to the first initial set to become a new initial route;
step S46: if not, returning the initial routes where the garbage points at the two ends of the newly added route are located to the first initial set;
step S47: sequentially calling the garbage point pairs according to the sequence of the remaining garbage point pairs in the second initial set, and repeating the steps S41 to S47;
step S48: judging whether all the garbage point pairs in the second initial set are traversed or not;
step S49: if yes, go out of step S4;
step S5: and calculating the total garbage amount of each initial route contained in the first initial set, and marking the initial route with the maximum total garbage amount as a working route and outputting the working route.
By adopting the technical scheme, based on the vehicle information and the acquired operation information, a plurality of operation routes which are within the collection and transportation interval and have the total garbage amount not exceeding the full-load amount can be obtained, so that the efficiency of the dispatched vehicle for performing garbage collection and transportation according to the operation routes is effectively improved.
The present application may be further configured in a preferred example to: the step of obtaining a plurality of garbage point pairs by connecting the plurality of garbage point pairs pairwise, and sorting the plurality of garbage point pairs from small to large according to the distance values between the garbage point pairs to obtain a second initial set comprises the following steps:
acquiring a plurality of garbage points;
connecting the plurality of garbage points in a pairwise connection manner to obtain n (n-1) garbage point pairs;
wherein n is the number of garbage points.
By adopting the technical scheme, the plurality of garbage point pairs are generated based on the plurality of garbage point pairs, so that data support is provided for subsequent route planning according to the plurality of garbage point pairs.
The present application may be further configured in a preferred example to: the step of combining the initial route and the newly added route according to the preset combination rule to obtain the confirmed route comprises the following steps:
calling an initial route where a garbage point on the front end point of the newly added route is located and marking the initial route as a first initial route,
based on the first initial route, deleting a connecting line between a front end point and a termination point of the newly added route to obtain a first remaining initial route;
calling an initial route where a garbage point on the rear end point of the newly added route is located and marking the initial route as a second initial route,
based on the second initial route, deleting the connecting line between the rear end point and the termination point of the newly added route to obtain a second residual initial route;
connecting the first remaining initial route, the newly added route and the second remaining initial route in series to form a confirmation route;
the front end point is a garbage point which is passed by the vehicle firstly, and the rear end point is a garbage point which is passed by the vehicle finally.
By adopting the technical scheme, the two initial routes and the generated newly added route are combined into one confirmed route one by one, so that data support is provided for the subsequently generated operation route.
The present application may be further configured in a preferred example to: before the operation route is output, the following steps are required:
calculating the arrival time of the vehicle to each garbage point contained in the operation route;
acquiring a forbidden time window of each garbage point contained in the operation route;
judging whether the reaching time of each garbage point included in the vehicle reaching operation route is positioned in a corresponding forbidden time window;
if so, recombining the operation route according to a preset exchange rule;
and outputting the recombined operation route.
By adopting the technical scheme, the output operation route not only meets the requirement that the operation route is positioned in the collection and transportation interval and the total garbage amount does not exceed the full-load amount, but also can automatically adjust the operation route of the garbage point according to the limitation of the forbidden transportation time window, thereby improving the practicability of the application.
The present application may be further configured in a preferred example to: the method for recombining the operation routes according to the preset exchange rule comprises the following steps: and replacing the garbage points in the forbidden time window in a mode of more exchange and less exchange and cross exchange neighborhood.
The application may be further configured in a preferred example to: the step of calculating the total garbage amount of each initial route contained in the first initial set, and marking the initial route with the maximum total garbage amount as the working route and outputting the initial route further comprises the following steps: after the working route is outputted, all the garbage points except the garbage points included in the working route return to the step S2, and the steps S2 to S5 are repeated.
By adopting the technical scheme, all the garbage points in the target area can be brought into the operation route, so that the vehicle can complete the garbage clearing task of the target area according to the operation route.
The second purpose of the application is to provide a garbage collection and transportation route planning system.
The second application object of the present application is achieved by the following technical scheme:
a waste collection and transportation route planning system, comprising:
the system comprises a data acquisition module, a data processing module and a display module, wherein the data acquisition module is used for acquiring vehicle information and operation information of a target area, the vehicle information comprises a receiving and transporting interval and a full capacity, the target area is an area to be subjected to garbage collection and transportation, and the operation information comprises a starting point, a terminating point, a plurality of garbage points and a garbage amount of each garbage point contained in the target area;
the first processing module is used for connecting the plurality of garbage points with a starting point and a stopping point respectively to obtain a plurality of initial routes, and the plurality of initial routes are collected according to a preset arrangement sequence to form a first initial set;
the second processing module is used for obtaining a plurality of garbage point pairs by connecting the garbage points pairwise, and sequencing the garbage point pairs from small to large according to the distance values between the garbage point pairs to obtain a second initial set;
the third processing module is used for obtaining a plurality of confirmed routes according to the first initial set, the second initial set and a preset route generation model, and returning the confirmed routes meeting preset conditions to the first initial set to become new initial routes;
a third processing submodule used for calling the garbage point pair sorted first in the second initial set to be marked as a new route;
a third processing second sub-module, which is used for calling the initial routes where the garbage points at the two ends of the newly added route are located in the first initial set;
a third processing submodule, configured to merge the initial route and the newly added route according to a preset merging rule to obtain a confirmed route;
the third processing fourth sub-module is used for merging the initial route and the newly added route according to a preset merging rule to obtain a confirmed route;
a fifth processing submodule, configured to determine whether the confirmation route meets a preset condition: the time consumed by the vehicle passing through the confirmation route is positioned in the receiving and transporting interval and the total garbage amount of the garbage points contained in the confirmation route does not exceed the full load amount;
a third processing six sub-module, which is used for returning the confirmed routes to the first initial set to become new initial routes when the confirmed routes meet the preset conditions;
the third processing seven sub-module is used for returning the initial routes where the garbage points at the two ends of the newly added route are located to the first initial set when the fact that the routes do not meet the preset conditions is confirmed;
the third processing eight sub-module is used for sequentially calling the garbage point pairs according to the sequencing of the remaining garbage point pairs in the second initial set, and transmitting the called garbage point pairs to the third processing one sub-module for sequential circulation;
a third processing nine sub-module for judging whether to traverse all the garbage point pairs in the second initial set;
a third processing cross module, configured to skip step S4 when traversing all pairs of garbage points in the second initial set;
and the fourth processing module is used for calculating the total garbage amount of each initial route contained in the first initial set, marking the initial route with the maximum total garbage amount as a working route and outputting the working route.
In summary, the present application includes at least one of the following beneficial technical effects:
1. on one hand, based on the vehicle information and the acquired operation information, a plurality of initial routes which are within the collection and transportation interval and have the total garbage amount not exceeding the full-load amount can be acquired, and one with the highest full-load amount can be selected from the plurality of initial routes which meet the preset conditions to serve as an operation route, so that the efficiency of the dispatched vehicle in garbage collection and transportation according to the operation route is effectively improved;
2. on the other hand, the application increases the limiting condition of the forbidden time window, so that the output operation route not only meets the requirement that the operation route is positioned in the collection and transportation interval and the total garbage amount does not exceed the full-load amount, but also can automatically adjust the operation route of the garbage point according to the limitation of the forbidden time window, and the practicability of the application is improved.
Drawings
Fig. 1 is a schematic view of an application scenario provided in the present application.
Fig. 2 is a flowchart of a garbage collection and transportation route planning method according to an embodiment of the present application.
Fig. 3 is a flowchart of obtaining a confirmed route in the garbage collection and transportation route planning method according to the embodiment of the present application.
Fig. 4 is a diagram of a garbage collection and transportation route planning method according to an embodiment of the present disclosure.
Fig. 5 is a further view of the display of fig. 4.
Fig. 6 is a block diagram of a garbage collection and transportation route planning system according to an embodiment of the present application.
Description of reference numerals: 10. a vehicle data management system; 20. a geographic trash can data management system; 30. A vehicle online monitoring system; 40. a sanitation contractor data management system; 41. a data acquisition module; 42. a first processing module; 43. a second processing module; 44. a third processing module; 441. thirdly, processing a submodule; 442. a third processing second sub-module; 443. a third processing submodule; 444. a third processing four sub-module; 445. a third processing five sub-module; 446. a third processing six sub-module; 447. a third processing seven sub-module; 448. a third processing eight sub-module; 449. a third processing nine sub-module; 45. and a fourth processing module.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application. It is to be understood that the embodiments described are only a few embodiments of the present application and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Fig. 1 is a schematic view of an application scenario provided in the present application. As shown in fig. 1, the application scenario includes a vehicle data management system 10, a geographic trash can data management system 20, a vehicle online monitoring system 30, and a sanitation contractor data management system 40.
The vehicle data management system 10 stores therein vehicle information of the sanitation vehicle, which is different from other types of vehicle characteristic information such as a collection and transportation section, a full capacity amount, a vehicle running speed, and the like during vehicle operation.
The geo-trash can data management system 20 includes a plurality of trash stations, the number of trash cans contained in each trash station, and the amount of trash in each trash can. Each rubbish station all is provided with orientation module, like the combination of electronic equipment, electron device or a plurality of electron device that big dipper orientation module, GPS orientation module etc. have the locate function to make managers learn the geographical position at each rubbish station according to orientation module, and generate operation information according to geographical position and rubbish volume, and then be convenient for carry out the management and control to the rubbish station.
The vehicle online monitoring system 30 includes a vehicle positioning module, a vehicle video capturing module, and a full capacity detecting module. The vehicle positioning module, the vehicle video acquisition module and the full capacity detection module are all installed on the vehicle. Particularly, the vehicle positioning module is an electronic device with a vehicle movement route positioning function, such as a GPS positioning module and a Beidou positioning module, so that whether a driver carries out receiving and transporting work according to an operation route is conveniently judged. The vehicle video acquisition module can acquire the traffic condition of the running vehicle through the forward-looking camera, the reverse-looking camera and other acquisition devices, so that the environmental condition is reported to the environmental sanitation contractor data management system 40 when the vehicle is in traffic jam and the road is rugged. The full capacity detection module, such as a camera, a weighing sensor, etc., can acquire the electronic devices of the vehicle in the process of operation, and upload the acquired data to the data management system 40 of the environmental sanitation contractor.
The environmental sanitation contractor data management system 40 includes an order receiving module, a data processing module, and a dispatching module. The order receiving module may be an Android operating system or an apple ios operating system, and is not specifically limited in this embodiment of the present application.
The data processing module comprises a processor, a memory, an interface device and a communication device. The processor is used to execute program instructions that may employ an instruction set of architectures such as x86, Arm, RISC, MIPS, SSE, and the like. The memory includes, for example, a ROM (read only memory), a RAM (random access memory), a nonvolatile memory such as a hard disk, and the like. The interface device includes, for example, a USB interface, a serial interface, and the like. The communication device is capable of wired or wireless communication, for example. The memory is configured to store instructions for controlling the processor to operate to implement or support the implementation of the garbage collection and transportation routing method in accordance with at least some embodiments of the present description. The skilled person can design the instructions according to the solution disclosed in the present specification. How the instructions control the operation of the processor is well known in the art and will not be described in detail herein.
The data processing module is connected with the order receiving module, the vehicle data management system 10, the geographic garbage can data management system 20 and the vehicle online monitoring system 30. When the data processing module receives a garbage collection instruction, vehicle information is called from the vehicle data management system 10, operation information of each garbage station is checked from the geographic garbage bin data management system 20, an operation route is generated according to the vehicle information and the operation information of the garbage stations, the operation route is output to the order dispatching module, a garbage collection task is executed by the vehicle according to the operation route, and finally the specific situation of the vehicle in the garbage collection task is monitored in real time by the vehicle online monitoring system 30, so that a manager can know the completion situation of the order dispatching task.
For sanitation companies, garbage collection and transportation projects in cities are one of main operation businesses, the fact that the mileage of a working route is reduced means that more collection and transportation tasks can be completed in the same time means that the time spent on completing the same tasks is shorter, the manpower and other various costs are reduced, and the companies can obtain greater profit. On the other hand, the garbage collection and transportation route planning algorithm based on universality can quickly complete route planning of a company for newly accepted urban projects so as to save exploration cost, create income for enterprises and assist the enterprises to continuously and quickly develop. Therefore, the system of the garbage collection and transportation route planning method can optimize the garbage collection and transportation route, improve the logistics efficiency and reduce the garbage transfer cost.
The application provides a garbage collection and transportation route planning method. As shown in fig. 2, the main flow of the garbage collection and transportation route planning method is described as follows:
step S1: vehicle information and work information of a target area are acquired.
The vehicle information includes a collection area and a full capacity. Specifically, the reason for setting the transportation section is that each vehicle has different energy consumption, so each vehicle has a transportation time threshold, and when the transportation time of the vehicle exceeds the transportation time threshold, the oil amount of the vehicle may be exhausted, and the service life of the vehicle may be shortened. The full capacity is the maximum capacity of the vehicle that can be loaded with refuse. The vehicle information further includes a driving speed, which is an average speed of the vehicle during the garbage collection and transportation, and is related to the region for garbage collection and transportation, and can be obtained by collecting and transporting the garbage for a limited number of times.
The target area is an area to be garbage collected, and the operation information includes a start point, an end point, a plurality of garbage points and a garbage amount of each garbage point included in the target area. Further, the starting point is a vehicle parking lot, i.e., a place where the vehicle is parked. The end point is a transfer station, namely a place where the vehicle unloads garbage, and after the vehicle finishes all cleaning tasks, the vehicle returns to the parking lot to finish the work of the day. The operation information of the target area is acquired to provide data support for garbage collection and transportation route planning.
Step S2: and connecting the plurality of garbage points with the starting point and the ending point respectively to obtain a plurality of initial routes, and collecting the plurality of initial routes according to a preset arrangement sequence to form a first initial set.
After the starting point, the stopping point and the garbage points are obtained, each garbage point is respectively connected with the starting point and the stopping point, so that one garbage point independently forms an initial route, and n initial routes are obtained when n garbage points exist. N is any positive integer.
After n initial routes are obtained, the n initial routes are collected according to a preset arrangement sequence to form a first initial set. In a specific example, the preset arrangement order may be arranged according to the length of the initial route. In other examples, the preset ranking order may be a chronological order of the initial route generation as the ranking order. In the practical application process, the specific arrangement order is not limited herein.
Step S3: and sequencing the plurality of garbage point pairs from small to large according to the distance values between the garbage point pairs to obtain a second initial set.
In short, if n garbage points exist, n (n-1) garbage point pairs are obtained by adopting a pairwise connection mode, and then the n (n-1) garbage point pairs are sequenced. It should be noted that, in real life, the following two situations exist between any two garbage spots:
in the first case: when the road connecting the two garbage points is a one-way road, the distances between two pairs of garbage points in the end points that are the same and in opposite order may be unequal, for example, the distance between the garbage point a and the garbage point B is unequal to the distance between the garbage point B and the garbage point a, so that the garbage point pair a between the garbage point a and the garbage point B is not the same as the garbage point pair B between the garbage point B and the garbage point a in the second initial set.
In the second case: if in actual life, two garbage points are in a double-track or even in a single-track, but the distances between the two single-track are equal, the garbage points on the end points are the same, and the distances between two pairs of garbage points in the opposite sequence are the same.
For the second case described above, in the same ordering of the second initial set: and the garbage points at the two ends are the same, the sequence of the garbage points is opposite, and the garbage point pair taking the garbage point close to the starting point as the front end point is arranged before the garbage point pair taking the garbage point far from the starting point as the front end point. The front end point is a garbage point which is passed by the vehicle firstly.
The second initial set is then passed to the next step.
Step S4: and obtaining a plurality of confirmed routes according to the first initial set, the second initial set and a preset route generation model, and returning the confirmed routes meeting preset conditions to the first initial set to become new initial routes.
Further, a specific flow for obtaining the confirmed route is shown in fig. 3, and specifically includes:
step S41: calling the garbage point pair sorted first in the second initial set and marking as a new route;
step S42, calling initial routes of the garbage points at the two ends of the newly added route in the first initial set;
step S43, merging the initial route and the newly added route according to a preset merging rule to obtain a confirmed route;
step S44, judging whether the confirmed route meets the preset condition: the time consumed by the vehicle passing through the confirmation route is positioned in the receiving and transporting interval and the total garbage amount of the garbage points contained in the confirmation route does not exceed the full capacity;
step S45, if yes, returning the confirmed route to the first initial set to become a new initial route;
step S46, if not, returning the initial routes where the garbage points at the two ends of the newly added route are located to the first initial set;
step S47, sequentially calling the garbage point pairs according to the sequence of the remaining garbage point pairs in the second initial set, and repeating the steps S41 to S47;
step S48, judging whether to traverse all the garbage point pairs in the second initial set;
step S49, if yes, go out of step S4.
In short, the steps S41 to S47 are performed as a process of sequentially analyzing and processing the pairs of spam points in the second initial set, and the confirmation route is gradually generated during the traversal of the pairs of spam points in the second initial set. The specific traversal process is as follows:
firstly, calling the garbage point pairs sorted into the first initial set and marking the garbage point pairs as a new added route, and then calling the related initial route in the first initial set according to the garbage points contained at the two ends of the new added route, namely calling the initial route where the garbage points at the two ends of the new added route are located; then, deleting the connecting line between the front end point and the end point of the newly added route and deleting the connecting line between the rear end point and the departure point of the newly added route, and connecting the remaining initial route and the newly added route in series to form a confirmation route. Finally, judging whether the confirmed route meets the two preset conditions or not, if so, returning the confirmed route to the first initial set to become a new initial route; and if the initial route is not satisfied, giving up forming a confirmation route, and returning the initial routes where the garbage points at the two ends of the called newly-added route are located to the first initial set. The rear end point is a garbage point which is passed by the vehicle at last.
After traversing the first garbage point pairs in the second initial set, sequentially calling the garbage point pairs according to the sorting of the remaining garbage point pairs in the second initial set, and repeating the steps from S41 to S47 until the garbage point pairs in the second initial set are completely traversed. It should be noted that the merged confirmation route cannot be looped, that is, the front end point and the rear end point of the confirmation route cannot be connected, and the pair of spam points related to spam points located in the middle section of the confirmation route is not connected, so when the pair of connection points between the front end point and the rear end point of the confirmation route and the pair of spam points related to spam points located in the middle section of the confirmation route are encountered, the pair of spam points is directly skipped, that is, the confirmation route is not formed. The above-mentioned garbage points located in the middle section of the confirmation route refer to all the garbage points except the front end point and the rear end point in the confirmation route.
For convenience of explanation of steps S41 to S47, for example, as shown in fig. 4, the example is a target area where two garbage spots are in a double-track or even a single-track, but the distance between the two single-track is equal, and the following is specifically described: the target area is set to be a two-dimensional coordinate system, a starting point S (0,4.5), an end point T (6,5), a garbage point a (3,3.5), a garbage point b (4,4.5), a garbage point c (4,3), a garbage point d (2.5,1) and a garbage point e (4,0) exist in the two-dimensional coordinate system, and each unit in the two-dimensional coordinate system corresponds to 100 meters of an actual scene. For simplicity, the two-dimensional coordinates of the starting point S, the ending point T, the garbage point a, the garbage point b, the garbage point c, the garbage point d and the garbage point e are not shown below, and the starting point S, the ending point T, the garbage point a, the garbage point b, the garbage point c, the garbage point d and the garbage point e are represented by letters S, a, b, c, d, e and T, respectively.
First, a first initial set [ route V, route W, route X, route Y, route Z ] and a second initial set are obtained from the above points:
Figure BDA0003753299580000101
in the first initial set, a is located in an initial route V, which includes the route V 1 And line V 2 . Likewise, b is located in an initial route W, which includes route W 1 And a route W 2 (ii) a c is located in an initial route X, which includes route X 1 And route X 2 (ii) a d is located in an initial route Y, which includes route Y 1 And route Y 2 (ii) a e is located in an initial route Z, which includes route Z 1 And route Z 2 。
Then, carrying out the operation; the first step is as follows: calling the garbage point pairs a-b as a newly added route I, calling an initial route V and an initial route W in a first initial set, and deleting the route V 2 And a route W 1 The confirmation route is obtained as follows: route V 1 + newly-added route I + route W 2 . If the confirmed route meets the two preset conditions, returning the confirmed route to the first initial set and naming the confirmed route as an initial route U, wherein the route U is formed by the route U 1 And route U 2 Composition, route U is marked by an arrow in FIG. 5 1 And route U 2 . After the route U is obtained, since a is the front end point of the route U and b is the back end point of the route U, even if the pair of trash points b-a and the pair of trash points a-b are located in the same sort of the second initial set at the same time, the reason why the pair of trash points a-b is called first and the pair of trash points a-b is called first is already described in step S3, and therefore, the detailed description is omitted here, so when the pair of trash points b-a is called, a confirmation route is not formed, and the pair of trash points b-c in the second initial set is called continuously.
The second step is that: calling the garbage point pairs b-c as a newly added route II, calling an initial route U and an initial route X in a first initial set, and deleting the route U 2 And route X 1 The confirmation route is obtained as follows: route U 1 + New route II + route X 2 If the confirmed route meets the two preset conditions, the confirmed route is returned to the first initial set and named as an initial route R. While a pair of garbage points c-b in the same rank as the pair of garbage points b-c does not generate an acknowledgement route.
The third step: calling the garbage point pairs d-e as a newly added route III, calling an initial route Y and an initial route Z in a first initial set, and deleting the route Y 2 And route Z 1 The confirmation route is obtained as follows: route Y 1 + New route III + route Z 2 . And if the confirmed route meets the two preset conditions, returning the confirmed route to the first initial set and naming the confirmed route as an initial route Q. The garbage point pairs e-d are called, but no validation route is generated. The composition and manner of presentation of routes R and Q generated as described above is similar to the composition and manner of presentation of route U in fig. 5, and therefore, no reference is made to routes R and Q in the drawings of the specification.
The fourth step: calling the garbage point pairs d-c as newly added routes IV, calling an initial route R and an initial route Q in a first initial set, and deleting the route R 2 And route Q 1 The confirmation route is obtained as follows: route R 1 + newly-added route IV + route Q 2 . At this time, if the confirmation route meets the two preset conditions, the remaining garbage point pairs are continuously traversed. When the garbage point pair a-c is called, the garbage point a is found to be a route R 1 + newly-added route IV + route Q 2 The front end point of the confirmed route is obtained, and the garbage point c is positioned on the route R 1 + newly-added route IV + route Q 2 In the middle section of the obtained confirmation route, at this time, the garbage point pair related to the garbage point c is not merged any more, that is, a new garbage point cannot be expanded to the generated confirmation route through the garbage point pair a-c, so that the judgment of the garbage point pair a-c is skipped. When the garbage point pair c-e is called, the garbage point c is positioned on the route R 1 + newly-added route IV + route Q 2 And the middle section of the obtained confirmation route is not merged at the moment of the garbage point pair related to the garbage point c. And judging the remaining garbage point pairs according to the mode of judging the garbage point pairs a-c and c-e until the remaining garbage point pairs are traversed.
Further, if during the process of analyzing and processing the garbage point pairs d-c, route R is found 1 + newly-added route IV + route Q 2 If the obtained confirmation route does not meet the two preset conditions, the initial routes where the garbage points at the two ends of the newly added route are located need to be returned to the first initial set, that is, the initial route R and the initial route Q are returned to the first initial set again.
In an actual application process, due to the fact that the number of the garbage points contained in the target area is large, the initial routes are continuously merged to obtain the confirmed routes, and then the confirmed routes meeting the preset conditions are returned to the first initial set to become new initial routes under the repeated operation, so that the first initial set obtains a plurality of initial routes meeting the two preset conditions.
Step S5: and calculating the total garbage amount of each initial route contained in the first initial set, and marking the initial route with the maximum total garbage amount as a working route and outputting the working route.
The purpose of efficiently collecting and transporting the garbage is achieved by selecting the initial route with the largest total garbage amount as the operation route to ensure that the output operation route is the route with the highest garbage collecting and transporting efficiency in the route planning.
Further, after obtaining the operation route, the following steps are required:
step S51: calculating the arrival time of the vehicle to each garbage point contained in the operation route;
step S52: acquiring a forbidden time window of each garbage point contained in the operation route;
step S53: judging whether the reaching time of each garbage point included in the vehicle reaching operation route is positioned in a corresponding forbidden time window;
step S54: if so, recombining the operation route according to a preset exchange rule;
step S55: and outputting the recombined operation route.
The forbidden time window is related to the actual time, for example, the allowed collection and transportation time of a garbage station in a school is 6:00-7:00, and the other time is not allowed to collect and transport garbage, so the forbidden time window is 7:00-22:00 and 00:00-6: 00. Therefore, in order to improve the utility of the present application, it is necessary to consider the prohibited time window for each trash point when outputting the work route. It should be noted that the allowed receiving and transporting time of the garbage points may be the same or different, and generally, the allowed receiving and transporting time of the garbage station in each city is generally located in the morning, so the forbidden time windows of most garbage points are not too different, and therefore, the garbage points whose arrival time of the vehicle is located in the forbidden time window are usually located at the tail of the operation route.
Therefore, according to the method, the garbage points at the tail part of the operation route can be replaced in a mode of more changing and less exchanging and cross-exchanging the neighborhood, namely the operation route is recombined by adopting a preset exchanging rule. For example, if the arrival time of three garbage points in the operation route is within the forbidden time window, a garbage point with a garbage amount close to the total amount of the three garbage points is searched in an area adjacent to the three garbage points, so that the driving distance of the vehicle is reduced, and the garbage points in the operation route meet the limitation condition of the forbidden time window. The above example may also be: searching a garbage point with the garbage amount similar to the total amount of any two garbage points in an area adjacent to the three garbage points, wherein one garbage point is less in the traveling path of the vehicle after the switching, so that the garbage points contained in the switched operation route all meet the limitation of the forbidden time window, the situation that the three garbage points in the operation route are replaced by one garbage point in the neighborhood or the two garbage points in the operation route are replaced by one garbage point in the neighborhood all meet the limitation of the operation route on the forbidden time window, at the moment, the route with the shortest distance is marked as the operation route to reduce the distance difference between the recombined operation route and the initially obtained operation route, thereby reducing the situation that the time consumed by the vehicle through the recombined operation route exceeds the receiving and transporting interval due to the fact that the distance of the recombined operation route is lengthened, and then the practicality of this application has been improved.
Further, after the working route is output, the method returns all the remaining garbage points to the step S2 except the garbage points included in the working route, and repeats the steps S2 to S5 until all the garbage points in the target area are brought into the working route, so that the vehicle can complete the garbage clearing task of the target area according to the generated working routes.
In summary, according to the present application, a plurality of operation routes that both satisfy the requirement of being located in the garbage collection and transportation area and the requirement that the total garbage amount does not exceed the full-load amount can be obtained according to the operation information in the target area, and the garbage points can be automatically adjusted according to the limitation of the forbidden time window, so that the output operation route not only has a short route distance and the full-load amount but also is the optimal one under the same condition, and further, the efficiency of the dispatched vehicle in performing garbage collection and transportation according to the operation route is effectively improved.
The above is an introduction of the method embodiment, and the scheme is further described below by a system embodiment.
The present application provides a waste collection and transportation route planning system, as shown in fig. 6, the waste collection and transportation route planning system includes a data obtaining module 41, a first processing module 42, a second processing module 43, a third processing module 44, and a fourth processing module 45, the data obtaining module 41, the first processing module 42, the second processing module 43, the third processing module 44, and the fourth processing module 45 are sequentially connected, and the data obtaining module 41, the first processing module 42, the second processing module 43, the third processing module 44, and the fourth processing module 45 are all components of a data processing module in the sanitation contractor data management system 40 in an application scenario, and the system is used for optimizing a waste collection and transportation route, so as to achieve the purposes of improving waste collection and transportation efficiency and reducing waste transportation cost.
The third processing module 44 includes a third processing first sub-module 441, a third processing second sub-module 442, a third processing third sub-module 443, a third processing fourth sub-module 444, a third processing fifth sub-module 445, a third processing sixth sub-module 446, a third processing seventh sub-module 447, a third processing eighth sub-module 448, and a third processing ninth sub-module.
Specifically, the data acquisition module 41 is used to acquire vehicle information and work information of a target area. The first processing module 42 is configured to connect the plurality of garbage points with the departure point and the termination point respectively to obtain a plurality of initial routes, and the plurality of initial routes are aggregated according to a preset arrangement order to form a first initial set. The second processing module 43 is configured to obtain a plurality of pairs of garbage points by connecting the plurality of garbage points pairwise, and sort the plurality of pairs of garbage points from small to large according to a distance value between the pairs of garbage points to obtain a second initial set. The third processing module 44 is configured to obtain multiple confirmed routes according to the first initial set, the second initial set, and a preset route generation model, and return the confirmed routes meeting preset conditions to the first initial set to become new initial routes. The third processing sub-module 441 is used for calling the first sorted garbage point in the second initial set to be marked as a new route. The third processing second sub-module 442 is configured to call the initial route where the garbage points at two ends of the newly added route are located in the first initial set. The third processing sub-module 443 is used for merging the initial route and the newly added route according to a preset merging rule to obtain a confirmed route. The third processing four sub-module 444 is used for judging whether the confirmed route meets the preset conditions: the time consumed by the vehicle to pass through the confirmation route is within the receiving and transporting interval and the total garbage amount of the garbage points contained in the confirmation route does not exceed the full capacity. The third process five sub-module 445 is used for returning the confirmed routes to the first initial set to become new initial routes when the confirmed routes meet the preset conditions. The third processing six sub-module 446 is configured to return the initial routes where the garbage points at the two ends of the newly added route are located to the first initial set when it is determined that the route does not meet the preset condition. The third processing seventh sub-module 447 is configured to sequentially retrieve the garbage point pairs according to the sorting of the remaining garbage point pairs in the second initial set, and transmit the retrieved garbage point pairs to the third processing first sub-module 441 for sequential circulation. The third process eight sub-module 448 is used to determine whether all pairs of garbage points in the second initial set are traversed. The third process nine sub-module 449 is adapted to skip out of step S4 when traversing all the garbage point pairs in the second initial set. The fourth processing module 45 is configured to calculate a total amount of garbage for each of the initial routes included in the first initial set, mark the initial route with the largest total amount of garbage as a working route, and output the working route.
The foregoing description is only exemplary of the preferred embodiments of the invention and is provided for the purpose of illustrating the general principles of the technology. It will be appreciated by those skilled in the art that the scope of the disclosure herein is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the disclosure. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.

Claims (7)

1. A garbage collection and transportation route planning method is characterized by comprising the following steps:
step S1: acquiring vehicle information and operation information of a target area, wherein the vehicle information comprises a receiving and transporting interval and a full capacity, the target area is an area to be subjected to garbage collection and transportation, and the operation information comprises a starting point, an ending point, a plurality of garbage points and the garbage amount of each garbage point contained in the target area;
step S2: connecting the plurality of garbage points with a starting point and a stopping point respectively to obtain a plurality of initial routes, and collecting the initial routes according to a preset arrangement sequence to form a first initial set;
step S3: obtaining a plurality of garbage point pairs by connecting the garbage points pairwise, and sequencing the garbage point pairs from small to large according to the distance values between the garbage point pairs to obtain a second initial set;
step S4: obtaining a plurality of confirmed routes according to the first initial set, the second initial set and a preset route generation model, and returning the confirmed routes meeting preset conditions to the first initial set to become new initial routes;
the step of obtaining a confirmed route includes:
step S41: calling the garbage point pair marks sorted in the second initial set and recorded as a new route;
step S42: calling initial routes where garbage points at two ends of the newly added route are located in the first initial set;
step S43: merging the initial route and the newly added route according to a preset merging rule to obtain a confirmed route;
step S44: judging whether the confirmed route meets a preset condition: the time consumed by the vehicle passing through the confirmation route is positioned in the receiving and transporting interval and the total garbage amount of the garbage points contained in the confirmation route does not exceed the full capacity;
step S45: if yes, returning the confirmed route to the first initial set to become a new initial route;
step S46: if not, returning the initial routes where the garbage points at the two ends of the newly added route are located to the first initial set;
step S47: sequentially calling the garbage point pairs according to the sequence of the remaining garbage point pairs in the second initial set, and repeating the steps S41 to S47;
step S48: judging whether all the garbage point pairs in the second initial set are traversed or not;
step S49: if yes, go out of step S4;
step S5: and calculating the total garbage amount of each initial route contained in the first initial set, and marking the initial route with the maximum total garbage amount as a working route and outputting the working route.
2. The garbage collection and transportation route planning method according to claim 1, wherein the step of connecting the garbage points two by two to obtain a plurality of garbage point pairs, and the step of sorting the garbage point pairs according to the distance between the garbage point pairs from small to large to obtain a second initial set comprises:
acquiring a plurality of garbage points;
connecting the plurality of garbage points in a pairwise connection manner to obtain n (n-1) garbage point pairs;
wherein n is the number of garbage points.
3. The garbage collection and transportation route planning method according to claim 1, wherein the step of merging the initial route and the added route according to a preset merging rule to obtain the confirmed route comprises:
calling an initial route where a garbage point on the front end point of the newly added route is located and marking the initial route as a first initial route,
based on the first initial route, deleting a connecting line between a front end point and a termination point of the newly added route to obtain a first remaining initial route;
calling an initial route where a garbage point on the rear end point of the newly added route is located and marking the initial route as a second initial route,
based on the second initial route, deleting the connecting line between the rear end point and the termination point of the newly added route to obtain a second residual initial route;
connecting the first remaining initial route, the newly added route and the second remaining initial route in series to form a confirmation route;
the front end point is a garbage point which is passed by the vehicle firstly, and the rear end point is a garbage point which is passed by the vehicle finally.
4. The waste collection and transportation route planning method according to claim 1, wherein before the operation route is output, the following steps are further performed:
calculating the arrival time of the vehicle to each garbage point contained in the operation route;
acquiring a forbidden time window of each garbage point contained in the operation route;
judging whether the reaching time of each garbage point included in the vehicle reaching operation route is positioned in a corresponding forbidden time window;
if so, recombining the operation route according to a preset exchange rule;
and outputting the recombined operation route.
5. The garbage collection and transportation route planning method according to claim 4, wherein the method for recombining the operation route according to the preset exchange rule comprises: and replacing the garbage points in the forbidden time window in a mode of more exchange and less exchange and cross exchange neighborhood.
6. The garbage collection route planning method according to claim 1, wherein the step of calculating the total garbage amount of each of the initial routes included in the first initial set, and marking the initial route with the largest total garbage amount as the working route and outputting the marked initial route further comprises: after the working route is outputted, all the garbage points except the garbage points included in the working route return to the step S2, and the steps S2 to S5 are repeated.
7. A waste collection and transportation route planning system, comprising:
the system comprises a data acquisition module (41) and a display module, wherein the data acquisition module is used for acquiring vehicle information and operation information of a target area, the vehicle information comprises a receiving and transporting interval and a full capacity, the target area is an area to be subjected to garbage collection and transportation, and the operation information comprises a starting point, an ending point, a plurality of garbage points and a garbage amount of each garbage point contained in the target area;
the first processing module (42) is used for connecting the plurality of garbage points with the starting point and the ending point respectively to obtain a plurality of initial routes, and the initial routes are collected according to a preset arrangement sequence to form a first initial set;
the second processing module (43) is used for obtaining a plurality of garbage point pairs by connecting the garbage points pairwise, and sequencing the garbage point pairs from small to large according to the distance values between the garbage point pairs to obtain a second initial set;
the third processing module (44) is used for obtaining a plurality of confirmed routes according to the first initial set, the second initial set and a preset route generation model, and returning the confirmed routes meeting preset conditions to the first initial set to become new initial routes;
a third processing submodule (441) for calling the first sorted garbage point in the second initial set to mark as a new route;
a second processing submodule (442) for calling the initial routes where the garbage points at the two ends of the newly-added route are located in the first initial set;
a third processing third sub-module (443) for merging the initial route and the newly added route according to a preset merging rule to obtain a confirmed route;
a third processing four sub-module (444) for determining whether the confirmation route satisfies a preset condition: the time consumed by the vehicle passing through the confirmation route is positioned in the receiving and transporting interval and the total garbage amount of the garbage points contained in the confirmation route does not exceed the full capacity;
a fifth processing submodule (445) for returning the confirmed routes to the first initial set to become new initial routes when the confirmed routes meet the preset conditions;
a third processing six sub-module (446) which is used for returning the initial routes where the garbage points at the two ends of the newly added route are located to the first initial set when the route is confirmed not to meet the preset condition;
a third processing seventh sub-module (447) for sequentially calling the garbage point pairs according to the sorting of the remaining garbage point pairs in the second initial set, and transmitting the called garbage point pairs to the third processing first sub-module (441) for sequential circulation;
a third processing eight sub-module (448) for judging whether all the garbage point pairs in the second initial set are traversed;
a third processing nine sub-module (449) for jumping out of step S4 when traversing all the garbage point pairs in the second initial set;
and the fourth processing module (45) is used for calculating the total garbage amount of each initial route contained in the first initial set, and marking the initial route with the maximum total garbage amount as a working route and outputting the working route.
CN202210850175.6A 2022-07-19 2022-07-19 Garbage collection and transportation route planning method and system Active CN115049309B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210850175.6A CN115049309B (en) 2022-07-19 2022-07-19 Garbage collection and transportation route planning method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210850175.6A CN115049309B (en) 2022-07-19 2022-07-19 Garbage collection and transportation route planning method and system

Publications (2)

Publication Number Publication Date
CN115049309A true CN115049309A (en) 2022-09-13
CN115049309B CN115049309B (en) 2023-01-13

Family

ID=83167367

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210850175.6A Active CN115049309B (en) 2022-07-19 2022-07-19 Garbage collection and transportation route planning method and system

Country Status (1)

Country Link
CN (1) CN115049309B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116227775A (en) * 2023-05-06 2023-06-06 中国公路工程咨询集团有限公司 Method, device and storage medium for determining road maintenance operation route

Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020023860A1 (en) * 2000-07-27 2002-02-28 Bahram Rabiei Method and system for garbage recycling
US20060206623A1 (en) * 2005-03-10 2006-09-14 Peter Gipps Path determination system for vehicle infrastructure paths
CN105868856A (en) * 2016-04-01 2016-08-17 苏州玄禾物联网科技有限公司 Garbage recycling path optimization system based on internet of things
CN105868857A (en) * 2016-04-01 2016-08-17 苏州玄禾物联网科技有限公司 Method for optimizing shortest path for recovering garbage in district
CN105956695A (en) * 2016-04-27 2016-09-21 苏州市伏泰信息科技股份有限公司 Circular and optimized planning method and system for garbage collection and transportation
US20190163191A1 (en) * 2016-06-10 2019-05-30 Duke University Motion planning for autonomous vehicles and reconfigurable motion planning processors
CN110334874A (en) * 2019-07-10 2019-10-15 云南电网有限责任公司电力科学研究院 A kind of smart city garbage truck travel route optimization method
JP2020019639A (en) * 2018-08-02 2020-02-06 日立造船株式会社 Garbage count measurement device and garbage count measurement system and garbage collection route optimization system equipped therewith
CN111301896A (en) * 2020-02-18 2020-06-19 东莞蜂巢智慧智能科技有限公司 Efficient garbage collection method and system, computer and storage medium
CN112232563A (en) * 2020-10-14 2021-01-15 平安国际智慧城市科技股份有限公司 Household garbage collection and transportation route scheduling method and device, computer equipment and medium
CN112478529A (en) * 2020-11-30 2021-03-12 重庆电子工程职业学院 Intelligent garbage collection and transportation system
WO2021093685A1 (en) * 2019-11-06 2021-05-20 南京君慕士物联网技术研究院有限公司 Internet-of-things-based garbage disposal system
CN112906932A (en) * 2019-12-04 2021-06-04 北京城市机扫服务有限公司 Method and device for processing route of garbage cleaning vehicle
CN114330874A (en) * 2021-12-28 2022-04-12 扬州大学 Vehicle collecting and transporting scheduling method and system based on urban household garbage classification
CN114386690A (en) * 2022-01-10 2022-04-22 苏迈特智能科技(江苏)有限公司 Garbage truck route planning method and system, electronic device and readable storage medium

Patent Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020023860A1 (en) * 2000-07-27 2002-02-28 Bahram Rabiei Method and system for garbage recycling
US20060206623A1 (en) * 2005-03-10 2006-09-14 Peter Gipps Path determination system for vehicle infrastructure paths
CN105868856A (en) * 2016-04-01 2016-08-17 苏州玄禾物联网科技有限公司 Garbage recycling path optimization system based on internet of things
CN105868857A (en) * 2016-04-01 2016-08-17 苏州玄禾物联网科技有限公司 Method for optimizing shortest path for recovering garbage in district
CN105956695A (en) * 2016-04-27 2016-09-21 苏州市伏泰信息科技股份有限公司 Circular and optimized planning method and system for garbage collection and transportation
US20190163191A1 (en) * 2016-06-10 2019-05-30 Duke University Motion planning for autonomous vehicles and reconfigurable motion planning processors
JP2020019639A (en) * 2018-08-02 2020-02-06 日立造船株式会社 Garbage count measurement device and garbage count measurement system and garbage collection route optimization system equipped therewith
CN110334874A (en) * 2019-07-10 2019-10-15 云南电网有限责任公司电力科学研究院 A kind of smart city garbage truck travel route optimization method
WO2021093685A1 (en) * 2019-11-06 2021-05-20 南京君慕士物联网技术研究院有限公司 Internet-of-things-based garbage disposal system
CN112906932A (en) * 2019-12-04 2021-06-04 北京城市机扫服务有限公司 Method and device for processing route of garbage cleaning vehicle
CN111301896A (en) * 2020-02-18 2020-06-19 东莞蜂巢智慧智能科技有限公司 Efficient garbage collection method and system, computer and storage medium
CN112232563A (en) * 2020-10-14 2021-01-15 平安国际智慧城市科技股份有限公司 Household garbage collection and transportation route scheduling method and device, computer equipment and medium
CN112478529A (en) * 2020-11-30 2021-03-12 重庆电子工程职业学院 Intelligent garbage collection and transportation system
CN114330874A (en) * 2021-12-28 2022-04-12 扬州大学 Vehicle collecting and transporting scheduling method and system based on urban household garbage classification
CN114386690A (en) * 2022-01-10 2022-04-22 苏迈特智能科技(江苏)有限公司 Garbage truck route planning method and system, electronic device and readable storage medium

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
肖帆: "基于贪心算法的城市生活垃圾收运路线优化", 《甘肃科学学报》 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116227775A (en) * 2023-05-06 2023-06-06 中国公路工程咨询集团有限公司 Method, device and storage medium for determining road maintenance operation route

Also Published As

Publication number Publication date
CN115049309B (en) 2023-01-13

Similar Documents

Publication Publication Date Title
CN113344262A (en) Intelligent clearing system and method based on urban garbage classification
CN100463009C (en) Traffic information fusion processing method and system
CN101604478B (en) Method and system for processing dynamic traffic information
CN111461624A (en) Logistics line planning method, device, equipment and storage medium
CN101169843A (en) Garbage collecting and transportation method based on geological information
WO2016155517A1 (en) Logistics monitoring method and device
CN101750089B (en) Road network connectivity detection method and device based on mass e-maps
CN109840685A (en) A kind of method and apparatus of refuse collection
CN105674994A (en) Driving route acquisition method and device and navigation equipment
CN104121918A (en) Real-time path planning method and system
CN111301896B (en) Efficient garbage collection method and system, computer and storage medium
CN101694749A (en) Method and device for speculating routes
CN115049309B (en) Garbage collection and transportation route planning method and system
CN112434854B (en) Intelligent environmental sanitation management method and device, computer equipment and readable medium
CN112508488A (en) Solid waste vehicle transportation monitoring method, device, equipment and storage medium
CN115271190B (en) Method and device for arranging garbage centralized recovery points
JP2010244247A (en) Delivery results collection system and vehicle allocation plan preparation method
CN111582527A (en) Travel time estimation method and device, electronic equipment and storage medium
CN116911481B (en) Garbage collection and transportation system and method based on big data processing
Manqele et al. Multi-objective decision-making framework for effective waste collection in smart cities
CN116823098A (en) Logistics storage transportation route establishment method based on three-dimensional modeling
CN110674990A (en) Instant delivery path selection method and system with sliding window updating mechanism
CN115526427A (en) Planning layout method for refuse transfer station
CN114387812A (en) Garbage collection and transportation monitoring method, device, equipment and storage medium
CN113934217A (en) Intelligent scheduling processing system based on 5G

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CP03 Change of name, title or address
CP03 Change of name, title or address

Address after: 601, Jinbao Building, No. 89, Jinbao Street, Dongcheng District, Beijing 100005

Patentee after: Zhonghuajie Group Co.,Ltd.

Country or region after: China

Address before: Room 106, Floor 1, Building A-3, No. 45, Yanqi East Second Road, Yanqi Economic Development Zone, Huairou District, Beijing 101400

Patentee before: Zhonghuanjie environment Co.,Ltd.

Country or region before: China