3,427 research outputs found

    Artificial Intelligence Enabled Project Management: A Systematic Literature Review

    Get PDF
    In the Industry 5.0 era, companies are leveraging the potential of cutting-edge technologies such as artificial intelligence for more efficient and green human-centric production. In a similar approach, project management would benefit from artificial intelligence in order to achieve project goals by improving project performance, and consequently, reaching higher sustainable success. In this context, this paper examines the role of artificial intelligence in emerging project management through a systematic literature review; the applications of AI techniques in the project management performance domains are presented. The results show that the number of influential publications on artificial intelligence-enabled project management has increased significantly over the last decade. The findings indicate that artificial intelligence, predominantly machine learning, can be considerably useful in the management of construction and IT projects; it is notably encouraging for enhancing the planning, measurement, and uncertainty performance domains by providing promising forecasting and decision-making capabilities

    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

    A Novel Implementation of Nature-inspired Optimization for Civil Engineering: A Comparative Study of Symbiotic Organisms Search

    Get PDF
    The increasing numbers of design variables and constraints have made many civil engineering problems significantly more complex and difficult for engineers to resolve in a timely manner. Various optimization models have been developed to address this problem. The present paper introduces Symbiotic Organisms Search (SOS), a new nature-inspired algorithm for solving civil engineering problems. SOS simulates mutualism, commensalism, and parasitism, which are the symbiotic interaction mechanisms that organisms often adopt for survival in the ecosystem. The proposed algorithm is compared with other algorithms recently developed with regard to their respective effectiveness in solving benchmark problems and three civil engineering problems. Simulation results demonstrate that the proposed SOS algorithm is significantly more effective and efficient than the other algorithms tested. The proposed model is a promising tool for assisting civil engineers to make decisions to minimize the expenditure of material and financial resources

    Optimal design of symmetric switching CMOS inverter using symbiotic organisms search algorithm

    Get PDF
    This paper investigates the optimal design of symmetric switching CMOS inverter using the Symbiotic Organisms Search (SOS) algorithm. SOS has been recently proposed as an effective evolutionary global optimization method that is inspired by the symbiotic interaction strategies between different organisms in an ecosystem. In SOS, the three common types of symbiotic relationships (mutualism, commensalism, and parasitism) are modeled using simple expressions, which are used to find the global minimum of the fitness function. Unlike other optimization methods, SOS has no parameters to be tuned, which makes it an attractive and easy-to-implement optimization method. Here, SOS is used to design a high speed symmetric switching CMOS inverter, which is considered the most fundamental logic gate. SOS results are compared to those obtained using several optimization methods, like particle swarm optimization (PSO), genetic algorithm (GA), differential evolution (DE), and other ones, available in the literature. It is shown that the SOS is a robust straight-forward evolutionary algorithm that can compete with other well-known advanced methods

    A survey of variants and extensions of the resource-constrained project scheduling problem

    Get PDF
    The resource-constrained project scheduling problem (RCPSP) consists of activities that must be scheduled subject to precedence and resource constraints such that the makespan is minimized. It has become a well-known standard problem in the context of project scheduling which has attracted numerous researchers who developed both exact and heuristic scheduling procedures. However, it is a rather basic model with assumptions that are too restrictive for many practical applications. Consequently, various extensions of the basic RCPSP have been developed. This paper gives an overview over these extensions. The extensions are classified according to the structure of the RCPSP. We summarize generalizations of the activity concept, of the precedence relations and of the resource constraints. Alternative objectives and approaches for scheduling multiple projects are discussed as well. In addition to popular variants and extensions such as multiple modes, minimal and maximal time lags, and net present value-based objectives, the paper also provides a survey of many less known concepts. --project scheduling,modeling,resource constraints,temporal constraints,networks

    Hacker Combat: A Competitive Sport from Programmatic Dueling & Cyberwarfare

    Full text link
    The history of humanhood has included competitive activities of many different forms. Sports have offered many benefits beyond that of entertainment. At the time of this article, there exists not a competitive ecosystem for cyber security beyond that of conventional capture the flag competitions, and the like. This paper introduces a competitive framework with a foundation on computer science, and hacking. This proposed competitive landscape encompasses the ideas underlying information security, software engineering, and cyber warfare. We also demonstrate the opportunity to rank, score, & categorize actionable skill levels into tiers of capability. Physiological metrics are analyzed from participants during gameplay. These analyses provide support regarding the intricacies required for competitive play, and analysis of play. We use these intricacies to build a case for an organized competitive ecosystem. Using previous player behavior from gameplay, we also demonstrate the generation of an artificial agent purposed with gameplay at a competitive level

    Hybrid harmony search algorithm for continuous optimization problems

    Get PDF
    Harmony Search (HS) algorithm has been extensively adopted in the literature to address optimization problems in many different fields, such as industrial design, civil engineering, electrical and mechanical engineering problems. In order to ensure its search performance, HS requires extensive tuning of its four parameters control namely harmony memory size (HMS), harmony memory consideration rate (HMCR), pitch adjustment rate (PAR), and bandwidth (BW). However, tuning process is often cumbersome and is problem dependent. Furthermore, there is no one size fits all problems. Additionally, despite many useful works, HS and its variant still suffer from weak exploitation which can lead to poor convergence problem. Addressing these aforementioned issues, this thesis proposes to augment HS with adaptive tuning using Grey Wolf Optimizer (GWO). Meanwhile, to enhance its exploitation, this thesis also proposes to adopt a new variant of the opposition-based learning technique (OBL). Taken together, the proposed hybrid algorithm, called IHS-GWO, aims to address continuous optimization problems. The IHS-GWO is evaluated using two standard benchmarking sets and two real-world optimization problems. The first benchmarking set consists of 24 classical benchmark unimodal and multimodal functions whilst the second benchmark set contains 30 state-of-the-art benchmark functions from the Congress on Evolutionary Computation (CEC). The two real-world optimization problems involved the three-bar truss and spring design. Statistical analysis using Wilcoxon rank-sum and Friedman of IHS-GWO’s results with recent HS variants and other metaheuristic demonstrate superior performance
    corecore