E. G. Dayıoğlu, Kenan Karagül, Yusuf Şahin, M. Kay
{"title":"模块化仓库系统的路径规划方法","authors":"E. G. Dayıoğlu, Kenan Karagül, Yusuf Şahin, M. Kay","doi":"10.11121/ijocta.01.2020.00752","DOIUrl":null,"url":null,"abstract":"In this study, procedures are presented that can be used to determine the routes of the packages transported within a modular storage system. The problem is a variant of robot motion planning problem. The structures of the procedures are developed in three steps for the simultaneous movement of multiple unit-sized packages in a modular warehouse. The proposed heuristic methods consist of route planning, tagging, and main control components. In order to demonstrate the solution performance of the methods, various experiments were conducted with different data sets and the solution times and qualities of the proposed methods were compared with previous studies. It was found that the proposed methods provide better solutions when taking the number of steps and solution time into consideration.","PeriodicalId":37369,"journal":{"name":"International Journal of Optimization and Control: Theories and Applications","volume":"125 1","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Route planning methods for a modular warehouse system\",\"authors\":\"E. G. Dayıoğlu, Kenan Karagül, Yusuf Şahin, M. Kay\",\"doi\":\"10.11121/ijocta.01.2020.00752\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this study, procedures are presented that can be used to determine the routes of the packages transported within a modular storage system. The problem is a variant of robot motion planning problem. The structures of the procedures are developed in three steps for the simultaneous movement of multiple unit-sized packages in a modular warehouse. The proposed heuristic methods consist of route planning, tagging, and main control components. In order to demonstrate the solution performance of the methods, various experiments were conducted with different data sets and the solution times and qualities of the proposed methods were compared with previous studies. It was found that the proposed methods provide better solutions when taking the number of steps and solution time into consideration.\",\"PeriodicalId\":37369,\"journal\":{\"name\":\"International Journal of Optimization and Control: Theories and Applications\",\"volume\":\"125 1\",\"pages\":\"\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2019-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Optimization and Control: Theories and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.11121/ijocta.01.2020.00752\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Optimization and Control: Theories and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11121/ijocta.01.2020.00752","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Route planning methods for a modular warehouse system
In this study, procedures are presented that can be used to determine the routes of the packages transported within a modular storage system. The problem is a variant of robot motion planning problem. The structures of the procedures are developed in three steps for the simultaneous movement of multiple unit-sized packages in a modular warehouse. The proposed heuristic methods consist of route planning, tagging, and main control components. In order to demonstrate the solution performance of the methods, various experiments were conducted with different data sets and the solution times and qualities of the proposed methods were compared with previous studies. It was found that the proposed methods provide better solutions when taking the number of steps and solution time into consideration.