scholarly journals A Forager Adjustment Strategy Used by the Bees Algorithm for Solving Optimization Problems in Cloud Manufacturing

Author(s):  
Yongquan Xie ◽  
Zude Zhou ◽  
Duc Truong Pham ◽  
Quan Liu ◽  
Wenjun Xu ◽  
...  

Intelligent technologies have become increasingly important in manufacturing nowadays. Optimal service management and allocation in current cloud manufacturing model are impossible without applications of appropriate intelligent tools. The Bees Algorithm (BA) is a swarm-based intelligent optimizer that provides support for smart decision-making process in manufacturing models. A novel forager adjustment strategy (FAS) is proposed in this paper to manage the forager division in the algorithm, so as to make the entire colony perform with higher efficiency. The proposed FAS based Bees Algorithm (FAS-BA) is able to realize flexible allocation of its forager resources between different roles in accordance with the solution fitness sampled by current scout population. The proposed algorithm is presented in detail. Experiments are conducted based on a set of well-known benchmark functions and a case study. Comparisons between FAS-BA and an improved Bees Algorithm are made to highlight the effectiveness of FAS. The results demonstrate that the proposed algorithm requires less function evaluation cost than the improved version but is capable of obtaining at least the same optimal solution to a problem.

Author(s):  
Ahmed T. Sadiq Al-Obaidi ◽  
Hasanen S. Abdullah ◽  
Zied O. Ahmed

<p>Evolutionary computation and swarm intelligence meta-heuristics are exceptional instances that environment has been a never-ending source of creativeness. The behavior of bees, bacteria, glow-worms, fireflies and other beings have stirred swarm intelligence scholars to create innovative optimization algorithms. This paper proposes the Meerkat Clan Algorithm (MCA) that is a novel swarm intelligence algorithm resulting from watchful observation of the Meerkat (Suricata suricatta) in the Kalahari Desert in southern Africa. This animal shows an exceptional intelligence, tactical organizational skills, and remarkable directional cleverness in its traversal of the desert when searching for food. A Meerkat Clan Algorithm (MCA) proposed to solve the optimization problems through reach the optimal solution by efficient way comparing with another swarm intelligence. Traveling Salesman Problem uses as a case study to measure the capacity of the proposed algorithm through comparing its results with another swarm intelligence. MCA shows its capacity to solve the Traveling Salesman’s Problem. Its dived the solutions group to sub-group depend of meerkat behavior that gives a good diversity to reach an optimal solution. Paralleled with the current algorithms for resolving TSP by swarm intelligence, it has been displayed that the size of the resolved problems could be enlarged by adopting the algorithm proposed here.</p>


2015 ◽  
Vol 764-765 ◽  
pp. 305-308
Author(s):  
Kuang Hung Hsien ◽  
Shyh Chour Huang

In this paper, hybrid weights-utility and Taguchi method is proposed to solve multi-objective optimization problems. The new method combines the Taguchi method and the weights-utility concept. The weights of the objective function and overall utility values are very important for the weights-utility, and must be set correctly in order to obtain an optimal solution. Application of this method to engineering design problems is illustrated with the aid of one case study, and the result shows that the weights-utlity method is able to handle multi-objective optimization problems, with an optimal solution which better meets the demand of multi-objective optimization problems than the utility concept does.


Author(s):  
Meng Yu ◽  
Wenjun Xu ◽  
Jiwei Hu ◽  
Zude Zhou ◽  
Duc Truong Pham

Cloud manufacturing (CMfg) aims to realize the full-scale sharing, free circulation and transaction, and on-demand use of various manufacturing resources and capabilities in the form of manufacturing services. During the whole product life-cycle, the number of manufacturing services is huge, and services are highly dynamic and changeful. Without the effective operation and technical support of manufacturing service management, the implementation and aim of CMfg could not be achieved. In this paper, a multi-layer model of manufacturing service is proposed for a job shop in cloud manufacturing, in order to solve the description problem of different manufacturing services from different level view, e.g. machine level, process level and shop level. Consequently, a hypergraph-based network model of manufacturing service is developed, so as to facilitate the management of different services during the whole production process in job shop. A case study and some applications of the proposed model for supporting the manufacturing services management to practical manufacturing system are studied, to demonstrate the feasibility and efficiency of such model.


Author(s):  
Ahmed T. Sadiq Al-Obaidi ◽  
Hasanen S. Abdullah ◽  
Zied O. Ahmed

Swarm Intelligence (SI) is a discipline that deals with artificial and naturalsystems which study the collective behaviors of social insects or animals. Camel HerdsAlgorithm (CHA) have been proposed as a new swarm intelligent algorithm in this work.The proposed algorithm depends on the behavior of the camel in the natural wild, takinginto consideration that there is a leader for each herd, food and water searchingdepending on humidity value with neighboring strategy. The Flexible Job Shop SchedulingProblem (FJSP) have been addressed as a case study to confirm the proposed algorithm.The trial result showed that the CHA is a good strategy to find the optimal solution inproblem space.


