This paper addresses the problem of service composition in military organization cloud cooperation(MOCC). Military service providers(MSP) cooperate together to provide military resources for military service users...This paper addresses the problem of service composition in military organization cloud cooperation(MOCC). Military service providers(MSP) cooperate together to provide military resources for military service users(MSU). A group of atom services, each of which has its level of quality of service(QoS), can be combined together into a certain structure to form a composite service. Since there are a large number of atom services having the same function, the atom service is selected to participate in the composite service so as to fulfill users' will. In this paper a method based on discrete particle swarm optimization(DPSO) is proposed to tackle this problem. The method aims at selecting atom services from service repositories to constitute the composite service, satisfying the MSU's requirement on QoS. Since the QoS criteria include location-aware criteria and location-independent criteria, this method aims to get the composite service with the highest location-aware criteria and the best-match location-independent criteria. Simulations show that the DPSO has a better performance compared with the standard particle swarm optimization(PSO) and genetic algorithm(GA).展开更多
Internet of things(IoT) imposes new challenges on service composition as it is difficult to manage a quick instantiation of a complex services from a growing number of dynamic candidate services. A cross-modified Arti...Internet of things(IoT) imposes new challenges on service composition as it is difficult to manage a quick instantiation of a complex services from a growing number of dynamic candidate services. A cross-modified Artificial Bee Colony Algorithm(CMABC) is proposed to achieve the optimal solution services in an acceptable time and high accuracy. Firstly, web service instantiation model was established. What is more, to overcome the problem of discrete and chaotic solution space, the global optimal solution was used to accelerate convergence rate by imitating the cross operation of Genetic algorithm(GA). The simulation experiment result shows that CMABC exhibited faster convergence speed and better convergence accuracy than some other intelligent optimization algorithms.展开更多
Scheduling is one of the most difficult issues in t he planning and operations of the aircraft services industry. In this paper, t he various scheduling problems in ground support operation of an aircraft mainte nance...Scheduling is one of the most difficult issues in t he planning and operations of the aircraft services industry. In this paper, t he various scheduling problems in ground support operation of an aircraft mainte nance service company are addressed. The authors developed a set of vehicle rout ings to cover each schedule flights; the objectives pursued are the maximization of vehicle and manpower utilization and minimization of operation time. To obta in the goals, an integer-programming model with genetic algorithm is formulated . It is found that the company can produce an effective and efficient schedules to deploy the manpower and equipment resources. Simulation is used to verify the method and a MATLAB program is used to code the genetic algorithm. This model i s further illustrated by a case study in Hong Kong and the benefit elaborated. F inally, a conclusion is made to summarize the experience of this project and pro vide further improvement.展开更多
Large-scale service composition has become an important research topic in Service-Oriented Computing(SOC). Quality of Service(Qo S) has been mostly applied to represent nonfunctional properties of web services and...Large-scale service composition has become an important research topic in Service-Oriented Computing(SOC). Quality of Service(Qo S) has been mostly applied to represent nonfunctional properties of web services and to differentiate those with the same functionality. Many studies for measuring service composition in terms of Qo S have been completed. Among current popular optimization methods for service composition, the exhaustion method has some disadvantages such as requiring a large number of calculations and poor scalability. Similarly,the traditional evolutionary computation method has defects such as exhibiting slow convergence speed and falling easily into the local optimum. In order to solve these problems, an improved optimization algorithm, WS FOA(Web Service composition based on Fruit Fly Optimization Algorithm) for service composition, was proposed, on the basis of the modeling of service composition and the FOA. Simulated experiments demonstrated that the algorithm is effective, feasible, stable, and possesses good global searching ability.展开更多
In existing research,the optimization of algorithms applied to cloud manufacturing service composition based on the quality of service often suffers from decreased convergence rates and solution quality due to single-...In existing research,the optimization of algorithms applied to cloud manufacturing service composition based on the quality of service often suffers from decreased convergence rates and solution quality due to single-population searches in fixed spaces and insufficient information exchange.In this paper,we introduce an improved Sparrow Search Algorithm(ISSA)to address these issues.The fixed solution space is divided into multiple subspaces,allowing for parallel searches that expedite the discovery of target solutions.To enhance search efficiency within these subspaces and significantly improve population diversity,we employ multiple group evolution mechanisms and chaotic perturbation strategies.Furthermore,we incorporate adaptive weights and a global capture strategy based on the golden sine to guide individual discoverers more effectively.Finally,differential Cauchy mutation perturbation is utilized during sparrow position updates to strengthen the algorithm's global optimization capabilities.Simulation experiments on benchmark problems and service composition optimization problems show that the ISSA delivers superior optimization accuracy and convergence stability compared to other methods.These results demonstrate that our approach effectively balances global and local search abilities,leading to enhanced performance in cloud manufacturing service composition.展开更多
基金supported by the National Natural Science Foundation of China(61573283)
文摘This paper addresses the problem of service composition in military organization cloud cooperation(MOCC). Military service providers(MSP) cooperate together to provide military resources for military service users(MSU). A group of atom services, each of which has its level of quality of service(QoS), can be combined together into a certain structure to form a composite service. Since there are a large number of atom services having the same function, the atom service is selected to participate in the composite service so as to fulfill users' will. In this paper a method based on discrete particle swarm optimization(DPSO) is proposed to tackle this problem. The method aims at selecting atom services from service repositories to constitute the composite service, satisfying the MSU's requirement on QoS. Since the QoS criteria include location-aware criteria and location-independent criteria, this method aims to get the composite service with the highest location-aware criteria and the best-match location-independent criteria. Simulations show that the DPSO has a better performance compared with the standard particle swarm optimization(PSO) and genetic algorithm(GA).
基金supported by a grant from the Project "Multifunctional mobile phone R & D and industrialization of the Internet of things" supported by the Project of the Provincial Department of research (2011A090200008)partly supported by National Science and Technology Major Project (No. 2010ZX07102-006)+3 种基金the National Basic Research Program of China (973 Program) (No. 2011CB505402)the Major Program of the National Natural Science Foundation of China (No. 61170117)the National Natural Science Foundation of China (No.61432004)the National Key Research and Development Program (No.2016YFB1001404)
文摘Internet of things(IoT) imposes new challenges on service composition as it is difficult to manage a quick instantiation of a complex services from a growing number of dynamic candidate services. A cross-modified Artificial Bee Colony Algorithm(CMABC) is proposed to achieve the optimal solution services in an acceptable time and high accuracy. Firstly, web service instantiation model was established. What is more, to overcome the problem of discrete and chaotic solution space, the global optimal solution was used to accelerate convergence rate by imitating the cross operation of Genetic algorithm(GA). The simulation experiment result shows that CMABC exhibited faster convergence speed and better convergence accuracy than some other intelligent optimization algorithms.
文摘Scheduling is one of the most difficult issues in t he planning and operations of the aircraft services industry. In this paper, t he various scheduling problems in ground support operation of an aircraft mainte nance service company are addressed. The authors developed a set of vehicle rout ings to cover each schedule flights; the objectives pursued are the maximization of vehicle and manpower utilization and minimization of operation time. To obta in the goals, an integer-programming model with genetic algorithm is formulated . It is found that the company can produce an effective and efficient schedules to deploy the manpower and equipment resources. Simulation is used to verify the method and a MATLAB program is used to code the genetic algorithm. This model i s further illustrated by a case study in Hong Kong and the benefit elaborated. F inally, a conclusion is made to summarize the experience of this project and pro vide further improvement.
基金supported by the National Natural Science Foundation of China (Nos. 61402006 and 61202227)the Natural Science Foundation of Anhui Province of China (No. 1408085MF132)+2 种基金the Science and Technology Planning Project of Anhui Province of China (No. 1301032162)the College Students Scientific Research Training Program (No. KYXL2014060)the 211 Project of Anhui University (No. 02303301)
文摘Large-scale service composition has become an important research topic in Service-Oriented Computing(SOC). Quality of Service(Qo S) has been mostly applied to represent nonfunctional properties of web services and to differentiate those with the same functionality. Many studies for measuring service composition in terms of Qo S have been completed. Among current popular optimization methods for service composition, the exhaustion method has some disadvantages such as requiring a large number of calculations and poor scalability. Similarly,the traditional evolutionary computation method has defects such as exhibiting slow convergence speed and falling easily into the local optimum. In order to solve these problems, an improved optimization algorithm, WS FOA(Web Service composition based on Fruit Fly Optimization Algorithm) for service composition, was proposed, on the basis of the modeling of service composition and the FOA. Simulated experiments demonstrated that the algorithm is effective, feasible, stable, and possesses good global searching ability.
基金Supported by the National Natural Science Foundation of China(62272214)。
文摘In existing research,the optimization of algorithms applied to cloud manufacturing service composition based on the quality of service often suffers from decreased convergence rates and solution quality due to single-population searches in fixed spaces and insufficient information exchange.In this paper,we introduce an improved Sparrow Search Algorithm(ISSA)to address these issues.The fixed solution space is divided into multiple subspaces,allowing for parallel searches that expedite the discovery of target solutions.To enhance search efficiency within these subspaces and significantly improve population diversity,we employ multiple group evolution mechanisms and chaotic perturbation strategies.Furthermore,we incorporate adaptive weights and a global capture strategy based on the golden sine to guide individual discoverers more effectively.Finally,differential Cauchy mutation perturbation is utilized during sparrow position updates to strengthen the algorithm's global optimization capabilities.Simulation experiments on benchmark problems and service composition optimization problems show that the ISSA delivers superior optimization accuracy and convergence stability compared to other methods.These results demonstrate that our approach effectively balances global and local search abilities,leading to enhanced performance in cloud manufacturing service composition.