A Heuristic Algorithm for Optimal Service Composition in Complex Manufacturing Networks
Service composition in a Cloud Manufacturing environment involves the adaptive and optimal assembly of manufacturing services to achieve quick responses to varied manufacturing needs. It is challenged by the inherent heterogeneity and complexity of these services in terms of their diverse and comple...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2019-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2019/7819523 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850173429613854720 |
|---|---|
| author | Yinan Wu Gongzhuang Peng Hongwei Wang Heming Zhang |
| author_facet | Yinan Wu Gongzhuang Peng Hongwei Wang Heming Zhang |
| author_sort | Yinan Wu |
| collection | DOAJ |
| description | Service composition in a Cloud Manufacturing environment involves the adaptive and optimal assembly of manufacturing services to achieve quick responses to varied manufacturing needs. It is challenged by the inherent heterogeneity and complexity of these services in terms of their diverse and complex functions, qualities of service, execution paths, etc. In this paper, a manufacturing network is constructed to explicitly identify and describe the relationships between individual services based on their attributes. On this basis, the service composition problem can be modeled as a multiple-constrained optimal path (MCOP) selection problem by taking into account different types of composition, namely, sequence, parallel, selection, and cycle. A novel Dual Heuristic Functions based Optimal Service Composition Path algorithm (DHA_OSCP) is proposed to solve the NP-Complete MCOP problem, which involves exploiting the backward search procedure with different search targets to obtain two heuristic functions for the forward search procedure. The proposed algorithm is evaluated through a set of computational experiments in which the proposed algorithm and other popular algorithms such as MFPB_HOSTP are applied to the same dataset, and the results obtained show that DHA_OSCP can efficiently find the optimal service composition path with better Quality of Service (QoS). The viability of DHA_OSCP is further proved in a case study of services composition on a Cloud Manufacturing platform. |
| format | Article |
| id | doaj-art-d3093c942e324d73b8d390a2193ba23b |
| institution | OA Journals |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2019-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-d3093c942e324d73b8d390a2193ba23b2025-08-20T02:19:51ZengWileyComplexity1076-27871099-05262019-01-01201910.1155/2019/78195237819523A Heuristic Algorithm for Optimal Service Composition in Complex Manufacturing NetworksYinan Wu0Gongzhuang Peng1Hongwei Wang2Heming Zhang3Department of Automation, Tsinghua University, Beijing 100084, ChinaEngineering Research Institute, University of Science and Technology Beijing, Beijing 100083, ChinaZJU-UIUC Institute, Zhejiang University, 314400 Haining, ChinaDepartment of Automation, Tsinghua University, Beijing 100084, ChinaService composition in a Cloud Manufacturing environment involves the adaptive and optimal assembly of manufacturing services to achieve quick responses to varied manufacturing needs. It is challenged by the inherent heterogeneity and complexity of these services in terms of their diverse and complex functions, qualities of service, execution paths, etc. In this paper, a manufacturing network is constructed to explicitly identify and describe the relationships between individual services based on their attributes. On this basis, the service composition problem can be modeled as a multiple-constrained optimal path (MCOP) selection problem by taking into account different types of composition, namely, sequence, parallel, selection, and cycle. A novel Dual Heuristic Functions based Optimal Service Composition Path algorithm (DHA_OSCP) is proposed to solve the NP-Complete MCOP problem, which involves exploiting the backward search procedure with different search targets to obtain two heuristic functions for the forward search procedure. The proposed algorithm is evaluated through a set of computational experiments in which the proposed algorithm and other popular algorithms such as MFPB_HOSTP are applied to the same dataset, and the results obtained show that DHA_OSCP can efficiently find the optimal service composition path with better Quality of Service (QoS). The viability of DHA_OSCP is further proved in a case study of services composition on a Cloud Manufacturing platform.http://dx.doi.org/10.1155/2019/7819523 |
| spellingShingle | Yinan Wu Gongzhuang Peng Hongwei Wang Heming Zhang A Heuristic Algorithm for Optimal Service Composition in Complex Manufacturing Networks Complexity |
| title | A Heuristic Algorithm for Optimal Service Composition in Complex Manufacturing Networks |
| title_full | A Heuristic Algorithm for Optimal Service Composition in Complex Manufacturing Networks |
| title_fullStr | A Heuristic Algorithm for Optimal Service Composition in Complex Manufacturing Networks |
| title_full_unstemmed | A Heuristic Algorithm for Optimal Service Composition in Complex Manufacturing Networks |
| title_short | A Heuristic Algorithm for Optimal Service Composition in Complex Manufacturing Networks |
| title_sort | heuristic algorithm for optimal service composition in complex manufacturing networks |
| url | http://dx.doi.org/10.1155/2019/7819523 |
| work_keys_str_mv | AT yinanwu aheuristicalgorithmforoptimalservicecompositionincomplexmanufacturingnetworks AT gongzhuangpeng aheuristicalgorithmforoptimalservicecompositionincomplexmanufacturingnetworks AT hongweiwang aheuristicalgorithmforoptimalservicecompositionincomplexmanufacturingnetworks AT hemingzhang aheuristicalgorithmforoptimalservicecompositionincomplexmanufacturingnetworks AT yinanwu heuristicalgorithmforoptimalservicecompositionincomplexmanufacturingnetworks AT gongzhuangpeng heuristicalgorithmforoptimalservicecompositionincomplexmanufacturingnetworks AT hongweiwang heuristicalgorithmforoptimalservicecompositionincomplexmanufacturingnetworks AT hemingzhang heuristicalgorithmforoptimalservicecompositionincomplexmanufacturingnetworks |