2021 ◽  
Vol 11 (13) ◽  
pp. 5826
Author(s):  
Evangelos Axiotis ◽  
Andreas Kontogiannis ◽  
Eleftherios Kalpoutzakis ◽  
George Giannakopoulos

Ethnopharmacology experts face several challenges when identifying and retrieving documents and resources related to their scientific focus. The volume of sources that need to be monitored, the variety of formats utilized, and the different quality of language use across sources present some of what we call “big data” challenges in the analysis of this data. This study aims to understand if and how experts can be supported effectively through intelligent tools in the task of ethnopharmacological literature research. To this end, we utilize a real case study of ethnopharmacology research aimed at the southern Balkans and the coastal zone of Asia Minor. Thus, we propose a methodology for more efficient research in ethnopharmacology. Our work follows an “expert–apprentice” paradigm in an automatic URL extraction process, through crawling, where the apprentice is a machine learning (ML) algorithm, utilizing a combination of active learning (AL) and reinforcement learning (RL), and the expert is the human researcher. ML-powered research improved the effectiveness and efficiency of the domain expert by 3.1 and 5.14 times, respectively, fetching a total number of 420 relevant ethnopharmacological documents in only 7 h versus an estimated 36 h of human-expert effort. Therefore, utilizing artificial intelligence (AI) tools to support the researcher can boost the efficiency and effectiveness of the identification and retrieval of appropriate documents.


2019 ◽  
Vol 11 (9) ◽  
pp. 2619 ◽  
Author(s):  
Wei He ◽  
Guozhu Jia ◽  
Hengshan Zong ◽  
Jili Kong

Service management in cloud manufacturing (CMfg), especially the service selection and scheduling (SSS) problem has aroused general attention due to its broad industrial application prospects. Due to the diversity of CMfg services, SSS usually need to take into account multiple objectives in terms of time, cost, quality, and environment. As one of the keys to solving multi-objective problems, the preference information of decision maker (DM) is less considered in current research. In this paper, linguistic preference is considered, and a novel two-phase model based on a desirable satisfying degree is proposed for solving the multi-objective SSS problem with linguistic preference. In the first phase, the maximum comprehensive satisfying degree is calculated. In the second phase, the satisfying solution is obtained by repeatedly solving the model and interaction with DM. Compared with the traditional model, the two-phase is more effective, which is verified in the calculation experiment. The proposed method could offer useful insights which help DM balance multiple objectives with linguistic preference and promote sustainable development of CMfg.


2013 ◽  
Vol 2013 ◽  
pp. 1-10
Author(s):  
Hamid Reza Erfanian ◽  
M. H. Noori Skandari ◽  
A. V. Kamyad

We present a new approach for solving nonsmooth optimization problems and a system of nonsmooth equations which is based on generalized derivative. For this purpose, we introduce the first order of generalized Taylor expansion of nonsmooth functions and replace it with smooth functions. In other words, nonsmooth function is approximated by a piecewise linear function based on generalized derivative. In the next step, we solve smooth linear optimization problem whose optimal solution is an approximate solution of main problem. Then, we apply the results for solving system of nonsmooth equations. Finally, for efficiency of our approach some numerical examples have been presented.


2012 ◽  
Vol 215-216 ◽  
pp. 592-596
Author(s):  
Li Gao ◽  
Rong Rong Wang

In order to deal with complex product design optimization problems with both discrete and continuous variables, mix-variable collaborative design optimization algorithm is put forward based on collaborative optimization, which is an efficient way to solve mix-variable design optimization problems. On the rule of “divide and rule”, the algorithm decouples the problem into some relatively simple subsystems. Then by using collaborative mechanism, the optimal solution is obtained. Finally, the result of a case shows the feasibility and effectiveness of the new algorithm.


1995 ◽  
Vol 117 (1) ◽  
pp. 155-157 ◽  
Author(s):  
F. C. Anderson ◽  
J. M. Ziegler ◽  
M. G. Pandy ◽  
R. T. Whalen

We have examined the feasibility of using massively-parallel and vector-processing supercomputers to solve large-scale optimization problems for human movement. Specifically, we compared the computational expense of determining the optimal controls for the single support phase of gait using a conventional serial machine (SGI Iris 4D25), a MIMD parallel machine (Intel iPSC/860), and a parallel-vector-processing machine (Cray Y-MP 8/864). With the human body modeled as a 14 degree-of-freedom linkage actuated by 46 musculotendinous units, computation of the optimal controls for gait could take up to 3 months of CPU time on the Iris. Both the Cray and the Intel are able to reduce this time to practical levels. The optimal solution for gait can be found with about 77 hours of CPU on the Cray and with about 88 hours of CPU on the Intel. Although the overall speeds of the Cray and the Intel were found to be similar, the unique capabilities of each machine are better suited to different portions of the computational algorithm used. The Intel was best suited to computing the derivatives of the performance criterion and the constraints whereas the Cray was best suited to parameter optimization of the controls. These results suggest that the ideal computer architecture for solving very large-scale optimal control problems is a hybrid system in which a vector-processing machine is integrated into the communication network of a MIMD parallel machine.


Sign in / Sign up

Export Citation Format

Share Document