Optimization of the Storage Spaces and the Storing Route of the Pharmaceutical Logistics Robot
Auto drug distribution systems are used popularly to replace pharmacists when drugs are distributed in pharmacies. The Cartesian robot is usually used as the recovery mechanism. Under non-dynamic storage location conditions, generally, the selected planning route of the Cartesian robot is definite,...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-03-01
|
| Series: | Actuators |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-0825/12/3/133 |
| _version_ | 1797614151301857280 |
|---|---|
| author | Ling Zhang Shiqing Lu Mulin Luo Bin Dong |
| author_facet | Ling Zhang Shiqing Lu Mulin Luo Bin Dong |
| author_sort | Ling Zhang |
| collection | DOAJ |
| description | Auto drug distribution systems are used popularly to replace pharmacists when drugs are distributed in pharmacies. The Cartesian robot is usually used as the recovery mechanism. Under non-dynamic storage location conditions, generally, the selected planning route of the Cartesian robot is definite, which makes it difficult to optimize. In this paper, storage spaces were distributed for different drugs, and the route of storing was broken down into multiple path optimization problems for limited pick points. The path was chosen by an improved ant colony algorithm. Experiments showed that the algorithm can plan an effective storing route in the simulation and actual operation of the robot. The time spent on the route by improved ant colony algorithm sequence (IACS) was less than the time spent of route by random sequence (RS) and the time spent of route by traditional ant colony algorithm sequence (ACS); compared with RS, the optimized rate of restoring time with iacs can improve by 22.04% in simulation and 7.35% in operation. Compared with ACS, the optimized rate of restoring time with iacs was even more than 4.70% in simulation and 1.57% in operation. To the Cartesian robot, the optimization has certain guiding significance of the application on the 3D for improving quality. |
| first_indexed | 2024-03-11T07:05:44Z |
| format | Article |
| id | doaj.art-8fde3a5efbb9427c9b5b77e501c8eb66 |
| institution | Directory Open Access Journal |
| issn | 2076-0825 |
| language | English |
| last_indexed | 2024-03-11T07:05:44Z |
| publishDate | 2023-03-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Actuators |
| spelling | doaj.art-8fde3a5efbb9427c9b5b77e501c8eb662023-11-17T08:57:08ZengMDPI AGActuators2076-08252023-03-0112313310.3390/act12030133Optimization of the Storage Spaces and the Storing Route of the Pharmaceutical Logistics RobotLing Zhang0Shiqing Lu1Mulin Luo2Bin Dong3Mechanical Engineering and Automation College, Chongqing Industry Polytechnic College, Yubei District, Chongqing 400050, ChinaSchool of Mechanical Engineering, Chongqing University of Technology, Banan District, Chongqing 400045, ChinaSchool of Mechanical Engineering, Chongqing University of Technology, Banan District, Chongqing 400045, ChinaChongqing Dile Jinchi General Machinery Co., Ltd., Chongqing 401320, ChinaAuto drug distribution systems are used popularly to replace pharmacists when drugs are distributed in pharmacies. The Cartesian robot is usually used as the recovery mechanism. Under non-dynamic storage location conditions, generally, the selected planning route of the Cartesian robot is definite, which makes it difficult to optimize. In this paper, storage spaces were distributed for different drugs, and the route of storing was broken down into multiple path optimization problems for limited pick points. The path was chosen by an improved ant colony algorithm. Experiments showed that the algorithm can plan an effective storing route in the simulation and actual operation of the robot. The time spent on the route by improved ant colony algorithm sequence (IACS) was less than the time spent of route by random sequence (RS) and the time spent of route by traditional ant colony algorithm sequence (ACS); compared with RS, the optimized rate of restoring time with iacs can improve by 22.04% in simulation and 7.35% in operation. Compared with ACS, the optimized rate of restoring time with iacs was even more than 4.70% in simulation and 1.57% in operation. To the Cartesian robot, the optimization has certain guiding significance of the application on the 3D for improving quality.https://www.mdpi.com/2076-0825/12/3/133Cartesian robotstoring routeant colony algorithm |
| spellingShingle | Ling Zhang Shiqing Lu Mulin Luo Bin Dong Optimization of the Storage Spaces and the Storing Route of the Pharmaceutical Logistics Robot Actuators Cartesian robot storing route ant colony algorithm |
| title | Optimization of the Storage Spaces and the Storing Route of the Pharmaceutical Logistics Robot |
| title_full | Optimization of the Storage Spaces and the Storing Route of the Pharmaceutical Logistics Robot |
| title_fullStr | Optimization of the Storage Spaces and the Storing Route of the Pharmaceutical Logistics Robot |
| title_full_unstemmed | Optimization of the Storage Spaces and the Storing Route of the Pharmaceutical Logistics Robot |
| title_short | Optimization of the Storage Spaces and the Storing Route of the Pharmaceutical Logistics Robot |
| title_sort | optimization of the storage spaces and the storing route of the pharmaceutical logistics robot |
| topic | Cartesian robot storing route ant colony algorithm |
| url | https://www.mdpi.com/2076-0825/12/3/133 |
| work_keys_str_mv | AT lingzhang optimizationofthestoragespacesandthestoringrouteofthepharmaceuticallogisticsrobot AT shiqinglu optimizationofthestoragespacesandthestoringrouteofthepharmaceuticallogisticsrobot AT mulinluo optimizationofthestoragespacesandthestoringrouteofthepharmaceuticallogisticsrobot AT bindong optimizationofthestoragespacesandthestoringrouteofthepharmaceuticallogisticsrobot |