CN112365032A - System and method for optimizing garbage clearing path - Google Patents
System and method for optimizing garbage clearing path Download PDFInfo
- Publication number
- CN112365032A CN112365032A CN202011139691.5A CN202011139691A CN112365032A CN 112365032 A CN112365032 A CN 112365032A CN 202011139691 A CN202011139691 A CN 202011139691A CN 112365032 A CN112365032 A CN 112365032A
- Authority
- CN
- China
- Prior art keywords
- garbage
- path optimization
- clearing
- total
- vehicle
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 239000010813 municipal solid waste Substances 0.000 title claims abstract description 231
- 238000000034 method Methods 0.000 title claims abstract description 22
- 238000005457 optimization Methods 0.000 claims abstract description 94
- 238000004140 cleaning Methods 0.000 claims abstract description 44
- 230000001174 ascending effect Effects 0.000 claims abstract description 29
- 238000012163 sequencing technique Methods 0.000 claims description 6
- 230000007613 environmental effect Effects 0.000 claims 1
- 238000007726 management method Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 239000000446 fuel Substances 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 238000012935 Averaging Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000013523 data management Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000004804 winding Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
- G01C21/3492—Special cost functions, i.e. other than distance or default speed limit of road segments employing speed data or traffic data, e.g. real-time or historical
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
-
- 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
- Y02W30/00—Technologies for solid waste management
- Y02W30/50—Reuse, recycling or recovery technologies
- Y02W30/82—Recycling of waste of electrical or electronic equipment [WEEE]
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Remote Sensing (AREA)
- Radar, Positioning & Navigation (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Automation & Control Theory (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Entrepreneurship & Innovation (AREA)
- Educational Administration (AREA)
- Primary Health Care (AREA)
- General Health & Medical Sciences (AREA)
- Health & Medical Sciences (AREA)
- Game Theory and Decision Science (AREA)
- Refuse-Collection Vehicles (AREA)
- Refuse Collection And Transfer (AREA)
Abstract
The embodiment of the invention discloses a path optimization method and a system for garbage clearing, wherein the method comprises the following steps: acquiring position information and garbage weight information of all garbage cans in a target area and garbage cleaning related information of all garbage cleaning vehicles; obtaining a plurality of path optimization scheme information according to given limiting conditions, the position information and the garbage weight information of all the garbage cans and the garbage clearing related information of all the garbage clearing vehicles; calculating the garbage clearing cost of the multiple path optimization scheme information according to a preset garbage clearing cost rule; and sorting the garbage clearing cost of the plurality of pieces of path optimization scheme information in an ascending order, and displaying the preset number of pieces of path optimization scheme information according to the sorting. The path optimization of the invention considers the operation cost of the garbage cleaning vehicle according to the algorithm, and can effectively reduce the operation cost of the sanitation vehicle.
Description
Technical Field
The embodiment of the invention relates to the technical field of information, in particular to a method and a system for optimizing a garbage clearing path.
Background
Refuse disposal refers to the collection and transport of refuse. 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.
At present, the optimization of the garbage clearing route is generally to divide a block area according to a grid or an administrative area, then to assign a route according to personal experience or to simply perform neighborhood search according to a vehicle starting point to determine the route, and to arrange emergency operation vehicles for processing under special conditions, so that the optimization method has the advantages of strong flexibility, high optimization speed and the like. However, in the case of a large number of collection vehicles facing a large number of collection points under actual road conditions, the traditional method of manually dividing the whole problem and arranging the route cannot optimize the collection route, which results in increased cost and decreased efficiency.
Disclosure of Invention
The embodiment of the invention aims to provide a garbage clearing path optimizing system and method, which are used for solving the problem of higher cost of the existing garbage clearing.
In order to achieve the above object, the embodiments of the present invention mainly provide the following technical solutions:
in a first aspect, an embodiment of the present invention provides a method for optimizing a garbage disposal path, including: acquiring position information and garbage weight information of all garbage cans in a target area and garbage cleaning related information of all garbage cleaning vehicles; obtaining a plurality of path optimization scheme information according to given limiting conditions, the position information and the garbage weight information of all the garbage cans and the garbage clearing related information of all the garbage clearing vehicles; calculating the garbage clearing cost of the multiple path optimization schemes according to a preset garbage clearing cost rule; and sorting the garbage clearing cost of the plurality of pieces of path optimization scheme information in an ascending order, and displaying a preset number of pieces of path optimization scheme information according to a sorting result.
According to one embodiment of the invention, the refuse related information comprises a payload and an operating cost of each refuse clearing vehicle.
According to one embodiment of the invention, the given limiting conditions comprise that the garbage clearing weight of the garbage clearing vehicle does not exceed the loading capacity of the corresponding vehicle, the working time of each garbage clearing vehicle does not exceed the preset time, the allowed garbage clearing time of the target garbage can, the allowed vehicle type of the position where the target garbage can is located and the sanitation vehicle traffic regulation limit.
According to an embodiment of the present invention, sorting the garbage collection costs of the path optimization scheme information in an ascending order includes: sequencing and displaying according to the total fixed cost of all the garbage cleaning vehicles; if the total fixed costs of at least two path optimization schemes are the same when the sorting display is carried out according to the total fixed costs of all the garbage cleaning vehicles, the at least two path optimization schemes are sorted in an ascending order according to the total distance or the total time length; and if the garbage clearing total routes or the total time of the at least two path optimization schemes are the same when the at least two path optimization schemes are sorted in an ascending order according to the garbage clearing total routes or the total time, sorting according to the balance index of the daily working time of each vehicle.
In a second aspect, an embodiment of the present invention further provides a system for optimizing a garbage disposal path, including: the data acquisition module is used for acquiring the position information and the garbage weight information of all garbage cans in the target area and the garbage cleaning related information of all garbage cleaning vehicles; the algorithm optimization module is used for obtaining a plurality of path optimization scheme information according to given limiting conditions, the position information and the garbage weight information of all the garbage cans and the garbage cleaning related information of all the garbage cleaning vehicles; the algorithm optimization module is further used for calculating the garbage clearing cost of the multiple path optimization scheme information according to a preset garbage clearing cost rule and sequencing the garbage clearing cost of the multiple path optimization scheme information in an ascending order; and the display output module is used for displaying the scheme information of the preset number of path optimization schemes from low to high according to the garbage clearing cost.
According to one embodiment of the invention, the refuse related information comprises a payload and an operating cost of each refuse clearing vehicle.
According to one embodiment of the invention, the given limiting conditions comprise that the garbage clearing weight of the garbage clearing vehicles does not exceed the loading capacity of the corresponding vehicle, the working time of each garbage clearing vehicle does not exceed the preset time, the allowed garbage clearing time of the target garbage can, the allowed vehicle type of the position where the target garbage can is located and the sanitation vehicle traffic regulation limit.
According to one embodiment of the invention, the algorithm optimization module is configured to sort in ascending order the total fixed cost of the refuse collection vehicles in the plurality of path optimization scenario information; if the total fixed costs of the at least two path optimization schemes are the same when the ascending sorting is carried out according to the total fixed cost of the garbage cleaning vehicles, the ascending sorting is carried out on the at least two path optimization schemes according to the total garbage cleaning distance or the total time; and if the garbage clearing total routes or the total time of the at least two path optimization schemes are the same when the at least two path optimization schemes are sorted in an ascending order according to the garbage clearing total routes or the total time, sorting according to the balance index of the daily working time of each vehicle.
The technical scheme provided by the embodiment of the invention at least has the following advantages:
according to the method and the system for optimizing the path of the garbage collection vehicle, the operation cost of the garbage collection vehicle is considered according to the algorithm in the path optimization, the operation cost of the sanitation vehicle can be effectively reduced, an electronic map is relied on, and the optimized result can be visualized and accords with the actual operation condition; the database is used for management, so that data support can be provided for management personnel; before the vehicle works, the theoretical working time, working mileage, working amount and the like of each vehicle can be calculated through the system, and important basis is provided for management work.
Drawings
Fig. 1 is a flowchart of a garbage disposal path optimization method according to an embodiment of the present invention.
Fig. 2(a) and 2(b) are diagrams of the clearing route of a garbage clearing vehicle in an example of the present invention.
Fig. 3 is a block diagram of a garbage disposal path optimizing apparatus according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention is provided for illustrative purposes, and other advantages and effects of the present invention will become apparent to those skilled in the art from the present disclosure.
In the following description, for purposes of explanation and not limitation, specific details are set forth such as particular system structures, interfaces, techniques, etc. in order to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, circuits, and methods are omitted so as not to obscure the description of the present invention with unnecessary detail.
In the description of the present invention, it is to be understood that the terms "central", "longitudinal", "lateral", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inner" and "outer" and the like indicate orientations or positional relationships based on those shown in the drawings, and are used only for convenience in describing the present invention and for simplicity in description, and do not indicate or imply that the device or element being referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus, should not be construed as limiting the present invention. Furthermore, the terms "first" and "second" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
Fig. 1 is a flowchart of a garbage disposal path optimization method according to an embodiment of the present invention. As shown in fig. 1, the method for optimizing a garbage disposal path according to the embodiment of the present invention includes:
s1: and acquiring the position information and the garbage weight information of all garbage cans in the target area and the garbage cleaning related information of all garbage cleaning vehicles.
Illustratively, for the target area a, the positions and garbage weights of all garbage cans of the target area a are known in advance. In one example of the present invention, for the trash can X in the target area a, the estimated weight of the trash can X is obtained by counting the average weight of the trash can X over a certain period of time (e.g., 7 days or 30 days). And the garbage weight of the garbage can X on a certain day is obtained in a mode that the weight of the garbage can X which is not loaded by the garbage cleaning vehicle is subtracted from the weight of the garbage cleaning vehicle after the garbage can X is loaded. In the embodiment, the estimated garbage weight of all the garbage cans is obtained by averaging the garbage weights of all the garbage cans in the target area A within a certain time, and meanwhile, a certain fluctuation coefficient is considered according to the actual situation.
In one embodiment of the present invention, the garbage collection-related information includes the number and kind of garbage collection vehicles, and the load capacity and operating cost of each garbage collection vehicle. The operation cost comprises at least one of cost, maintenance cost, depreciation cost and labor cost caused by oil consumption, and the specific cost content is determined according to the user requirement.
S2: and obtaining a plurality of path optimization scheme information according to the given limiting conditions, the position information and the garbage weight information of all the garbage cans and the garbage clearing related information of all the garbage clearing vehicles.
In this embodiment, the garbage collection vehicle has a plurality of garbage collection vehicles, the garbage discharge location may be one or more, and the starting point of the garbage collection vehicle and the garbage discharge location in the roadbed optimization may be different.
In one embodiment of the present invention, the given limiting conditions may include that the working time of the single garbage collection vehicle should not exceed a preset upper limit value of the working time, the allowed garbage collection time of the target garbage can, the allowed vehicle type of the position where the target garbage can is located, and the traffic regulation limit of the sanitation vehicle.
Wherein the given limiting conditions further include that the accumulated loading weight of the garbage in a train of each garbage cleaning vehicle does not exceed the loading weight of the vehicle, and the like.
Exemplarily, the garbage clearing time of the garbage can X is 6-7 am and 2-3 pm; the garbage collection vehicle can only collect the garbage within the garbage collection time allowed by the garbage can X.
The traffic limitation conditions include: the garbage collection vehicle needs to carry out garbage collection according to a specified route under the condition of complying with the traffic regulations and limit different vehicle types in a certain road section in the traffic regulations.
The person skilled in the art can set corresponding limiting conditions according to the working requirements or special circumstances.
Under the given limiting condition, a path optimization scheme meeting all the conditions can be obtained through a preset algorithm. In this embodiment, the path optimization scheme is required to cover the positions of all the trash cans, and the trash cleaning route of each trash cleaning vehicle does not include a winding route.
Fig. 2(a) and 2(b) are diagrams of the clearing route of a garbage clearing vehicle in an example of the present invention. As shown in fig. 2(a) and 2(b), the garbage collection vehicle needs to perform garbage collection according to the optimized path.
For an overall route optimization scheme, the total distance of all assigned garbage collection vehicles, the number of times of each garbage collection vehicle in a day, and the total working time (including the driving time obtained according to the actual road condition and the garbage collection time of each garbage can in the optimized route, etc.) are obtained.
S3: and calculating the garbage clearing cost of the multiple paths of optimization scheme information according to a preset garbage clearing cost rule.
Specifically, a formula that affects the garbage disposal cost is specified in advance. Wherein, the direct clearing cost of a single vehicle is fixed cost + variable cost. Wherein, the fixed cost is vehicle depreciation + personnel wage + maintenance cost + insurance cost; the variable cost is the vehicle mileage x average fuel consumption x fuel price. The system can calculate the garbage clearing cost of the path optimization scheme generated under the limiting condition according to a formula influencing the garbage clearing cost.
S4: and sorting the garbage clearing cost of the multiple path optimization schemes in an ascending order, and displaying the preset number of path optimization scheme information according to the sorting result.
In an embodiment of the present invention, sorting the garbage collection costs of multiple path optimization scheme information in ascending order includes: sorting in ascending order according to the total fixed cost of the garbage cleaning vehicles in the multiple path optimization schemes; if the total fixed costs of the garbage cleaning vehicles in the at least two path optimization schemes are the same when the garbage cleaning vehicles are sorted and displayed according to the total fixed costs of the garbage cleaning vehicles, sorting the at least two path optimization schemes in an ascending order according to the total garbage cleaning distance or the total garbage cleaning time; and if the at least two path optimization schemes are ranked according to the total garbage clearing distance or the total garbage clearing time length, the at least two path optimization schemes are ranked according to the balance index of the daily working time of each vehicle.
The embodiment can adopt the optimal path optimization scheme (with the lowest cost) to distribute the garbage clearing work, but sometimes the garbage clearing work can be distributed according to the suboptimal path optimization scheme by considering some special conditions.
According to the path optimization method for garbage collection and transportation provided by the embodiment of the invention, the operation cost of the garbage collection and transportation vehicle is considered according to the algorithm in the path optimization, so that the operation cost of the sanitation vehicle can be effectively reduced, an electronic map is relied on, and the optimized result can be visually presented and accords with the actual operation condition; the database is used for data management, so that data support can be provided for daily management of managers; before the vehicle works, the theoretical working time, working mileage, working amount and the like of each vehicle can be calculated through the system, and a basis is provided for management work.
Fig. 3 is a block diagram of a garbage disposal path optimizing apparatus according to an embodiment of the present invention. As shown in fig. 3, the path optimizing apparatus for garbage collection according to the embodiment of the present invention includes a data obtaining module 100, an algorithm optimizing module 200, and a display output module 300.
The data obtaining module 100 is configured to obtain position information and garbage weight information of all garbage cans in the target area, and garbage cleaning related information of all garbage cleaning vehicles. The algorithm optimization module 200 is configured to obtain a plurality of path optimization schemes according to given limiting conditions, the position information and the garbage weight information of all the garbage cans, and the garbage cleaning related information of all the garbage cleaning vehicles. The algorithm optimization module 200 is further configured to calculate garbage clearing costs of the multiple path optimization schemes according to a preset garbage clearing cost rule, and sort the garbage clearing costs of the multiple path optimization schemes in an ascending order. The display output module 300 is configured to display a preset number of pieces of path optimization scheme information according to the sorting result.
In one embodiment of the invention, the garbage collection-related information includes the payload and operating cost of each garbage collection vehicle.
In one embodiment of the invention, the given limiting conditions comprise that the garbage clearing weight of the garbage clearing vehicles does not exceed the loading capacity of the corresponding vehicles, the working time of each garbage clearing vehicle does not exceed the preset time, the allowed garbage clearing time of the target garbage bin, the allowed vehicle type of the position where the target garbage bin is located and the sanitation vehicle traffic regulation limit.
In one embodiment of the invention, the algorithm optimization module 200 is configured to sort in ascending order the total fixed cost of the garbage collection vehicles in the plurality of path optimization plan messages; if the total fixed costs of the at least two path optimization schemes are the same when the ascending sorting is carried out according to the total fixed cost of the garbage cleaning vehicles, the ascending sorting is carried out on the at least two path optimization schemes according to the total garbage cleaning distance or the total time length; and if the garbage clearing total routes or the total time lengths of the at least two path optimization schemes are the same when the at least two path optimization schemes are sorted in an ascending order according to the garbage clearing total routes or the total time lengths, sorting according to the balance index of the daily working time of each vehicle.
It should be noted that the specific implementation of the path optimization system for garbage collection in the embodiment of the present invention is similar to the specific implementation of the path optimization method for garbage collection in the embodiment of the present invention, and specific reference is specifically made to the description of the path optimization method for garbage collection, and details are not repeated for reducing redundancy.
Those skilled in the art will appreciate that the functionality described in the present invention may be implemented in a combination of hardware and software in one or more of the examples described above. When software is applied, the corresponding functionality may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.
The above-mentioned embodiments, objects, technical solutions and advantages of the present invention are further described in detail, it should be understood that the above-mentioned embodiments are only exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made on the basis of the technical solutions of the present invention should be included in the scope of the present invention.
Claims (8)
1. A method for optimizing a garbage disposal route, comprising:
acquiring position information and garbage weight information of all garbage cans in a target area and garbage cleaning related information of all garbage cleaning vehicles;
obtaining a plurality of path optimization scheme information according to given limiting conditions, the position information and the garbage weight information of all the garbage cans and the garbage clearing related information of all the garbage clearing vehicles;
calculating the garbage clearing cost of the multiple path optimization schemes according to a preset garbage clearing cost rule;
and sorting the garbage clearing cost of the plurality of pieces of path optimization scheme information in an ascending order, and displaying a preset number of pieces of path optimization scheme information according to a sorting result.
2. The method for path optimization of trash collection of claim 1, wherein the trash collection related information includes a load capacity and an operating cost of each trash collection vehicle.
3. The method of claim 1, wherein the given limiting conditions include that the garbage collection weight of the garbage collection vehicle does not exceed the loading weight of the corresponding vehicle, the working time of each garbage collection vehicle does not exceed a preset time, the allowed garbage collection time of the target garbage can, the allowed vehicle type of the target garbage can and the sanitation vehicle traffic regulation limit.
4. The path optimization method for garbage collection according to claim 1, wherein sorting the garbage collection costs of the plurality of path optimization scheme information in ascending order comprises:
sorting in ascending order according to the total fixed cost of the garbage collection vehicles in the plurality of path optimization scheme information;
if the total fixed costs of the at least two path optimization schemes are the same when sequencing according to the total fixed cost of the garbage cleaning vehicles, sequencing the at least two path optimization schemes in an ascending order according to the total garbage cleaning distance or the total garbage cleaning time;
and if the garbage clearing total routes or the total time lengths of the at least two path optimization schemes are the same when the at least two path optimization schemes are sorted in an ascending order according to the garbage clearing total routes or the total time lengths, sorting according to the balance index of the daily working time of each vehicle.
5. A refuse clearing path optimization system comprising:
the data acquisition module is used for acquiring the position information and the garbage weight information of all garbage cans in the target area and the garbage cleaning related information of all garbage cleaning vehicles;
the algorithm optimization module is used for obtaining a plurality of path optimization scheme information according to given limiting conditions, the position information and the garbage weight information of all the garbage cans and the garbage cleaning related information of all the garbage cleaning vehicles; the algorithm optimization module is further used for calculating the garbage clearing cost of the multiple path optimization schemes according to a preset garbage clearing cost rule and sequencing the multiple path optimization schemes in an ascending order;
and the display output module is used for displaying the preset amount of path optimization scheme information according to the sequencing result.
6. The path optimization system for garbage collection of claim 5, wherein the garbage collection related information comprises a payload and an operating cost of each garbage collection vehicle.
7. The system of claim 5, wherein the given constraints include that the garbage collection weight of the garbage collection vehicle does not exceed the loading weight of the corresponding vehicle, the working time of each garbage collection vehicle does not exceed a preset time, the allowed garbage collection time of the target garbage can, the allowed vehicle type of the target garbage can and the environmental sanitation vehicle traffic constraints.
8. The path optimization system for garbage collection of claim 5, wherein the algorithm optimization module is configured to sort in ascending order the total fixed cost of garbage collection vehicles in the plurality of path optimization scenario information; if the total fixed costs of the at least two path optimization schemes are the same when the ascending sorting is carried out according to the total fixed cost of the garbage cleaning vehicles, the ascending sorting is carried out on the at least two path optimization schemes according to the total garbage cleaning distance or the total garbage cleaning time length; and if the garbage clearing total routes or the total time lengths of the at least two path optimization schemes are the same when the at least two path optimization schemes are sorted in an ascending order according to the garbage clearing total routes or the total time lengths, sorting according to the balance index of the daily working time of each vehicle.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011139691.5A CN112365032A (en) | 2020-10-22 | 2020-10-22 | System and method for optimizing garbage clearing path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011139691.5A CN112365032A (en) | 2020-10-22 | 2020-10-22 | System and method for optimizing garbage clearing path |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112365032A true CN112365032A (en) | 2021-02-12 |
Family
ID=74511627
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011139691.5A Pending CN112365032A (en) | 2020-10-22 | 2020-10-22 | System and method for optimizing garbage clearing path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112365032A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113344262A (en) * | 2021-05-28 | 2021-09-03 | 淮阴工学院 | Intelligent clearing system and method based on urban garbage classification |
| CN113650993A (en) * | 2021-08-17 | 2021-11-16 | 北京航空航天大学 | Intelligent garbage disposal method based on optimized path |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106115104A (en) * | 2016-06-27 | 2016-11-16 | 湖南现代环境科技股份有限公司 | Categorized consumer waste collecting and transferring system based on Internet of Things, devices and methods therefor |
-
2020
- 2020-10-22 CN CN202011139691.5A patent/CN112365032A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106115104A (en) * | 2016-06-27 | 2016-11-16 | 湖南现代环境科技股份有限公司 | Categorized consumer waste collecting and transferring system based on Internet of Things, devices and methods therefor |
Non-Patent Citations (1)
| Title |
|---|
| 朱明华等: "上海浦东新区城市生活垃圾收运路线优化研究", 《资源科学》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113344262A (en) * | 2021-05-28 | 2021-09-03 | 淮阴工学院 | Intelligent clearing system and method based on urban garbage classification |
| CN113650993A (en) * | 2021-08-17 | 2021-11-16 | 北京航空航天大学 | Intelligent garbage disposal method based on optimized path |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kinobe et al. | Optimization of waste collection and disposal in Kampala city | |
| Lin | A cooperative strategy for a vehicle routing problem with pickup and delivery time windows | |
| CN112365032A (en) | System and method for optimizing garbage clearing path | |
| Aremu | In-town tour optimization of conventional mode for municipal solid waste collection | |
| Leyerer et al. | Decision support for sustainable and resilience-oriented urban parcel delivery | |
| Ye et al. | Location set covering for waste resource recycling centers in Taiwan | |
| Hemidat et al. | Evaluation of key indicators of waste collection using GIS techniques as a planning and control tool for route optimization | |
| JP2012083882A (en) | Delivery plan creation device, delivery plan creation method, and delivery plan creation program | |
| CN114912659A (en) | Method, system, equipment and storage medium for calculating transfer scheme in railway passenger transport | |
| Pitera et al. | Evaluation of emissions reduction in urban pickup systems: heterogeneous fleet case study | |
| Li et al. | Heterogeneous fleet electric vehicle routing optimization for logistic distribution with time windows and simultaneous pick-up and delivery service | |
| JP2004185398A (en) | Server for transportation system | |
| Stellingwerff | Dynamic waste collection: assessing the usage of dynamic routing methodologies | |
| Asimakopoulos et al. | Dynacargo: the evaluation results of a dynamic waste collection management system based on real-time and forecasted data | |
| Christodoulou et al. | Dynacargo routing subsystem and its algorithms for efficient urban waste collection | |
| Dumas | A spreadsheet process model for analysis of costs and life-cycle inventory parameters associated with collection of municipal solid waste | |
| Slater | Vehicle load planning | |
| US20230260067A1 (en) | System and Method for Dynamically Generating Collection Routes Based On Predicted Accumulation of Industrial Waste and Recyclables | |
| McLeod et al. | Maximising efficiency in domestic waste collection through improved fleet management | |
| Omar et al. | Original Research Article Feasibility and effects of GIS-based municipal solid waste vehicle routing for Bahrain | |
| Dunovic et al. | A method for optimizing collection, transfer and transport routs of waste using OSGeo software | |
| Ninidze | Optimization of waste transportation costs in Mtskheta-Mtianeti region | |
| Nnaji et al. | Process analysis and optimization of solid waste haulage in Enugu Metropolis | |
| Lin | Collecting, dewatering and depositing sewage-logistics challenges | |
| Sadigov | DRIVING THE WASTE COLLECTION ROUTING AGENDA: A model for determination of the route time by simulating a collection vehicle traveling in Greater Baku Area, Republic of Azerbaijan. |
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 | ||
| CB03 | Change of inventor or designer information |
Inventor after: Wang Jie Inventor after: Zang Bing Inventor after: Shi Xiong Inventor after: Wen Ding Inventor after: Wang Yang Inventor after: Jiang Shan Inventor after: Wang Yujuan Inventor after: Wang Gan Inventor after: Zhang Chenguang Inventor before: Zang Bing Inventor before: Shi Xiong Inventor before: Wen Ding Inventor before: Wang Yang Inventor before: Jiang Shan Inventor before: Wang Yujuan Inventor before: Wang Gan Inventor before: Zhang Chenguang |
|
| CB03 | Change of inventor or designer information | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210212 |
|
| RJ01 | Rejection of invention patent application after publication |