Mutation-Based Harmony Search Algorithm for Hybrid Testing of Web Service Composition

Maythaisong, Eckwijai; Songpan, Wararat

doi:10.1155/2018/4759405

Cited by 5 publications

(3 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Through the orderly choreography of different services connected to cloud services, the efficiency of cloud manufacturing service system can be effectively improved. Maythaisong and Songpan [ 5 ] proposed mutation-based harmony search algorithm to select web services and to compose with minimum defects. This algorithm can help find appropriate solutions to compose services based on business plans.…”

Section: Related Workmentioning

confidence: 99%

Dynamic Collaboration Model of Production Network Based on Cloud Service Bus

Zhao

Liu

2022

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

The IT system of manufacturing enterprises usually has many problems, such as complex industrial software, different development languages, diverse communication protocols, and complex operation environment. Cloud service bus (CSB) technology based on service model encapsulates various applications existing in enterprises by means of the integration of cloud service bus and micro services, which can realize the rapid cloud migration and deployment of heterogeneous industrial application software. Theoretically, after the production system is connected to CSB, it can be arranged arbitrarily by service choreography technology to produce any possible products. However, in the context of industrial Internet, the production system connected to CSB corresponds to the equipment, materials, personnel, and other resources on the production line one by one. These production nodes need to consider the production capacity and cost of production service nodes and the output value of the whole production network, and cannot be combined arbitrarily. Therefore, when integrating production service nodes, we should not only consider the technical integration, but also consider whether the production conditions support this integration. To solve the problem of production node integration in CSB, a dynamic collaboration model of production network based on cloud service bus is proposed in this paper. The model takes the capacity, cost, and production relationship of production nodes as constraints, and the overall efficiency of production network as the optimization goal. The model can calculate the new creation, modification, deletion, and other scheduling operations of production line services in real time and give the production plan with the highest resource utilization and the greatest value in the current production network. The model can improve the rationality and economy of service choreography and give full play to the value of production network. Taking an enterprise with 11 production nodes and 5 production lines as an example, this paper discusses in detail how to use this model to calculate the optimal production organization scheme and the maximum output value of the enterprise.

show abstract

Section: Related Workmentioning

confidence: 99%

Dynamic Collaboration Model of Production Network Based on Cloud Service Bus

Zhao

Liu

2022

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

show abstract

“…A hybrid approach is proposed for the automatic composition of Web services that generates semantic input-output based compositions with optimal end-to-end QoS, minimizing the number of services of the resulting composition [7]. A mutation-based harmonious search (MBHS) algorithm is therefore proposed to select Web services and compose with the fewest defects [8], but they did not consider the algorithm's global search capability and algorithm's stability. TAN Wenan [9] proposed an improved Flower Pollination Algorithm (IFPA) to solve the problem of Web service composition.…”

Section: Related Workmentioning

confidence: 99%

Global Optimization Algorithm for Cloud Service Composition

Yang

Xue

Liu

et al. 2021

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

Service composition optimization is a classic NP-hard problem. How to quickly select high-quality services that meet user needs from a large number of candidate services is a hot topic in cloud service composition research. An efficient second-order beetle swarm optimization is proposed with a global search ability to solve the problem of cloud service composition optimization in this study. First, the beetle antennae search algorithm is introduced into the modified particle swarm optimization algorithm, initialize the population bying using a chaotic sequence, and the modified nonlinear dynamic trigonometric learning factors are adopted to control the expanding capacity of particles and global convergence capability. Second, modified secondary oscillation factors are incorporated, increasing the search precision of the algorithm and global searching ability. An adaptive step adjustment is utilized to improve the stability of the algorithm. Experimental results founded on a real data set indicated that the proposed global optimization algorithm can solve web service composition optimization problems in a cloud environment. It exhibits excellent global searching ability, has comparatively fast convergence speed, favorable stability, and requires less time cost.

show abstract

“…A mutation-based harmony search (MBHS) algorithm is implemented in [39]. Where the idea is to modify the mutation parameter that can be combined and that supports different web services under the minimum number of defects (with the fewest number of restriction violations).…”

Section: State Of the Art In Hs Versions Focused On Parameters Improvements For The Last 10 Yearsmentioning

confidence: 99%

A Comparative Study of Improved Harmony Search Algorithm in Four Bar Mechanisms

et al. 2020

View full text Add to dashboard Cite

There are problems that are difficult to solve through mathematical programming or by classical methods. These problems are called hard problems due to their high complexity or high dimension. On the other hand, mataheuristics intends to seek a better solution to a problem. The Improvement Harmony Search algorithm is proposed under modification of the bandwidth parameter increasing the quality of the exploitation of the solutions. That is why within the state of the art, are mentioned several versions of harmonic search. The state of the art is supports the fact that the algorithm belongs to the category of those who make modifications to its parameters. This research demonstrates the ability of ImHS to solve a problem of high complexity focused on solving four-bar mechanism designs, whose solutions imply high dimension and which are also classified as hard problems. The two problems that are solved in this investigation, are problems very attacked within the state of the art by various metaheuristics. A comparison is then made against previous solutions with traditional metaheuristics and other versions of harmony search algorithm. Finally, the effectiveness of performance is demonstrated, where proposed algorithm it exceeded five metaheuristic algorithms and five harmony search versions. An optimum is provided in an easy and useful way, the parametric statistics are improved and the number of feasible solutions is exceeded in NPhard problems as in the case of problems with four-bar mechanisms.INDEX TERMS algorithms performance, four-bar mechanism, improved harmony search, optimization problems, mechatronic.

show abstract

Mutation-Based Harmony Search Algorithm for Hybrid Testing of Web Service Composition

Cited by 5 publications

References 48 publications

Dynamic Collaboration Model of Production Network Based on Cloud Service Bus

Dynamic Collaboration Model of Production Network Based on Cloud Service Bus

Global Optimization Algorithm for Cloud Service Composition

A Comparative Study of Improved Harmony Search Algorithm in Four Bar Mechanisms

Contact Info

Product

Resources

About