CN115783602A - Annular shuttle vehicle scheduling system and method based on dynamic task allocation - Google Patents

Annular shuttle vehicle scheduling system and method based on dynamic task allocation Download PDF

Info

Publication number
CN115783602A
CN115783602A CN202211592680.1A CN202211592680A CN115783602A CN 115783602 A CN115783602 A CN 115783602A CN 202211592680 A CN202211592680 A CN 202211592680A CN 115783602 A CN115783602 A CN 115783602A
Authority
CN
China
Prior art keywords
task
trolley
tasks
dynamic
module
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.)
Granted
Application number
CN202211592680.1A
Other languages
Chinese (zh)
Other versions
CN115783602B (en
Inventor
厉明
黄少华
束搏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Suzhou Everdi Logistics Technology Co ltd
Original Assignee
Suzhou Everdi Logistics Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Suzhou Everdi Logistics Technology Co ltd filed Critical Suzhou Everdi Logistics Technology Co ltd
Priority to CN202211592680.1A priority Critical patent/CN115783602B/en
Publication of CN115783602A publication Critical patent/CN115783602A/en
Application granted granted Critical
Publication of CN115783602B publication Critical patent/CN115783602B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention relates to the field of logistics scheduling, in particular to an annular shuttle vehicle scheduling system and method based on dynamic task allocation, which comprises the following steps: the WCS issues a trolley task; receiving the trolley tasks, and performing overall distribution on all the trolley tasks; optimizing and issuing the overall distributed trolley tasks; and receiving the trolley information transmitted by the PLC and carrying out visual presentation. According to the method, the tasks are dynamically distributed according to the dynamic task distribution method, and are optimized and then sent to the annular shuttle car, so that the reasonability and efficiency of task distribution are improved, and the overall working efficiency of the annular shuttle car system is greatly improved; the states of the annular shuttle vehicles are collected and reported through the communication alarm module, the current positions, speeds, states and current tasks of the trolleys are displayed through the task visualization module, the annular shuttle vehicles can be conveniently and better dispatched, the tasks of the annular shuttle vehicles can be modified through the offline operation module, and logistics tasks can be conveniently and efficiently completed.

Description

Annular shuttle vehicle dispatching system and method based on dynamic task allocation
Technical Field
The invention relates to the field of logistics scheduling, in particular to an annular shuttle vehicle scheduling system and method based on dynamic task allocation.
Background
With the development of science and technology and the addition of WTO in China, the modern logistics concept is deeply popular, and a great number of users have common understanding on the promotion effect of the logistics storage system in the development of various industries, and the development of an automatic logistics system and an automatic warehouse follows. With the development of automation logistics systems and automation warehouses in China and even the world, many defects of general automation systems and warehouses are exposed, and in order to make up for the defects, an RGV (rail guided shuttle car) is generated, and can be very conveniently and automatically connected with other logistics systems, such as an exit/entry platform, various buffer stations, a conveyor, a lifter, a robot and the like, so that materials can be conveyed according to a plan. In addition, the automatic control system does not need to be operated by personnel and has high running speed. Therefore, the workload of warehouse management personnel is obviously reduced, the labor productivity is improved, and meanwhile, the application of the shuttle vehicle can enable a logistics system to be very simple and convenient. The circular shuttle vehicle usually runs on a circular track by a plurality of vehicles in sequence to form a complete system. The purpose of the scheduling method is to assign the handling tasks to the appropriate vehicles for execution. The existing annular shuttle dispatching systems all use a static dispatching algorithm. The static state is mainly embodied in two aspects: 1. assignment of tasks is done when the vehicle arrives past a sensor, and is static over the time of assignment. 2. After assignment of a task to a vehicle, unless the vehicle fails, the assigned vehicle cannot be modified until the vehicle has not reached the pick-up station, and is static in the assignment of the task.
Disclosure of Invention
The invention aims to solve the defects in the background technology by providing an annular shuttle vehicle dispatching system based on dynamic task allocation and a method thereof.
The technical scheme adopted by the invention is as follows:
the method for dispatching the annular shuttle car based on dynamic task allocation comprises the following steps:
s1.1: the WCS issues a trolley task;
s1.2: receiving the trolley tasks, and performing overall distribution on all the trolley tasks;
s1.3: optimizing and issuing the overall distributed trolley tasks;
s1.4: and receiving the trolley information transmitted by the PLC and carrying out visual presentation.
As a preferred technical scheme of the invention: and S1.2, receiving the trolley task, and establishing a task model according to the trolley task issued by the WCS:
Figure 841392DEST_PATH_IMAGE001
Figure 442007DEST_PATH_IMAGE002
wherein U is a time objective function,
Figure 997753DEST_PATH_IMAGE003
the total number of the trolleys is the total number,
Figure 143563DEST_PATH_IMAGE004
the total number of tasks of the trolley is,
Figure 36958DEST_PATH_IMAGE005
show the trolley performs the first
Figure 926416DEST_PATH_IMAGE006
The time spent for each task is,
Figure 867827DEST_PATH_IMAGE007
for the introduced decision variables, the first
Figure 699386DEST_PATH_IMAGE008
The first vehicle to carry out
Figure 827879DEST_PATH_IMAGE006
The success rate of each task is 0 or 1, V is the task priority objective function,
Figure 521029DEST_PATH_IMAGE009
denotes the first
Figure 35055DEST_PATH_IMAGE010
The priority of each task;
the constraints of the task model are as follows:
Figure 788248DEST_PATH_IMAGE011
Figure 138458DEST_PATH_IMAGE012
and Q is the maximum capacity of the trolley for executing the tasks.
As a preferred technical scheme of the invention: the scheduling system in S1.2 receives the trolley task and then passes through the dynamic exploration factor
Figure 884566DEST_PATH_IMAGE013
Performing dynamic allocation of the dynamic exploration factor
Figure 269411DEST_PATH_IMAGE013
The following:
Figure 927925DEST_PATH_IMAGE014
wherein the content of the first and second substances,
Figure 283207DEST_PATH_IMAGE015
to explore factors
Figure 318160DEST_PATH_IMAGE016
The step size of the change is such that,
Figure 823090DEST_PATH_IMAGE017
which indicates the number of times the task was performed,
Figure 636194DEST_PATH_IMAGE018
representing the total number of times the task was performed.
As a preferred technical scheme of the invention: the dynamic task allocation algorithm is as follows;
Figure 492155DEST_PATH_IMAGE019
wherein the content of the first and second substances,
Figure 65219DEST_PATH_IMAGE020
an objective function is assigned to the dynamic.
As a preferred technical scheme of the invention: the task optimization algorithm is as follows:
Figure 424656DEST_PATH_IMAGE021
wherein the content of the first and second substances,
Figure 939820DEST_PATH_IMAGE022
Figure 17497DEST_PATH_IMAGE023
all are proportionality coefficients.
As a preferred technical scheme of the invention: the trolley information received in the S1.4 comprises the current position, the speed, the state and the current task of the trolley, wherein the current task comprises a pallet stacking platform, a goods taking platform and a goods placing platform.
As a preferred technical scheme of the invention: and in the S1.4, trolley information transmitted by the PLC is reported to the WCS, and the WCS compiles and converts the trolley information to carry out visual display.
Provided is a circular shuttle dispatching system based on dynamic task allocation, comprising:
a task issuing module: the system is used for the WCS to issue the trolley task;
a task receiving module: the system is used for receiving a trolley task issued by the WCS;
the task overall planning module is: the system is used for carrying out overall task planning according to the received trolley tasks;
the task optimization module: the system is used for optimizing the overall planned trolley tasks;
and the task redistribution module is used for: the system is used for redistributing the optimized trolley tasks;
a task visualization module: and the trolley information receiving module is used for receiving the trolley information and carrying out visual display.
As a preferred technical scheme of the invention: the trolley monitoring system also comprises a communication alarm module and an off-line operation module, wherein the communication alarm module is used for collecting alarm information of the trolley and reporting the alarm information to an upper computer; the off-line operation module is used for manually filling data.
As a preferred technical scheme of the invention: the scheduling system is divided into a body page and a webpage version, the scheduling system is deployed on a server, the body page is viewed on the server, and the webpage version is connected with an intranet after service is started and is logged in and viewed through a user account.
Compared with the prior art, the annular shuttle vehicle dispatching system and the method thereof based on dynamic task allocation have the beneficial effects that:
according to the method, the tasks are dynamically distributed according to the dynamic task distribution method, optimized and then issued to the annular shuttle vehicle, so that the reasonability and efficiency of task distribution are improved, and the overall working efficiency of the annular shuttle vehicle system is greatly improved; the communication alarm module is used for collecting and reporting the state of the annular shuttle car, the task visualization module is used for displaying the current position, the speed, the state and the current task of the trolley, the annular shuttle car can be conveniently and better dispatched, the task of the annular shuttle car can be modified through the offline operation module, and the logistics task can be conveniently and efficiently completed.
Drawings
FIG. 1 is a flow chart of a method of a preferred embodiment of the present invention;
FIG. 2 is a block diagram of a system in accordance with a preferred embodiment of the present invention;
FIG. 3 is a page view of the ontology in the preferred embodiment of the present invention.
The meaning of each label in the figure is: 100. a task issuing module; 200. a task receiving module; 300. a task overall planning module; 400. a task optimization module; 500. a task redistribution module; 600. a task visualization module; 700. a communication alarm module; 800. and an off-line operation module.
Detailed Description
It should be noted that, in the case of no conflict, the embodiments and the features in the embodiments may be combined with each other, and the technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, a preferred embodiment of the present invention provides a method for dispatching a circular shuttle vehicle based on dynamic task allocation, which includes the following steps:
s1.1: the WCS issues a trolley task;
s1.2: receiving the trolley tasks, and performing overall distribution on all the trolley tasks;
s1.3: optimizing and issuing the overall distributed trolley tasks;
s1.4: and receiving the trolley information transmitted by the PLC and carrying out visual presentation.
S1.2, receiving the trolley task, and establishing a task model according to the trolley task issued by the WCS:
Figure 394252DEST_PATH_IMAGE024
Figure 123042DEST_PATH_IMAGE025
wherein U is a time objective function,
Figure 294261DEST_PATH_IMAGE003
the total number of the trolleys is the total number,
Figure 859234DEST_PATH_IMAGE026
the total number of tasks of the trolley is,
Figure 38017DEST_PATH_IMAGE005
show the trolley performs the first
Figure 372046DEST_PATH_IMAGE027
The time spent for each task is the time spent,
Figure 714166DEST_PATH_IMAGE007
for the introduced decision variables, denote
Figure 766435DEST_PATH_IMAGE028
Vehicle to vehicle carried out
Figure 734260DEST_PATH_IMAGE027
The success rate of each task is 0 or 1, V is the task priority objective function,
Figure 922796DEST_PATH_IMAGE009
is shown as
Figure 701396DEST_PATH_IMAGE029
The priority of each task;
the constraints of the task model are as follows:
Figure 490229DEST_PATH_IMAGE030
Figure 746898DEST_PATH_IMAGE031
and Q is the maximum capacity of the trolley for executing the tasks.
S1.2, after receiving the trolley task, the scheduling system passes through the dynamic exploration factor
Figure 55520DEST_PATH_IMAGE032
Dynamically allocating, dynamically exploring factors
Figure 5021DEST_PATH_IMAGE033
The following were used:
Figure 15572DEST_PATH_IMAGE014
wherein, the first and the second end of the pipe are connected with each other,
Figure 341511DEST_PATH_IMAGE034
for exploring the factor
Figure 504639DEST_PATH_IMAGE035
The step size of the change is such that,
Figure 625042DEST_PATH_IMAGE017
which indicates the number of times the task was performed,
Figure 391397DEST_PATH_IMAGE018
representing the total number of times the task was performed.
The dynamic task allocation algorithm is as follows;
Figure 255448DEST_PATH_IMAGE036
wherein, the first and the second end of the pipe are connected with each other,
Figure 273082DEST_PATH_IMAGE037
an objective function is dynamically assigned.
The task optimization algorithm is as follows:
Figure 813654DEST_PATH_IMAGE038
wherein, the first and the second end of the pipe are connected with each other,
Figure 549529DEST_PATH_IMAGE039
Figure 217270DEST_PATH_IMAGE023
all are proportionality coefficients.
And S1.4, the trolley information received in the S1.4 comprises the current position, the speed, the state and the current task of the trolley, and the current task comprises a pallet stacking platform, a goods taking platform and a goods placing platform.
And in the S1.4, trolley information transmitted by the PLC is reported to the WCS, and the WCS compiles and converts the trolley information to carry out visual display.
Referring to fig. 2, there is provided a circular shuttle dispatching system based on dynamic task allocation, comprising:
the task issuing module 100: the WCS is used for issuing a trolley task;
the task receiving module 200: the system is used for receiving the trolley tasks issued by the WCS;
task orchestration module 300: the system is used for carrying out overall task planning according to the received trolley tasks;
the task optimization module 400: the system is used for optimizing the overall planned trolley tasks;
task reassignment Module 500: the system is used for redistributing the optimized trolley tasks;
the task visualization module 600: and the trolley information receiving module is used for receiving the trolley information and carrying out visual display.
The trolley alarm system further comprises a communication alarm module 700 and an off-line operation module 800, wherein the communication alarm module 700 is used for collecting alarm information of the trolley and reporting the alarm information to an upper computer; offline operations module 800 is used to manually fill in data.
The scheduling system is divided into a body page and a webpage version, the scheduling system is deployed on the server, the body page is viewed on the server, and the webpage version is connected with the intranet after being started up for service and is logged in and viewed through the user account.
In this embodiment, the WCS is a warehouse control system, the PLC is a programmable logic controller, the WCS in the task issuing module 100 issues the cart task, the task receiving module 200 receives the cart task issued by the WCS, and the task orchestration module 300 establishes the task model according to the cart task issued by the WCS:
Figure 89411DEST_PATH_IMAGE024
Figure 66464DEST_PATH_IMAGE025
wherein U is a time objective function,
Figure 289635DEST_PATH_IMAGE003
the total number of the trolleys is the total number,
Figure 495488DEST_PATH_IMAGE026
the total number of tasks of the trolley is,
Figure 222135DEST_PATH_IMAGE005
show the car performs
Figure 635668DEST_PATH_IMAGE027
The time spent for each task is the time spent,
Figure 80556DEST_PATH_IMAGE007
for the introduced decision variables, the first
Figure 90100DEST_PATH_IMAGE028
Vehicle to vehicle carried out
Figure 202413DEST_PATH_IMAGE027
The success rate of each task is 0 or 1, V is the task priority objective function,
Figure 993039DEST_PATH_IMAGE009
is shown as
Figure 456381DEST_PATH_IMAGE029
The priority of each task;
the constraints of the task model are as follows:
Figure 738458DEST_PATH_IMAGE011
Figure 705277DEST_PATH_IMAGE040
wherein Q is the maximum capacity of the trolley to execute the tasks.
And by constructing a task allocation model, the task can be conveniently reallocated in the later period.
Overall distribution of all the trolley tasks through dynamic exploration factors
Figure 195033DEST_PATH_IMAGE033
Dynamically allocating, dynamically exploring factors
Figure 880092DEST_PATH_IMAGE033
The following were used:
Figure 965860DEST_PATH_IMAGE014
wherein the content of the first and second substances,
Figure 787185DEST_PATH_IMAGE015
to explore factors
Figure 447843DEST_PATH_IMAGE016
The step size of the change is such that,
Figure 354619DEST_PATH_IMAGE017
which indicates the number of times the task was performed,
Figure 244077DEST_PATH_IMAGE018
representing the total number of times the task was performed.
Establishing a dynamic task allocation algorithm according to the dynamic exploration factors as follows;
Figure 185489DEST_PATH_IMAGE041
wherein, the first and the second end of the pipe are connected with each other,
Figure 751468DEST_PATH_IMAGE037
an objective function is assigned to the dynamic.
And the self-adaptive task dynamic allocation is carried out through a dynamic allocation algorithm, so that the task allocation efficiency is improved.
For efficiency and different functional requirements, the task optimization module 400 optimizes task assignments:
Figure 145540DEST_PATH_IMAGE038
wherein the content of the first and second substances,
Figure 838690DEST_PATH_IMAGE042
Figure 634607DEST_PATH_IMAGE023
all are proportionality coefficients.
The task allocation reasonableness is improved through the task allocation optimization.
The task redistribution module 500 redistributes the optimized cart tasks, specifically to which cart, which task, and which pallet to receive. In the process, the task visualization module 600 reads and receives cart information from the PLC, and reports the cart information to the WCS, and the WCS compiles and converts the cart information, and presents the cart information to the user in the case of page visualization.
For the scheduling system, the scheduling system is divided into 2 parts, one part is an ontology page, and the other part is a webpage version. All the pages are deployed on a server, and the body pages refer to the figure 3 and can be directly viewed on the server; after the webpage version starts the service, the intranet can be connected, and login and check can be performed through the user account.
Referring to fig. 3, a connection button is clicked on the upper left corner of the client of the scheduling system, an ip address of a port provided by the PLC is filled in an input box to connect the PLC and the WCS, and the upper left of a page prompts the connection state of the scheduling system and the WCS. The "WCS connected" green display indicates that communications with the WCS have been connected.
By switching the online mode, the WCS is informed whether to be online, the PLC connection state of each car is in the middle of the page, green is written, and "PLC1 is connected" is written, which indicates that the RG01 first car is connected, otherwise, the red is not connected.
The function of the off-line operation module 800 of the system is to fill out data manually, including: current position of the tray, number, destination, etc. After the allocated trolley data is filled, the action button beside the trolley can be clicked to issue the task to the trolley. These actions include: a transport task, a destination of a modification task, a cancellation task, a designated cart transport, and the like.
The upper right corner of the page is a ring-through alarm communication service, and the communication alarm module 700 collects alarm information of the ring-shaped shuttle and reports the alarm information to the upper computer.
And the middle of the page is the current position, speed, state and current task of all the trolleys read by the scheduling system. Wherein the current tasks include: pallet stacking, a goods taking platform and a goods placing platform.
The bottom of the page is a general task list, and a deleting button is provided at the leftmost part of the list, so that the task deleting operation can be performed. The list content includes: task _ id Task number; a PalletCode pallet code; source location, i.e., pick-up station; destination target location; priority task Priority; task _ Status Task state; create time creation time; update _ time Update time; update _ by creator; rgvnum car number.
As a version of the web page RGVDispatching System, the top of the page is the connection status of all carts. And a locking button and an unlocking button are respectively arranged below each trolley: reset, lock. A specific trolley can be locked, and when a task is allocated, the task cannot be issued to the trolley. The following are the status descriptions and alarm states of the cart and are interpreted so that the user can more intuitively see the specific status of the cart.
The RGVTask is a task list of the trolley, and compared with the body page, the upper left corner of the webpage version has one more History function. The function can check which trolley does what task when, and the specific time and place can be deleted and derived by the excel form.
The Pointinformation is arranged at the lower right part of the page, and can be used for editing, deleting and other operations on point positions such as a goods receiving platform and a discharging platform of the trolley.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned.
Furthermore, it should be understood that although the present specification describes embodiments, not every embodiment includes only a single embodiment, and such description is for clarity purposes only, and it is to be understood that all embodiments may be combined as appropriate by one of ordinary skill in the art to form other embodiments as will be apparent to those of skill in the art from the description herein.

Claims (10)

1. A method for dispatching an annular shuttle vehicle based on dynamic task allocation is characterized in that: the method comprises the following steps:
s1.1: the WCS issues a trolley task;
s1.2: receiving the trolley tasks, and performing overall distribution on all the trolley tasks;
s1.3: optimizing and issuing the overall distributed trolley tasks;
s1.4: and receiving the trolley information transmitted by the PLC and carrying out visual presentation.
2. The method for dispatching the ring-shaped shuttle based on the dynamic task allocation as claimed in claim 1, wherein: and S1.2, receiving the trolley task, and establishing a task model according to the trolley task issued by the WCS:
Figure 467817DEST_PATH_IMAGE001
Figure 349185DEST_PATH_IMAGE002
wherein U is a time objective function,
Figure 829714DEST_PATH_IMAGE003
the total number of the trolleys is the total number of the trolleys,
Figure 214559DEST_PATH_IMAGE004
the total number of tasks of the trolley is,
Figure 138653DEST_PATH_IMAGE005
show the car performs
Figure 756585DEST_PATH_IMAGE006
The time spent for each task is the time spent,
Figure 791537DEST_PATH_IMAGE007
for the introduced decision variables, denote
Figure 296467DEST_PATH_IMAGE008
Vehicle to vehicle carried out
Figure 391462DEST_PATH_IMAGE009
The success rate of each task is 0 or 1, V is the task priority objective function,
Figure 496691DEST_PATH_IMAGE010
is shown as
Figure 69754DEST_PATH_IMAGE011
The priority of each task;
the constraints of the task model are as follows:
Figure 429192DEST_PATH_IMAGE012
Figure 695088DEST_PATH_IMAGE013
and Q is the maximum capacity of the trolley for executing the tasks.
3. The method for dispatching the ring-shaped shuttle based on the dynamic task allocation as claimed in claim 2, wherein: in S1.2, after receiving the trolley task, the dynamic exploration factor is passed
Figure 759383DEST_PATH_IMAGE014
Performing dynamic allocation of the dynamic exploration factor
Figure 401717DEST_PATH_IMAGE015
The following:
Figure 881240DEST_PATH_IMAGE016
wherein, the first and the second end of the pipe are connected with each other,
Figure 567305DEST_PATH_IMAGE017
for exploring the factor
Figure 132279DEST_PATH_IMAGE015
The step size of the change, T represents the number of times the task is performed, and T represents the total number of times the task is performed.
4. The method for dispatching the ring-shaped shuttle based on the dynamic task allocation as claimed in claim 3, wherein: the dynamic task allocation algorithm is as follows;
Figure 781566DEST_PATH_IMAGE018
wherein Y is a dynamic allocation objective function.
5. The method for dispatching the ring-shaped shuttle based on the dynamic task allocation as claimed in claim 4, wherein: the task optimization algorithm is as follows:
Figure 381175DEST_PATH_IMAGE019
wherein the content of the first and second substances,
Figure 238141DEST_PATH_IMAGE020
Figure 290411DEST_PATH_IMAGE021
all are proportionality coefficients.
6. The method for dispatching the ring-shaped shuttle car based on the dynamic task allocation as claimed in claim 1, wherein: the trolley information received in the S1.4 comprises the current position, the speed, the state and the current task of the trolley, wherein the current task comprises a pallet stacking platform, a goods taking platform and a goods placing platform.
7. The method for dispatching the ring-shaped shuttle based on the dynamic task allocation as claimed in claim 6, wherein: and in the S1.4, trolley information transmitted by the PLC is reported to the WCS, and the WCS compiles and converts the trolley information to carry out visual display.
8. An annular shuttle dispatching system based on dynamic task allocation is characterized in that: the method comprises the following steps:
task issuing module (100): the system is used for the WCS to issue the trolley task;
task reception module (200): the system is used for receiving the trolley tasks issued by the WCS;
task orchestration module (300): the system is used for carrying out overall task planning according to the received trolley tasks;
task optimization module (400): the system is used for optimizing the overall planned trolley tasks;
task reassignment module (500): the system is used for redistributing the optimized trolley tasks;
task visualization module (600): and the trolley information receiving module is used for receiving the trolley information and carrying out visual display.
9. The circular shuttle vehicle dispatching system based on dynamic task allocation as claimed in claim 8, wherein: the trolley monitoring system further comprises a communication alarm module (700) and an off-line operation module (800), wherein the communication alarm module (700) is used for collecting alarm information of the trolley and reporting the alarm information to an upper computer; the offline operational module (800) is used for manually filling in data.
10. The circular shuttle dispatching system based on dynamic task allocation as claimed in claim 9, wherein: the scheduling system is divided into a body page and a webpage version, the scheduling system is deployed on a server, the body page is viewed on the server, and the webpage version is connected with an intranet after service is started and is logged in and viewed through a user account.
CN202211592680.1A 2022-12-13 2022-12-13 Annular shuttle scheduling system and method based on dynamic task allocation Active CN115783602B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211592680.1A CN115783602B (en) 2022-12-13 2022-12-13 Annular shuttle scheduling system and method based on dynamic task allocation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211592680.1A CN115783602B (en) 2022-12-13 2022-12-13 Annular shuttle scheduling system and method based on dynamic task allocation

Publications (2)

Publication Number Publication Date
CN115783602A true CN115783602A (en) 2023-03-14
CN115783602B CN115783602B (en) 2024-03-08

Family

ID=85419494

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211592680.1A Active CN115783602B (en) 2022-12-13 2022-12-13 Annular shuttle scheduling system and method based on dynamic task allocation

Country Status (1)

Country Link
CN (1) CN115783602B (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107479403A (en) * 2017-09-14 2017-12-15 长春北方化工灌装设备股份有限公司 Annular RGV semi-matter simulating systems based on virtual reality and run dispatching algorithm without sky
CN111291927A (en) * 2020-01-20 2020-06-16 河北环铁技术开发有限公司 Annular RGV (reduced-size-vector graphics) trolley scheduling method based on SVR (support vector regression) model prediction
CN111474926A (en) * 2020-03-24 2020-07-31 浙江中烟工业有限责任公司 Waste smoke recovery method based on multiple AGV time window path optimization algorithm
CN112224245A (en) * 2020-11-24 2021-01-15 华晟(青岛)智能装备科技有限公司 RGV scheduling method and system for one-rail multiple vehicles
CN112505602A (en) * 2020-11-10 2021-03-16 国网江苏省电力有限公司营销服务中心 Automatic verification scheduling method and system based on multi-type acquisition terminal
CN112907387A (en) * 2021-01-22 2021-06-04 武汉飞恩微电子有限公司 Intelligent scheduling system and method based on automobile pressure sensor production line
CN114445009A (en) * 2022-01-25 2022-05-06 中国船舶重工集团公司第七二四研究所 Intelligent warehousing system and method for micro-assembly materials

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107479403A (en) * 2017-09-14 2017-12-15 长春北方化工灌装设备股份有限公司 Annular RGV semi-matter simulating systems based on virtual reality and run dispatching algorithm without sky
CN111291927A (en) * 2020-01-20 2020-06-16 河北环铁技术开发有限公司 Annular RGV (reduced-size-vector graphics) trolley scheduling method based on SVR (support vector regression) model prediction
CN111474926A (en) * 2020-03-24 2020-07-31 浙江中烟工业有限责任公司 Waste smoke recovery method based on multiple AGV time window path optimization algorithm
CN112505602A (en) * 2020-11-10 2021-03-16 国网江苏省电力有限公司营销服务中心 Automatic verification scheduling method and system based on multi-type acquisition terminal
CN112224245A (en) * 2020-11-24 2021-01-15 华晟(青岛)智能装备科技有限公司 RGV scheduling method and system for one-rail multiple vehicles
CN112907387A (en) * 2021-01-22 2021-06-04 武汉飞恩微电子有限公司 Intelligent scheduling system and method based on automobile pressure sensor production line
CN114445009A (en) * 2022-01-25 2022-05-06 中国船舶重工集团公司第七二四研究所 Intelligent warehousing system and method for micro-assembly materials

Also Published As

Publication number Publication date
CN115783602B (en) 2024-03-08

Similar Documents

Publication Publication Date Title
JP6854966B2 (en) Order processing methods and equipment, servers and storage media
CN204280470U (en) A kind of tiered warehouse facility dispatching system
CN204507907U (en) A kind of storage based on submersible AGV divides integral system
Gao et al. Design of digital twin applications in automated storage yard scheduling
Zhen et al. A review on yard management in container terminals
CN109878964A (en) A kind of pulsating production system based on AGV
CN104555222A (en) Storage and distribution integration system and method based on insert-type AGV
CN109857074A (en) Intelligent logistics system and workshop management system
CN111898908B (en) Production line scheduling system and method based on multiple intelligent objects
Kluska et al. The use of simulation in the design of Milk-Run intralogistics systems
CN113934189A (en) Mobile carrying robot scheduling system and scheduling method
CN109625748A (en) Storage scheduling system and method
CN103197614A (en) Automatic material handling system based on programmable logic controller (PLC) control and control method thereof
Bocewicz et al. Declarative modeling of a milk-run vehicle routing problem for split and merge supply streams scheduling
CN108196541A (en) Automatic guiding carriage dispatching method
CN111861313A (en) Intelligent logistics distribution method based on 5G network
CN114326621B (en) Group intelligent airport consignment car scheduling method and system based on layered architecture
Zoubek et al. Methodology proposal for storage rationalization by implementing principles of industry 4.0. in a technology-driven warehouse
He et al. AGV scheduling optimization for medical waste sorting system
Maoudj et al. The capacitated multi-AGV scheduling problem with conflicting products: Model and a decentralized multi-agent approach
CN113885466A (en) AGV scheduling algorithm simulation system
CN115783602A (en) Annular shuttle vehicle scheduling system and method based on dynamic task allocation
Hu et al. Performance analysis on transfer platforms in frame bridge based automated container terminals
CN109242138B (en) Same-city automatic cargo transfer system based on stack type task management
CN115689448A (en) Warehouse management system and material scheduling device

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