4,732 research outputs found

    Symbiotic Organisms Search Algorithm: theory, recent advances and applications

    Get PDF
    The symbiotic organisms search algorithm is a very promising recent metaheuristic algorithm. It has received a plethora of attention from all areas of numerical optimization research, as well as engineering design practices. it has since undergone several modifications, either in the form of hybridization or as some other improved variants of the original algorithm. However, despite all the remarkable achievements and rapidly expanding body of literature regarding the symbiotic organisms search algorithm within its short appearance in the field of swarm intelligence optimization techniques, there has been no collective and comprehensive study on the success of the various implementations of this algorithm. As a way forward, this paper provides an overview of the research conducted on symbiotic organisms search algorithms from inception to the time of writing, in the form of details of various application scenarios with variants and hybrid implementations, and suggestions for future research directions

    Symbiotic Organisms Search Optimization to Predict Optimal Thread Count for Multi-threaded Applications

    Get PDF
    Multicore systems have emerged as a cost-effective option for the growing demands for high-performance, low-energy computing. Thread management has long been a source of concern for developers, as overheads associated with it reduce the overall throughput of the multicore processor systems. One of the most complex problems with multicore processors is determining the optimal number of threads for the execution of multithreaded programs. To address this issue, this paper proposes a novel solution based on a modified symbiotic organism search (MSOS) algorithm which is a bio-inspired algorithm used for optimization in various engineering domains. This technique uses mutualism, commensalism and parasitism behaviours seen in organisms for searching the optimal solutions in the available search space. The algorithm is simulated on the NVIDIA DGX Intel-Xeon E5-2698-v4 server with PARSEC 3.0 benchmark suit.  The results show that keeping the thread count equal to the number of processors available in the system is not necessarily the best strategy to get maximum speedup when running multithreaded programs. It was also observed that when programs are run with the optimal thread count, the execution time is substantially decreased, resulting in energy savings due to the use of fewer processors than are available in the system

    Symbiotic Evolution of Rule Based Classifiers

    Get PDF

    Hybrid scheduling algorithms in cloud computing: a review

    Get PDF
    Cloud computing is one of the emerging fields in computer science due to its several advancements like on-demand processing, resource sharing, and pay per use. There are several cloud computing issues like security, quality of service (QoS) management, data center energy consumption, and scaling. Scheduling is one of the several challenging problems in cloud computing, where several tasks need to be assigned to resources to optimize the quality of service parameters. Scheduling is a well-known NP-hard problem in cloud computing. This will require a suitable scheduling algorithm. Several heuristics and meta-heuristics algorithms were proposed for scheduling the user's task to the resources available in cloud computing in an optimal way. Hybrid scheduling algorithms have become popular in cloud computing. In this paper, we reviewed the hybrid algorithms, which are the combinations of two or more algorithms, used for scheduling in cloud computing. The basic idea behind the hybridization of the algorithm is to take useful features of the used algorithms. This article also classifies the hybrid algorithms and analyzes their objectives, quality of service (QoS) parameters, and future directions for hybrid scheduling algorithms

    Scientific research trends about metaheuristics in process optimization and case study using the desirability function

    Get PDF
    This study aimed to identify the research gaps in Metaheuristics, taking into account the publications entered in a database in 2015 and to present a case study of a company in the Sul Fluminense region using the Desirability function. To achieve this goal, applied research of exploratory nature and qualitative approach was carried out, as well as another of quantitative nature. As method and technical procedures were the bibliographical research, some literature review, and an adopted case study respectively. As a contribution of this research, the holistic view of opportunities to carry out new investigations on the theme in question is pointed out. It is noteworthy that the identified study gaps after the research were prioritized and discriminated, highlighting the importance of the viability of metaheuristic algorithms, as well as their benefits for process optimization

    Multiobjective adaptive symbiotic organisms search for truss optimization problems

    Get PDF
    This paper presents a multiobjective adaptive symbiotic organisms search (MOASOS) and its two-archive technique for solving truss optimization problems. The SOS algorithm considers the symbiotic relationship among various species, such as mutualism, commensalism, and parasitism, to live in nature. The heuristic characteristics of the mutualism phase permits the search to jump into not visited sections (named an exploration) and allows a local search of visited sections (named an exploitation) of the search region. As search progresses, a good balance between an exploration and exploitation has a greater impact on the solutions. Thus, adaptive control is now incorporated to propose MOASOS. In addition, two-archive approach is applied in MOASOS to maintain population diversity which is a major issue in multiobjective meta-heuristics. For the design problems, minimization of the truss� mass and maximization of nodal displacement are objectives whereas elemental stress and discrete cross-sectional areas are assumed to be behaviour and side constraints respectively. The usefulness of these methods to solve complex problems is validated by five truss problems (i.e. 10-bar truss, 25-bar truss, 60-bar truss, 72-bar truss, and 942-bar truss) with discrete design variables. The results of the proposed algorithms have demonstrated that adaptive control is able to provide a better and competitive solutions when compared against the previous studies

    A novel Multiple Objective Symbiotic Organisms Search (MOSOS) for time–cost–labor utilization tradeoff problem

    Get PDF
    Multiple work shifts are commonly utilized in construction projects to meet project requirements. Nevertheless, evening and night shifts raise the risk of adverse events and thus must be used to the minimum extent feasible. Tradeoff optimization among project duration (time), project cost, and the utilization of evening and night work shifts while maintaining with all job logic and resource availability constraints is necessary to enhance overall construction project success. In this study, a novel approach called “Multiple Objective Symbiotic Organisms Search” (MOSOS) to solve multiple work shifts problem is introduced. The MOSOS algorithm is new meta-heuristic based multi-objective optimization techniques inspired by the symbiotic interaction strategies that organisms use to survive in the ecosystem. A numerical case study of construction projects were studied and the performance of MOSOS is evaluated in comparison with other widely used algorithms which includes non-dominated sorting genetic algorithm II (NSGA-II), the multiple objective particle swarm optimization (MOPSO), the multiple objective differential evolution (MODE), and the multiple objective artificial bee colony (MOABC). The numerical results demonstrate MOSOS approach is a powerful search and optimization technique in finding optimization of work shift schedules that is it can assist project managers in selecting appropriate plan for project

    Optimized task scheduling based on hybrid symbiotic organisms search algorithms for cloud computing environment

    Get PDF
    In Cloud Computing model, users are charged according to the usage of resources and desired Quality of Service (QoS). Task scheduling algorithms are responsible for specifying adequate set of resources to execute user applications in the form of tasks, and schedule decisions of task scheduling algorithms are based on QoS requirements defined by the user. Task scheduling problem is an NP-Complete problem, due to the NP-Complete nature of task scheduling problems and huge search space presented by large scale problem instances, many of the existing solution algorithms incur high computational complexity and cannot effectively obtain global optimum solutions. Recently, Symbiotic Organisms Search (SOS) has been applied to various optimization problems and results obtained were found to be competitive with state-of-the-art metaheuristic algorithms. However, similar to the case other metaheuristic optimization algorithms, the efficiency of SOS algorithm deteriorates as the size of the search space increases. Moreover, SOS suffers from local optima entrapment and its static control parameters cannot maintain a balance between local and global search. In this study, Cooperative Coevolutionary Constrained Multiobjective Symbiotic Organisms Search (CC-CMSOS), Cooperative Coevolutionary Constrained Multi-objective Memetic Symbiotic Organisms Search (CC-CMMSOS), and Cooperative Coevolutionary Constrained Multi-objective Adaptive Benefit Factor Symbiotic Organisms Search (CC-CMABFSOS) algorithms are proposed to solve constrained multi-objective large scale task scheduling optimization problem on IaaS cloud computing environment. To address the issue of scalability, the concept of Cooperative Coevolutionary for enhancing SOS named CC-CMSOS make SOS more efficient for solving large scale task scheduling problems. CC-CMMSOS algorithm further improves the performance of SOS algorithm by hybridizing with Simulated Annealing (SA) to avoid entrapment in local optima for global convergence. Finally, CC-CMABFSOS algorithm adaptively turn SOS control parameters to balance the local and global search procedure for faster convergence speed. The performance of the proposed CC-CMSOS, CC-CMMSOS, and CC-CMABFSOS algorithms are evaluated on CloudSim simulator, using both standard workload traces and synthesized workloads for larger problem instances of up to 5000. Moreover, CC-CMSOS, CC-CMMSOS, and CC-CMABFSOS algorithms are compared with multi-objective optimization algorithms, namely, EMS-C, ECMSMOO, and BOGA. The CC-CMSOS, CC-CMMSOS, and CC-CMABFSOS algorithms obtained significant improved optimal trade-offs between execution time (makespan) and financial cost (cost) while meeting deadline constraints with no computational overhead. The performance improvements obtained by the proposed algorithms in terms of hypervolume ranges from 8.72% to 37.95% across the workloads. Therefore, the proposed algorithms have potentials to improve the performance of QoS delivery

    Aerospace Medicine and Biology

    Get PDF
    This bibliography lists 184 reports, articles and other documents introduced into the NASA Scientific and Technical Information System during October 1989. Subject coverage includes: aerospace medicine and psychology, life support systems and controlled environments, safety equipment, exobiology and extraterrestrial life, and flight crew behavior and performance
    corecore