This paper focuses on the optimization method for multi-skilled painting personnel scheduling.The budget working time analysis is carried out considering the influence of operating area,difficulty of spraying area,mul...This paper focuses on the optimization method for multi-skilled painting personnel scheduling.The budget working time analysis is carried out considering the influence of operating area,difficulty of spraying area,multi-skilled workers,and worker’s efficiency,then a mathematical model is established to minimize the completion time. The constraints of task priority,paint preparation,pump management,and neighbor avoidance in the ship block painting production are considered. Based on this model,an improved scatter search(ISS)algorithm is designed,and the hybrid approximate dynamic programming(ADP)algorithm is used to improve search efficiency. In addition,the two solution combination methods of path-relinking and task sequence combination are used to enhance the search breadth and depth. The numerical experimental results show that ISS has a significant advantage in solving efficiency compared with the solver in small scale instances;Compared with the scatter search algorithm and genetic algorithm,ISS can stably improve the solution quality. Verified by the production example,ISS effectively shortens the total completion time of the production,which is suitable for scheduling problems in the actual painting production of the shipyard.展开更多
Constrained clustering,such as k-means with instance-level Must-Link(ML)and Cannot-Link(CL)auxiliary information as the constraints,has been extensively studied recently,due to its broad applications in data science a...Constrained clustering,such as k-means with instance-level Must-Link(ML)and Cannot-Link(CL)auxiliary information as the constraints,has been extensively studied recently,due to its broad applications in data science and AI.Despite some heuristic approaches,there has not been any algorithm providing a non-trivial approximation ratio to the constrained k-means problem.To address this issue,we propose an algorithm with a provable approximation ratio of O(logk)when only ML constraints are considered.We also empirically evaluate the performance of our algorithm on real-world datasets having artificial ML and disjoint CL constraints.The experimental results show that our algorithm outperforms the existing greedy-based heuristic methods in clustering accuracy.展开更多
颗粒粒度反演需要求解第一类Fredholm积分方程,此问题是动态光散射中的难点之一,其中,双峰颗粒的反演更是亟待解决的问题.为保证反演结果的非负性,采用了trust region reflective Newton和active set算法实现的非负Tikhonov,非负TSVD算...颗粒粒度反演需要求解第一类Fredholm积分方程,此问题是动态光散射中的难点之一,其中,双峰颗粒的反演更是亟待解决的问题.为保证反演结果的非负性,采用了trust region reflective Newton和active set算法实现的非负Tikhonov,非负TSVD算法对双峰颗粒数据进行了反演.结果表明采用前者实现的非负Tikhonov和非负TSVD不能区别间隔粒径较近双峰,而采用后者实现的非负Tikhonov和非负TSVD能区别出.展开更多
基金Sponsored by the Ministry of Industry and Information Technology of China(Grant No.MIIT[2019]359)。
文摘This paper focuses on the optimization method for multi-skilled painting personnel scheduling.The budget working time analysis is carried out considering the influence of operating area,difficulty of spraying area,multi-skilled workers,and worker’s efficiency,then a mathematical model is established to minimize the completion time. The constraints of task priority,paint preparation,pump management,and neighbor avoidance in the ship block painting production are considered. Based on this model,an improved scatter search(ISS)algorithm is designed,and the hybrid approximate dynamic programming(ADP)algorithm is used to improve search efficiency. In addition,the two solution combination methods of path-relinking and task sequence combination are used to enhance the search breadth and depth. The numerical experimental results show that ISS has a significant advantage in solving efficiency compared with the solver in small scale instances;Compared with the scatter search algorithm and genetic algorithm,ISS can stably improve the solution quality. Verified by the production example,ISS effectively shortens the total completion time of the production,which is suitable for scheduling problems in the actual painting production of the shipyard.
基金This work was supported by the National Natural Science Foundation of China(Nos.12271098 and 61772005)the Outstanding Youth Innovation Team Project for Universities of Shandong Province(No.2020KJN008)。
文摘Constrained clustering,such as k-means with instance-level Must-Link(ML)and Cannot-Link(CL)auxiliary information as the constraints,has been extensively studied recently,due to its broad applications in data science and AI.Despite some heuristic approaches,there has not been any algorithm providing a non-trivial approximation ratio to the constrained k-means problem.To address this issue,we propose an algorithm with a provable approximation ratio of O(logk)when only ML constraints are considered.We also empirically evaluate the performance of our algorithm on real-world datasets having artificial ML and disjoint CL constraints.The experimental results show that our algorithm outperforms the existing greedy-based heuristic methods in clustering accuracy.
文摘颗粒粒度反演需要求解第一类Fredholm积分方程,此问题是动态光散射中的难点之一,其中,双峰颗粒的反演更是亟待解决的问题.为保证反演结果的非负性,采用了trust region reflective Newton和active set算法实现的非负Tikhonov,非负TSVD算法对双峰颗粒数据进行了反演.结果表明采用前者实现的非负Tikhonov和非负TSVD不能区别间隔粒径较近双峰,而采用后者实现的非负Tikhonov和非负TSVD能区别出.
