This paper describes a method of multiple cranes assignment to operators who call cranes in a factory. Due to a crane moving on a rail, there is a restriction on the movement. Therefore, the crane cannot be delivered without proper assignment. To solve the cranes assignment problem, we propose two methods. The first is the optimal solution search method which finds the minimum travel distance combination from the number of cases that are derived by calculating the distance between all the cranes and all the operators. The second is the dynamic mapping method which finds the number of operators between each crane. Simulation results show that the dynamic mapping method sometimes performs the same assignment results as the optimal solution search method, but on average, the result of dynamic mapping method is farther than the optimal solution as the number of cranes increases. When partial regions are created by using the dynamic mapping method and an optimal solution search method is applied to each region, optimal solutions can be acquired while reducing the number of calculations.
Published inIOP Conference Series: Materials Science and Engineering
Date19 / Jul / 18
Place/CountryTokyo / Japan
Name of Conference / Workshop / Event2018 International Conference on Mechanics and Mechatronics Research (ICMMR)
Author(s)Seung-Jun Lee, Yang Koo Lee and Daesub Yoon
Privacy & Cookies Policy
Necessary cookies are absolutely essential for the website to function properly. This category only includes cookies that ensures basic functionalities and security features of the website. These cookies do not store any personal information.
Any cookies that may not be particularly necessary for the website to function and is used specifically to collect user personal data via analytics, ads, other embedded contents are termed as non-necessary cookies. It is mandatory to procure user consent prior to running these cookies on your website.