CN113990062B - Garbage transport vehicle scheduling method and device, readable storage medium and server - Google Patents
Garbage transport vehicle scheduling method and device, readable storage medium and server Download PDFInfo
- Publication number
- CN113990062B CN113990062B CN202111231763.3A CN202111231763A CN113990062B CN 113990062 B CN113990062 B CN 113990062B CN 202111231763 A CN202111231763 A CN 202111231763A CN 113990062 B CN113990062 B CN 113990062B
- Authority
- CN
- China
- Prior art keywords
- garbage
- transport vehicle
- candidate
- garbage transport
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
- G08G1/202—Dispatching vehicles on the basis of a location, e.g. taxi dispatching
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02W—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO WASTEWATER TREATMENT OR WASTE MANAGEMENT
- Y02W90/00—Enabling technologies or technologies with a potential or indirect contribution to greenhouse gas [GHG] emissions mitigation
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Traffic Control Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention belongs to the technical field of artificial intelligence, and particularly relates to a garbage transport vehicle scheduling method and device, a computer readable storage medium and a server. The method comprises the following steps: acquiring position information of a target garbage station and each garbage transport vehicle, and respectively calculating a linear distance between each garbage transport vehicle and the target garbage station; selecting the garbage transport vehicles with the linear distance between the garbage transport vehicles and the target garbage station smaller than the distance threshold value as candidate garbage transport vehicles; respectively calculating the minimum dispatching distance between each candidate garbage transport vehicle and the target garbage station by using a shortest path algorithm, and selecting at least one optimal garbage transport vehicle from each candidate garbage transport vehicle; the method comprises the steps of obtaining the weight of various types of garbage of a target garbage station and the free weight of various types of optimized garbage transport vehicles, determining a garbage transport vehicle selection sequence, and carrying out vehicle scheduling according to the garbage transport vehicle selection sequence.
Description
Technical Field
The invention belongs to the technical field of artificial intelligence, and particularly relates to a garbage transport vehicle scheduling method and device, a computer readable storage medium and a server.
Background
The coordinated and orderly operation of the urban domestic garbage collection and transportation system is the basic guarantee for the urban appearance environment, the sanitation and the safety of the city and the sustainable development of the city. Through classified putting and classified collection, useful materials such as paper, plastics, rubber, glass, bottles, metal, waste household appliances and the like are separated from garbage and recycled, and waste is changed into valuable. The method not only improves the utilization level of garbage resources, but also can reduce the garbage disposal amount, and is an important way and means for realizing garbage reduction and reclamation.
In the prior art, when dispatching the garbage transport vehicles, the garbage transport vehicles are not managed systematically, but the dispatching personnel rely on personal experience to dispatch the garbage transport vehicles in a scattered, disordered and fragmented manner, so that the existing vehicle resources are difficult to be fully utilized, and the garbage transport efficiency is low.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for scheduling a garbage transport vehicle, a computer-readable storage medium, and a server, so as to solve the problem that an existing method for scheduling a garbage transport vehicle is low in efficiency.
A first aspect of an embodiment of the present invention provides a method for scheduling a garbage transport vehicle, which may include:
acquiring position information of a target garbage station and preset position information of each garbage transport vehicle;
respectively calculating the linear distance between each garbage transport vehicle and the target garbage station according to the position information of the target garbage station and the position information of each garbage transport vehicle;
selecting the garbage transport vehicles with the linear distance between the garbage transport vehicles and the target garbage station smaller than a preset distance threshold value as candidate garbage transport vehicles;
respectively calculating the minimum dispatching distance between each candidate garbage transport vehicle and the target garbage station by using a preset shortest path algorithm;
selecting at least one optimal garbage transport vehicle from the candidate garbage transport vehicles according to the linear distance between the candidate garbage transport vehicles and the target garbage station and the minimum scheduling distance;
acquiring the weight of various types of garbage of the target garbage station and the free weight of various types of the optimized garbage transport vehicles;
and determining a garbage transport vehicle selection sequence according to the garbage weight of each type of the target garbage station and the free weight of each type of the preferred garbage transport vehicle, and performing vehicle scheduling according to the garbage transport vehicle selection sequence.
In a specific implementation manner of the first aspect, the calculating the minimum scheduling distance between each candidate garbage transport vehicle and the target garbage site by using a preset shortest path algorithm may include:
determining path lengths of preferred paths between each of the candidate garbage transport vehicles and the target garbage site, respectively, using the shortest path algorithm;
respectively acquiring path information of each preferred path from a preset traffic information database, and respectively calculating path length correction of each preferred path according to the path information;
and respectively calculating the minimum dispatching distance between each candidate garbage transport vehicle and the target garbage station according to the path length of the preferred path and the path length correction quantity.
In a specific implementation manner of the first aspect, the calculating a path length correction amount of each of the preferred paths according to the path information may include:
calculating a path length correction amount for any of the preferred paths according to:
wherein M is the length of each preset traffic light block on average, and M is the number of the traffic lights; v is the number of road sections in the preferred path, i is the serial number of the road sections, i is more than or equal to 1 and less than or equal to v, and l i Is the length of the ith road section, w i And Δ L is the blocking weight of the ith link, and is the path length correction amount.
In a specific implementation manner of the first aspect, the calculating, according to the path length of the preferred path and the path length correction, the minimum scheduling distance between each candidate garbage transport vehicle and the target garbage station respectively may include:
calculating a minimum dispatch distance between any one of the candidate refuse transport vehicles and the target refuse site according to the following formula:
L D ＝L min +ΔL
wherein L is min Is the path length of the preferred path between the candidate garbage transport vehicle and the target garbage station, and DeltaL is the path length correction quantity, L D The minimum scheduling distance between the candidate garbage transport vehicle and the target garbage station is obtained.
In a specific implementation manner of the first aspect, the selecting at least one preferred garbage transportation vehicle from the candidate garbage transportation vehicles according to the straight-line distance and the minimum scheduling distance between the candidate garbage transportation vehicles and the target garbage site may include:
respectively calculating the dispatching loss of each candidate garbage transport vehicle according to the linear distance between each candidate garbage transport vehicle and the target garbage station and the minimum dispatching distance;
and sequencing the candidate garbage transport vehicles according to the sequence of the scheduling loss from small to large, and selecting N candidate garbage transport vehicles sequenced at the top as preferred garbage transport vehicles, wherein N is a positive integer.
In a specific implementation manner of the first aspect, the calculating the scheduling loss of each candidate garbage transport vehicle according to the straight-line distance and the minimum scheduling distance between each candidate garbage transport vehicle and the target garbage site may include:
calculating the dispatch loss of any one of the candidate refuse transport vehicles according to the following formula:
wherein L is the linear distance between the candidate garbage transport vehicle and the target garbage station, and L is D Is the minimum scheduling distance, K, between the candidate garbage transport vehicle and the target garbage station 1 And K 2 And respectively, the preset coefficients, and P is the dispatching loss of the candidate garbage transport vehicle.
In a specific implementation manner of the first aspect, after selecting the garbage transport vehicle, of which the straight-line distance to the target garbage site is smaller than a preset distance threshold, as a candidate garbage transport vehicle, the method may further include:
if the number of the candidate garbage transport vehicles is smaller than a preset first number threshold, gradually increasing the distance threshold until the number of the selected candidate garbage transport vehicles is larger than or equal to the first number threshold;
if the number of the candidate garbage transport vehicles is larger than a preset second number threshold, gradually reducing the distance threshold until the number of the selected candidate garbage transport vehicles is smaller than or equal to the second number threshold; the second number threshold is greater than the first number threshold.
A second aspect of an embodiment of the present invention provides a garbage transport vehicle scheduling apparatus, which may include:
the position information acquisition module is used for acquiring the position information of the target garbage station and the preset position information of each garbage transport vehicle;
the linear distance calculation module is used for calculating the linear distance between each garbage transport vehicle and the target garbage station according to the position information of the target garbage station and the position information of each garbage transport vehicle;
the candidate garbage transport vehicle selection module is used for selecting the garbage transport vehicle with the linear distance between the candidate garbage transport vehicle and the target garbage station smaller than a preset distance threshold value as a candidate garbage transport vehicle;
the minimum dispatching distance calculation module is used for calculating the minimum dispatching distance between each candidate garbage transport vehicle and the target garbage station by using a preset shortest path algorithm;
a preferred garbage transport vehicle selecting module, configured to select at least one preferred garbage transport vehicle from the candidate garbage transport vehicles according to the linear distance between the candidate garbage transport vehicles and the target garbage station and the minimum scheduling distance;
the weight information acquisition module is used for acquiring the garbage weights of various types of the target garbage station and the free weights of various types of the optimized garbage transport vehicles;
and the vehicle scheduling module is used for determining a garbage transport vehicle selection sequence according to the garbage weight of each type of the target garbage station and the free weight of each type of the optimized garbage transport vehicle, and performing vehicle scheduling according to the garbage transport vehicle selection sequence.
In a specific implementation manner of the second aspect, the minimum scheduling distance calculation module may include:
a path length calculation unit for respectively determining the path length of the preferred path between each candidate garbage transport vehicle and the target garbage station by using the shortest path algorithm;
the path length correction quantity calculating unit is used for respectively acquiring the path information of each preferred path from a preset traffic information database and respectively calculating the path length correction quantity of each preferred path according to the path information;
and the minimum dispatching distance calculating unit is used for calculating the minimum dispatching distance between each candidate garbage transport vehicle and the target garbage station according to the path length of the preferred path and the path length correction quantity.
In a specific implementation manner of the second aspect, the path-length correction amount calculation unit may be specifically configured to calculate a path-length correction amount of any one of the preferred paths according to the following formula:
wherein M is the length of each preset traffic light block on average, and M is the number of the traffic lights; v is the number of road sections in the preferred path, i is the serial number of the road sections, i is more than or equal to 1 and less than or equal to v, l i Is the length of the ith road section, w i And Δ L is the blocking weight of the ith link, and is the path length correction amount.
In a specific implementation manner of the second aspect, the minimum scheduling distance calculating unit may be specifically configured to calculate the minimum scheduling distance between any one of the candidate garbage transport vehicles and the target garbage station according to the following formula:
L D ＝L min +ΔL
wherein L is min Is the path length of the preferred path between the candidate garbage transport vehicle and the target garbage station, and DeltaL is the path length correction quantity, L D Is the most important between the candidate garbage transport vehicle and the target garbage stationA small scheduling distance.
In a specific implementation manner of the second aspect, the preferred garbage transport vehicle selection module may include:
the scheduling loss calculation unit is used for calculating the scheduling loss of each candidate garbage transport vehicle according to the linear distance between each candidate garbage transport vehicle and the target garbage station and the minimum scheduling distance;
and the preferable garbage transport vehicle selecting unit is used for sorting the candidate garbage transport vehicles in a sequence from small to large according to the scheduling loss, selecting the N candidate garbage transport vehicles sorted at the top as the preferable garbage transport vehicles, and N is a positive integer.
In a specific implementation manner of the second aspect, the scheduling loss calculating unit may be specifically configured to calculate the scheduling loss of any one of the candidate garbage transport vehicles according to the following formula:
wherein L is the linear distance between the candidate garbage transport vehicle and the target garbage station, and L is D Is the minimum dispatching distance, K, between the candidate garbage transport vehicle and the target garbage station 1 And K 2 And respectively, the preset coefficients, and P is the dispatching loss of the candidate garbage transport vehicle.
In a specific implementation manner of the second aspect, the garbage transportation vehicle dispatching device may further include:
a distance threshold adjusting module, configured to gradually increase the distance threshold if the number of the candidate garbage transport vehicles is smaller than a preset first number threshold until the number of the selected candidate garbage transport vehicles is greater than or equal to the first number threshold; if the number of the candidate garbage transport vehicles is larger than a preset second number threshold, gradually reducing the distance threshold until the number of the selected candidate garbage transport vehicles is smaller than or equal to the second number threshold; the second number threshold is greater than the first number threshold.
A third aspect of the embodiments of the present invention provides a computer-readable storage medium, which stores a computer program, and the computer program, when executed by a processor, implements the steps of any one of the above garbage transport vehicle scheduling methods.
A fourth aspect of the embodiments of the present invention provides a server, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the steps of any one of the methods for dispatching a garbage transportation vehicle described above when executing the computer program.
A fifth aspect of embodiments of the present invention provides a computer program product, which, when run on a server, causes the server to perform the steps of any of the above-mentioned methods of scheduling of garbage transport vehicles.
Compared with the prior art, the embodiment of the invention has the following beneficial effects: the method comprises the steps of obtaining position information of a target garbage station and preset position information of each garbage transport vehicle; respectively calculating the linear distance between each garbage transport vehicle and the target garbage station according to the position information of the target garbage station and the position information of each garbage transport vehicle; selecting the garbage transport vehicles with the linear distance between the garbage transport vehicles and the target garbage station smaller than a preset distance threshold value as candidate garbage transport vehicles; respectively calculating the minimum dispatching distance between each candidate garbage transport vehicle and the target garbage station by using a preset shortest path algorithm; selecting at least one optimal garbage transport vehicle from the candidate garbage transport vehicles according to the linear distance between the candidate garbage transport vehicles and the target garbage station and the minimum scheduling distance; acquiring the weight of various types of garbage of the target garbage station and the free weight of various types of the preferred garbage transport vehicles; and determining a garbage transport vehicle selection sequence according to the garbage weight of each type of the target garbage station and the free weight of each type of the preferred garbage transport vehicle, and performing vehicle scheduling according to the garbage transport vehicle selection sequence. According to the embodiment of the invention, the optimal garbage transport vehicle can be intelligently matched for the garbage station according to the information such as the distance, the garbage weight and the like, the existing vehicle resources are fully utilized, and the garbage transport efficiency is greatly improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.
FIG. 1 is a flowchart of an embodiment of a garbage transport vehicle scheduling method according to an embodiment of the present invention;
FIG. 2 is a site distribution map generated based on location information for various spam sites;
FIG. 3 is a schematic diagram of a circular region constructed with a distance threshold as a radius, centered at a target garbage site;
FIG. 4 is a schematic flow chart of the calculation of the minimum dispatch distance between each candidate garbage transport vehicle and the target garbage site using a predetermined shortest path algorithm, respectively;
FIG. 5 is a block diagram of an exemplary embodiment of a dispatching device of garbage transport vehicles according to the present invention;
fig. 6 is a schematic block diagram of a server according to an embodiment of the present invention.
Detailed Description
In order to make the objects, features and advantages of the present invention more obvious and understandable, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is obvious that the embodiments described below are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without making any creative effort based on the embodiments in the present invention, belong to the protection scope of the present invention.
The embodiment of the invention can acquire and process related data based on an artificial intelligence technology. Among them, Artificial Intelligence (AI) is a theory, method, technique and application system that simulates, extends and expands human Intelligence using a digital computer or a machine controlled by a digital computer, senses the environment, acquires knowledge and uses the knowledge to obtain the best result.
The artificial intelligence base technologies generally include technologies such as sensors, dedicated artificial intelligence chips, cloud computing, distributed storage, big data processing technologies, operation/interaction systems, mechatronics, and the like. The artificial intelligence software technology mainly comprises a computer vision technology, a robot technology, a biological recognition technology, a voice processing technology, a natural language processing technology, machine learning/deep learning and the like.
The execution subject of the embodiment of the invention can be a server based on artificial intelligence and is used for executing the garbage transport vehicle scheduling method in the embodiment of the invention. The server may be an independent server, or may be a cloud server that provides basic cloud computing services such as a cloud service, a cloud database, cloud computing, a cloud function, cloud storage, a Network service, cloud communication, a middleware service, a domain name service, a security service, a Content Delivery Network (CDN), a big data and artificial intelligence platform, and the like.
Referring to fig. 1, an embodiment of a garbage transportation vehicle scheduling method according to an embodiment of the present invention may include:
and S101, acquiring the position information of the target garbage station and the preset position information of each garbage transport vehicle.
The target spam site may be any spam site in a designated area, and the designated area may be set according to actual conditions, for example, the target spam site may be an administrative area of a city or a community. Each spam site in the designated area is registered in advance, the registration information of the spam site is stored in a preset site information database, and the server can inquire the registration information of any spam site in the site information database, wherein the registration information includes but is not limited to site name, affiliated area, position information, floor area and the like. The server may generate a site profile as shown in fig. 2 based on the location information of each of the spam sites.
Each garbage transport vehicle is internally and pre-provided with a positioning device and a communication device, the positioning device can acquire the position information of the garbage transport vehicle in real time, and the communication device can report the position information of the garbage transport vehicle to the server in real time.
And S102, respectively calculating the linear distance between each garbage transport vehicle and the target garbage station according to the position information of the target garbage station and the position information of each garbage transport vehicle.
Step S103, selecting the garbage transport vehicles with the linear distance between the garbage transport vehicles and the target garbage station smaller than a preset distance threshold value as candidate garbage transport vehicles.
The distance threshold may be set according to an actual situation, for example, the distance threshold may be set to 10 kilometers, and certainly, the distance threshold may also be set to other values, which is not specifically limited in the embodiment of the present invention. In the embodiment of the present invention, a circular area as shown in fig. 3 may be constructed by taking the target garbage station as a center and the distance threshold as a radius, and all garbage transport vehicles in the circular area may be used as candidate garbage transport vehicles.
Preferably, the distance threshold may be dynamically adjusted according to an actual situation, a default value of the distance threshold is first set, and if the number of the selected candidate garbage transport vehicles according to the default value is smaller than a preset first number threshold, the distance threshold may be gradually increased until the number of the selected candidate garbage transport vehicles is greater than or equal to the first number threshold; on the contrary, if the number of the selected candidate garbage transport vehicles according to the default value is larger than the preset second number threshold, the distance threshold can be gradually reduced until the number of the selected candidate garbage transport vehicles is smaller than or equal to the second number threshold. The second number threshold is greater than the first number threshold, and specific values of the first number threshold and the second number threshold may be set according to actual situations, for example, the first number threshold may be set to 10, the second number threshold may be set to 20, and of course, the second number threshold may also be set to other values, which is not specifically limited in this embodiment of the present invention.
And step S104, respectively calculating the minimum dispatching distance between each candidate garbage transport vehicle and the target garbage station by using a preset shortest path algorithm.
Specifically, step 104 may include the process shown in FIG. 4:
and 1041, respectively determining the path length of the preferred path between each candidate garbage transport vehicle and the target garbage site by using the shortest path algorithm.
The shortest path algorithm may be selected according to actual conditions, for example, Dijkstra (Dijkstra), which is a shortest path algorithm from one vertex to the rest of the vertices, may be used to solve the shortest path problem in the weighted graph. The algorithm starts from a starting point, adopts a greedy algorithm strategy, and traverses adjacent nodes of a vertex which is closest to the starting point and has not been visited each time until the adjacent nodes extend to a terminal point. Other shortest path algorithms may also be used according to actual situations, and the embodiment of the present invention is not limited in this respect. In the embodiment of the present invention, road data may be obtained from an Open Street Map (OSM) in advance, and then the shortest path algorithm is used to determine the path length of the preferred path between each candidate garbage transport vehicle and the target garbage site based on the road data in the Map.
Step 1042, respectively obtaining path information of each preferred path from a preset traffic information database, and respectively calculating a path length correction amount of each preferred path according to the path information.
The path information may include the number of traffic lights and the level of traffic congestion, and taking the preferred path between any one of the candidate garbage transport vehicles and the target garbage station as an example, the path length correction amount may be calculated according to the following formula:
wherein, Δ L is the path length correction amount, M is a preset length of blocking each traffic light on average, and M is the number of traffic lights; v is the number of road sections in the preferred path, i is the serial number of the road sections, i is more than or equal to 1 and less than or equal to v, l i Is the length of the ith road section, w i For example, the traffic congestion level may be divided into four levels of heavy congestion, medium congestion, light congestion, and no congestion in sequence from high to low, the corresponding links are respectively marked with purple, red, yellow, and green, and the blocking weights are respectively set to 0.3, 0.2, 0.1, and 0. Of course, other forms of traffic congestion level division and other blocking weight values may also be performed according to the actual situation, which is not specifically limited in the embodiment of the present invention.
And 1043, respectively calculating the minimum dispatching distance between each candidate garbage transport vehicle and the target garbage station according to the path length of the preferred path and the path length correction quantity.
Taking any one of the candidate garbage transport vehicles as an example, the minimum scheduling distance between the candidate garbage transport vehicle and the target garbage station can be calculated according to the following formula:
L D ＝L min +ΔL
wherein L is min Is the path length, L, of the preferred path between it and the target garbage site D The minimum scheduling distance between the target garbage site and the target garbage site.
Step S105, selecting at least one optimized garbage transport vehicle from each candidate garbage transport vehicle according to the linear distance between each candidate garbage transport vehicle and the target garbage station and the minimum dispatching distance.
Firstly, the scheduling loss of each candidate garbage transport vehicle can be respectively calculated according to the straight-line distance and the minimum scheduling distance between each candidate garbage transport vehicle and the target garbage station. Taking any one of the candidate garbage transport vehicles as an example, the scheduling loss can be calculated according to the following formula:
wherein L is the linear distance between the candidate refuse transport vehicle and the target refuse station, K 1 And K 2 The preset coefficients are, for example, all of the preset coefficients may be set to 1, and may also be set to other values according to practical situations, which is not specifically limited in this embodiment of the present invention, where P is the scheduling loss of the candidate garbage transport vehicle, and the smaller the value is, the higher the scheduling efficiency of the garbage transport vehicle is, in this formula,
the larger the representative minimum dispatch distance is, the greater the straight-line distance, indicating that a long detour is required for the trash station and the trash transport vehicle route, which is very time consuming.
Then, sorting the candidate garbage transport vehicles according to the sequence of the scheduling loss from small to large, selecting the N candidate garbage transport vehicles sorted at the top as the preferred garbage transport vehicles, wherein N is a positive integer, and the specific value of N is set according to the actual situation.
And S106, acquiring the weight of various types of garbage of the target garbage station and the free weight of various types of the optimized garbage transport vehicles.
The specific type of rubbish can set up according to actual conditions, for example, can divide into four kinds of dry rubbish, wet rubbish, recoverable rubbish and harmful rubbish with rubbish, and the rubbish of different grade type need use different garbage bins to hold.
In a specific implementation manner of the embodiment of the present invention, a weight sensing device and a communication device may be pre-installed at the bottom of each trash can of the target trash site, so that the weight of various types of trash can be obtained in real time through the weight sensing device, and the weight of various types of trash can be reported to the server in real time through the communication device.
Similarly, for any garbage transport vehicle, a weight sensing device and a communication device can be pre-installed at the bottom of each garbage can on the vehicle, the weight sensing device can acquire the weight of various types of garbage in real time, and the communication device can report the weight of various types of garbage to the server in real time.
After receiving the garbage weights of various types reported by the garbage transport vehicle, the server can query the credit weights of various types of the garbage transport vehicle in a preset vehicle information database, and subtract the reported garbage weight from the credit weight of a certain type to obtain the free weight of the type.
And S107, determining a garbage transport vehicle selection sequence according to the garbage weights of the target garbage stations and the free weights of the optimal garbage transport vehicles, and performing vehicle scheduling according to the garbage transport vehicle selection sequence.
Specifically, the garbage weights of the various types of garbage at the target garbage station can be sorted in descending order, as follows:
| type 1 | Type 2 | Type 3 | Type 4 |
| Weight: m1 | Weight: m2 | Weight: m3 | Weight: m4 |
Wherein M1> M2> M3> M4.
For example, if the weight of each type of garbage at the target garbage site is as follows:
| dry garbage | Wet garbage | Recyclable garbage | Harmful refuse |
| 45kg | 100kg | 250kg | 10kg |
Sorting the obtained product to obtain:
| recyclable garbage | Wet garbage | Dry garbage | Harmful garbage |
| 250kg | 100kg | 45kg | 10kg |
In this order, the free weights of the various types of the preferred refuse transport vehicles are sorted in descending order as follows:
| recyclable garbage | Wet garbage | Dry garbage | Harmful garbage |
| Car4(A m1 ) | Car3(B m1 ) | Car3(C m1 ) | Car3(D m1 ) |
| Car3(A m2 ) | Car1(B m2 ) | Car1(C m2 ) | Car1(D m2 ) |
| Car1(A m3 ) | Car2(B m3 ) | Car4(C m3 ) | Car4(D m3 ) |
| Car2(A m4 ) | Car4(B m4 ) | Car2(C m4 ) | Car2(D m4 ) |
In the above table, 4 preferable garbage transport vehicles are assumed and are designated as Car No. 1 (Car1), Car No. 2 (Car2), Car No. 3 (Car3), and Car No. 4 (Car4), respectively. The free weight that 4 cars can pull decreases from top to bottom, and for the type of recoverable garbage, the free weight of the 4 th car (i.e. A) m1 ) Empty weight of maximum, number 2 vehicle (i.e. A) m4 ) At a minimum; empty weight of vehicle # 3 (i.e. B) for the type of recyclable waste m1 ) Free weight of maximum, 4 # vehicle (i.e. B) m4 ) At a minimum, the other types are analogized in turn.
It may then be determined whether there is a certain type of refuse weighing more than the sum of the free weights of all preferred refuse transport vehicles according to the following formula:
if isExceded is false (i.e., 0), it indicates that there is at least one type of refuse whose weight exceeds the sum of the free weights of all the preferred refuse transport vehicles, i.e., if these vehicles are all transporting, the refuse transport task cannot be completed, and a new refuse transport vehicle needs to be rescheduled.
If isExceeded is true (i.e. 1), indicating that the preferred garbage truck can complete the garbage truck task of the target garbage site, the garbage truck selection sequence is determined according to the column priority principle as described above. For type 1, which is the most heavy garbage, and is recoverable garbage in the above example, the preferred garbage transport vehicle (i.e., Car4) with the largest free weight is selected and added to the garbage transport vehicle selection sequence. If the sum of the free weights corresponding to the existing vehicles in the garbage transport vehicle selection sequence is less than the garbage weight, selecting the next preferred garbage transport vehicle (namely Car3) with the largest corresponding free weight, adding the selected garbage transport vehicle into the garbage transport vehicle selection sequence, and so on, and continuing considering the next type until the sum of the free weights corresponding to the existing vehicles in the garbage transport vehicle selection sequence is more than or equal to the garbage weight; and processing the next type according to the process until all types are traversed to obtain a final garbage transport vehicle selection sequence.
Finally, according to the sequence in the garbage transport vehicle selection sequence, sequentially scheduling each garbage transport vehicle to go to the target garbage station to collect garbage, wherein each garbage transport vehicle collects garbage from the target garbage station to the maximum extent according to the free weight of each garbage transport vehicle, and accordingly garbage transport tasks can be completed orderly and efficiently.
In summary, the embodiment of the present invention obtains the position information of the target garbage station and the preset position information of each garbage transport vehicle; respectively calculating the linear distance between each garbage transport vehicle and the target garbage station according to the position information of the target garbage station and the position information of each garbage transport vehicle; selecting the garbage transport vehicles with the linear distance between the garbage transport vehicles and the target garbage station smaller than a preset distance threshold value as candidate garbage transport vehicles; respectively calculating the minimum dispatching distance between each candidate garbage transport vehicle and the target garbage station by using a preset shortest path algorithm; selecting at least one optimal garbage transport vehicle from the candidate garbage transport vehicles according to the linear distance between the candidate garbage transport vehicles and the target garbage station and the minimum scheduling distance; acquiring the weight of various types of garbage of the target garbage station and the free weight of various types of the optimized garbage transport vehicles; and determining a garbage transport vehicle selection sequence according to the garbage weight of each type of the target garbage station and the free weight of each type of the preferred garbage transport vehicle, and performing vehicle scheduling according to the garbage transport vehicle selection sequence. According to the embodiment of the invention, the optimal garbage transport vehicle can be intelligently matched for the garbage station according to the information such as the distance, the garbage weight and the like, the existing vehicle resources are fully utilized, and the garbage transport efficiency is greatly improved.
It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.
Corresponding to the garbage transport vehicle dispatching method in the foregoing embodiment, fig. 5 shows a structural diagram of an embodiment of a garbage transport vehicle dispatching device according to an embodiment of the present invention.
In this embodiment, a garbage transport vehicle scheduling device may include:
a position information obtaining module 501, configured to obtain position information of a target garbage station and preset position information of each garbage transport vehicle;
a linear distance calculating module 502, configured to calculate linear distances between the garbage trucks and the target garbage station respectively according to the position information of the target garbage station and the position information of the garbage trucks;
a candidate garbage transport vehicle selecting module 503, configured to select the garbage transport vehicle whose linear distance to the target garbage station is smaller than a preset distance threshold as a candidate garbage transport vehicle;
a minimum dispatching distance calculating module 504, configured to calculate a minimum dispatching distance between each candidate garbage transport vehicle and the target garbage station using a preset shortest path algorithm;
a preferred garbage transport vehicle selecting module 505, configured to select at least one preferred garbage transport vehicle from the candidate garbage transport vehicles according to the linear distance between the candidate garbage transport vehicles and the target garbage station and the minimum scheduling distance;
a weight information obtaining module 506, configured to obtain the weight of each type of garbage at the target garbage station and the free weight of each type of the preferred garbage transport vehicle;
and a vehicle scheduling module 507, configured to determine a garbage transportation vehicle selection sequence according to the various types of garbage weights of the target garbage station and the various types of free weights of the preferred garbage transportation vehicles, and perform vehicle scheduling according to the garbage transportation vehicle selection sequence.
In a specific implementation manner of the embodiment of the present invention, the minimum scheduling distance calculating module may include:
a path length calculation unit for determining path lengths of preferred paths between the respective candidate garbage transport vehicles and the target garbage site, respectively, using the shortest path algorithm;
the path length correction quantity calculating unit is used for respectively acquiring the path information of each preferred path from a preset traffic information database and respectively calculating the path length correction quantity of each preferred path according to the path information;
and the minimum dispatching distance calculating unit is used for calculating the minimum dispatching distance between each candidate garbage transport vehicle and the target garbage station according to the path length of the preferred path and the path length correction quantity.
In a specific implementation manner of the embodiment of the present invention, the path-length correction amount calculating unit may be specifically configured to calculate a path-length correction amount of any one of the preferred paths according to the following formula:
wherein M is the length of each preset traffic light block on average, and M is the number of the traffic lights; v is the number of road sections in the preferred path, i is the serial number of the road sections, i is more than or equal to 1 and less than or equal to v, l i Is the length of the ith road section, w i And Δ L is the blocking weight of the ith link, and is the path length correction amount.
In a specific implementation manner of the embodiment of the present invention, the minimum scheduling distance calculating unit may be specifically configured to calculate the minimum scheduling distance between any one of the candidate garbage transport vehicles and the target garbage site according to the following formula:
L D ＝L min +ΔL
wherein L is min Is the path length of the preferred path between the candidate garbage transport vehicle and the target garbage station, and Delta L is the path length correction quantity, L D Is the minimum dispatch distance between the candidate garbage transport vehicle and the target garbage station.
In a specific implementation manner of the embodiment of the present invention, the preferable garbage transport vehicle selecting module may include:
the scheduling loss calculation unit is used for calculating the scheduling loss of each candidate garbage transport vehicle according to the linear distance between each candidate garbage transport vehicle and the target garbage station and the minimum scheduling distance;
and the preferable garbage transport vehicle selecting unit is used for sorting the candidate garbage transport vehicles in a sequence from small to large according to the scheduling loss, selecting the N candidate garbage transport vehicles sorted at the top as the preferable garbage transport vehicles, and N is a positive integer.
In a specific implementation manner of the embodiment of the present invention, the scheduling loss calculating unit may be specifically configured to calculate the scheduling loss of any one of the candidate garbage transport vehicles according to the following formula:
wherein L is the linear distance between the candidate garbage transport vehicle and the target garbage station, and L is D Is the minimum dispatching distance, K, between the candidate garbage transport vehicle and the target garbage station 1 And K 2 And respectively, the preset coefficients, and P is the dispatching loss of the candidate garbage transport vehicle.
In a specific implementation manner of the embodiment of the present invention, the garbage transport vehicle scheduling device may further include:
a distance threshold adjusting module, configured to gradually increase the distance threshold if the number of the candidate garbage transport vehicles is smaller than a preset first number threshold until the number of the selected candidate garbage transport vehicles is greater than or equal to the first number threshold; if the number of the candidate garbage transport vehicles is larger than a preset second number threshold, gradually reducing the distance threshold until the number of the selected candidate garbage transport vehicles is smaller than or equal to the second number threshold; the second number threshold is greater than the first number threshold.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described apparatuses, modules and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.
Fig. 6 shows a schematic block diagram of a server provided in an embodiment of the present invention, and for convenience of explanation, only the parts related to the embodiment of the present invention are shown.
The server 6 may include: a processor 60, a memory 61, and computer readable instructions 62 stored in the memory 61 and executable on the processor 60, such as computer readable instructions to perform the above-described garbage transport vehicle scheduling method. The processor 60, when executing the computer readable instructions 62, implements the steps in the various garbage transport vehicle scheduling method embodiments described above, such as the steps S101-S107 shown in fig. 1. Alternatively, the processor 60, when executing the computer readable instructions 62, implements the functions of the modules/units in the above-described device embodiments, such as the functions of the modules 501 to 507 shown in fig. 5.
Illustratively, the computer-readable instructions 62 may be divided into one or more modules/units, which are stored in the memory 61 and executed by the processor 60 to implement the present invention. The one or more modules/units may be a series of computer-readable instruction segments capable of performing specific functions, which are used to describe the execution of the computer-readable instructions 62 in the server 6.
The Processor 60 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component, etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The storage 61 may be an internal storage unit of the server 6, such as a hard disk or a memory of the server 6. The memory 61 may also be an external storage device of the server 6, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card) and the like provided on the server 6. Further, the memory 61 may also include both an internal storage unit of the server 6 and an external storage device. The memory 61 is used to store the computer readable instructions and other instructions and data required by the server 6. The memory 61 may also be used to temporarily store data that has been output or is to be output.
Each functional unit in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes a plurality of computer readable instructions for enabling a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and the like, which can store computer readable instructions.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same; although the present invention has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (6)
1. A method of dispatching a refuse transport vehicle, comprising:
acquiring position information of a target garbage station and preset position information of each garbage transport vehicle;
respectively calculating the linear distance between each garbage transport vehicle and the target garbage station according to the position information of the target garbage station and the position information of each garbage transport vehicle;
selecting the garbage transport vehicles with the linear distance between the garbage transport vehicles and the target garbage station smaller than a preset distance threshold value as candidate garbage transport vehicles;
respectively determining the path length of a preferred path between each candidate garbage transport vehicle and the target garbage station by using a preset shortest path algorithm;
respectively acquiring the path information of each preferred path from a preset traffic information database, and respectively calculating the path length correction quantity of each preferred path according to the path information:
wherein M is the length of each preset traffic light block on average, and M is the number of the traffic lights; v is the number of road sections in the preferred path, i is the serial number of the road sections, i is more than or equal to 1 and less than or equal to v, l i Is the length of the ith road section, w i The stopping weight of the ith road section is obtained, and the delta L is the path length correction quantity;
respectively calculating the minimum dispatching distance between each candidate garbage transport vehicle and the target garbage station according to the path length and the path length correction quantity of the preferred path;
according to the straight-line distance and the minimum dispatching distance between each candidate garbage transport vehicle and the target garbage station, respectively calculating the dispatching loss of each candidate garbage transport vehicle:
wherein L is the linear distance between the candidate garbage transport vehicle and the target garbage station, L D Is the minimum scheduling distance, K, between the candidate refuse transport vehicle and the target refuse site 1 And K 2 Respectively are preset coefficients, and P is the scheduling loss of the candidate garbage transport vehicle;
sorting the candidate garbage transport vehicles according to the sequence of the scheduling loss from small to large, and selecting N candidate garbage transport vehicles sorted at the top as preferred garbage transport vehicles, wherein N is a positive integer;
acquiring the weight of various types of garbage of the target garbage station and the free weight of various types of the preferred garbage transport vehicles;
and determining a garbage transport vehicle selection sequence according to the garbage weight of each type of the target garbage station and the free weight of each type of the preferred garbage transport vehicle, and performing vehicle scheduling according to the garbage transport vehicle selection sequence.
2. The method according to claim 1, wherein the calculating the minimum dispatching distance between each of the candidate garbage transport vehicles and the target garbage station according to the path length of the preferred path and the path length correction amount comprises:
calculating a minimum dispatch distance between any one of the candidate refuse transport vehicles and the target refuse site according to the following formula:
L D ＝L min +ΔL
wherein L is min Is the path length of the preferred path between the candidate garbage transport vehicle and the target garbage station, and DeltaL is the path length correction quantity, L D The minimum scheduling distance between the candidate garbage transport vehicle and the target garbage station is obtained.
3. The method for dispatching refuse transport vehicles according to any one of claims 1-2, wherein after selecting the refuse transport vehicles with the straight-line distance from the target refuse station smaller than a preset distance threshold as candidate refuse transport vehicles, the method further comprises:
if the number of the candidate garbage transport vehicles is smaller than a preset first number threshold, gradually increasing the distance threshold until the number of the selected candidate garbage transport vehicles is larger than or equal to the first number threshold;
if the number of the candidate garbage transport vehicles is larger than a preset second number threshold, gradually reducing the distance threshold until the number of the selected candidate garbage transport vehicles is smaller than or equal to the second number threshold; the second number threshold is greater than the first number threshold.
4. A refuse transport vehicle dispatching device, comprising:
the position information acquisition module is used for acquiring the position information of the target garbage station and the preset position information of each garbage transport vehicle;
the linear distance calculation module is used for calculating linear distances between the garbage transport vehicles and the target garbage station respectively according to the position information of the target garbage station and the position information of the garbage transport vehicles;
the candidate garbage transport vehicle selection module is used for selecting the garbage transport vehicle with the linear distance between the candidate garbage transport vehicle and the target garbage station smaller than a preset distance threshold value as a candidate garbage transport vehicle;
the minimum scheduling distance calculation module is used for respectively determining the path length of the optimal path between each candidate garbage transport vehicle and the target garbage station by using a preset shortest path algorithm; respectively acquiring the path information of each preferred path from a preset traffic information database, and respectively calculating the path length correction quantity of each preferred path according to the path information:
wherein, M is the number of the traffic lights, and is the length of each preset traffic light block on average; v is the number of road sections in the preferred path, i is the serial number of the road sections, i is more than or equal to 1 and less than or equal to v, and l i Is the length of the ith road section, w i The stopping weight of the ith road section is obtained, and the delta L is the path length correction quantity; respectively calculating the minimum dispatching distance between each candidate garbage transport vehicle and the target garbage station according to the path length and the path length correction quantity of the preferred path;
the optimal garbage transport vehicle selection module is used for respectively calculating the scheduling loss of each candidate garbage transport vehicle according to the linear distance and the minimum scheduling distance between each candidate garbage transport vehicle and the target garbage station:
wherein L is the linear distance between the candidate garbage transport vehicle and the target garbage station, L D Is the minimum scheduling distance, K, between the candidate refuse transport vehicle and the target refuse site 1 And K 2 Respectively are preset coefficients, and P is the scheduling loss of the candidate garbage transport vehicle; sorting the candidate garbage transport vehicles according to the sequence of the scheduling loss from small to large, and selecting N candidate garbage transport vehicles sorted at the top as preferred garbage transport vehicles, wherein N is a positive integer;
the weight information acquisition module is used for acquiring the weight of various types of garbage of the target garbage station and the free weight of various types of the optimized garbage transport vehicles;
and the vehicle scheduling module is used for determining a garbage transport vehicle selection sequence according to the garbage weight of each type of the target garbage station and the free weight of each type of the optimized garbage transport vehicle, and performing vehicle scheduling according to the garbage transport vehicle selection sequence.
5. A computer readable storage medium storing computer readable instructions, wherein the computer readable instructions, when executed by a processor, implement the steps of the method for dispatching a refuse transport vehicle according to any of claims 1 to 3.
6. A server comprising a memory, a processor and computer readable instructions stored in the memory and executable on the processor, wherein the processor when executing the computer readable instructions performs the steps of the method of scheduling a refuse transport vehicle according to any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111231763.3A CN113990062B (en) | 2021-10-22 | 2021-10-22 | Garbage transport vehicle scheduling method and device, readable storage medium and server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111231763.3A CN113990062B (en) | 2021-10-22 | 2021-10-22 | Garbage transport vehicle scheduling method and device, readable storage medium and server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113990062A CN113990062A (en) | 2022-01-28 |
| CN113990062B true CN113990062B (en) | 2022-08-26 |
Family
ID=79740286
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111231763.3A Active CN113990062B (en) | 2021-10-22 | 2021-10-22 | Garbage transport vehicle scheduling method and device, readable storage medium and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113990062B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115083198B (en) * | 2022-06-15 | 2023-11-24 | 国汽(北京)智能网联汽车研究院有限公司 | Multi-vehicle power resource scheduling method and device |
| CN115545574A (en) * | 2022-11-30 | 2022-12-30 | 北京梅凯尼克环保科技有限公司 | Intelligent garbage receiving and transporting processing method and system based on Internet of things |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109102123A (en) * | 2018-08-17 | 2018-12-28 | 安吉汽车物流股份有限公司 | Share-car route optimization method and device, calculate equipment at storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2020086121A (en) * | 2018-11-26 | 2020-06-04 | 合同会社Ｍｂｃ | Road condition information collection method for three-dimensional map creation using garbage collecting vehicle used in garbage collection business, and garbage collecting vehicle used therefor |
| CN110516870B (en) * | 2019-08-22 | 2023-09-22 | 安庆师范大学 | Multi-recovery site garbage collection and transportation method based on co-evolution |
| CN113344262A (en) * | 2021-05-28 | 2021-09-03 | 淮阴工学院 | Intelligent clearing system and method based on urban garbage classification |
-
2021
- 2021-10-22 CN CN202111231763.3A patent/CN113990062B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109102123A (en) * | 2018-08-17 | 2018-12-28 | 安吉汽车物流股份有限公司 | Share-car route optimization method and device, calculate equipment at storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113990062A (en) | 2022-01-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Tirkolaee et al. | An improved ant colony optimization for the multi-trip Capacitated Arc Routing Problem | |
| CN113990062B (en) | Garbage transport vehicle scheduling method and device, readable storage medium and server | |
| Idwan et al. | Optimal management of solid waste in smart cities using internet of things | |
| Tavares et al. | Optimisation of MSW collection routes for minimum fuel consumption using 3D GIS modelling | |
| Fujdiak et al. | Using genetic algorithm for advanced municipal waste collection in smart city | |
| Eiselt | Locating landfills—Optimization vs. reality | |
| Anagnostopoulos et al. | Effective waste collection with shortest path semi-static and dynamic routing | |
| CN107578132A (en) | A kind of garbage truck method for obtaining path based on immune optimization | |
| Zhan et al. | A modified artificial bee colony algorithm for the dynamic ride-hailing sharing problem | |
| Mohammadi et al. | A dynamic approach for the multi-compartment vehicle routing problem in waste management | |
| CN113762624A (en) | Garbage clearing and transporting vehicle route optimization method and urban garbage clearing and transporting ecological system | |
| Dolinina et al. | Development of semi-adaptive Waste Collection Vehicle Routing Algorithm for agglomeration and urban settlements | |
| Everett et al. | Curbside collection of recyclables I: route time estimation model | |
| Heng et al. | Multi-objective heterogeneous capacitated vehicle routing problem with time windows and simultaneous pickup and delivery for urban last mile logistics | |
| CN110222892B (en) | Passenger getting-off station prediction method and device | |
| CN108711028B (en) | Distributed computation-based solid waste classified transportation multistage cooperative decision making system | |
| CN115526427A (en) | Planning layout method for refuse transfer station | |
| Li et al. | Method for determining the location of highway passenger transportation hubs using poi data and the dijkstra algorithm in large city | |
| Wang et al. | In-depth learning layout and path optimization of energy service urban distribution sites under e-commerce environment | |
| Ismail et al. | Metropolitan Cities's Waste Transportation Model | |
| Bhargava et al. | Genetic algorithm to optimize solid waste collection | |
| CN113361957B (en) | Garbage classification recycling facility adding method and system based on step-suitable index improvement | |
| Rabbani et al. | Sustainable vehicle-routing problem with time windows by heterogeneous fleet of vehicles and separated compartments: Application in waste collection problem | |
| CN111223288B (en) | Line blockage avoiding method based on Internet of vehicles data and storage medium | |
| Yamnenko et al. | Domestic solid waste disposal logistic optimization using Internet of Things technologies |
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 |