Complex & Intelligent Systems 

About: Complex & Intelligent Systems is an academic journal published by Springer Science+Business Media. The journal publishes majorly in the area(s): Computer science & Computational intelligence. It has an ISSN identifier of 2199-4536. It is also open access. Over the lifetime, 992 publications have been published receiving 12573 citations. The journal is also known as: Complex and intelligent systems (Print) & Complex and intelligent systems (Online).

A benchmark test suite for evolutionary many-objective optimization

Abstract: In the real world, it is not uncommon to face an optimization problem with more than three objectives. Such problems, called many-objective optimization problems (MaOPs), pose great challenges to the area of evolutionary computation. The failure of conventional Pareto-based multi-objective evolutionary algorithms in dealing with MaOPs motivates various new approaches. However, in contrast to the rapid development of algorithm design, performance investigation and comparison of algorithms have received little attention. Several test problem suites which were designed for multi-objective optimization have still been dominantly used in many-objective optimization. In this paper, we carefully select (or modify) 15 test problems with diverse properties to construct a benchmark test suite, aiming to promote the research of evolutionary many-objective optimization (EMaO) via suggesting a set of test problems with a good representation of various real-world scenarios. Also, an open-source software platform with a user-friendly GUI is provided to facilitate the experimental execution and data observation.

On some distance measures of complex Pythagorean fuzzy sets and their applications in pattern recognition

Abstract: The concept of complex fuzzy set (CFS) and complex intuitionistic fuzzy set (CIFS) is two recent developments in the field of fuzzy set (FS) theory. The significance of these concepts lies in the fact that these concepts assigned membership grades from unit circle in plane, i.e., in the form of a complex number instead from [0, 1] interval. CFS cannot deal with information of yes and no type, while CIFS works only for a limited range of values. To deal with these kinds of problems, in this article, the concept of complex Pythagorean fuzzy set (CPFS) is developed. The novelty of CPFS lies in its larger range comparative to CFS and CIFS which is demonstrated numerically. It is discussed how a CFS and CIFS could be CPFS but not conversely. We investigated the very basic concepts of CPFSs and studied their properties. Furthermore, some distance measures for CPFSs are developed and their characteristics are studied. The viability of the proposed new distance measures in a building material recognition problem is also discussed. Finally, a comparative study of the proposed new work is established with pre-existing study and some advantages of CPFS are discussed over CFS and CIFS.

Overview and methods of correlation filter algorithms in object tracking

Abstract: An important area of computer vision is real-time object tracking, which is now widely used in intelligent transportation and smart industry technologies. Although the correlation filter object tracking methods have a good real-time tracking effect, it still faces many challenges such as scale variation, occlusion, and boundary effects. Many scholars have continuously improved existing methods for better efficiency and tracking performance in some aspects. To provide a comprehensive understanding of the background, key technologies and algorithms of single object tracking, this article focuses on the correlation filter-based object tracking algorithms. Specifically, the background and current advancement of the object tracking methodologies, as well as the presentation of the main datasets are introduced. All kinds of methods are summarized to present tracking results in various vision problems, and a visual tracking method based on reliability is observed.

Social group optimization (SGO): a new population evolutionary optimization technique

Abstract: Social group optimization (SGO), a population-based optimization technique is proposed in this paper. It is inspired from the concept of social behavior of human toward solving a complex problem. The concept and the mathematical formulation of SGO algorithm is explained in this paper with a flowchart. To judge the effectiveness of SGO, extensive experiments have been conducted on number of different unconstrained benchmark functions as well as standard numerical benchmark functions taken from the IEEE Congress on Evolutionary Computation 2005 competition. Performance comparisons are made between state-of-the-art optimization techniques, like GA, PSO, DE, ABC and its variants, and the recently developed TLBO. The investigational outcomes show that the proposed social group optimization outperforms all the investigated optimization techniques in computational costs and also provides optimal solutions for most of the functions considered in our work. The proposed technique is found to be very simple and straightforward to implement as well. It is believed that SGO will supplement the group of effective and efficient optimization techniques in the population-based category and give researchers wide scope to choose this in their respective applications.

Genetic programming for production scheduling: a survey with a unified framework

Abstract: Genetic programming has been a powerful technique for automated design of production scheduling heuristics. Many studies have shown that heuristics evolved by genetic programming can outperform many existing heuristics manually designed in the literature. The flexibility of genetic programming also allows it to discover very sophisticated heuristics to deal with complex and dynamic production environments. However, as compared to other applications of genetic programming or scheduling applications of other evolutionary computation techniques, the configurations and requirements of genetic programming for production scheduling are more complicated. In this paper, a unified framework for automated design of production scheduling heuristics with genetic programming is developed. The goal of the framework is to provide the researchers with the overall picture of how genetic programming can be applied for this task and the key components. The framework is also used to facilitate our discussions and analyses of existing studies in the field. Finally, this paper shows how knowledge from machine learning and operations research can be employed and how the current challenges can be addressed.