CN112598273B - Intelligent transportation scheduling method, system, medium and electronic equipment - Google Patents
Intelligent transportation scheduling method, system, medium and electronic equipment Download PDFInfo
- Publication number
- CN112598273B CN112598273B CN202011534414.4A CN202011534414A CN112598273B CN 112598273 B CN112598273 B CN 112598273B CN 202011534414 A CN202011534414 A CN 202011534414A CN 112598273 B CN112598273 B CN 112598273B
- Authority
- CN
- China
- Prior art keywords
- schedule
- checked
- scheduling
- time cost
- time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 49
- 238000004519 manufacturing process Methods 0.000 claims abstract description 145
- 238000003860 storage Methods 0.000 claims abstract description 18
- 238000010276 construction Methods 0.000 claims description 55
- 238000004590 computer program Methods 0.000 claims description 9
- 230000002194 synthesizing effect Effects 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 8
- 230000008901 benefit Effects 0.000 description 5
- 238000001514 detection method Methods 0.000 description 5
- 238000002156 mixing Methods 0.000 description 5
- 239000002699 waste material Substances 0.000 description 4
- 239000000463 material Substances 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000009825 accumulation Methods 0.000 description 1
- 238000007792 addition Methods 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 238000000354 decomposition reaction Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000035772 mutation Effects 0.000 description 1
- 238000003062 neural network model Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000003825 pressing Methods 0.000 description 1
- 230000006798 recombination Effects 0.000 description 1
- 238000005215 recombination Methods 0.000 description 1
- 230000010076 replication Effects 0.000 description 1
- 238000013215 result calculation Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
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
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses an intelligent transportation scheduling method, a system, a computer readable storage medium and electronic equipment, wherein at least one schedule to be checked with time cost smaller than a preset time cost threshold is obtained, and then production state information is respectively obtained based on the at least one schedule to be checked, wherein the production state information is used for representing the state information of production equipment and the state information of transportation vehicles corresponding to the production equipment; selecting a schedule to be checked, the production state information of which meets preset conditions, and executing transportation scheduling; after the schedule to be checked with the time cost meeting the requirement is obtained, the schedule to be checked with the time cost meeting the requirement is detected by utilizing the production state information, so that the transportation schedule meeting the preset condition and having lower time cost is obtained, the time cost is saved as much as possible and the working efficiency is improved on the premise of meeting the requirement of a customer order.
Description
Technical Field
The application relates to the technical field of production scheduling, in particular to an intelligent transportation scheduling method, an intelligent transportation scheduling system, a computer readable storage medium and electronic equipment.
Background
The whole process of the goods on the construction site refers to the whole process of starting from the order on the construction site, going through production and finally transporting to the construction site. For example, the production and transportation cycle of concrete can be divided into three stages of 'construction site-mixing station-mixing truck', the cooperative cooperation of production and transportation is required, and besides the fact that the concrete mixing truck is used for transporting concrete to a destination in time and quantity according to the construction time of each construction site, the time interval from production to unloading of concrete cannot exceed the initial setting time of the concrete is ensured, so that the production scheduling and the transportation scheduling of the concrete are very difficult problems. In particular, transportation scheduling, which is a scheduling problem for vehicles with time windows, has proven to be a class of NP-hard problems.
Existing commercial concrete transportation scheduling solutions often monitor the real-time position and status of a truck mixer vehicle in real-time by adding third party sensors or cameras and rely on manual operations by a dispatcher to determine. The manual scheduling aspect provides long-time and high-strength working requirements for a scheduler; in addition, the use efficiency of the production line and the vehicle is not high enough, so that resource waste is easily caused, and the operation cost of the mixing station is increased.
Disclosure of Invention
In order to solve the above technical problems, the present application provides an intelligent transportation scheduling method, system, computer readable storage medium and electronic device, so as to solve the above problems.
According to one aspect of the present application, there is provided an intelligent transportation scheduling method, including: acquiring at least one schedule to be checked, the time cost of which is smaller than a preset time cost threshold value; respectively acquiring production state information based on the at least one schedule to be checked, wherein the production state information is used for representing the state information of production equipment and the state information of a transport vehicle corresponding to the production equipment; and selecting the production state information in the at least one schedule to be checked to meet preset conditions, and executing transportation scheduling by the schedule to be checked with the lowest time cost.
Acquiring at least one schedule to be checked, the time cost of which is smaller than a preset time cost threshold value, and then respectively acquiring production state information based on the at least one schedule to be checked, wherein the production state information is used for representing the state information of production equipment and the state information of a transport vehicle corresponding to the production equipment; selecting a schedule to be checked, the production state information of which meets preset conditions, and executing transportation scheduling; after the schedule to be checked with the time cost meeting the requirement is obtained, the schedule to be checked with the time cost meeting the requirement is detected by utilizing the production state information, so that the transportation schedule meeting the preset condition and having lower time cost is obtained, the time cost is saved as much as possible and the working efficiency is improved on the premise of meeting the requirement of a customer order.
In an embodiment, the schedule to be checked includes: production equipment information and transportation vehicle information; wherein the respectively acquiring the production state information based on the at least one schedule to be checked includes: acquiring the number of the production equipment and the corresponding yield according to the production equipment information; and/or obtaining the number of the transport vehicles waiting at each production facility according to the transport vehicle information.
The production equipment quantity, the corresponding yield and the quantity of transport vehicles waiting at the production equipment are respectively obtained according to the production equipment information and the transport vehicle information in the schedule to be detected, so that the production state constraint detection can be carried out on the schedule to be detected according to the production equipment quantity, the corresponding yield and the quantity of transport vehicles waiting at the production equipment, and the schedule to be detected, which meets the preset condition and has low time cost, is obtained.
In an embodiment, the schedule to be checked includes: production equipment information, transport vehicle information and demand corresponding to different moments; the preset conditions include: the sum of products of the number of the production devices and the corresponding yield is larger than or equal to the maximum value of the demand corresponding to all the moments in the scheduling schedule to be checked; and/or the number of transport vehicles waiting at a single production facility is less than or equal to a preset number threshold.
By detecting whether the sum of products of the number of production equipment and the corresponding yield is greater than or equal to the maximum value of the demand corresponding to all moments in the schedule to be checked, the production capacity of the production equipment can be ensured to meet the requirements of all orders; by detecting whether the number of the transport vehicles waiting at the corresponding positions of the single production equipment is smaller than or equal to a preset number threshold, the number of the transport vehicles reaching the same production equipment in the same time period can be ensured not to be excessive, so that the congestion of the transport vehicles and the waste of time cost are avoided.
In an embodiment, the obtaining manner of the time cost of the schedule to be checked includes: respectively calculating the transportation time cost and the invalid waiting time cost of a single scheduling schedule to be checked; and integrating the transportation time cost and the invalid waiting time cost to obtain the time cost of the single scheduling schedule to be checked.
By taking into account both the cost of transportation time and the cost of ineffective waiting time, the cost of time for the entire transportation schedule as a whole will be lower.
In an embodiment, said integrating said transit time cost and said invalid latency cost comprises: summing or weighting the transit time costs and the invalid latency costs.
The transportation time cost and the ineffective waiting time cost can be comprehensively considered through summation or weighted summation, so that a transportation scheduling schedule with lower overall time cost is obtained.
In one embodiment, the invalidation latency cost comprises: the time difference between the blanking time, the pressing time, the arrival time of the first transport vehicle arriving at the single site and the construction start time of the site.
By controlling the invalid waiting time cost, waiting time and backlog time of the client can be avoided as much as possible, so that the construction progress of the client can be ensured, and the satisfaction degree of the client is improved.
In an embodiment, the intelligent transportation scheduling method further includes: and updating the schedule to be checked when the time cost of the acquired schedule to be checked is larger than the time cost threshold.
When all the schedules to be checked cannot meet the preset conditions, the schedules to be checked can be iteratively updated to obtain new schedules, and the schedules meeting the conditions are obtained by using an iterative method.
In an embodiment, the updating the pending schedule includes: acquiring probability values of all construction sites in the scheduling schedule to be checked; wherein the probability value characterizes a probability of transporting the product to the worksite at a corresponding time; exchanging probability values of partial construction sites of the two scheduling schedules to be checked to obtain a child scheduling schedule; exchanging the sequence of the first half of the construction sites and the sequence of the second half of the construction sites in the single schedule to be checked to obtain a variation schedule; synthesizing the child schedule and the variant schedule to obtain a plurality of updated schedule to be checked; calculating the time cost of the updated scheduling schedules to be checked; and updating the plurality of updated to-be-checked schedule schedules again when the time cost of the plurality of updated to-be-checked schedule schedules is greater than the time cost threshold.
Because the demand of each site is different and the capacity of each transport vehicle is also different, the probability value of each site in the schedule to be checked is obtained through setting, the transport sequence is represented by the probability value on the premise of not changing the transport capacity, the schedule of the next iteration (namely, the updated schedule to be checked) is obtained through intersecting operation of the two schedules to be checked and mutation operation of the single schedule to be checked, and the schedule meeting the condition is obtained through iterative updating.
In an embodiment, the obtaining the probability value of each worksite in the schedule to be inspected includes: and randomly generating probability values of all the sites in the scheduling schedule to be checked.
And randomly generating probability values of all the sites in the scheduling schedule to be checked to obtain iterative initial data.
In an embodiment, after the obtaining the probability value of each worksite in the schedule to be inspected, the intelligent transportation scheduling method further includes: and rearranging the site sequence in the scheduling schedule to be checked from big to small according to the probability value.
And ordering the scheduling schedules to be detected according to the size of the probability value to obtain iterative scheduling schedules to be detected.
In an embodiment, the updating the plurality of updated pending schedule schedules again includes: selecting the schedule to be checked with the minimum time cost from the updated schedules to be checked as an excellent schedule; and copying the excellent scheduling schedules to obtain a plurality of scheduling schedules to be checked after updating again.
The to-be-detected scheduling schedule corresponding to the minimum time cost is directly reserved and copied to form a plurality of updated to-be-detected scheduling schedules, namely, the current optimal scheduling schedule is used as initial data of the next iteration, so that each iteration is guaranteed to iterate in the direction with smaller time cost, and the optimal scheduling schedule is obtained through iteration.
In an embodiment, the intelligent transportation scheduling method further includes: and when the time cost of the updated schedule to be detected is smaller than or equal to the minimum time cost of the schedule to be detected before updating, selecting the updated schedule to be detected as a schedule to be detected after updating again.
And directly reserving the scheduling schedule with the time cost smaller than or equal to the time cost of the optimal scheduling schedule in the current iteration in the subsequent iteration result to ensure that each iteration iterates towards the direction with smaller time cost, thereby being beneficial to obtaining the optimal scheduling schedule by iteration.
In an embodiment, the intelligent transportation scheduling method further includes: and when the time cost of the updated schedule to be checked is greater than the minimum time cost, exchanging the sequence of the first half of the construction sites and the sequence of the second half of the construction sites in the updated schedule to be checked, so as to obtain the schedule to be checked which is updated again.
And the schedule with time cost greater than that of the optimal schedule in the current iteration is mutated in the next iteration by comparing the optimal schedule in the current iteration, so that the mutated schedule can be iterated to the schedule close to the optimal schedule, and the convergence speed is improved.
In an embodiment, the order information includes any one or a combination of the following: site address, product strength grade, demand, construction time, number of transport vehicles, capacity of transport vehicles, address of production facility.
By acquiring order information such as site address, product strength level, demand, construction time, number of transport vehicles, capacity of transport vehicles, address of production equipment, etc., a schedule meeting the conditions can be acquired more accurately.
In an embodiment, the schedule to be checked includes: the capacity of the transport vehicles transported to the various sites, the arrival time of the transport vehicles transported to each site, and the loading time and transport time of each transport vehicle; the method for acquiring the scheduling schedule to be checked comprises the following steps: and inputting the order information into a scheduling schedule generation model to obtain a scheduling schedule to be checked which meets the transportation conditions.
And inputting order information into the scheduling schedule generation model to generate a scheduling schedule to be checked which meets the transportation condition, namely directly obtaining the scheduling schedule to be checked by using the intelligent model, so that the generation efficiency of the scheduling schedule to be checked can be improved.
In an embodiment, the schedule to be checked satisfies any one or a combination of the following conditions: the sum of the capacities of the transport vehicles transported to each worksite is greater than or equal to the demand at that worksite; the arrival time of the transport vehicle to each worksite is within the construction time range of that worksite; the sum of the loading time, the transporting time and the unloading time of each transporting vehicle is less than or equal to the initial setting time of the concrete; the time interval between adjacent transport vehicles transported to each worksite is less than or equal to a preset first time threshold; the time interval between adjacent transport vehicles transported to each worksite is greater than or equal to a preset second time threshold; and the number of vehicles simultaneously unloaded or poured on each site is less than or equal to 1.
By detecting the schedule to be detected under the plurality of conditions, the obtained transportation schedule can be ensured to meet the production constraint conditions, thereby ensuring that the production and transportation meet the demands of customer orders.
According to another aspect of the present application, there is provided an intelligent transportation scheduling system comprising: the to-be-detected generation module is used for acquiring at least one to-be-detected scheduling schedule with time cost smaller than a preset time cost threshold; the production state acquisition module is used for respectively acquiring production state information based on the at least one scheduling schedule to be checked, wherein the production state information is used for representing the state information of production equipment and the state information of a transport vehicle corresponding to the production equipment; and the selecting module is used for selecting the production state information in the at least one schedule to be checked to meet the preset condition, and the schedule to be checked with the lowest time cost executes transportation scheduling.
The method comprises the steps that at least one schedule to be detected, the time cost of which is smaller than a preset time cost threshold value, is obtained through a schedule to be detected generating module, then production state information is obtained through a production state obtaining module based on the schedule to be detected respectively, and a selecting module selects the schedule to be detected, the production state information of which meets preset conditions and is the lowest in time cost, in the schedule to be detected, to execute transportation scheduling; after at least one schedule to be checked with time cost smaller than a preset time cost threshold is obtained, the schedule with time cost meeting the requirement is detected by utilizing the production state information, so that the transportation schedule meeting the preset condition and with lower time cost is obtained, the time cost is saved as much as possible and the working efficiency is improved on the premise of meeting the requirement of a customer order.
According to another aspect of the present application, there is provided a computer readable storage medium storing a computer program for executing the intelligent transportation scheduling method of any one of the above.
According to another aspect of the present application, there is provided an electronic device including: a processor; a memory for storing the processor-executable instructions; the processor is configured to execute any one of the above intelligent transportation scheduling methods.
Drawings
The foregoing and other objects, features and advantages of the present application will become more apparent from the following more particular description of embodiments of the present application, as illustrated in the accompanying drawings. The accompanying drawings are included to provide a further understanding of embodiments of the application and are incorporated in and constitute a part of this specification, illustrate the application and not constitute a limitation to the application. In the drawings, like reference numerals generally refer to like parts or steps.
Fig. 1 is a schematic flow chart of an intelligent transportation scheduling method according to an exemplary embodiment of the present application.
Fig. 2 is a flow chart of an intelligent transportation scheduling method according to another exemplary embodiment of the present application.
Fig. 3 is a flowchart of a method for updating a scheduled to-be-checked schedule according to an exemplary embodiment of the present application.
Fig. 4 is a schematic structural diagram of an intelligent transportation scheduling system according to an exemplary embodiment of the present application.
Fig. 5 is a schematic structural diagram of an intelligent transportation scheduling system according to another exemplary embodiment of the present application.
Fig. 6 is a block diagram of an electronic device according to an exemplary embodiment of the present application.
Detailed Description
Hereinafter, example embodiments according to the present application will be described in detail with reference to the accompanying drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application and not all of the embodiments of the present application, and it should be understood that the present application is not limited by the example embodiments described herein.
Summary of the application
The transportation part of commercial concrete is a transportation scheduling problem, requiring the produced concrete to be transported to a designated site in time and quantity, and belongs to the vehicle scheduling problem with a time window. In addition, in the concrete production process, faults such as a main mixer shaft, blade breakage, conveyor belt breakage and the like easily occur, and the faults need to be checked in advance and a scheduling scheme needs to be adjusted in time.
Commercial concrete transportation scheduling solutions often focus on realizing real-time monitoring of concrete quality and vehicle running conditions by adding various sensors. However, for the core dispatch module, it is generally only possible to rely on the dispatcher to manually determine. The manual scheduling on one hand provides long-time and high-strength work requirements for the scheduler, on the other hand, the use efficiency of the production line and the vehicle is not high enough, the resource waste is easy to cause, and the operation cost of the mixing station is increased.
The application aims to provide an intelligent transportation scheduling method, system, computer readable storage medium and electronic equipment, wherein a plurality of to-be-detected scheduling schedules are produced through order information, time costs of the to-be-detected scheduling schedules are calculated to obtain a plurality of time costs corresponding to the to-be-detected scheduling schedules respectively, when at least one time cost is smaller than or equal to a preset time cost threshold value in the plurality of time costs, the to-be-detected scheduling schedule corresponding to the at least one time cost is selected as the to-be-detected scheduling schedule, then production constraint detection is carried out on the to-be-detected scheduling schedule according to production equipment information and/or transportation vehicle information corresponding to single production equipment, and the to-be-detected scheduling schedule meeting preset conditions in a production constraint detection result is selected as the transportation scheduling schedule; after a plurality of schedule schedules to be checked are obtained, the time cost is calculated, when the time cost meets the requirement, the schedule schedules with the time cost meeting the requirement are detected by utilizing production constraint detection, so that the transportation schedule schedules meeting the production constraint condition and with lower time cost are obtained, the time cost is saved as much as possible on the premise of meeting the requirement of a customer order, and the working efficiency is improved.
The following specifically describes specific structures and specific implementation manners of an intelligent transportation scheduling method, a system, a computer readable storage medium and an electronic device provided in the embodiments of the present application with reference to the accompanying drawings.
Exemplary method
Fig. 1 is a schematic flow chart of an intelligent transportation scheduling method according to an exemplary embodiment of the present application. As shown in fig. 1, the intelligent transportation scheduling method includes the following steps:
step 110: at least one schedule to be checked with a time cost less than a preset time cost threshold is obtained.
The specific implementation manner of step 110 may be: generating a plurality of scheduling schedules to be checked according to the order information; calculating time costs of a plurality of scheduling schedules to be detected, and obtaining a plurality of time costs corresponding to the scheduling schedules to be detected respectively; at least one schedule to be checked, of which the time cost is less than or equal to a preset time cost threshold, is selected from the plurality of time costs.
The order information refers to necessary information contained in an order placed by a customer, i.e., the customer's needs can be determined from the order information, and production and transportation can be arranged to meet the customer's needs according to the order information. In an embodiment, the order information includes any one or a combination of the following: site address, product strength grade, demand, construction time, number of transport vehicles, capacity of transport vehicles, address of production facility. A plurality of scheduling schedules to be checked meeting the demands of customers can be generated according to order information such as site addresses, product strength grades, demand, construction time, number of transport vehicles, capacity of transport vehicles, addresses of production equipment and the like. In one embodiment, the specific generation of the plurality of candidate schedule schedules may be: a plurality of to-be-checked scheduling schedules capable of completing order information are randomly generated. When the order tasks are more, the corresponding scheduling timetable is also more complex, and the optimal scheduling timetable is difficult to simply acquire. Therefore, the embodiment of the application can randomly generate a plurality of to-be-checked scheduling schedules capable of completing order information, and then iteratively update the to-be-checked scheduling schedules based on the to-be-checked scheduling schedules so as to acquire an optimal or better scheduling schedule.
In one embodiment, the dispatch schedule includes the capacity of the transport vehicles to each worksite, the arrival time of the transport vehicles to each worksite, and the loading time and transport of each transport vehicle; the specific generation mode of the scheduling schedule to be checked can be as follows: and inputting order information into a scheduling schedule generation model to obtain a plurality of scheduling schedules to be checked which meet the transportation conditions. The schedule generating model may be any intelligent model, such as a neural network model, which can generate a schedule to be checked. In further embodiments, the transportation conditions may include any one or a combination of the following conditions: the sum of the capacities of the transport vehicles transported to each worksite is greater than or equal to the demand at that worksite; the arrival time of the transport vehicle to each worksite is within the construction time range of that worksite; the sum of the loading time, the transporting time and the unloading time of each transporting vehicle is less than or equal to the initial setting time of the concrete; the time interval between adjacent transport vehicles transported to each worksite is less than or equal to a preset first time threshold; the time interval between adjacent transport vehicles transported to each worksite is greater than or equal to a preset second time threshold; and the number of vehicles simultaneously unloaded or poured on each site is less than or equal to 1.
To meet customer demand, the sum of the capacities of the transport vehicles transported to each worksite is greater than or equal to the demand at that worksite, specifically,where K is the collection of transport vehicles, Δ k (u) represents a site where the transport vehicle k is going ahead immediately after leaving from the production facility u, q (k) is the maximum load of the vehicle k, lambda (v) is the demand of the site v, x uvk Representing the number of times the product produced by the production facility u is transported to the worksite v by the transport vehicle k, an
Because of the requirement of initial setting time of the concrete, in order to ensure the quality of the concrete, the transportation, unloading and pouring of each transportation vehicle must be completed within the specified initial setting time, in particular, M (1-x uvk )+st(u)+γ≥ω v +st(v)-ω u Wherein M is an infinite positive integer, st (u) is the discharge time, st (u) is the loading time, ω u To start the production time omega V And gamma is the initial setting time for starting pouring.
In order not to affect the construction progress of the construction site, the concrete delivered to each site is completed within the construction site's working time window, i.e. the time to start the work must not be earlier than the earliest start time of the time window and not be allowed to be later than the latest end time of the time window, in particular, a (u) v omega uj B (u), j ε {1,.. N (u) -1}, where a (u) is the construction start time required for worksite u, b (u 0 is the construction end time required for worksite u, andwherein Q (c) is the ready-mixed concrete demand of the construction site, which is marked +.>Representing an upward rounding.
In order not to affect the construction progress of the worksite and to improve the working efficiency of the transport vehicles, the time interval between adjacent transport vehicles transported to each worksite is less than or equal to a preset first time threshold value and greater than or equal to a preset second time threshold value, specifically,wherein maxtl (u) and maxtl (u) are the minimum allowed time interval (i.e., the second time threshold) and the maximum allowed time interval (i.e., the first time threshold), respectively.
By detecting the schedule to be detected through the plurality of transportation conditions, the obtained transportation schedule can be ensured to meet the transportation constraint conditions, so that production and transportation are ensured to meet the demands of customer orders.
For the evaluation of the efficiency of concrete production and transportation, the time cost is mainly reflected in the time cost, and the time cost can be directly related to the sum of the production time and the transportation time (for example, the time cost is a fixed multiple of the sum of the production time and the transportation time), and the time cost can also be directly the sum of the production time and the transportation time. Therefore, the embodiment of the application mainly uses the time cost as a standard for judging whether the scheduling schedule is optimal or better. After a plurality of schedule to be checked are obtained, the time costs of the schedule to be checked are calculated respectively to obtain a plurality of time costs (i.e. the time costs of production and transportation according to each schedule to be checked).
In an embodiment, the calculation manner of the time cost of the schedule to be checked may include: respectively calculating the transportation time cost and the invalid waiting time cost of a single scheduling schedule to be checked; and integrating the transportation time cost and the invalid waiting time cost to obtain the time cost of the single schedule to be checked. Wherein the invalid latency cost comprises: the time difference between the off-load time and the press time, the arrival time of the first transport vehicle at a single site, and the start time of construction at the site. For ease of calculation, the above-described transportation time and invalidation waiting time may be transportation time and invalidation waiting time, respectively. Specifically, the transportation time can be calculated according to the distance between the production equipment and the transportation site and the average speed of the transportation vehicle (a vehicle speed can be preset or can be obtained according to the past time statistics); the material breaking time can be obtained according to the difference between the material breaking starting time and the arrival time of the next transport vehicle; the hold time may be obtained from the difference between the arrival time of the first waiting vehicle (i.e., the second vehicle in the hold state) and the start-discharge time of the last waiting vehicle. Since both the transportation time and the invalid waiting time will constitute the time costs of the whole production and transportation, by comprehensively considering the transportation time costs and the invalid waiting time costs, the time costs of the whole transportation scheduling can be reduced as a whole.
In a further embodiment, the specific way to integrate the transit time cost and the ineffective waiting time cost may be: the transit time costs and the invalid waiting time costs are summed or weighted summed. The transportation time cost and the invalid waiting time cost can be comprehensively considered in a direct summation mode, and a weight with an importance degree can be added to each time cost in a weighted summation mode, so that a transportation scheduling schedule with lower overall time cost can be acquired more pertinently, the construction progress of a client can be ensured, and the satisfaction degree of the client is improved.
A time cost threshold (namely, the maximum time cost which can be accepted) is preset, when a to-be-detected scheduling schedule with the time cost smaller than or equal to the time cost threshold exists in the to-be-detected scheduling schedule, the fact that the optimal or better scheduling scheme possibly exists in the current to-be-detected scheduling schedule is indicated, and the to-be-detected scheduling schedule with the time cost smaller than or equal to the time cost threshold is selected.
Step 120: and respectively acquiring production state information based on at least one schedule to be checked, wherein the production state information is used for representing the state information of the production equipment and the state information of the transport vehicle corresponding to the production equipment.
The schedule to be checked comprises production equipment information and transport vehicle information, and production and transport are constrained by the production equipment and the transport vehicles, so that after the schedule to be checked is obtained, the state information of the production equipment and the state information of the transport vehicles corresponding to the production equipment are obtained based on the schedule to be checked, and production constraint detection is carried out on the schedule to be checked; specifically, the acquired production facility information includes the number of production facilities and the corresponding production volumes, and the acquired transportation vehicle information includes the number of transportation vehicles waiting at the respective production facilities. For example, when the number of production apparatuses cannot meet the demand of the schedule to be inspected (due to damage to part of the apparatuses, etc.), production and transportation according to the schedule to be inspected cannot be performed; for another example, when the number of the transport vehicles corresponding to a single production device is large, it is indicated that the number of the transport vehicles receiving the material at the same production device is large, so that the accumulation of the transport vehicles is easy to be caused, and the working efficiency of the transport vehicles is obviously reduced.
Step 130: and selecting at least one schedule to be checked, wherein the production state information in the schedule to be checked meets preset conditions, and the schedule to be checked with the lowest time cost is selected to execute transportation scheduling.
When the production state information meets the preset condition, the production equipment can meet the production requirement of the schedule to be checked, so that the schedule to be checked can be selected to execute transportation scheduling, more than one schedule to be checked meeting the preset condition is possible, and in order to further reduce the time cost, the schedule to be checked with the lowest time cost in the preset condition can be selected to execute transportation scheduling. In an embodiment, the schedule to be checked includes a demand amount at a corresponding time, and the preset condition may include: the sum of products of the number of production equipment and the corresponding yield is larger than or equal to the maximum value of the demand corresponding to all the moments in the scheduling schedule to be checked; and/or the number of transport vehicles waiting at a single production facility is less than or equal to a preset number threshold. By detecting whether the sum of products of the number of production equipment and the corresponding yield is greater than or equal to the maximum value of the demand at a single moment in the schedule to be checked, the production capacity of the production equipment can be ensured to meet the requirements of all orders; by detecting whether the number of transport vehicles waiting at a single production facility is less than or equal to a preset number threshold, it is possible to ensure that the number of transport vehicles arriving at the same production facility within the same time period is not excessive, resulting in congestion of transport vehicles and waste of time costs.
According to the intelligent transportation scheduling method, at least one schedule to be checked, the time cost of which is smaller than a preset time cost threshold, is obtained, and then production state information is respectively obtained based on the at least one schedule to be checked, wherein the production state information is used for representing the state information of production equipment and the state information of transportation vehicles corresponding to the production equipment; selecting a schedule to be checked, the production state information of which meets preset conditions, and executing transportation scheduling; after the schedule to be checked with the time cost meeting the requirement is obtained, the schedule to be checked with the time cost meeting the requirement is detected by utilizing the production state information, so that the transportation schedule meeting the preset condition and having lower time cost is obtained, the time cost is saved as much as possible and the working efficiency is improved on the premise of meeting the requirement of a customer order.
Fig. 2 is a flow chart of an intelligent transportation scheduling method according to another exemplary embodiment of the present application. As shown in fig. 2, the intelligent transportation scheduling method may further include:
step 140: and updating the plurality of scheduling schedules to be checked when the time cost of the acquired scheduling schedules to be checked is greater than the time cost threshold.
When all the schedules to be checked cannot meet preset conditions, the time cost for production and transportation according to the current schedule to be checked is relatively high, at this time, the schedules to be checked can be iteratively updated to obtain a new schedule, and the schedule meeting the conditions is obtained by using an iterative method.
Fig. 3 is a flowchart of a method for updating a scheduled to-be-checked schedule according to an exemplary embodiment of the present application. As shown in fig. 3, the step 140 may specifically include the following steps:
step 141: acquiring probability values of each construction site in a plurality of scheduling schedules to be detected; wherein the probability value characterizes a probability of transporting the product to the worksite at the corresponding time.
Because the required amount of each site and the maximum load amount of each transport vehicle may be different, the complexity is greatly increased if the site to which the transport vehicle is directed is directly adjusted, which may possibly result in excessive solving difficulty and incapability of solving. Accordingly, the present application mainly adjusts the transportation schedule of each site, that is, adjusts the time of transportation to each site, by acquiring probability values of each site, and determines the order of transportation to each site (schedule of corresponding transportation) according to the magnitude of the probability values.
In an embodiment, the probability value of each worksite in the schedule to be checked may be obtained by: probability values for each worksite in the schedule to be inspected are randomly generated. As the initial value of the iteration, it may be randomly generated to reduce the difficulty of acquiring the initial value.
Step 142: and exchanging probability values of part of the construction sites in the two scheduling schedules to be checked to obtain a child scheduling schedule.
In order to obtain a new schedule, the embodiment of the application can exchange probability values of part of sites in each two schedules to be checked, namely, the probability values of the crossing part of sites are carried out by using the two known schedules to be checked, so that the transportation sequence of the sites in the two schedules to be checked is adjusted, thereby obtaining the new schedule, namely, iteration is realized, and an iteration result is obtained.
Step 143: and exchanging the sequence of the first half of the construction sites and the sequence of the second half of the construction sites in the single schedule to be checked to obtain a variant schedule.
In order to obtain a new scheduling schedule, the embodiment of the application can exchange the order of the first half of the construction sites and the order of the second half of the construction sites in the single scheduling schedule to realize the adjustment of the transportation order of the construction sites in the single scheduling schedule to obtain the new scheduling schedule, namely, realize iteration and obtain an iteration result.
Step 144: and integrating the child schedule and the variant schedule to obtain a plurality of updated schedule to be checked.
After the child schedule and the variant schedule are obtained, the child schedule and the variant schedule are used as new schedule obtained through iteration.
Step 145: and calculating the time cost of a plurality of updated scheduling schedules to be checked.
After the updated schedule to be checked is obtained, calculating the time cost of a plurality of updated schedules to be checked, namely, obtaining a new schedule through iteration, and then calculating the time cost (i.e. the time cost) of the new schedule to determine whether the obtained new schedule meets the set condition.
Step 146: and when the time cost of the plurality of updated schedule to be checked is larger than the time cost threshold, updating the plurality of updated schedule to be checked again.
When the obtained time cost of the updated schedule to be checked is greater than the time cost threshold, namely, the current iteration result cannot meet the set condition, the schedule can be updated again at this time, namely, the step 142 is performed, and the schedule is updated continuously through multiple iterations, so that the schedule meeting the condition is obtained; or stopping iteration after the iteration number reaches a preset iteration number threshold, and selecting a scheduling schedule with the minimum time cost in the current scheduling schedule to execute transportation scheduling so as to avoid longer time for generating the scheduling schedule caused by long-time updating, thereby avoiding influencing the whole scheduling time due to longer time for generating the scheduling schedule.
In an embodiment, as shown in fig. 3, after step 141, the updating method may further include:
step 147: and rearranging the order of the construction sites in the scheduling schedule to be detected according to the probability value from large to small.
And sorting the scheduling schedules to be detected according to the size of the probability value, namely acquiring the scheduling schedules to be detected which are arranged according to the transportation sequence of each construction site.
In an embodiment, the implementation of step 146 may include:
selecting a waiting scheduling schedule with the minimum time cost from a plurality of updated waiting scheduling schedules as an excellent scheduling schedule; and copying the excellent scheduling schedule to obtain a plurality of scheduling schedules to be checked after updating again.
When the time cost of the updated to-be-detected schedule is larger than the time cost threshold value, the updated to-be-detected schedule cannot meet the preset condition, and more times are needed to find the to-be-detected schedule meeting the preset condition if the updated to-be-detected schedule is updated again, so that in order to reduce the iteration times and accelerate convergence, the to-be-detected schedule with the minimum time cost is directly reserved and copied in a plurality of ways, so that to obtain to-be-detected schedules which are equal to the initial to-be-detected schedule in number (or scale) and are the minimum in time cost, the to-be-detected schedules are used as updated to-be-detected schedules again, namely, the to-be-detected schedules with the current optimal schedule are used as the initial to-be-detected schedules, iteration is performed again, and the to-be-detected schedules with the updated time cost larger than the time cost threshold value are abandoned, so that each iteration can be iterated in the direction with the smaller time cost, and the optimal schedule is obtained by iteration.
In an embodiment, the updating method may further include: and when the time cost of the updated schedule to be checked is smaller than or equal to the minimum time cost of the schedule to be checked before being updated, selecting the updated schedule to be checked as a schedule to be checked after being updated again. And directly reserving the scheduling schedule with the time cost smaller than or equal to the time cost of the optimal scheduling schedule in the current iteration in the next iteration to the result of the re-iteration so as to ensure that each iteration iterates towards the direction with smaller time cost, thereby being beneficial to obtaining the optimal scheduling schedule by iteration.
In an embodiment, the updating method may further include: and when the time cost of the updated schedule to be checked is greater than the minimum time cost, exchanging the sequence of the first half of the construction sites and the sequence of the second half of the construction sites in the updated schedule to be checked, so as to obtain the schedule to be checked which is updated again. By comparing the optimal scheduling schedule in the parent, the scheduling schedule with the time cost in the child being greater than that of the optimal scheduling schedule in the parent is mutated, so that the mutated scheduling schedule can be iterated to a scheduling schedule close to the optimal scheduling schedule, and the convergence speed is improved.
Exemplary apparatus
Fig. 4 is a schematic structural diagram of an intelligent transportation scheduling system according to an exemplary embodiment of the present application. As shown in fig. 4, the intelligent transportation scheduling system 40 includes: the to-be-detected generating module 41 is configured to obtain at least one to-be-detected scheduling schedule with a time cost less than a preset time cost threshold; a production status acquisition module 42, configured to acquire production status information based on at least one schedule to be checked, where the production status information is used to characterize status information of a production facility and status information of a transport vehicle corresponding to the production facility; and a selecting module 43, configured to select a schedule to be checked, in which the production status information in the at least one schedule to be checked satisfies a preset condition and the time cost is the lowest, to perform transportation scheduling.
In an embodiment, the preset condition may include: the sum of products of the number of production equipment and the corresponding yield is larger than or equal to the maximum value of the demand corresponding to all the moments in the scheduling schedule to be checked; and/or the number of transport vehicles waiting at a single production facility is less than or equal to a preset number threshold.
According to the intelligent transportation scheduling system, at least one to-be-detected scheduling schedule with time cost smaller than a preset time cost threshold is acquired through the to-be-detected generating module 41, then the production state acquiring module 42 acquires production state information based on the at least one to-be-detected scheduling schedule respectively, and the selecting module 43 selects the to-be-detected scheduling schedule with the production state information meeting preset conditions and the lowest time cost in the at least one to-be-detected scheduling schedule to execute transportation scheduling; after at least one schedule to be checked with time cost smaller than a preset time cost threshold is obtained, the schedule with time cost meeting the requirement is detected by utilizing the production state information, so that the transportation schedule meeting the preset condition and with lower time cost is obtained, the time cost is saved as much as possible and the working efficiency is improved on the premise of meeting the requirement of a customer order.
In an embodiment, the pending generation module 41 may be further configured to: generating a plurality of scheduling schedules to be checked according to the order information; calculating time costs of a plurality of scheduling schedules to be detected, and obtaining a plurality of time costs corresponding to the scheduling schedules to be detected respectively; at least one schedule to be checked, of which the time cost is less than or equal to a preset time cost threshold, is selected from the plurality of time costs.
In an embodiment, the pending generation module 41 may be further configured to: a plurality of to-be-checked scheduling schedules capable of completing order information are randomly generated.
In an embodiment, the to-be-checked schedule may satisfy a combination of any one or more of the following conditions: the sum of the capacities of the transport vehicles transported to each worksite is greater than or equal to the demand at that worksite; the arrival time of the transport vehicle to each worksite is within the construction time range of that worksite; the sum of the loading time, the transporting time and the unloading time of each transporting vehicle is less than or equal to the initial setting time of the concrete; the time interval between adjacent transport vehicles transported to each worksite is less than or equal to a preset first time threshold; the time interval between adjacent transport vehicles transported to each worksite is greater than or equal to a preset second time threshold; and the number of vehicles simultaneously unloaded or poured on each site is less than or equal to 1.
In an embodiment, the pending generation module 41 may be further configured to: respectively calculating the transportation time cost and the invalid waiting time cost of a single scheduling schedule to be checked; and integrating the transportation time cost and the invalid waiting time cost to obtain the time cost of the single schedule to be checked. Wherein the invalid latency cost comprises: the time difference between the off-load time and the press time, the arrival time of the first transport vehicle at a single site, and the start time of construction at the site. In a further embodiment, the test generation module 41 may be further configured to: the transit time costs and the invalid waiting time costs are summed or weighted summed.
In one embodiment, the production status acquisition module 42 may be further configured to: acquiring the number of production equipment and the corresponding yield according to the production equipment information; and/or the number of transport vehicles waiting at each production facility is obtained from the transport vehicle information.
Fig. 5 is a schematic structural diagram of an intelligent transportation scheduling system according to another exemplary embodiment of the present application. As shown in fig. 5, the intelligent transportation scheduling system 40 may further include: the updating module 44 is configured to update the schedule to be checked when the time costs of the obtained schedule to be checked are all greater than the time cost threshold.
In one embodiment, as shown in fig. 5, the update module 44 may include: a probability obtaining unit 441, configured to obtain probability values of each worksite in the schedule to be checked; wherein the probability value characterizes a probability of transporting the product to the worksite at the corresponding time; a cross unit 442, configured to exchange probability values of part of the sites in the two scheduling schedules to be checked, so as to obtain a child scheduling schedule; a variation unit 443, configured to exchange the order of the first half of the worksites and the order of the second half of the worksites in the single schedule to be checked, so as to obtain a variation schedule; an iteration unit 444, configured to integrate the child schedule and the variant schedule to obtain a plurality of updated schedules to be checked; an iteration result calculation unit 445 for calculating time costs of the plurality of updated schedule to be checked; the iteration result determining unit 446 is configured to update the plurality of updated scheduled schedules to be checked again when the time costs of the plurality of updated scheduled schedules to be checked are all greater than the time cost threshold.
In an embodiment, the probability acquisition unit 441 may be further configured to: probability values for each worksite in a plurality of to-be-inspected schedule schedules are randomly generated.
In one embodiment, as shown in fig. 5, the update module 44 may include: a sorting unit 447 for rearranging the worksite sequences in the plurality of scheduling schedules to be inspected from large to small according to the probability values.
In one embodiment, as shown in fig. 5, the update module 44 may include: a replication unit 448, configured to select a schedule to be checked with the minimum time cost from the plurality of updated schedules to be checked as an excellent schedule to be checked; and copying the excellent scheduling schedule to obtain a plurality of scheduling schedules to be checked after updating again.
In an embodiment, the update module 44 may be further configured to: and when the time cost of the updated schedule to be checked is smaller than or equal to the minimum time cost of the schedule to be checked before being updated, selecting the updated schedule to be checked as a schedule to be checked after being updated again. In an embodiment, the update module 44 may be further configured to: and when the time cost of the updated schedule to be checked is greater than the minimum time cost, exchanging the sequence of the first half of the construction sites and the sequence of the second half of the construction sites in the updated schedule to be checked, so as to obtain the schedule to be checked which is updated again.
Exemplary electronic device
Next, an electronic device according to an embodiment of the present application is described with reference to fig. 6. The electronic device may be either or both of the first device and the second device, or a stand-alone device independent thereof, which may communicate with the first device and the second device to receive the acquired input signals therefrom.
Fig. 6 illustrates a block diagram of an electronic device according to an embodiment of the present application.
As shown in fig. 6, the electronic device 10 includes one or more processors 11 and a memory 12.
The processor 11 may be a Central Processing Unit (CPU) or other form of processing unit having data processing and/or instruction execution capabilities, and may control other components in the electronic device 10 to perform desired functions.
Memory 12 may include one or more computer program products that may include various forms of computer-readable storage media, such as volatile memory and/or non-volatile memory. The volatile memory may include, for example, random Access Memory (RAM) and/or cache memory (cache), and the like. The non-volatile memory may include, for example, read Only Memory (ROM), hard disk, flash memory, and the like. One or more computer program instructions may be stored on the computer readable storage medium that can be executed by the processor 11 to implement the intelligent transportation scheduling method and/or other desired functions of the various embodiments of the present application described above. Various contents such as an input signal, a signal component, a noise component, and the like may also be stored in the computer-readable storage medium.
In one example, the electronic device 10 may further include: an input device 13 and an output device 14, which are interconnected by a bus system and/or other forms of connection mechanisms (not shown).
For example, when the electronic device is a first device or a second device, the input means 13 may be a camera for capturing an input signal of an image. When the electronic device is a stand-alone device, the input means 13 may be a communication network connector for receiving the acquired input signals from the first device and the second device.
In addition, the input device 13 may also include, for example, a keyboard, a mouse, and the like.
The output device 14 may output various information to the outside, including the determined distance information, direction information, and the like. The output device 14 may include, for example, a display, speakers, a printer, and a communication network and remote output devices connected thereto, etc.
Of course, only some of the components of the electronic device 10 that are relevant to the present application are shown in fig. 6 for simplicity, components such as buses, input/output interfaces, etc. are omitted. In addition, the electronic device 10 may include any other suitable components depending on the particular application.
Exemplary computer program product and computer readable storage Medium
In addition to the methods and apparatus described above, embodiments of the present application may also be a computer program product comprising computer program instructions which, when executed by a processor, cause the processor to perform the steps in an intelligent transportation scheduling method according to various embodiments of the present application described in the "exemplary methods" section of the present specification.
The computer program product may write program code for performing the operations of embodiments of the present application in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server.
Furthermore, embodiments of the present application may also be a computer-readable storage medium, having stored thereon computer program instructions, which when executed by a processor, cause the processor to perform the steps in an intelligent transportation scheduling method according to various embodiments of the present application described in the above "exemplary methods" section of the present specification.
The computer readable storage medium may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may include, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The basic principles of the present application have been described above in connection with specific embodiments, however, it should be noted that the advantages, benefits, effects, etc. mentioned in the present application are merely examples and not limiting, and these advantages, benefits, effects, etc. are not to be considered as necessarily possessed by the various embodiments of the present application. Furthermore, the specific details disclosed herein are for purposes of illustration and understanding only, and are not intended to be limiting, as the application is not intended to be limited to the details disclosed herein as such.
The block diagrams of the devices, apparatuses, devices, systems referred to in this application are only illustrative examples and are not intended to require or imply that the connections, arrangements, configurations must be made in the manner shown in the block diagrams. As will be appreciated by one of skill in the art, the devices, apparatuses, devices, systems may be connected, arranged, configured in any manner. Words such as "including," "comprising," "having," and the like are words of openness and mean "including but not limited to," and are used interchangeably therewith. The terms "or" and "as used herein refer to and are used interchangeably with the term" and/or "unless the context clearly indicates otherwise. The term "such as" as used herein refers to, and is used interchangeably with, the phrase "such as, but not limited to.
It is also noted that in the apparatus, devices and methods of the present application, the components or steps may be disassembled and/or assembled. Such decomposition and/or recombination should be considered as equivalent to the present application.
The previous description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present application. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects without departing from the scope of the application. Thus, the present application is not intended to be limited to the aspects shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
The foregoing description has been presented for purposes of illustration and description. Furthermore, this description is not intended to limit the embodiments of the application to the form disclosed herein. Although a number of example aspects and embodiments have been discussed above, a person of ordinary skill in the art will recognize certain variations, modifications, alterations, additions, and subcombinations thereof.
Claims (10)
1. An intelligent transportation scheduling method is characterized by comprising the following steps:
acquiring at least one schedule to be checked, the time cost of which is smaller than a preset time cost threshold value;
respectively acquiring production state information based on the at least one schedule to be checked, wherein the production state information is used for representing the state information of production equipment and the state information of a transport vehicle corresponding to the production equipment; and
selecting the production state information in the at least one schedule to be checked to meet preset conditions, and executing transportation scheduling on the schedule to be checked with the lowest time cost;
updating the schedule to be checked when the time cost of the acquired schedule to be checked is larger than the time cost threshold;
the updating the schedule to be checked comprises the following steps:
acquiring probability values of all construction sites in the scheduling schedule to be checked; wherein the probability value characterizes a probability of transporting the product to the worksite at a corresponding time;
Exchanging probability values of partial construction sites of the two scheduling schedules to be checked to obtain a child scheduling schedule;
exchanging the sequence of the first half of the construction sites and the sequence of the second half of the construction sites in the single schedule to be checked to obtain a variation schedule;
synthesizing the child schedule and the variant schedule to obtain a plurality of updated schedule to be checked;
calculating the time cost of the updated scheduling schedules to be checked; and
and when the time cost of the plurality of updated to-be-detected scheduling schedules is larger than the time cost threshold value, updating the plurality of updated to-be-detected scheduling schedules again.
2. The intelligent transportation scheduling method of claim 1, wherein the schedule to be checked comprises: production equipment information, transport vehicle information and demand corresponding to different moments; the preset conditions include: the sum of products of the number of the production devices and the corresponding yield is larger than or equal to the maximum value of the demand corresponding to all the moments in the scheduling schedule to be checked; and/or the number of transport vehicles waiting at a single production facility is less than or equal to a preset number threshold.
3. The intelligent transportation scheduling method according to claim 1, wherein the obtaining manner of the time cost of the schedule to be checked includes:
respectively calculating the transportation time cost and the invalid waiting time cost of a single scheduling schedule to be checked; and
and integrating the transportation time cost and the invalid waiting time cost to obtain the time cost of the single scheduling schedule to be checked.
4. The intelligent transportation scheduling method of claim 1, wherein the re-updating the plurality of updated to-be-inspected schedule schedules comprises:
selecting the schedule to be checked with the minimum time cost from the updated schedules to be checked as an excellent schedule; and
and copying the excellent scheduling schedules to obtain a plurality of scheduling schedules to be checked after updating again.
5. The intelligent transportation scheduling method of claim 1, further comprising:
and when the time cost of the updated schedule to be detected is smaller than or equal to the minimum time cost of the schedule to be detected before updating, selecting the updated schedule to be detected as a schedule to be detected after updating again.
6. The intelligent transportation scheduling method of claim 5, further comprising:
and when the time cost of the updated schedule to be checked is greater than the minimum time cost, exchanging the sequence of the first half of the construction sites and the sequence of the second half of the construction sites in the updated schedule to be checked, so as to obtain the schedule to be checked which is updated again.
7. The intelligent transportation scheduling method of claim 1, wherein the schedule to be checked satisfies any one or more of the following combinations of conditions:
the sum of the capacities of the transport vehicles transported to each worksite is greater than or equal to the demand at that worksite;
the arrival time of the transport vehicle to each worksite is within the construction time range of that worksite;
the sum of the loading time, the transporting time and the unloading time of each transporting vehicle is less than or equal to the initial setting time of the concrete;
the time interval between adjacent transport vehicles transported to each worksite is less than or equal to a preset first time threshold;
the time interval between adjacent transport vehicles transported to each worksite is greater than or equal to a preset second time threshold; and
The number of vehicles simultaneously unloaded or poured on each site is less than or equal to 1.
8. An intelligent transportation scheduling system, comprising:
the to-be-detected generation module is used for acquiring at least one to-be-detected scheduling schedule with time cost smaller than a preset time cost threshold;
the production state acquisition module is used for respectively acquiring production state information based on the at least one scheduling schedule to be checked, wherein the production state information is used for representing the state information of production equipment and the state information of a transport vehicle corresponding to the production equipment; and
the selection module is used for selecting the production state information in the at least one schedule to be checked to meet preset conditions, and the schedule to be checked with the lowest time cost executes transportation scheduling;
the to-be-detected generating module is further configured to update the to-be-detected scheduling schedule when the time cost of the obtained to-be-detected scheduling schedule is greater than the time cost threshold;
the to-be-detected generating module is specifically configured to update the to-be-detected scheduling schedule:
acquiring probability values of all construction sites in the scheduling schedule to be checked; wherein the probability value characterizes a probability of transporting the product to the worksite at a corresponding time;
Exchanging probability values of partial construction sites of the two scheduling schedules to be checked to obtain a child scheduling schedule;
exchanging the sequence of the first half of the construction sites and the sequence of the second half of the construction sites in the single schedule to be checked to obtain a variation schedule;
synthesizing the child schedule and the variant schedule to obtain a plurality of updated schedule to be checked;
calculating the time cost of the updated scheduling schedules to be checked; and
and when the time cost of the plurality of updated to-be-detected scheduling schedules is larger than the time cost threshold value, updating the plurality of updated to-be-detected scheduling schedules again.
9. A computer readable storage medium storing a computer program for executing the intelligent transportation scheduling method of any one of the preceding claims 1-7.
10. An electronic device, the electronic device comprising:
a processor;
a memory for storing the processor-executable instructions;
the processor configured to perform the intelligent transportation scheduling method of any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011534414.4A CN112598273B (en) | 2020-12-22 | 2020-12-22 | Intelligent transportation scheduling method, system, medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011534414.4A CN112598273B (en) | 2020-12-22 | 2020-12-22 | Intelligent transportation scheduling method, system, medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112598273A CN112598273A (en) | 2021-04-02 |
| CN112598273B true CN112598273B (en) | 2024-04-02 |
Family
ID=75200212
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011534414.4A Active CN112598273B (en) | 2020-12-22 | 2020-12-22 | Intelligent transportation scheduling method, system, medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112598273B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113011792B (en) * | 2021-04-29 | 2024-03-26 | 上海华兴数字科技有限公司 | Mine vehicle dispatching method and system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001344317A (en) * | 2000-06-05 | 2001-12-14 | Mitsubishi Chemicals Corp | Support system for car dispatching planning |
| CN104573942A (en) * | 2014-12-26 | 2015-04-29 | 湖南万物工业软件有限公司 | Method and device for dispatching transport vehicles in mixing plants |
| JP2016085658A (en) * | 2014-10-28 | 2016-05-19 | Ｊｆｅスチール株式会社 | Physical distribution plan creation apparatus and physical distribution plan creation method |
| CN109816147A (en) * | 2018-12-26 | 2019-05-28 | 深圳市北斗智能科技有限公司 | A kind of airfreight route planning method, apparatus, equipment and storage medium |
| CN110264140A (en) * | 2019-06-27 | 2019-09-20 | 广东工业大学 | A kind of logistics transportation dispatching method, device and equipment with time window |
| CN111612358A (en) * | 2020-05-25 | 2020-09-01 | 北京交通大学 | Shared automobile vehicle scheduling and dispatcher path optimization method |
-
2020
- 2020-12-22 CN CN202011534414.4A patent/CN112598273B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001344317A (en) * | 2000-06-05 | 2001-12-14 | Mitsubishi Chemicals Corp | Support system for car dispatching planning |
| JP2016085658A (en) * | 2014-10-28 | 2016-05-19 | Ｊｆｅスチール株式会社 | Physical distribution plan creation apparatus and physical distribution plan creation method |
| CN104573942A (en) * | 2014-12-26 | 2015-04-29 | 湖南万物工业软件有限公司 | Method and device for dispatching transport vehicles in mixing plants |
| CN109816147A (en) * | 2018-12-26 | 2019-05-28 | 深圳市北斗智能科技有限公司 | A kind of airfreight route planning method, apparatus, equipment and storage medium |
| CN110264140A (en) * | 2019-06-27 | 2019-09-20 | 广东工业大学 | A kind of logistics transportation dispatching method, device and equipment with time window |
| CN111612358A (en) * | 2020-05-25 | 2020-09-01 | 北京交通大学 | Shared automobile vehicle scheduling and dispatcher path optimization method |
Non-Patent Citations (2)
| Title |
|---|
| 基于两步遗传算法的预拌混凝土智能调度模;陈海林 等;《山东化工》;第1节 * |
| 联网中物流配送车辆调度目标定位设计与仿真;冯亮;梁工谦;;计算机仿真(04);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112598273A (en) | 2021-04-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107943697B (en) | Problem distribution method, device, system, server and computer storage medium | |
| CN109829667B (en) | Logistics node parcel prediction method and device | |
| CN112598273B (en) | Intelligent transportation scheduling method, system, medium and electronic equipment | |
| CN110009155B (en) | Method and device for estimating distribution difficulty of service area and electronic equipment | |
| WO2020252666A1 (en) | Edge computing device and method for industrial internet of things, and computer-readable storage medium | |
| CN114202130A (en) | Flow transfer amount prediction multitask model generation method, scheduling method, device and equipment | |
| CN109242269A (en) | Job instruction generation method, device, system, electronic equipment and storage medium | |
| CN110826782B (en) | Data processing method and device, readable storage medium and electronic equipment | |
| CN111626497A (en) | People flow prediction method, device, equipment and storage medium | |
| CN114781874A (en) | Dispatching method and system of transport vehicle and electronic equipment | |
| CN111507542A (en) | Goods quantity measuring method and device and electronic equipment | |
| CN113233069B (en) | Intelligent warehousing ex-warehouse control method and device, electronic equipment and storage medium | |
| CN112651625A (en) | Concrete intelligent scheduling method, system, medium and electronic equipment | |
| CN111105176B (en) | Data processing method, device, equipment and storage medium | |
| CN111178568A (en) | Service reservation request processing method, device, server and storage medium | |
| CN115222328A (en) | Logistics tracking method, device, equipment and medium | |
| CN116029505A (en) | Vehicle scheduling method, device, electronic equipment and readable storage medium | |
| CN114841591A (en) | Vehicle scheduling information generation method, device, equipment and computer readable medium | |
| US20200311741A1 (en) | Methods and systems for validating order request | |
| CN111754050A (en) | Method and apparatus for predicting delivery image of delivery object | |
| CN112529486A (en) | Logistics processing method, device, equipment and machine readable medium | |
| WO2021129831A1 (en) | Vehicle allocation method and apparatus, device and computer-readable storage medium | |
| CN113570092B (en) | Gate control method, device, equipment and computer readable storage medium | |
| CN113269431B (en) | Inventory risk prediction method, apparatus, medium and computer program product | |
| CN111026571B (en) | Processor down-conversion processing method and device and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |