CN-121981624-A - Path optimization and comprehensive scheduling method, system, equipment and storage medium for classified transportation of urban garbage

CN121981624ACN 121981624 ACN121981624 ACN 121981624ACN-121981624-A

Abstract

The invention discloses a path optimization and comprehensive scheduling method, a system, equipment and a storage medium for classified transportation of urban garbage, which relate to the technical field of urban garbage treatment and intelligent scheduling and comprise the steps of collecting basic geography and operation parameters, and vehicle and facility attributes to construct a comprehensive data table; the method comprises the steps of generating an optimal traversing path for covering a collection point aiming at each garbage type, dividing the optimal traversing path into sub paths according to the load of a vehicle, binding the sub paths with a special vehicle, calculating the total transportation cost, introducing a transfer station site selection decision, planning a secondary transportation network, combining a time window with carbon emission constraint and optimizing cost and energy efficiency, converting an optimizing result into an instruction and a chart to deliver to operators, and completing transportation path optimization and scheduling.

Inventors

ZHANG YING
GAO ZIHAN
WANG MINGWEI
Wei Jijuan
LIU ZHE
YU PENGCHENG

Assignees

贵州电网有限责任公司

Dates

Publication Date: 20260505
Application Date: 20251201

Claims (10)

1. A path optimization and comprehensive scheduling method for classified transportation of urban garbage is characterized by comprising the following steps: Collecting basic geography and operation parameters, vehicles and facility attributes, and constructing a comprehensive data table; Based on the comprehensive data table, independently generating an optimal traversing path covering all collection points for each garbage type, and dividing the optimal traversing path into a plurality of feasible transportation sub-paths according to the load of the vehicle; binding all kinds of garbage sub-paths with corresponding special transportation vehicles based on the generated transportation sub-paths, and comprehensively calculating the total cost of the whole transportation system; Introducing a site selection decision of the transfer station, re-planning a secondary transportation network taking the transfer station as a hub, and simultaneously introducing a time window and carbon emission constraint to optimize cost and energy efficiency in a global range; and converting the final optimization result into an executable instruction and an visual chart, delivering the executable instruction and the visual chart to actual operators for use, and completing path optimization and comprehensive scheduling of urban garbage classified transportation.
2. The method for optimizing and comprehensively scheduling paths for classified transportation of municipal waste according to claim 1, wherein said collecting basic geographic and operational parameters, vehicle and facility attributes, and constructing a comprehensive data table comprises: The method comprises the steps of collecting basic geography and operation parameters, determining garbage collection points and garbage treatment plants serving as vehicle dispatching centers, numbering the garbage treatment plants serving as starting points, numbering all other garbage collection points in sequence, forming a node set together by the garbage collection points and the treatment plants, and acquiring space coordinate positions of all the nodes and daily garbage amount generated by all the collection points.
3. The method for optimizing and comprehensively scheduling paths for classified transportation of municipal waste according to claim 2, wherein said collecting basic geographic and operational parameters, vehicle and facility attributes, and constructing a comprehensive data table further comprises: Collecting attributes of vehicles and facilities, and calculating the distance between any two nodes based on the collected node space coordinate positions; And constructing a comprehensive data table according to the collected basic geography and operation parameters, the attributes of the vehicles and facilities and the calculated distance between the nodes.
4. A method for optimizing and comprehensively scheduling a path for classified transportation of municipal refuse according to claim 3, wherein the step of independently generating an optimal traversal path for each refuse type, covering all collection points, and dividing the optimal traversal path into a plurality of possible transportation sub-paths according to the load of the vehicle based on the comprehensive data table comprises: Starting from the current node, selecting the node closest to the current node from the non-access node set as the next access node, removing and updating the current node from the non-access node set until the non-access node set is empty, and returning the last accessed node to the garbage treatment plant to form an initial path.
5. The method for optimizing and comprehensively scheduling the path of classified transportation of urban garbage according to claim 4, wherein the step of independently generating an optimal traversal path covering all collection points for each garbage type based on the comprehensive data table, and dividing the optimal traversal path into a plurality of feasible transportation sub-paths according to the load of the vehicle further comprises: The method comprises the steps of dividing an initial path according to the load of a vehicle, initializing a transportation trip and a current load accumulation value, setting a maximum load limit of the vehicle, traversing initial path nodes, adding the current node into the current trip path and updating the load accumulation value if the load after adding the current node does not exceed the maximum load limit, marking the current node as the starting point of the next transportation trip if the load limit is exceeded, closing the current trip path, resetting the load accumulation value and increasing the transportation trip; And outputting a plurality of transportation paths meeting the load constraint, wherein the sum of the node garbage amounts in each transportation path does not exceed the maximum load limit of the vehicle.
6. The method for optimizing and comprehensively scheduling the classified transportation path of the urban garbage according to claim 5, wherein the binding the sub-paths of the various garbage with the corresponding special transportation vehicles based on the generated transportation sub-paths, and comprehensively calculating the total cost of the whole transportation system comprises: Binding sub-paths of various types of garbage with corresponding special transport vehicles, and decomposing the problem into a plurality of independent single-vehicle type capacity constraint path planning sub-problems, wherein each type of garbage corresponds to different vehicle types; The total cost of the entire transportation system is comprehensively calculated with the aim of minimizing the total cost of daily transportation.
7. The method for optimizing and comprehensively scheduling paths for classified transportation of municipal refuse according to claim 6, wherein introducing a site selection decision of a transfer station and re-planning a secondary transportation network with the transfer station as a hub while taking into consideration a time window and carbon emission constraints, and performing cost and energy efficiency optimization in a global range comprises: Introducing decision variables including a transfer station site selection variable, a collection point allocation variable, a transport path variable, a garbage loading variable and an arrival time variable; An objective function is constructed that aims at minimizing a total cost including a transportation cost calculated based on a vehicle unit distance transportation cost, an inter-node transportation distance, and a vehicle path selection condition, a transfer station construction cost generated only when a transfer station is selected to be constructed, and a carbon emission cost related to a vehicle travel distance and a load capacity.
8. A path optimization and comprehensive scheduling system for classified transportation of municipal refuse, applying the method as claimed in any one of claims 1 to 7, comprising: the data integration module is used for collecting basic geography and operation parameters, vehicles and facility attributes and constructing a comprehensive data table; the path planning module is used for independently generating an optimal traversing path covering all collection points according to each garbage type based on the comprehensive data table, and dividing the optimal traversing path into a plurality of feasible transportation sub-paths according to the load of the vehicle; The vehicle binding and cost calculating module is used for binding the sub-paths of various garbage with corresponding special transportation vehicles based on the generated transportation sub-paths and comprehensively calculating the total cost of the whole transportation system; The global optimization module is used for introducing a site selection decision of the transfer station and re-planning a secondary transportation network taking the transfer station as a hub, and simultaneously, taking in a time window and carbon emission constraint to optimize the cost and energy efficiency in a global range; And the result delivery module is used for converting the final optimization result into an executable instruction and an visual chart, delivering the executable instruction and the visual chart to actual operators for use, and completing path optimization and comprehensive scheduling of urban garbage classified transportation.
9. An electronic device, comprising: A memory and a processor; The memory is for storing computer executable instructions, the processor being for executing the computer executable instructions which when executed by the processor implement the steps of the method of any one of claims 1to 7.
10. A computer-readable storage medium, characterized in that it stores computer-executable instructions which, when executed by a processor, implement the steps of the method of any one of claims 1 to 7.

