The agent-based modeling is currently utilized extensively to analyze complex systems. It supported such growth, because it was able to convey distinct levels of interaction in a complex detailed environment. Meanwhile, agent-based models incline to be progressively complex. Thus, powerful modeling and simulation techniques are needed to address this rise in complexity. In recent years, a number of platforms for developing agent-based models have been developed. Actually, in most of the agents, often discrete representation of the environment, and one level of interaction are presented, where two or three are regarded hardly in various agent-based models. The key issue is that modellers work in these areas is not assisted by simulation platforms. Therefore, GAMA modelling and simulation platform is designed to facilitate the development of spatialized, multi-paradigms and multi-scale models to address this challenge.This platform enables modelers to build explicit and multi-level models geographically (spatially). It includes notably effective Data Mining models and Geographic Information Systems (GIS) that make the effort to model and analyze easier. This study examines how this platform deals with these concerns and how modeler's tools are provided from the box. Also, shows its skills relating to the tight combination of 3D visualization, GIS data management, and multi-level modeling. Furthermore, several examples of GAMA-based projects that had been built for complex models.
Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On the
... Show MoreIn the present paper, by making use of the new generalized operator, some results of third order differential subordination and differential superordination consequence for analytic functions are obtained. Also, some sandwich-type theorems are presented.
The global food supply heavily depends on utilizing fertilizers to meet production goals. The adverse impacts of traditional fertilization practices on the environment have necessitated the exploration of new alternatives in the form of smart fertilizer technologies (SFTs). This review seeks to categorize SFTs, which are slow and controlled-release Fertilizers (SCRFs), nano fertilizers, and biological fertilizers, and describes their operational principles. It examines the environmental implications of conventional fertilizers and outlines the attributes of SFTs that effectively address these concerns. The findings demonstrate a pronounced environmental advantage of SFTs, including enhanced crop yields, minimized nutrient loss, improved nut
... Show MorePosition control of servo motor systems is a challenging task because of inevitable factors such as uncertainties, nonlinearities, parametric variations, and external perturbations. In this article, to alleviate the above issues, a practical adaptive fast terminal sliding mode control (PAFTSMC) is proposed for better tracking performance of the servo motor system by using a state observer and bidirectional adaptive law. First, a smooth-tangent-hyperbolic-function-based practical fast terminal sliding mode control (PFTSM) surface is designed to ensure not only fast finite time tracking error convergence but also chattering reduction. Second, the PAFTSMC is proposed for the servo motor, in which a two-way adaptive law is designed to further s
... Show MoreScheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti
... Show MoreThe convolutional neural networks (CNN) are among the most utilized neural networks in various applications, including deep learning. In recent years, the continuing extension of CNN into increasingly complicated domains has made its training process more difficult. Thus, researchers adopted optimized hybrid algorithms to address this problem. In this work, a novel chaotic black hole algorithm-based approach was created for the training of CNN to optimize its performance via avoidance of entrapment in the local minima. The logistic chaotic map was used to initialize the population instead of using the uniform distribution. The proposed training algorithm was developed based on a specific benchmark problem for optical character recog
... Show More