CN115081819A - Scheduling method, scheduling device, electronic equipment and storage medium - Google Patents
Scheduling method, scheduling device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN115081819A CN115081819A CN202210600251.8A CN202210600251A CN115081819A CN 115081819 A CN115081819 A CN 115081819A CN 202210600251 A CN202210600251 A CN 202210600251A CN 115081819 A CN115081819 A CN 115081819A
- Authority
- CN
- China
- Prior art keywords
- route
- transfer station
- garbage truck
- determining
- garbage
- 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
- 238000000034 method Methods 0.000 title claims abstract description 63
- 238000012546 transfer Methods 0.000 claims abstract description 291
- 238000005457 optimization Methods 0.000 claims abstract description 32
- 238000012545 processing Methods 0.000 claims description 20
- 238000004590 computer program Methods 0.000 claims description 14
- 238000006243 chemical reaction Methods 0.000 claims description 11
- 239000002699 waste material Substances 0.000 abstract description 6
- 230000002354 daily effect Effects 0.000 description 70
- 238000004891 communication Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 230000003203 everyday effect Effects 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000012216 screening Methods 0.000 description 2
- 238000002485 combustion reaction Methods 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000006866 deterioration Effects 0.000 description 1
- 238000004090 dissolution Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000446 fuel Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
- 238000006467 substitution reaction 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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
- Y02W90/00—Enabling technologies or technologies with a potential or indirect contribution to greenhouse gas [GHG] emissions mitigation
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- Educational Administration (AREA)
- Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a scheduling method, a scheduling device, electronic equipment and a storage medium, wherein the method comprises the following steps: determining a common route of each garbage truck from the historical driving routes of each garbage truck; optimizing the transfer stations in the common route to obtain a planned route based on the distances from the collection points adjacent to the transfer stations in the common route to the preset transfer stations; and determining the dispatching route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck, and dispatching the garbage trucks based on the dispatching route. The method realizes the optimization of the driving route of each garbage truck by analyzing the historical driving route of each garbage truck and combining the daily transportation cost of each garbage truck, thereby reducing the daily transportation cost of each garbage truck and reducing the waste of resources.
Description
Technical Field
The present invention relates to the field of internet technologies, and in particular, to a scheduling method and apparatus, an electronic device, and a storage medium.
Background
At present, the dispatching of the garbage trucks in cities is mainly carried out in a real-time dispatching mode, namely, the running route of each garbage truck is dynamically adjusted according to the real-time state of a transfer station on the running route of each garbage truck.
However, the scheduling method is to schedule a single garbage truck based on a real-time clearing state, and cannot analyze big data of a common route of each garbage truck from a historical driving route of each garbage truck, and further cannot perform route planning optimization on each garbage truck through the historical driving route, so that the total transportation cost of urban garbage is high, and resources are wasted.
Disclosure of Invention
The invention provides a scheduling method, a scheduling device, electronic equipment and a storage medium, which are used for solving the defect that the total transportation cost of urban garbage is high because each garbage truck cannot be scheduled comprehensively from the perspective of urban global in the prior art.
The invention provides a scheduling method, which comprises the following steps:
determining a common route of each garbage truck from the historical driving routes of each garbage truck;
optimizing the transfer stations in the common route to obtain a planned route based on the distances from the collection points adjacent to the transfer stations in the common route to the preset transfer stations;
and determining the dispatching route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck, and dispatching the garbage trucks based on the dispatching route.
According to the scheduling method provided by the invention, the step of determining the scheduling route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck comprises the following steps:
determining a first planning scheme based on the daily transportation cost of the planned route of each garbage truck;
if an excess route containing a transfer station exceeding the daily maximum throughput exists in each planned route in the first planning scheme, optimizing the first planning scheme by taking the planned throughput of each preset transfer station smaller than the daily maximum throughput as a constraint condition to obtain a second planning scheme; and determining the dispatching route of each garbage truck by applying the second planning scheme.
According to the scheduling method provided by the invention, the step of optimizing the first planning scheme by taking the planning throughput of each preset transfer station smaller than the daily maximum throughput as a constraint condition to obtain a second planning scheme comprises the following steps:
determining an excess route in the first planning scenario;
optimizing the excess transfer stations in the excess route in an iterative manner by taking the planning throughput of each preset transfer station smaller than the daily maximum throughput as a constraint condition to obtain an optimized route, and determining the optimized route by applying the optimized route and the non-excess route in the first planning scheme; the iteration mode is that the excess part of garbage of the excess transfer station is distributed to the non-excess transfer station which is far away from the excess transfer station from near to far in an iteration mode until the iteration is finished after all the excess part of garbage is distributed;
and determining the second planning scheme based on the daily total transportation cost and preset transportation cost of each scheme in the optimization scheme.
According to the scheduling method provided by the invention, the total daily transportation cost of each scheme in the optimization scheme is determined based on the total transportation cost of each garbage truck and the transfer cost of each preset transfer station; the transfer cost of each preset transfer station is determined based on the garbage conversion rate corresponding to each preset transfer station and the distance of the garbage disposal site.
According to a scheduling method provided by the present invention, the excess route in the first planning scheme is determined based on the following steps:
determining the total number of the train numbers per day corresponding to each preset transfer station based on the first planning scheme;
determining the planning processing amount corresponding to each preset transfer station based on the total number of the vehicle times per day corresponding to each preset transfer station and the average load capacity of each vehicle time;
and determining an excess route in the first planning scheme based on the planning throughput corresponding to each preset transfer station, the daily maximum throughput corresponding to each preset transfer station and the first planning scheme.
According to a scheduling method provided by the invention, optimizing the transfer stations in the common route based on the distances from the collection points adjacent to the transfer stations in the common route to the preset transfer stations to obtain a planned route comprises the following steps:
determining the current transfer station of any one of the common routes of each garbage truck;
determining a transfer station with the closest distance to the collection point adjacent to the current transfer station of any route based on the distance between the collection point adjacent to the current transfer station of any route and each preset transfer station, replacing the current transfer station of any route with the closest transfer station, and taking the next transfer station of the current transfer station of any route as the current transfer station of any route until all the transfer stations of any route are replaced, so as to obtain a planned route corresponding to any route;
and determining the planned route of each garbage truck based on the planned route corresponding to each route in the common routes of each garbage truck.
According to the scheduling method provided by the invention, the step of determining the common route of each garbage truck from the historical driving routes of each garbage truck comprises the following steps:
determining each coincident route in the historical driving route of any garbage truck based on the collection points in the historical driving route of any garbage truck; the coincident route represents that the ratio of the total number of the collection points of the same collection points in the two driving routes is greater than a preset threshold value, and the two driving routes are coincident routes;
and determining the common route of any garbage truck based on the number of routes in each overlapped route.
The present invention also provides a scheduling apparatus, comprising:
the common route determining module is used for determining the common route of each garbage truck from the historical driving routes of each garbage truck;
the planning route determining module is used for optimizing the transfer stations in the common route to obtain a planning route based on the distances from the collection points adjacent to the transfer stations in the common route to the preset transfer stations;
and the scheduling module is used for determining the scheduling route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck and scheduling the garbage truck based on the scheduling route.
The present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements any of the above scheduling methods when executing the program.
The invention also provides a non-transitory computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements a scheduling method as in any one of the above.
The invention also provides a computer program product comprising a computer program which, when executed by a processor, implements the scheduling method as described in any one of the above.
According to the scheduling method, the scheduling device, the electronic equipment and the storage medium, the common routes of all the garbage trucks are obtained from the historical driving routes of all the garbage trucks, the common routes of all the garbage trucks are optimized according to the distances from the adjacent collection points of the transfer stations in the common routes to all the preset transfer points, the planned routes of all the garbage trucks are obtained, then the daily transportation cost of the planned routes of all the garbage trucks is obtained, the scheduling routes of all the garbage trucks are determined, all the garbage trucks are scheduled based on the scheduling routes of all the garbage trucks, the historical driving routes of all the garbage trucks are analyzed, the daily transportation cost of all the garbage trucks is combined, the driving routes of all the garbage trucks are optimized, the daily transportation cost of all the garbage trucks is reduced, and the waste of resources is reduced.
Drawings
In order to more clearly illustrate the technical solutions of the present invention or the prior art, the drawings needed for the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
FIG. 1 is a flow chart of a scheduling method according to the present invention;
FIG. 2 is a schematic flow chart of a method for obtaining a dispatch route according to the present invention;
fig. 3 is a schematic flow chart of a first planning scheme optimization method according to an embodiment of the present invention;
FIG. 4 is a schematic flow chart of a method for determining an excess route according to a first planning scenario of the present invention;
FIG. 5 is a schematic flow chart diagram illustrating a planned route acquisition method according to the present invention;
FIG. 6 is a schematic flow chart of a conventional route acquisition method provided by the present invention;
FIG. 7 is a second flowchart illustrating a scheduling method according to the present invention;
FIG. 8 is a schematic structural diagram of a scheduling apparatus provided in the present invention;
fig. 9 is a schematic structural diagram of an electronic device provided by the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is obvious that the described embodiments are some, but not all embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The dispatching of the garbage trucks in the city at present is to dynamically adjust the running route of each truck according to the real-time state of the transfer station on the running route of each garbage truck in real time, for example: when the maximum processing capacity of the transfer station A in the current running route of the garbage truck exceeds the maximum processing capacity of the garbage truck, the system can automatically plan the route according to the state of the current transfer station A, the transfer station B which is nearest to the transfer station A and does not have the excess capacity, the collection point behind the transfer station A in the current running route and the subsequent transfer stations, so as to adjust the subsequent route of the current garbage truck.
However, the scheduling manner is to perform real-time adjustment and scheduling on garbage trucks according to the clearing state, and each garbage truck cannot be scheduled on a whole from the perspective of urban global situation, which results in high total transportation cost of urban garbage and waste of resources.
Therefore, how to perform overall scheduling on each garbage truck from the perspective of city global to reduce the total transportation cost is an urgent technical problem to be solved in the field.
In order to solve the above technical problem, an embodiment of the present invention provides a scheduling method. Fig. 1 is a flowchart illustrating a scheduling method according to the present invention. As shown in fig. 1, the method includes:
considering that each garbage truck has a planned route or a planned garbage collection point when the urban garbage is cleared, namely each garbage truck has a route which is frequently taken, and optimizing the route which is frequently taken by each garbage truck can reduce the daily total transportation cost of the city. Therefore, the embodiment of the invention determines the common route of each garbage truck in the historical driving routes of each garbage truck.
It should be noted that the common route of each garbage truck may be obtained based on the coincidence rate of the reporting points of the positioning information in the historical driving route of each garbage truck, and may also be obtained according to the coincidence rate of the collection points in the route, which is not limited in this embodiment of the present invention. The common route comprises a plurality of historical driving routes with similar or identical tracks. The positioning information may be obtained through GPS positioning or Beidou satellite positioning, which is not limited in the embodiments of the present invention.
Consider that a transfer station in a common route is not necessarily an optimal transfer station, for example: the collection points of all routes in the common track of each vehicle are the same, but the transfer stations in all routes are different, the non-optimal transfer station can cause the running route of the garbage vehicle to be lengthened, so that the transportation cost is increased, and meanwhile, the conversion cost of garbage conversion of each garbage transfer station in a city can also influence the daily total transportation cost.
Specifically, collecting points adjacent to transfer stations in all routes are determined according to the sequence that the garbage trucks pass through collecting points or the transfer stations in all routes of a conventional route, the transfer stations in all routes in a common route are optimized according to the distance from the collecting points adjacent to the transfer stations in all routes to preset transfer stations, a planned route of all the garbage trucks is obtained, then a dispatching route of all the garbage trucks is determined according to the daily transportation cost of the planned route of all the garbage trucks, and finally all the garbage trucks are dispatched according to the dispatching routes of all the garbage trucks.
It should be noted that, the transit stations in each route in the common routes are optimized according to the distance from the collection point adjacent to the transit station in each route to each preset transit station, so as to obtain a planned route, the transit stations corresponding to the two collection points in the route can be replaced according to the transit station with the minimum distance from one or two collection points adjacent to the transit station in the route to each preset transit station, so as to complete the optimization of the transit stations corresponding to the two collection points in the route, so as to obtain a planned route corresponding to the route, and the transit stations corresponding to the two collection points in the route can be replaced by the transit station with the minimum cost according to the distance from the collection point adjacent to the transit station in each route to each preset transit station within a range, so as to complete the optimization of the transit stations corresponding to the two collection points in the route by combining the conversion cost of garbage conversion of the transit stations, a planned route corresponding to the route is obtained, which is not limited in the embodiment of the present invention.
In addition, the determining of the scheduling route of each garbage truck may be to calculate a total daily transportation cost of each route in the planning route corresponding to each garbage truck, directly use the planning route with the lowest total daily transportation cost of each garbage truck as the scheduling route of each garbage truck, and after obtaining the planning route with the lowest total daily transportation cost of each garbage truck, obtain the scheduling route of each garbage truck after performing replacement adjustment on a transfer station exceeding the maximum daily throughput in the planning route in combination with the maximum daily throughput of the transfer station in the planning route.
According to the scheduling method provided by the embodiment of the invention, the common routes of all the garbage trucks are obtained from the historical driving routes of all the garbage trucks, the common routes of all the garbage trucks are optimized according to the distances from the adjacent collection points of the transfer stations in the common routes to all the preset transfer points, the planned routes of all the garbage trucks are obtained, the daily transportation cost of the planned routes of all the garbage trucks is obtained, the scheduling routes of all the garbage trucks are determined, and all the garbage trucks are scheduled based on the scheduling routes of all the garbage trucks, so that the driving routes of all the garbage trucks are optimized by analyzing the historical driving routes of all the garbage trucks and combining the daily transportation cost of all the garbage trucks, the daily transportation cost of all the garbage trucks is further reduced, and the waste of resources is reduced.
Based on the above embodiments, fig. 2 is a schematic flow chart of the scheduling route obtaining method provided by the present invention. As shown in fig. 2, the step 120 of determining the scheduling route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck includes:
step 210, determining a first planning scheme based on the daily transportation cost of the planned route of each garbage truck;
Considering that the lowest-cost planned route with the lowest daily transport cost corresponding to each garbage truck is obtained according to the daily transport cost of the planned route of each garbage truck, the lowest-cost planned route corresponding to each garbage truck may have the situation that the same transfer station plans a plurality of lowest-cost planned routes for use, and as each transfer station has the maximum daily throughput, the situation that the transfer stations planned and used by the plurality of lowest-cost planned routes are excessive occurs, namely the total quantity of the garbage received by the transfer stations every day is greater than the maximum daily throughput, so that the situation that the garbage transfer is caused because the excessive transfer stations cannot receive the garbage, and the total cost still increases, the situation that the urban daily garbage transport is increased still occurs, therefore, the embodiment of the invention performs large data analysis on the lowest-cost planned route with the lowest daily transport cost corresponding to each garbage truck, and comprehensively adjusting the route with the excess transfer stations in the lowest planning route so as to ensure that the transfer stations in the planning route of each garbage truck can normally run without excess.
Specifically, a lowest-cost planned route with the lowest daily transport cost corresponding to each garbage truck is obtained according to the daily transportation cost of the planned route of each garbage truck, the lowest-cost planned route of each garbage truck is combined into a first planning scheme, whether excess transfer stations exist in each route in the first planning scheme or not is judged according to the daily maximum throughput of each preset transfer station, if excess routes containing transfer stations exceeding the daily maximum throughput exist in each planned route in the first planning scheme, the first planning scheme is optimized by taking the planning throughput of each preset transfer station smaller than the daily maximum throughput as a constraint condition, a second planning scheme is obtained, and the dispatching route of each garbage truck is determined according to each planned route in the second planning scheme.
It should be noted that, with the planning throughput of each preset transfer station being less than the daily maximum throughput as a constraint condition, the optimization of the first planning scheme may be performed by enumerating all optimized routes of each excess route in a manner of big data operation according to the excess transfer stations in each excess route of the first planning scheme and the transfer stations not in excess in each preset transfer station, combining all optimized routes of each excess route enumerated and the routes not in excess in the first planning scheme into each optimized scheme, determining the second planning scheme based on the total transportation cost and the preset transportation cost of each optimized scheme, optimizing the first planning scheme, and performing big data iterative search for the nearest transfer stations not in excess according to the nearest transfer stations not in excess routes of the first planning scheme until the optimization of all excess routes is completed, all optimized routes of the excess routes and the routes which are not excess in the first planning scheme are combined into each optimized scheme, and then the second planning scheme is determined based on the total transportation cost and the preset transportation cost of each optimized scheme.
In addition, when each planned route in the first planning scheme does not contain an excess route, the first planning scheme is directly used as a second planning scheme to determine the dispatching route of each garbage truck. Or when the planned routes in the first planning scheme all contain excessive transfer stations, alarm information is sent to indicate that the total quantity of the garbage generated by the city every day exceeds the maximum processing capacity of the urban garbage transfer stations, the garbage transfer stations need to be newly built, and the planning part is reminded in a more intuitive and timely manner, so that the deterioration of the urban environment and the increase of the total cost of daily garbage clearing caused by the fact that the total quantity of the garbage generated by the city every day exceeds the maximum processing capacity of the urban garbage transfer stations are reduced.
According to the scheduling method provided by the embodiment of the invention, the optimization of the excess transfer station in the route is carried out through the first planning scheme determined by the daily transportation cost minimum planning route of the planning route of each garbage truck, so that the scheduling route scheme of each garbage truck is optimized comprehensively from the perspective of city global situation, the total urban daily garbage transportation cost is further reduced, and the waste of resources is reduced.
Based on the above embodiments, fig. 3 is a schematic flow chart of a first planning scheme optimization method provided in the embodiments of the present invention. As shown in fig. 3, in step 220, the planning throughput of each preset transfer station is smaller than the maximum daily throughput as a constraint condition, and the first planning scheme is optimized to obtain a second planning scheme, which includes:
and step 330, determining a second planning scheme based on the total daily transportation cost and the preset transportation cost of each scheme in the optimization scheme.
Considering that the optimization of the excess route in the first planning scheme in the iterative manner can improve the optimization efficiency, the embodiment of the present invention performs secondary optimization on the excess route in the first planning scheme in the iterative manner.
Specifically, an excess route is determined in a first planning scheme, each non-excess transfer station from near to far away from the excess transfer station in the excess route is searched by taking the planning throughput of each preset transfer station as a constraint condition, the non-excess transfer station starts to receive excess partial garbage of the excess transfer station from the nearest non-excess transfer station, if the nearest non-excess transfer station cannot completely receive the excess partial garbage, the non-excess transfer station distributes a part of excess partial garbage, the rest unreceived part is iterated by taking the nearest non-excess transfer station except the non-excess transfer station as the excess transfer station for receiving, the iteration is carried out until the excess garbage distribution is completed to obtain an optimized route, the optimized scheme is determined according to the optimized route and the non-excess route in the first planning scheme, and finally the optimized scheme with the minimum cost in daily transportation of each scheme in the optimized schemes is carried out, and if the total daily transportation cost of the optimization scheme with the minimum cost is less than the preset cost, taking the optimization method with the minimum cost as a second planning scheme. The optimization of the excess intermediate transfer station in the excess route in the iterative manner can be better described as the following example, for example: in the route, a transfer station A exceeds M times of garbage, the transfer station B closest to the A does not exceed, the maximum garbage amount accepted by the B is N times of garbage, N is less than M, the transfer station C closest to the A does not exceed except the B, C can accept the maximum garbage amount as O times of garbage, M is greater than O and is greater than M-N, the transfer station A of the N times of garbage is replaced by B in the route containing the transfer station A in the first plan, the transfer station A of the M-N times of garbage is replaced by C in the route containing the transfer station A in the first plan after replacement, and the transfer stations not exceeding are inquired in sequence in a recursive mode until the optimization of all the excessive routes is completed.
Based on the above embodiment, the total daily transportation cost of each solution in the optimization solution in step 320 is determined based on the total transportation cost of each garbage truck and the transfer cost of each preset transfer station; the transfer cost of each preset transfer station is determined based on the garbage conversion rate corresponding to each preset transfer station and the distance of the garbage disposal site. The garbage conversion rate corresponding to the transfer station represents the proportion of the amount of garbage transferred to the garbage disposal site after the garbage is processed by the transfer station, for example, the transfer station receives 100 tons of garbage every day, the transfer station processes 20 tons of garbage through combustion, dissolution and the like, and the remaining 80 tons of garbage are transferred to the garbage disposal plant, so that the garbage conversion rate of the transfer station is 80%.
Preferably, if a route of the garbage truck is from a middle parking lot to a transfer station a1, the total length of the route is s1, the total length of the route is from a transfer station a1 to a transfer station a2, the total length of the route is s2, the transfer station a2 to a parking lot, and the total length of the route is s3, then the total daily transportation cost of the garbage truck is calculated by the following formula:
f＝k*p*(s1+s2+s3)+q*k*p*(l1+l2)
where k represents the fuel consumption per kilometer of the garbage truck, p represents the unit price of oil, the garbage conversion rate of the garbage transfer station is q, l1 represents the total route length of the garbage disposal plant closest to the transfer station a1, and l2 represents the total route length of the garbage disposal plant closest to the transfer station a 2.
Based on the above embodiments, fig. 4 is a schematic flow chart of the excess route determining method in the first planning scheme provided by the present invention. As shown in fig. 4, the method includes:
and 430, determining an excess route in the first planning scheme based on the planning throughput corresponding to each preset transfer station, the daily maximum throughput corresponding to each preset transfer station and the first planning scheme.
Specifically, the total number of the trains per day corresponding to each preset transfer station is determined according to the number of the transfer stations used by each route in the first planning scheme; and multiplying the total number of the vehicle times per day of each preset transfer station by the average garbage carrying capacity of each vehicle time to obtain the planning processing capacity corresponding to each preset transfer station, then determining according to the planning processing capacity corresponding to each preset transfer station and the daily maximum processing capacity corresponding to each preset transfer station to obtain the excess transfer station, and screening out the route containing the excess transfer station from the first planning scheme, wherein the route is the excess route in the first planning scheme.
Based on the above embodiments, fig. 5 is a schematic flow chart of the planned route obtaining method provided by the present invention. As shown in fig. 5, step 120 includes:
and step 123, determining the planned route of each garbage truck based on the planned route corresponding to each route in the common routes of each garbage truck.
Specifically, any one of the commonly used routes is used for sequentially optimizing the transfer stations of the routes from a starting point to a terminal point, the transfer station of the first route is used as the current transfer station, the distance from one or two adjacent collection points of the current transfer station to each preset transfer station is calculated to obtain the transfer station with the closest distance, the calculated transfer station is used for replacing the current transfer station of the route, the next transfer station of the route behind the current transfer station of the route is used as the current transfer station of the route, the operation is carried out until the last transfer station of the route changing route is replaced, the planned route corresponding to the changed route is obtained, then each route in the commonly used routes of all garbage trucks is optimized based on the optimization logic of the routes, the planned route corresponding to each route in the commonly used routes of all garbage trucks is obtained, and the route corresponding to each route in the commonly used routes of all garbage trucks is planned according to each route in the commonly used routes of all garbage trucks, and determining the planned route of each garbage truck.
It should be noted that the optimization process of any of the above routes can be further illustrated by the following examples, for example: one of the common routes passes through a parking lot t1, a collection point s1, a collection point s2, a transfer station z1, a collection point s3, a collection point s4, a collection point s5, a transfer station z2, a parking lot t2, taking the transit station z1 as the current transit station, calculating the distances between the collection point s2 and the collection point s3 adjacent to the current transit station and each preset transit station respectively, and calculates the distance sum of each preset transfer station to the obtained collection point s2 and the collection point s3 to obtain the distance sum of the nearest transfer station z1 ', and replaces z1 with z 1', the above operation is then performed with the next transfer station z2 of the current transfer station as the current transfer station, namely the distance from the collection point s5 adjacent to the current transfer station to each preset transfer station, obtaining the transfer station z2 'with the nearest distance, replacing z2 with z 2', because the subsequent route of the route has no transfer station, the route is optimized to obtain the planned route corresponding to the route.
Based on the above embodiments, fig. 6 is a schematic flow chart of a common route obtaining method provided by the present invention. As shown in fig. 6, step 110 includes:
and step 112, determining a common route of the garbage truck based on the number of routes in each overlapped route.
Specifically, the ratio of the total number of the collection points of the same collection point in the two driving routes is greater than a preset threshold value, the two driving routes are coincident routes, each coincident route in the historical track route of any garbage truck is determined based on the determination method of the coincident route, and the coincident route with the largest number of routes in the coincident route of the garbage truck is used as the common route of the garbage truck.
Fig. 7 is a second flowchart of the scheduling method according to the present invention. As shown in fig. 7, the scheduling method provided in the embodiment of the present invention includes:
the method comprises the steps of firstly, regarding the same collection point coincidence rate in any two driving routes in the historical driving routes of all garbage trucks as a coincidence route which exceeds 80% of the total collection points in the routes, combining big data statistical analysis to obtain the route with the most number of routes (the highest frequency) in the coincidence route and route mileage thereof, thereby obtaining the common routes of all the garbage trucks, combining all preset transfer stations, sequentially replacing the transfer stations in the original common routes, performing optimal planning, and particularly
Assuming that m transfer stations exist in the route combination 1, each transfer station is replaced by a transfer station which is away from the previous adjacent collection point and the next adjacent collection point and is closest to the previous adjacent collection point (if the current transfer station is the closest transfer station, the replacement is not performed), and for all the replaced planned routes, the planned route with the lowest cost is obtained according to the daily transportation cost of the planned route.
In the second step, the first step is that,combining the planned routes with the lowest cost corresponding to all the garbage trucks to serve as a first planning scheme, setting the average load capacity T (ton) of each trip, collecting the times C of each transfer station day, counting the times C, wherein the planned handling capacity of each transfer station is h-C-T, directly comparing the daily total transportation cost of the first planning scheme with the preset cost if the planned handling capacity is not greater than the maximum handling capacity m of the transfer station, obtaining the dispatching routes of all the garbage trucks if the planned handling capacity is less than the preset cost, and dispatching all the garbage trucks according to the dispatching routes of all the garbage trucks. If the planning processing amount is larger than the maximum processing amount m of the transfer station, i represents the ith transfer station, and the residual total amount of the transfer stations which are not excessive is calculated
The total number of the excess transfer stations is
If Hn is greater than Hn, all the garbage transfer stations in the city cannot support the total amount of garbage generated by the city, a new garbage transfer station needs to be built, if Hn is less than Hn, iteration is performed to allocate the excess garbage transfer stations, and the specific iteration allocation rule is as follows:
A. and screening out all schemes with excessive transfer stations.
B. And (3) sequentially replacing the excess transfer stations by the non-excess transfer stations closest to the excess transfer stations, wherein the k processing capacity of the excess transfer stations is Hk, the maximum processing capacity Mk, the m processing capacity of the non-excess transfer stations is Hm, the maximum processing capacity Mm and the single transfer capacity ti, all the schemes are transferred out of the k transfer stations for a number of vehicles, transferred to the m transfer stations for b numbers of vehicles, and the total cost of the total scheme after the transfer is ft. The iterative scheme can be changed to satisfy the constraint condition, wherein n represents n transfer stations:
(1)Hk-a*ti≤Mk,k∈{1,2……n}
(2)Hm+b*ti≤Mm,m∈{1,2……n}
obtaining an optimization scheme after iterative distribution according to the constraint conditions; and obtaining an optimization scheme with the minimum cost in the optimization schemes, if the optimization scheme with the minimum cost is smaller than the preset transportation cost, taking the optimization scheme with the minimum cost as a second planning scheme, determining a dispatching route of each garbage truck based on each planned route in the second planning scheme, and dispatching each garbage truck according to the dispatching route of each garbage truck.
The following describes the scheduling apparatus provided by the present invention, and the scheduling apparatus described below and the scheduling method described above may be referred to correspondingly.
Fig. 8 is a schematic structural diagram of a scheduling apparatus provided in the present invention. As shown in fig. 8, the apparatus includes: a frequent route determination module 810, a planned route determination module 820, and a scheduling module 830.
Wherein the content of the first and second substances,
the common route determining module 810 is configured to determine a common route of each garbage truck from historical driving routes of each garbage truck;
a planned route determining module 820, configured to optimize a transfer station in the common route based on distances from collection points in the common route, which are adjacent to the transfer station in the route, to preset transfer stations, so as to obtain a planned route;
and the scheduling module 830 is configured to determine a scheduling route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck, and perform garbage truck scheduling based on the scheduling route.
In the embodiment of the invention, the common route determining module is used for determining the common route of each garbage truck from the historical driving route of each garbage truck; the planning route determining module is used for optimizing the transfer stations in the common route to obtain a planning route based on the distances from the collection points adjacent to the transfer stations in the common route to the preset transfer stations; the scheduling module is used for determining the scheduling route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck, and scheduling the garbage trucks based on the scheduling route, so that the running route of each garbage truck is optimized by analyzing the historical running route of each garbage truck and combining the daily transportation cost of each garbage truck, the daily transportation cost of each garbage truck is reduced, and the waste of resources is reduced.
Based on any of the above embodiments, the scheduling module 830 includes:
the planning scheme determining submodule is used for determining a first planning scheme based on the daily transportation cost of the planned route of each garbage truck;
the scheduling route determining submodule is used for optimizing the first planning scheme by taking the planning throughput of each preset transfer station smaller than the daily maximum throughput as a constraint condition to obtain a second planning scheme if the first planning scheme has an excess route containing the transfer station with the daily maximum throughput in each planning route; and determining the dispatching route of each garbage truck by applying a second planning scheme.
Based on any of the above embodiments, the dispatch route determination sub-module includes:
an excess route determination submodule: determining an excess route in a first planning scenario;
the iteration optimization submodule is used for optimizing the excess transfer stations in the excess route in an iteration mode by taking the planning processing capacity of each preset transfer station smaller than the daily maximum processing capacity as a constraint condition to obtain an optimized route, and determining the optimized scheme by applying the optimized route and the non-excess route in the first planning scheme; the iteration mode is that the excess part of the garbage of the excess transfer station is distributed to the non-excess transfer station from near to far away from the excess transfer station in an iteration mode until the excess part of the garbage is completely distributed and then the iteration is completed;
and the planning scheme determining submodule is used for determining a second planning scheme based on the daily total transportation cost and the preset transportation cost of each scheme in the optimization scheme.
Based on any of the above embodiments, the planning scheme determination sub-module includes:
the transportation cost calculation submodule is used for determining the daily transportation total cost of each scheme in the optimization scheme based on the transportation total cost of each garbage truck and the transfer cost of each preset transfer station;
and the transfer cost calculation submodule is used for determining the transfer cost of each preset transfer station based on the corresponding garbage conversion rate of each preset transfer station and the distance of the garbage disposal site.
Based on any of the above embodiments, the excess route determination submodule includes:
the train number determining submodule is used for determining the total number of the train numbers per day corresponding to the preset transfer stations based on a first planning scheme;
the planning processing capacity determining submodule is used for determining the planning processing capacity corresponding to each preset transfer station based on the total number of the vehicle times per day corresponding to each preset transfer station and the average load capacity of each vehicle time;
and the excess route determining submodule is used for determining an excess route in the first planning scheme based on the planning throughput corresponding to each preset transfer station, the daily maximum throughput corresponding to each preset transfer station and the first planning scheme.
Based on any of the above embodiments, the planned route determination module 820 includes:
the current transfer station determining submodule is used for determining the current transfer station of any one of the common routes of all the garbage trucks;
the common route optimizing submodule is used for determining a transfer station closest to the collection point adjacent to the current transfer station of the route based on the distance between the collection point adjacent to the current transfer station of the route and each preset transfer station, replacing the current transfer station of the route by using the transfer station closest to the collection point, and taking the next transfer station of the current transfer station of the route as the current transfer station of the route until all the transfer stations of the route are replaced, so that a planned route corresponding to the route is obtained;
and the planned route determining submodule is used for determining the planned route of each garbage truck based on the planned route corresponding to each route in the common routes of each garbage truck.
Based on any of the above embodiments, the frequent route determination module 810 includes:
the coincident route determining submodule is used for determining each coincident route in the historical driving routes of the garbage truck based on the collection points in the historical driving routes of any garbage truck; the coincident route means that the proportion of the total number of the collection points of the same collection points in the two driving routes is greater than a preset threshold value, and the two driving routes are coincident routes;
and the common route determining submodule is used for determining the common route of the garbage truck based on the number of the routes in each overlapped route.
Fig. 9 illustrates a physical structure diagram of an electronic device, and as shown in fig. 9, the electronic device may include: a processor (processor)910, a communication Interface (Communications Interface)920, a memory (memory)930, and a communication bus 940, wherein the processor 910, the communication Interface 920, and the memory 930 communicate with each other via the communication bus 940. Processor 910 may invoke logic instructions in memory 930 to perform a scheduling method comprising: determining a common route of each garbage truck from the historical driving routes of each garbage truck; optimizing the transfer stations in the common route to obtain a planned route based on the distances from the collection points adjacent to the transfer stations in the common route to the preset transfer stations; and determining the dispatching route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck, and dispatching the garbage trucks based on the dispatching route.
In addition, the logic instructions in the memory 830 may be implemented in software functional units and stored in a computer readable storage medium when the logic instructions are sold or used as independent products. 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 instructions for causing 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 other various media capable of storing program codes.
In another aspect, the present invention also provides a computer program product, the computer program product comprising a computer program, the computer program being storable on a non-transitory computer-readable storage medium, the computer program, when being executed by a processor, being capable of executing the scheduling method provided by the above methods, the method comprising: determining a common route of each garbage truck from the historical driving routes of each garbage truck; optimizing the transfer stations in the common route to obtain a planned route based on the distances from the collection points adjacent to the transfer stations in the common route to the preset transfer stations; and determining the dispatching route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck, and dispatching the garbage trucks based on the dispatching route.
In yet another aspect, the present invention also provides a non-transitory computer readable storage medium, on which a computer program is stored, the computer program being implemented by a processor to execute the scheduling method provided by the above methods, the method including: determining a common route of each garbage truck from the historical driving routes of each garbage truck; optimizing the transfer stations in the common route to obtain a planned route based on the distances from the collection points adjacent to the transfer stations in the common route to the preset transfer stations; and determining the dispatching route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck, and dispatching the garbage trucks based on the dispatching route.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will 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 (10)
1. A method of scheduling, comprising:
determining a common route of each garbage truck from the historical driving routes of each garbage truck;
optimizing the transfer stations in the common route to obtain a planned route based on the distances from the collection points adjacent to the transfer stations in the common route to the preset transfer stations;
and determining the dispatching route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck, and dispatching the garbage trucks based on the dispatching route.
2. The scheduling method of claim 1, wherein determining the scheduled route for each garbage truck based on the daily transportation cost of the planned route for each garbage truck comprises:
determining a first planning scheme based on the daily transportation cost of the planned route of each garbage truck;
if an excess route containing a transfer station exceeding the daily maximum throughput exists in each planned route in the first planning scheme, optimizing the first planning scheme by taking the planned throughput of each preset transfer station smaller than the daily maximum throughput as a constraint condition to obtain a second planning scheme; and determining the dispatching route of each garbage truck by applying the second planning scheme.
3. The scheduling method according to claim 2, wherein the optimizing the first planning scheme by using the planning throughput of each preset transfer station smaller than the maximum daily throughput as a constraint condition to obtain a second planning scheme includes:
determining an excess route in the first planning scenario;
optimizing the excess transfer stations in the excess route in an iterative manner by taking the planning throughput of each preset transfer station smaller than the daily maximum throughput as a constraint condition to obtain an optimized route, and determining the optimized route by applying the optimized route and the non-excess route in the first planning scheme; the iteration mode is that the excess part of garbage of the excess transfer station is distributed to the non-excess transfer station which is far away from the excess transfer station from near to far in an iteration mode until the iteration is finished after all the excess part of garbage is distributed;
and determining the second planning scheme based on the daily total transportation cost and preset transportation cost of each scheme in the optimization scheme.
4. The scheduling method according to claim 3, wherein the total daily transportation cost of each scheme in the optimization scheme is determined based on the total transportation cost of each garbage truck and the transfer cost of each preset transfer station; the transfer cost of each preset transfer station is determined based on the garbage conversion rate corresponding to each preset transfer station and the distance of the garbage disposal site.
5. The scheduling method of claim 3 wherein the excess routes in the first planning scenario are determined based on the steps of:
determining the total number of the train numbers per day corresponding to each preset transfer station based on the first planning scheme;
determining the planning processing amount corresponding to each preset transfer station based on the total number of the vehicle times per day corresponding to each preset transfer station and the average load capacity of each vehicle time;
and determining an excess route in the first planning scheme based on the planning throughput corresponding to each preset transfer station, the daily maximum throughput corresponding to each preset transfer station and the first planning scheme.
6. The scheduling method according to any one of claims 1 to 5, wherein the optimizing the transit stations in the common route based on the distances from the collection points adjacent to the transit stations in the common route to the preset transit stations to obtain a planned route comprises:
determining the current transfer station of any one of the common routes of each garbage truck;
determining a transfer station with the closest distance to the collection point adjacent to the current transfer station of any route based on the distance between the collection point adjacent to the current transfer station of any route and each preset transfer station, replacing the current transfer station of any route with the closest transfer station, and taking the next transfer station of the current transfer station of any route as the current transfer station of any route until all the transfer stations of any route are replaced, so as to obtain a planned route corresponding to any route;
and determining the planned route of each garbage truck based on the planned route corresponding to each route in the common routes of each garbage truck.
7. The scheduling method according to any one of claims 1 to 5, wherein the determining the common route of each garbage truck from the historical driving routes of each garbage truck comprises:
determining each coincident route in the historical driving route of any garbage truck based on the collection points in the historical driving route of any garbage truck; the coincident route represents that the ratio of the total number of the collection points of the same collection points in the two driving routes is greater than a preset threshold value, and the two driving routes are coincident routes;
and determining the common route of any garbage truck based on the number of routes in each overlapped route.
8. A scheduling apparatus, comprising:
the common route determining module is used for determining the common route of each garbage truck from the historical driving routes of each garbage truck;
the planning route determining module is used for optimizing the transfer stations in the common route to obtain a planning route based on the distances from the collection points adjacent to the transfer stations in the common route to the preset transfer stations;
and the scheduling module is used for determining the scheduling route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck and scheduling the garbage truck based on the scheduling route.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the scheduling method according to any one of claims 1 to 7 when executing the program.
10. A non-transitory computer-readable storage medium, on which a computer program is stored, wherein the computer program, when executed by a processor, implements the scheduling method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210600251.8A CN115081819A (en) | 2022-05-27 | 2022-05-27 | Scheduling method, scheduling device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210600251.8A CN115081819A (en) | 2022-05-27 | 2022-05-27 | Scheduling method, scheduling device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115081819A true CN115081819A (en) | 2022-09-20 |
Family
ID=83249540
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210600251.8A Pending CN115081819A (en) | 2022-05-27 | 2022-05-27 | Scheduling method, scheduling device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115081819A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117474296A (en) * | 2023-12-26 | 2024-01-30 | 深圳智者行天下科技有限公司 | Intelligent garbage truck scheduling system based on real-time weighing of Internet of things |
-
2022
- 2022-05-27 CN CN202210600251.8A patent/CN115081819A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117474296A (en) * | 2023-12-26 | 2024-01-30 | 深圳智者行天下科技有限公司 | Intelligent garbage truck scheduling system based on real-time weighing of Internet of things |
| CN117474296B (en) * | 2023-12-26 | 2024-04-16 | 深圳智者行天下科技有限公司 | Intelligent garbage truck scheduling system based on real-time weighing of Internet of things |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112270135B (en) | Intelligent distribution method, device and equipment for logistics dispatching and storage medium | |
| CN110348613B (en) | Intelligent logistics management method and system for distribution center | |
| US8046319B2 (en) | Methods suitable for optimizing linehaul operations | |
| CN113379102B (en) | Multi-network trunk transport optimization method, computer equipment and storage medium | |
| CN114386720B (en) | Logistics system scheduling management method, system, terminal equipment and storage medium | |
| CN111539590A (en) | Emergency resource allocation optimization method based on regret theory | |
| CN115409295B (en) | Bus scheduling method based on bottleneck analysis, electronic equipment and storage medium | |
| CN108764800B (en) | Method for realizing rapid delivery of packages based on crowdsourcing public transportation system | |
| CN116824861B (en) | Method and system for scheduling sharing bicycle based on multidimensional data of urban brain platform | |
| CN115081819A (en) | Scheduling method, scheduling device, electronic equipment and storage medium | |
| CN112906980A (en) | Order processing method, device and system and readable storage medium | |
| CN111985699A (en) | Dispatching method and device for chemical transportation | |
| CN112184092A (en) | Logistics node determination method, device, server and storage medium | |
| CN112949987B (en) | Taxi scheduling and matching method, system, equipment and medium based on prediction | |
| CN112465384A (en) | Transportation capacity scheduling method and device, computer equipment and computer readable storage medium | |
| CN116090689B (en) | Freight resource optimization method and system based on transfer connection | |
| Apostolopoulos et al. | Seizing the potential of transport pooling in urban logistics-the case of thriasio logistics centre in Greece | |
| CN112288232A (en) | Cargo transportation batch planning method and system for trunk network point | |
| CN112365032A (en) | System and method for optimizing garbage clearing path | |
| Oliskevych | Dynamic scheduling of highway cargo transportation | |
| CN111539674A (en) | Order combining method for logistics transportation of engineering machinery rental scene | |
| Yu et al. | Coordinating matching, rebalancing and charging of electric ride-hailing fleet under hybrid requests | |
| CN113936494B (en) | Public transport scheduling method and device based on time-sharing riding demand | |
| CN111079008B (en) | Scheme recommendation method and system for taxi driver to leave in storage pool | |
| CN117495237B (en) | Management method, device and readable storage medium for freight distribution system |
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 |