Description

Path optimization and comprehensive scheduling method, system, equipment and storage medium for classified transportation of urban garbage Technical Field The invention relates to the technical field of urban garbage treatment and intelligent scheduling, in particular to a method, a system, equipment and a storage medium for optimizing and comprehensively scheduling a path of urban garbage classified transportation. Background With the acceleration of the urban process, the generation amount of the household garbage is increased, and the garbage classification and transportation efficiency is directly related to the urban environment quality and the operation cost. In the prior art, the path planning of single garbage or single vehicle is focused on, and a certain effect can be achieved under a specific simplified scene, but when complex reality constraints such as multi-class garbage, multi-model special vehicle cooperation, transfer station site selection and time window are faced, the solving difficulty is often reduced by disassembling or neglecting part of constraints, so that the dispatching scheme is disjointed from the actual operation, and multiple targets such as facility construction, aging requirement and environmental protection can not be effectively considered while the transportation cost is controlled. Disclosure of Invention In view of the above problems, the present invention provides a method, a system, a device and a storage medium for path optimization and comprehensive scheduling of urban garbage classified transportation. Therefore, the invention solves the technical problem of how to provide a comprehensive optimization method capable of comprehensively planning a garbage transportation path, vehicle cooperative scheduling, transfer station site selection, time window and carbon emission control so as to overcome the defect that the prior art scheme is not matched with the actual application requirement. In order to solve the technical problems, the invention provides the following technical scheme: in a first aspect, the present invention provides a method for path optimization and comprehensive scheduling of urban garbage classified transportation, including: Collecting basic geography and operation parameters, vehicles and facility attributes, and constructing a comprehensive data table; Based on the comprehensive data table, independently generating an optimal traversing path covering all collection points for each garbage type, and dividing the optimal traversing path into a plurality of feasible transportation sub-paths according to the load of the vehicle; binding all kinds of garbage sub-paths with corresponding special transportation vehicles based on the generated transportation sub-paths, and comprehensively calculating the total cost of the whole transportation system; Introducing a site selection decision of the transfer station, re-planning a secondary transportation network taking the transfer station as a hub, and simultaneously introducing a time window and carbon emission constraint to optimize cost and energy efficiency in a global range; and converting the final optimization result into an executable instruction and an visual chart, delivering the executable instruction and the visual chart to actual operators for use, and completing path optimization and comprehensive scheduling of urban garbage classified transportation. As a preferable scheme of the path optimization and comprehensive scheduling method for urban garbage classified transportation, the method comprises the following steps: the collecting basic geography and operation parameters, vehicles and facility attributes, and constructing a comprehensive data table comprises: The method comprises the steps of collecting basic geography and operation parameters, determining garbage collection points and garbage treatment plants serving as vehicle dispatching centers, numbering the garbage treatment plants serving as starting points, numbering all other garbage collection points in sequence, forming a node set together by the garbage collection points and the treatment plants, and acquiring space coordinate positions of all the nodes and daily garbage amount generated by all the collection points. As a preferable scheme of the path optimization and comprehensive scheduling method for urban garbage classified transportation, the method comprises the following steps: the collecting basic geography and operation parameters, vehicles and facility attributes, and constructing a comprehensive data table further comprises: Collecting attributes of vehicles and facilities, and calculating the distance between any two nodes based on the collected node space coordinate positions; And constructing a comprehensive data table according to the collected basic geography and operation parameters, the attributes of the vehicles and facilities and the calculated distance between the nodes. As a preferable scheme of the path