Author/Authors :
He, Xueting School of Management - Shanghai University, Shanghai, China , Quan, Hao Shibei Hospital - Jing’an District, Shanghai, China , Lin, Wanlong Shanghai No. 3 Rehabilitation Hospital, China , Deng, Weiliang School of Management - Shanghai University, Shanghai, China , Tan, Zheyi School of Management - Shanghai University, Shanghai, China
Abstract :
The dramatic increase in medical waste has put a severe strain on sorting operations. Traditional manual order picking is extremely susceptible to infection spread among workers and picking errors, while automated medical waste sorting systems can handle large volumes of medical waste efficiently and reliably. This paper investigates the optimization problem in the automated medical waste sorting system by considering the operational flow of medical waste. For this purpose, a mixed-integer programming model is developed to optimize the assignment among medical waste, presorting stations, and AGVs. An effective variable neighborhood search based on dynamic programming algorithm is proposed, and extensive numerical experiments are conducted. It is found that the proposed algorithm can efficiently solve the optimization problem, and the sensitivity analysis gives recommendations for the speed setting of the conveyor.
Keywords :
AGV , Scheduling , ptimization , Medical Waste Sorting System
