CN115310778A - Scheduling method and device, warehousing system and storage medium - Google Patents
Scheduling method and device, warehousing system and storage medium Download PDFInfo
- Publication number
- CN115310778A CN115310778A CN202210852027.8A CN202210852027A CN115310778A CN 115310778 A CN115310778 A CN 115310778A CN 202210852027 A CN202210852027 A CN 202210852027A CN 115310778 A CN115310778 A CN 115310778A
- Authority
- CN
- China
- Prior art keywords
- task
- containers
- container
- work
- work area
- 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
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
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
Abstract
The embodiment of the application provides a scheduling method, electronic equipment and a storage medium, wherein the method comprises the following steps: determining a task container allocated to each of at least some of the plurality of job regions based on flow control information and task-capable information of each of the plurality of job regions, wherein the flow control information of a job region is used for controlling the number of containers allocated to the job region and waiting for processing, and the task-capable information includes: information of a plurality of tasks in an execution state; and determining a scheduling scheme based on the task container and the transport capacity information allocated to each operation area, and scheduling the transport vehicle to transport the task container allocated to each operation area based on the scheduling scheme.
Description
Technical Field
The present application relates to the field of logistics, and in particular, to a scheduling method, apparatus and storage medium.
Background
In the delivery process of warehouse management, transportation vehicles in the warehouse need to be scheduled to transport containers, such as pallets, for corresponding tasks to corresponding work areas, and the containers are processed in the work areas.
The current scheduling mode is as follows: and determining which transport vehicles transport the containers to the corresponding operation areas through which transport vehicles according to the distances between the transport vehicles and the containers, wherein the containers of the corresponding tasks which are close to the corresponding transport vehicles are transported to the corresponding operation areas by the corresponding transport vehicles.
The current scheduling mode does not consider the operation efficiency of the operation area, and the problem of low operation efficiency may occur. For example, since the corresponding transport vehicle is not scheduled to go to the work area with less allocated containers for a longer time, the work area is idle, and the ex-warehouse work efficiency of the work area is low.
Disclosure of Invention
To overcome the problems in the related art, the present application provides a scheduling method, an electronic device, and a storage medium.
An embodiment of the present application provides a scheduling method, including:
determining a task container allocated to each of at least some of a plurality of job regions based on flow control information and task-capable information of each of the plurality of job regions, wherein the flow control information of the job region is used for controlling the number of containers allocated to the job region and waiting for processing, and the task-capable information includes: information of a plurality of tasks in an execution state;
and determining a scheduling scheme based on the task container and the transport capacity information allocated to each operation area, and scheduling the transport vehicle to transport the task container allocated to each operation area based on the scheduling scheme.
An embodiment of the present application provides an electronic device, including: a memory, a processor and a computer program stored on the memory, the processor executing the computer program to implement the scheduling method.
Embodiments of the present application provide a computer-readable storage medium, on which a computer program/instruction is stored, which, when executed by a processor, implements the scheduling method described above.
Embodiments of the present application provide a computer program product, which includes a computer program/instruction, and when executed by a processor, the computer program/instruction implements the scheduling method described above.
The scheduling method provided by the embodiment of the application determines the task container allocated to each of at least part of the plurality of operation areas based on the flow control information and the task-making information of each of the plurality of operation areas; a scheduling scheme is determined based on the assigned task containers and capacity information for each of at least some of the work areas, and the transport vehicle is scheduled to transport the assigned task containers for each of the work areas to each of the work areas based on the scheduling scheme. For any one of the plurality of work areas, the flow control information is used for controlling the flow of the work area, namely, the number of containers which are distributed to the work area and wait for processing is controlled, so that the condition that the work area is idle, namely, the number of the containers which are distributed to the work area and wait for processing is not too small, the condition that the work area is overloaded, namely, the number of the containers which are distributed to the work area and wait for processing is not too large is avoided, and the whole ex-warehouse work efficiency is improved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and, together with the description, serve to explain the principles of the application.
Fig. 1 is a flowchart illustrating a scheduling method provided in an embodiment of the present application;
fig. 2 shows a block diagram of a scheduling apparatus according to an embodiment of the present application.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
With the development of Intelligent technologies such as internet of things, artificial intelligence and big data, the requirement for transformation and upgrading of the traditional Logistics industry by using the Intelligent technologies is stronger, and Intelligent Logistics (Intelligent Logistics System) becomes a research hotspot in the Logistics field. The intelligent logistics utilizes artificial intelligence, big data, various information sensors, radio frequency identification technology, global Positioning System (GPS) and other Internet of things devices and technologies, is widely applied to basic activity links of material transportation, storage, delivery, packaging, loading and unloading, information service and the like, and realizes intelligent analysis decision, automatic operation and high-efficiency optimization management in the material management process. The internet of things technology comprises sensing equipment, an RFID technology, laser infrared scanning, infrared induction identification and the like, the internet of things can effectively connect materials in logistics with a network, the materials can be monitored in real time, environmental data such as humidity and temperature of a warehouse can be sensed, and the storage environment of the materials is guaranteed. All data in logistics can be sensed and collected through a big data technology, the data are uploaded to an information platform data layer, operations such as filtering, mining and analyzing are carried out on the data, and finally accurate data support is provided for business processes (such as links of transportation, warehousing, storing and taking, sorting, packaging, sorting, ex-warehouse, checking, distribution and the like). The application direction of artificial intelligence in logistics can be roughly divided into two types: 1) The AI technology is used for endowing intelligent equipment such as an unmanned truck, an AGV, an AMR, a forklift, a shuttle, a stacker, an unmanned distribution vehicle, an unmanned aerial vehicle, a service robot, a mechanical arm, an intelligent terminal and the like to replace part of labor; 2) The manual efficiency is improved through a software system such as a transportation equipment management system, a storage management system, an equipment scheduling system, an order distribution system and the like driven by technologies or algorithms such as computer vision, machine learning, operation and research optimization and the like. With the research and development of intelligent logistics, the technology is applied to a plurality of fields, such as retail and electronic commerce, electronic products, tobacco, medicine, industrial manufacturing, shoes and clothes, textiles, food and the like.
Fig. 1 shows a flowchart of a scheduling method provided in an embodiment of the present application, where the method includes:
In the present application, each of a plurality of job regions whose flow control information is used to control the number of containers allocated to the job region and waiting for processing.
In the present application, the task information includes: information of each of a plurality of tasks in an execution state.
For any task, if the task is being executed, the task is in an execution state. The information of the task in the execution state may include: the location of the container for the task in execution state when step 101 is executed, and the identification of the job region for handling the container allocated for the task in execution state. The tasks in this application may be: and carrying out the warehouse-out task on the goods in the containers allocated for the task. The container in this application may be a pallet, a container or the like.
A plurality of operation districts in this application can select the operation district including at least one manual work, can select the flow control information in operation district through the manual work, select the operation district to carry out flow control to the manual work to, neither can cause the manual work to select the operation district overload, can not cause the manual work again to select the operation district idle, the waste of the manpower resources in operation district is selected in the manual work.
In the present application, a container allocated to each of a plurality of tasks in an execution state is referred to as a task container. The number of tasks in the plurality of tasks in the executing state is equal to the number of task containers.
In the present application, a container allocated to any one of a plurality of work areas may be referred to as a task container of the work area.
And for any one of the plurality of work areas, the task type of the task to which the task container allocated for the work area belongs is the task type corresponding to the work area.
For example, the task type corresponding to the manual picking operation area is a manual picking type, the task of the manual picking type is a manual picking task, a task container allocated to the manual picking task needs to be transported to the manual picking operation area, and a worker in the manual picking operation area picks the goods in the task container. The task type corresponding to the robot picking operation area is a robot picking type, the task of the robot picking type is a robot picking task, a task container of the robot picking task needs to be transported to the robot picking operation area, and the robot in the robot picking operation area picks goods in the task container.
In the present application, for any one of the plurality of job regions, the existing container of the job region is a container that has been allocated to the job region and is waiting for processing, and the already allocated job region may refer to the one allocated to the job region before step 101 is executed.
For any one of the plurality of work areas, the flow control information of the work area may include: the number of existing containers in the operation area and the minimum container number threshold value of the operation area.
For any of the plurality of work zones, the minimum container number threshold for that work zone may indicate: to avoid the work area being free, the work area has at least how many containers allocated to the work area and waiting for processing.
For each of the plurality of operation areas, determining whether the number of containers in the operation area is smaller than a minimum container number threshold of the operation area, and if so, subtracting the existing container number of the operation area from the minimum container number threshold of the operation area to obtain a supplement number of task containers of the operation area.
The task container allocation order of at least part of the plurality of work areas may be randomly determined, or the task container allocation order of at least part of the plurality of work areas may be obtained by sorting at least part of the plurality of work areas according to the number of supplemented task containers. And allocating the task containers for each of at least part of the working areas in turn according to the task container allocation order. For any one of the plurality of work areas, randomly selecting a supplement number of task containers from all the optional task containers corresponding to the work area in the plurality of tasks, and allocating the randomly selected supplement number of task containers to the work area, wherein the optional task containers corresponding to the work area are not allocated to any work area and the corresponding task type is the task type corresponding to the work area.
And step 202, determining a scheduling scheme based on the task container and the transport capacity information allocated to each operation area, and scheduling the transport vehicle to transport the task container allocated to each operation area based on the scheduling scheme.
In the present application, the capacity information may include: position information of each of a plurality of transport vehicles, which may be respectively scheduled to transport a corresponding task container, may also be referred to as idle capacity. For each of the plurality of transportation vehicles, the location information of the transportation vehicle may be the location of the transportation vehicle at the time step 202 is performed.
For any one of the plurality of work areas, the scheduling scheme defines a transport vehicle corresponding to each task container of the work area, and the transport vehicle is used for transporting the corresponding task container from the original position to the work area. The home position of the task container may be: the location of the task container when step 101 is performed.
In the application, the determining of the scheduling scheme based on the task container and the transport capacity information allocated to each work area may include randomly determining a transport vehicle determination order of the work area, and sequentially performing a determination operation on each work area according to the transport vehicle determination order of the work area to determine a transport vehicle corresponding to each task container, each task container corresponding to a different transport vehicle.
For each of at least some of the plurality of work zones, the determining operation for that work zone comprises: when the operation area is provided with a plurality of task containers, the determination sequence of the transport vehicles of the task containers of the operation area can be randomly determined, the transport vehicles corresponding to each task container of the operation area are sequentially determined according to the determination sequence of the transport vehicles of the task containers of the operation area, for any one task container of the operation area, one optional transport vehicle can be randomly selected from all optional transport vehicles in the plurality of transport vehicles, the optional transport vehicle is a transport vehicle without a corresponding task container, and the randomly selected optional transport vehicle is used as the transport vehicle corresponding to the task container.
In the present application, scheduling the transport vehicle to transport the task container allocated for each work area to each work area based on the scheduling scheme may include: for each transport vehicle in at least part of the transport vehicles, scheduling the transport vehicle to go to the original position of the task container corresponding to the transport vehicle; if the task container is directly transmitted to the operation area, the corresponding transport vehicle transports the task container of the task from the original position of the task container to the operation area; if the task container is transported to the working area by at least one device, the task container is transported by the transport vehicle from the respective position of the task container to the respective device and from the respective device to the working area during the transport of the task container.
For example, a task container is transferred to a work area by a hoist, a junction between the hoist and the work area to which the task container is assigned. During the transport of the task container, the task container is transported by the transport vehicle from the home position of the task container to the entrance of the hoisting machine, and when the task container reaches the exit of the hoisting machine, the task container is transported by the transport vehicle from the exit of the hoisting machine to the docking point. When the task container can be transported from the docking point to the working area, the task container is transported from the docking point to the working area by a transport vehicle.
In some embodiments, for each of the plurality of work areas, the flow control information for the work area includes: the number of existing containers of the work area, the adaptive number of processing capabilities of the work area, the existing containers of the work area being containers which have been allocated to the work area and are waiting for processing, the number of existing containers of the work area being the number of existing containers of the work area, the adaptive number of processing capabilities of the work area being a number which is suitable for the processing capabilities of the work area, the adaptive number of processing capabilities being determined according to the time interval between two schedules and the length of time for which a single container is processed by the work area; determining a task container allocated to each of at least some of the plurality of work areas based on the flow control information, the task-capable information of each of the plurality of work areas includes: for each of a plurality of work areas, when the number of existing containers of the work area is smaller than the adaptive number of processing capacity of the work area, determining a first supplement number of task containers of the work area allocated to the work area, wherein the first supplement number of the work area is the adaptive number of processing capacity of the work area minus the number of existing containers of the work area.
In the present application, for any one of the plurality of job regions, the existing container of the job region is a container that has been allocated to the job region and is waiting for processing, and the already allocated job region may refer to the one allocated to the job region before step 101 is executed.
Before the scheduling method provided by the embodiment of the present application is executed for the first time, for each of a plurality of work areas, a time length required for the work area to process N containers allocated to the work area may be determined, and an average time length for the work area to process a single container may be obtained by dividing a time length for processing N containers allocated to the work area by N.
In this application, the time interval between two schedules is a duration between a time of executing the scheduling method provided by the embodiment of the present application once and a time of executing the scheduling method provided by the embodiment of the present application next time. The scheduling method provided by the embodiment of the present application may be performed at a time interval between two times of scheduling. For any one of the multiple work areas, dividing the time interval between the two schedules by the time length of processing a single container by the work area to obtain a quotient, and if the quotient is an integer, taking the quotient as the processing capacity adaptation number of the work area, and if the quotient is not an integer, taking the rounding-up result of the quotient as the processing capacity adaptation number of the work area.
For any one of the plurality of operation areas, when the number of the existing containers of the operation area is smaller than the adaptive number of the processing capacity of the operation area, determining to allocate a first supplement number of task containers to the operation area, wherein the first supplement number can be obtained by subtracting the number of the existing containers of the operation area from the adaptive number of the processing capacity of the operation area.
The task container allocation order of the job regions in at least part of the plurality of job regions may be randomly determined. And allocating the task containers for each of at least part of the working areas in turn according to the task container allocation order. For any one of the plurality of work areas, if a first supplement quantity of task containers are allocated to the work area, randomly selecting a first supplement quantity of task containers from all the optional task containers corresponding to the work area in the plurality of tasks, allocating the first supplement quantity of task containers to the work area, wherein the optional task containers corresponding to the work area are not allocated to any work area and the corresponding task types are the task types corresponding to the work area.
In the present application, for each of a plurality of work areas, the processing capacity adaptation number of the work area may be understood as a number that is more suitable for the container processing speed of the work area. For each of the plurality of work areas, when the number of the existing containers of the work area is smaller than the processing capacity adaptation number of the work area, a first supplementary number of task containers may be allocated to the work area, and the number of containers allocated to the work area to be processed may be adapted to the processing capacity of the work area. Therefore, the idle operation area and the overload operation area can not be caused.
In some embodiments, for each of the plurality of work areas, the flow control information for the work area includes: the number of the existing containers in the operation area and the maximum container number threshold value of the operation area; the task container determined to be allocated to at least part of the plurality of work areas based on the flow control information and the task-capable information of each of the plurality of work areas includes: for each of the plurality of work areas, when the number of the existing containers of the work area is smaller than the maximum container number threshold of the work area, determining to allocate a second replenishment number of task containers to the work area, wherein the second replenishment number of the work area is obtained by subtracting the number of the existing containers of the work area from the maximum container number threshold of the work area.
For each of the plurality of workspaces, the threshold of the maximum number of containers corresponding to the workspace may indicate: in order to avoid overloading the work area, the work area has at most how many containers allocated to the work area and waiting for processing.
In this application, for each of the plurality of work areas, a second supplemental number of task containers may be allocated to the work area when the number of existing containers in the work area is less than the threshold maximum container number for the work area, and no task containers may be allocated to the work area when the number of existing containers in the work area is equal to or greater than the threshold maximum container number for the work area. Therefore, the idle operation area and the overload operation area can not be caused.
In some embodiments, for each of the plurality of work areas, the flow control information for the work area includes: a number of containers on pre-processing equipment of the work area, a first container number threshold of the work area, containers on pre-processing equipment of the work area being transported to the work area directly or via a docking point of the work area after being processed by the pre-processing equipment; determining a task container allocated to each of at least some of the plurality of work areas based on the flow control information, the task-capable information of each of the plurality of work areas includes: for each of a plurality of work areas, when the number of containers on the front processing device of the work area is smaller than a first container number threshold of the work area, determining that a first preset number of task containers are allocated to the work area.
In the present application, for each of a plurality of work areas, each container on the front-end processing device of the work area is a container assigned to the work area.
For each of the plurality of work zones, the containers on the pre-processing equipment of the work zone are transported to the work zone directly after being processed by the pre-processing equipment or through a docking point of the work zone.
For example, one work area is a manual picking work area, the pre-processing equipment of the work area is a hoist, and the containers on the pre-processing equipment of the work area are transported to the work area directly after being processed by the hoist or transported to the work area through a connection point of the work area. The elevator handles the containers on the elevator by lifting the containers from the inlet of the elevator to the outlet of the elevator.
In the present application, for each of a plurality of workspaces, the number of containers on the front end of the processing facility for that workspace may be used to gauge whether the supply of containers to that workspace is sufficient. For each of a plurality of work areas, when the number of containers on the front end processing device of the work area is less than the first threshold number of containers for the work area, it may be determined that there are insufficient containers to supply to the work area, and the work area may be assigned a first preset number of task containers for the work area.
In this application, for each of the plurality of work areas, when the number of containers on the front processing device of the work area is smaller than the first container number threshold of the work area, a first preset number of task containers of the work area may be allocated to the work area, so that the containers are sufficiently supplied to the work area, and when the number of containers on the front processing device of the work area is not smaller than the first container number threshold of the work area, the containers are sufficiently supplied to the work area, and no task container is allocated to the work area. Therefore, the idle operation area and the overload operation area can not be caused.
In some embodiments, the flow control information of the work area includes, for each of the plurality of work areas: the number of containers corresponding to the connection point of the operation area and a second container number threshold value of the operation area; determining a task container allocated to each of at least some of the plurality of work areas based on the flow control information, the workable task information, and the capacity information for each of the plurality of work areas includes: for each operation zone in the multiple operation zones, when the number of containers corresponding to the connection point of the operation zone is smaller than a second container number threshold of the operation zone, determining that a second preset number of task containers are allocated to the operation zone, wherein the number of containers corresponding to the connection point of the operation zone is the sum of the number of containers on the connection point and the number of containers going to the connection point.
In this application, for each of a plurality of work zones, the container allocated for that work zone may first reach the access point of that work zone, and when a container at the access point of that work zone may be transported to that work zone, the container at the access point of that work zone is transported to that work zone by a transport vehicle. Whether the container on the connection point of the operation area can be transported to the operation area can be determined according to the traffic condition of the operation area, and if the transport vehicle transporting the container on the connection point of the operation area moves to the operation area and cannot cause blockage of the operation area, the container on the connection point of the operation area can be transported to the operation area.
In the present application, for each of a plurality of work areas, the number of containers corresponding to the access point of the work area may be used to measure whether the supply of containers to the work area is sufficient.
For each of the plurality of work areas, when the number of containers corresponding to the docking point of the work area is smaller than the second container number threshold of the work area, it may be determined that the containers are not sufficiently supplied to the work area, and a second preset number of task containers may be allocated to the work area.
In this application, for each of the plurality of operation areas, when the number of containers corresponding to the connection point of the operation area is smaller than the second container number threshold of the operation area, a second preset number of task containers of the operation area are allocated to the operation area, so that the containers are sufficiently supplied to the operation area, and when the number of containers corresponding to the connection point of the operation area is not smaller than the second container number threshold of the operation area, the containers are sufficiently supplied to the operation area, and the task containers are not allocated to the operation area. Therefore, the idle operation area and the overload operation area can not be caused.
In some embodiments, the capacity information includes: location information for each of a plurality of transport vehicles; determining a scheduling scheme based on the assigned task containers and capacity information for each of at least some of the work areas comprises: determining a scheduling plan based on the assigned task containers for each of at least some of the work areas, the capacity information, and the empty cost information for each of the plurality of transport vehicles, the empty cost information for the transport vehicles including: the distance between the transport vehicle and each task container.
A transport vehicle of the plurality of transport vehicles, which may also be referred to as an idle capacity, may be scheduled to transport the corresponding task container.
For a transport vehicle and a task container, the distance between the transport vehicle and the task container may be: a distance between the location of the transport vehicle in the capacity information and the location of the task container in the task-capable information.
Determining a scheduling plan based on the assigned task containers for each of at least some of the work areas, the capacity information, and the empty cost information for each of the plurality of transport vehicles may include: aggregating the task containers of each of at least part of the operation areas to obtain a task container set; calculating the minimum empty driving distance of each task container in the task container set, wherein the minimum empty driving distance of each task container in the task container set is the distance between the transport vehicle which is the closest to the task container in the plurality of transport vehicles and the task container; sequencing the task containers in the task container set according to the minimum empty driving distance of the task containers from small to large to obtain a determined sequence of the transport vehicles; and sequentially determining the transport vehicles corresponding to each task container in the task container set according to the transport vehicle determination sequence.
For each task container in the task container set, when determining the transport vehicle corresponding to the task container, one transport vehicle may be randomly selected from all the selectable transport vehicles in the plurality of transport vehicles, where the selectable transport vehicle is a transport vehicle without a corresponding task container, and the randomly selected selectable transport vehicle is taken as the transport vehicle corresponding to the task container.
In the present application, the scheduling plan is determined based on the task container assigned to each of at least some of the work areas, the capacity information, and the empty running cost information of each of the plurality of transport vehicles. The distance between the transport vehicle and the task container corresponding to the transport vehicle can be made shorter for each transport vehicle corresponding to the task container, so that resources consumed by the transport vehicle to reach the position of the task container corresponding to the transport vehicle can be saved in the process of scheduling the transport vehicle to transport the task container allocated to each work area based on the scheduling scheme.
In some embodiments, determining the scheduling plan based on the assigned task containers for each of at least some of the work areas, the capacity information, and the empty cost information for each of the transport vehicles includes: determining a plurality of candidate schemes based on the task container and the transport capacity information distributed to each of at least part of the operation areas; calculating a total empty cost of each candidate solution in the plurality of candidate solutions based on the empty cost information of each transport vehicle, wherein the total empty cost of the candidate solution is the sum of the empty costs of each candidate transport vehicle in the candidate solution, and the empty cost of the candidate transport vehicle is determined according to the distance between the candidate transport vehicle and the corresponding task container; determining a candidate with the smallest total empty-driving cost among the plurality of candidates as the scheduling scheme.
In this application, the candidate solution may be understood as a possible scheduling solution, and the task containers of each of at least some of the job regions may be aggregated to obtain a task container set. All possible scheduling schemes can be exhausted based on a plurality of transport vehicles and task container sets, and all possible scheduling schemes are a plurality of candidate schemes.
The candidate transport vehicle in the candidate scenario may be understood as a transport vehicle of the plurality of transport vehicles that may be used for transporting the respective task container. For each of at least some of the work areas, a candidate solution defines a candidate transport vehicle corresponding to each task container of the work area, the candidate transport vehicle corresponding to the task container being understood as a transport vehicle of the plurality of transport vehicles that may be used to transport the task container, and for any one of the plurality of transport vehicles, the candidate transport vehicle corresponding to each task container of the work area defined by the candidate solution is different as a candidate transport vehicle or not as a candidate transport vehicle corresponding to a task container.
In the present application, for any one candidate solution, the total empty cost of the candidate solution is the sum of the empty cost of each candidate transportation vehicle in the candidate solution.
For each candidate haulage vehicle defined by a candidate solution, the empty cost of the candidate haulage vehicle may be the distance between the candidate haulage vehicle and the corresponding mission container.
In the present application, a total empty cost of each of the plurality of candidate solutions may be calculated, and a candidate solution having a smallest total empty cost among the plurality of candidate solutions may be determined as the scheduling solution. Therefore, in the process that the transport vehicle is scheduled to transport the task container allocated to each working area based on the scheduling scheme, the resource consumed by the transport vehicle corresponding to the task container to reach the position of the task container is reduced to the maximum extent.
Please refer to fig. 2, which shows a block diagram of a scheduling apparatus according to an embodiment of the present application. The scheduling device includes: an allocation unit 201 and a scheduling unit 202.
The allocation unit 201 is configured to determine a task container allocated to each of at least some of the plurality of job regions based on flow control information of each of the plurality of job regions for controlling the number of containers allocated to the job region and waiting to be processed, and on tasking information including: information of a plurality of tasks in an execution state;
the scheduling unit 202 is configured to determine a scheduling scheme based on the assigned task container and the capacity information for each work area, and to schedule the transport vehicle to transport the assigned task container for each work area to each work area based on the scheduling scheme.
In some embodiments, the flow control information of the work area includes: the number of existing containers of the work area, which are containers that have been allocated to the work area and are waiting for processing, and the number of existing containers of the work area, which is the number of existing containers of the work area, are determined according to the time interval between two schedules and the length of time for which the work area processes a single container; the allocation unit 201 is configured to determine, for each of a plurality of work areas, to allocate a first replenishment quantity of task containers to the work area when the number of existing containers of the work area is less than the processing capacity adaptation number of the work area, wherein the first replenishment quantity is obtained by subtracting the number of existing containers of the work area from the processing capacity adaptation number of the work area.
In some embodiments, the flow control information of the work area includes: the number of the existing containers in the operation area and the maximum container number threshold value of the operation area are set; the allocation unit 201 is configured to determine, for each of a plurality of work areas, to allocate a second replenishment quantity of task containers to the work area when the number of existing containers of the work area is less than the maximum container number threshold of the work area, the second replenishment quantity being obtained by subtracting the number of existing containers of the work area from the maximum container number threshold of the work area.
In some embodiments, the flow control information of the work area includes: a number of containers on a pre-processing device of the work zone, a first container number threshold of the work zone, containers on the pre-processing device being transported to the work zone directly or through a docking point of the work zone after being processed by a pre-processing device; the allocation unit 201 is configured to determine, for each of a plurality of job regions, to allocate a first preset number of task containers to the job region when the number of containers on the front processing device of the job region is less than a first container number threshold of the job region.
In some embodiments, the flow control information of the work area includes: the number of containers corresponding to the access point of the operation area and a second container number threshold value of the operation area are obtained; the allocating unit 201 is configured to determine, for each of the plurality of work zones, to allocate a second preset number of task containers to the work zone when the number of containers corresponding to the docking point of the work zone is smaller than a second container number threshold of the work zone, where the number of containers corresponding to the docking point is the sum of the number of containers at the docking point and the number of containers heading to the docking point.
In some embodiments, the capacity information comprises: location information for each of a plurality of transport vehicles; the scheduling unit 202 is configured to determine the scheduling plan based on the task container allocated to each of the work areas, the capacity information, and the empty cost information of each of the transportation vehicles, the empty cost information of the transportation vehicles including: the distance between the transport vehicle and each task container.
In some embodiments, the scheduling unit 202 is configured to determine a plurality of candidate solutions based on the capacity information, the task container allocated for said each job space; calculating a total empty cost for each of the plurality of candidate solutions based on the empty cost information for each of the transport vehicles, wherein the total empty cost for a candidate solution is a sum of the empty costs for each of the candidate solutions, and the empty cost for a candidate transport vehicle is determined according to a distance between the candidate transport vehicle and the corresponding task container; determining a candidate of the plurality of candidates having a smallest total cost of empty driving as the scheduling scheme.
Embodiments of the present application further provide a computer program product, which includes a computer program/instruction, and when executed by a processor, the computer program/instruction implements the operations described in the foregoing scheduling method embodiments.
The present application further provides an electronic device that may be configured with one or more processors; a memory for storing one or more programs, the one or more programs may include instructions for performing the operations described in the above embodiments. The one or more programs, when executed by the one or more processors, cause the one or more processors to perform the instructions of the operations described in the scheduling method embodiments above.
The present application also provides a storage medium, which may be included in an electronic device; or the device can be independently arranged and not assembled into the electronic equipment. The storage medium carries one or more programs, and when the one or more programs are executed by the electronic device, the electronic device is caused to perform the operations described in the scheduling method embodiments.
Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.
It will be understood that the present application is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.
Claims (10)
1. A method of scheduling, the method comprising:
determining a task container allocated to each of at least some of a plurality of job regions based on flow control information and task-capable information of each of the plurality of job regions, wherein the flow control information of the job region is used for controlling the number of containers allocated to the job region and waiting for processing, and the task-capable information includes: information of a plurality of tasks in an execution state;
and determining a scheduling scheme based on the task container and the transport capacity information allocated to each working area, and scheduling the transport vehicle to transport the task container allocated to each working area based on the scheduling scheme.
2. The method according to claim 1, wherein the flow control information of the work area includes: the number of existing containers in the operation area, the adaptive number of processing capacity of the operation area, wherein the existing containers in the operation area are containers which are allocated to the operation area and wait for processing, the adaptive number of processing capacity is a number suitable for the processing capacity of the operation area, and the adaptive number of processing capacity is determined according to a time interval between two times of scheduling and the time length of processing a single container in the operation area;
determining a task container allocated to each of at least some of the plurality of work areas based on the flow control information, the task-capable information of each of the plurality of work areas includes:
for each of a plurality of work areas, when the number of the existing containers of the work area is smaller than the adaptive number of the processing capacity of the work area, determining to allocate a first supplement number of task containers to the work area, wherein the first supplement number is obtained by subtracting the adaptive number of the processing capacity of the work area from the number of the existing containers of the work area.
3. The method according to claim 1, wherein the flow control information of the work area includes: the number of the existing containers in the operation area and the maximum container number threshold value of the operation area;
determining a task container allocated to each of at least some of the plurality of work areas based on the flow control information, the task-capable information of each of the plurality of work areas includes:
for each of a plurality of work areas, when the number of existing containers in the work area is smaller than the maximum container number threshold value of the work area, determining to allocate a second replenishment number of task containers to the work area, wherein the second replenishment number is obtained by subtracting the number of existing containers in the work area from the maximum container number threshold value of the work area.
4. The method according to claim 1, wherein the flow control information of the work area includes: a number of containers on a pre-processing device of the work zone, a first container number threshold of the work zone, containers on the pre-processing device being transported to the work zone directly or through a docking point of the work zone after being processed by a pre-processing device;
determining a task container allocated to each of at least some of the plurality of work areas based on the flow control information, the task-capable information of each of the plurality of work areas includes:
for each of a plurality of work areas, when the number of containers on the front processing device of the work area is smaller than a first container number threshold of the work area, determining to allocate a first preset number of task containers to the work area.
5. The method according to claim 1, wherein the flow control information of the work area includes: the number of containers corresponding to the connection point of the operation area and a second container number threshold value of the operation area are obtained;
determining a task container allocated to each of at least some of the plurality of work areas based on the flow control information, the task-capable information of each of the plurality of work areas includes:
for each operation zone in the multiple operation zones, when the number of containers corresponding to the connection point of the operation zone is smaller than a second container number threshold of the operation zone, determining that a second preset number of task containers are allocated to the operation zone, where the number of containers corresponding to the connection point is the sum of the number of containers on the connection point and the number of containers going to the connection point.
6. The method according to any of claims 1-5, wherein the capacity information comprises: location information for each of a plurality of transport vehicles; determining a scheduling scheme based on the task container and capacity information allocated to each of the work areas includes:
determining the scheduling scheme based on the task container allocated to each work area, the capacity information, and the empty cost information of each transport vehicle, the empty cost information of the transport vehicle including: the distance between the transport vehicle and each task container.
7. The method of claim 6, wherein determining the scheduling plan based on the assigned task container for each work area, the capacity information, and the empty cost information for each transport vehicle comprises:
determining a plurality of candidate schemes based on the task container allocated to each operation area and the transportation capacity information;
calculating a total empty cost for each of the plurality of candidate solutions based on the empty cost information for each of the transport vehicles, wherein the total empty cost for a candidate solution is a sum of the empty costs for each of the candidate solutions, and the empty cost for a candidate transport vehicle is determined according to a distance between the candidate transport vehicle and the corresponding task container;
determining a candidate solution having a smallest total empty-driving cost among the plurality of candidate solutions as the scheduling solution.
8. An electronic device, comprising: memory, processor and computer program stored on the memory, characterized in that the processor executes the computer program to implement the method of any of claims 1-7.
9. A computer-readable storage medium on which a computer program/instructions are stored, characterized in that the computer program/instructions, when executed by a processor, implement the method of any one of claims 1-7.
10. A computer program product comprising computer programs/instructions, characterized in that the computer programs/instructions, when executed by a processor, implement the method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210852027.8A CN115310778A (en) | 2022-07-20 | 2022-07-20 | Scheduling method and device, warehousing system and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210852027.8A CN115310778A (en) | 2022-07-20 | 2022-07-20 | Scheduling method and device, warehousing system and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115310778A true CN115310778A (en) | 2022-11-08 |
Family
ID=83856142
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210852027.8A Pending CN115310778A (en) | 2022-07-20 | 2022-07-20 | Scheduling method and device, warehousing system and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115310778A (en) |
-
2022
- 2022-07-20 CN CN202210852027.8A patent/CN115310778A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6854966B2 (en) | Order processing methods and equipment, servers and storage media | |
| Custodio et al. | Flexible automated warehouse: a literature review and an innovative framework | |
| CN110239868B (en) | Goods taking task allocation method and goods sorting system thereof | |
| CN109795828B (en) | Lightweight logistics automation system method based on Internet of things technology | |
| CN110633926A (en) | Method, apparatus and system for handling work-bin and storage medium | |
| CN110599075A (en) | Warehouse goods turnover management device, system, method and storage medium | |
| CN113335811B (en) | Task balancing method, control terminal and sorting system thereof | |
| CN114580996A (en) | Method for discharging bin | |
| CN113998352B (en) | Sorting and dispatching method and device, electronic equipment, storage medium and warehousing system | |
| CN116605574B (en) | Parameter configuration and collaborative scheduling platform for large-scale robot picking system | |
| CN113578757A (en) | Sorting method, electronic equipment and sorting system | |
| CN113496327A (en) | Cargo handling method, device, system, control terminal and computer storage medium | |
| CN111123870A (en) | System control method and device and electronic equipment | |
| WO2023226756A1 (en) | Device scheduling method, electronic device, and storage medium | |
| CN115310778A (en) | Scheduling method and device, warehousing system and storage medium | |
| CN114399247A (en) | Task allocation method, electronic device, storage medium, and computer program product | |
| CN115293680A (en) | Warehouse management method, electronic device and storage medium | |
| CN114662853A (en) | Distribution method, equipment, product and medium of transport vehicle | |
| CN114358680A (en) | Task allocation method, electronic device and computer program product | |
| CN115357017A (en) | Robot control method, electronic device, and storage medium | |
| CN115258507A (en) | Warehousing system, control method and device thereof, electronic equipment and storage medium | |
| CN114358681A (en) | Task allocation method, electronic device and computer program product | |
| CN113807770A (en) | Exception handling method and device in warehousing system | |
| CN117273606B (en) | Unmanned carrier scheduling method and system based on intelligent warehouse | |
| CN115156090B (en) | Material box distribution method, electronic equipment and storage medium |
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 |