A classification-based approach for integrated service matching and composition in cloud manufacturing. (December 2020)

• Record Type: Journal Article
• Authors: Bouzary, Hamed; Chen, F. Frank
• Is Part Of: Robotics and computer-integrated manufacturing. Volume 66(2020)
• Publication Date: 2020-12
• Subjects: Cloud manufacturing -- Service matching -- Service composition -- Classification algorithms -- Candidate sets retrieval; Robots, Industrial -- Periodicals; Computer integrated manufacturing systems -- Periodicals; Robotics -- Periodicals; Robots industriels -- Périodiques; Productique -- Périodiques; Robotique -- Périodiques; 670.285
• DOI: 10.1016/j.rcim.2020.101989
• Languages: English
• ISSNs: 0736-5845

Abstract

Highlights: Retrieval of candidate sets is added to the service composition problem in CMfg. Five supervised classification algorithms are used for retrieving candidate sets. Two well-known metaheuristics are implemented for optimal composition of services. The advantages of the proposed framework is proven through a set of experiments. Abstract: Cloud manufacturing has been acknowledged as a transformative manufacturing paradigm aiming towards producing highly customized products via sharing distributed manufacturing resources and capabilities. One of the pivotal challenges regarding the practical realization of this idea is the process of matching manufacturing resources with personalized service demands. This problem contains two main steps: (1) retrieval of functionally similar services through assessing semantic similarity between resources' and subtasks' descriptions and (2) optimal composition of subtasks according to non-functional quality of service (QoS) indexes. However, almost all the research work in the field so far has focused on tackling each of these dimensions individually which barely represents actual conditions of the cloud manufacturing paradigm. To this end, this paper aims towards a novel integrated approach that first, successfully retrieves candidate sets for each corresponding subtask via implementing five classification algorithms and using TF-IDF (term frequency–inverse document frequency) vectors extracted from the manufacturing capability data. Then, optimal composite services are obtained for each scenario by using two well-known metaheuristic algorithms. Results obtained from the experiments have proven the advantages of this method resulting in a more comprehensive and realistic way for dealing with the service composition problems.