for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> COMPUTER SCIENCE (Total: 1988 journals)
    - ANIMATION AND SIMULATION (29 journals)
    - ARTIFICIAL INTELLIGENCE (99 journals)
    - AUTOMATION AND ROBOTICS (100 journals)
    - CLOUD COMPUTING AND NETWORKS (63 journals)
    - COMPUTER ARCHITECTURE (9 journals)
    - COMPUTER ENGINEERING (9 journals)
    - COMPUTER GAMES (16 journals)
    - COMPUTER PROGRAMMING (23 journals)
    - COMPUTER SCIENCE (1153 journals)
    - COMPUTER SECURITY (45 journals)
    - DATA BASE MANAGEMENT (13 journals)
    - DATA MINING (32 journals)
    - E-BUSINESS (22 journals)
    - E-LEARNING (27 journals)
    - ELECTRONIC DATA PROCESSING (21 journals)
    - IMAGE AND VIDEO PROCESSING (40 journals)
    - INFORMATION SYSTEMS (104 journals)
    - INTERNET (92 journals)
    - SOCIAL WEB (50 journals)
    - SOFTWARE (33 journals)
    - THEORY OF COMPUTING (8 journals)

COMPUTER SCIENCE (1153 journals)                  1 2 3 4 5 6 | Last

Showing 1 - 200 of 872 Journals sorted alphabetically
3D Printing and Additive Manufacturing     Full-text available via subscription   (Followers: 14)
Abakós     Open Access   (Followers: 3)
Academy of Information and Management Sciences Journal     Full-text available via subscription   (Followers: 68)
ACM Computing Surveys     Hybrid Journal   (Followers: 22)
ACM Journal on Computing and Cultural Heritage     Hybrid Journal   (Followers: 9)
ACM Journal on Emerging Technologies in Computing Systems     Hybrid Journal   (Followers: 13)
ACM Transactions on Accessible Computing (TACCESS)     Hybrid Journal   (Followers: 3)
ACM Transactions on Algorithms (TALG)     Hybrid Journal   (Followers: 16)
ACM Transactions on Applied Perception (TAP)     Hybrid Journal   (Followers: 6)
ACM Transactions on Architecture and Code Optimization (TACO)     Hybrid Journal   (Followers: 9)
ACM Transactions on Autonomous and Adaptive Systems (TAAS)     Hybrid Journal   (Followers: 7)
ACM Transactions on Computation Theory (TOCT)     Hybrid Journal   (Followers: 11)
ACM Transactions on Computational Logic (TOCL)     Hybrid Journal   (Followers: 4)
ACM Transactions on Computer Systems (TOCS)     Hybrid Journal   (Followers: 18)
ACM Transactions on Computer-Human Interaction     Hybrid Journal   (Followers: 12)
ACM Transactions on Computing Education (TOCE)     Hybrid Journal   (Followers: 3)
ACM Transactions on Design Automation of Electronic Systems (TODAES)     Hybrid Journal   (Followers: 1)
ACM Transactions on Economics and Computation     Hybrid Journal  
ACM Transactions on Embedded Computing Systems (TECS)     Hybrid Journal   (Followers: 4)
ACM Transactions on Information Systems (TOIS)     Hybrid Journal   (Followers: 20)
ACM Transactions on Intelligent Systems and Technology (TIST)     Hybrid Journal   (Followers: 9)
ACM Transactions on Interactive Intelligent Systems (TiiS)     Hybrid Journal   (Followers: 4)
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)     Hybrid Journal   (Followers: 10)
ACM Transactions on Reconfigurable Technology and Systems (TRETS)     Hybrid Journal   (Followers: 7)
ACM Transactions on Sensor Networks (TOSN)     Hybrid Journal   (Followers: 8)
ACM Transactions on Speech and Language Processing (TSLP)     Hybrid Journal   (Followers: 11)
ACM Transactions on Storage     Hybrid Journal  
ACS Applied Materials & Interfaces     Full-text available via subscription   (Followers: 21)
Acta Automatica Sinica     Full-text available via subscription   (Followers: 3)
Acta Universitatis Cibiniensis. Technical Series     Open Access  
Ad Hoc Networks     Hybrid Journal   (Followers: 11)
Adaptive Behavior     Hybrid Journal   (Followers: 11)
Advanced Engineering Materials     Hybrid Journal   (Followers: 26)
Advanced Science Letters     Full-text available via subscription   (Followers: 7)
Advances in Adaptive Data Analysis     Hybrid Journal   (Followers: 8)
Advances in Artificial Intelligence     Open Access   (Followers: 16)
Advances in Calculus of Variations     Hybrid Journal   (Followers: 2)
Advances in Catalysis     Full-text available via subscription   (Followers: 5)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 15)
Advances in Computer Science : an International Journal     Open Access   (Followers: 13)
Advances in Computing     Open Access   (Followers: 2)
Advances in Data Analysis and Classification     Hybrid Journal   (Followers: 54)
Advances in Engineering Software     Hybrid Journal   (Followers: 25)
Advances in Geosciences (ADGEO)     Open Access   (Followers: 10)
Advances in Human Factors/Ergonomics     Full-text available via subscription   (Followers: 25)
Advances in Human-Computer Interaction     Open Access   (Followers: 20)
Advances in Materials Sciences     Open Access   (Followers: 16)
Advances in Operations Research     Open Access   (Followers: 11)
Advances in Parallel Computing     Full-text available via subscription   (Followers: 7)
Advances in Porous Media     Full-text available via subscription   (Followers: 4)
Advances in Remote Sensing     Open Access   (Followers: 37)
Advances in Science and Research (ASR)     Open Access   (Followers: 6)
Advances in Technology Innovation     Open Access   (Followers: 1)
AEU - International Journal of Electronics and Communications     Hybrid Journal   (Followers: 8)
African Journal of Information and Communication     Open Access   (Followers: 6)
African Journal of Mathematics and Computer Science Research     Open Access   (Followers: 4)
Air, Soil & Water Research     Open Access   (Followers: 7)
AIS Transactions on Human-Computer Interaction     Open Access   (Followers: 6)
Algebras and Representation Theory     Hybrid Journal   (Followers: 1)
Algorithms     Open Access   (Followers: 11)
American Journal of Computational and Applied Mathematics     Open Access   (Followers: 4)
American Journal of Computational Mathematics     Open Access   (Followers: 4)
American Journal of Information Systems     Open Access   (Followers: 7)
American Journal of Sensor Technology     Open Access   (Followers: 2)
Anais da Academia Brasileira de Ciências     Open Access   (Followers: 2)
Analog Integrated Circuits and Signal Processing     Hybrid Journal   (Followers: 5)
Analysis in Theory and Applications     Hybrid Journal   (Followers: 1)
Animation Practice, Process & Production     Hybrid Journal   (Followers: 5)
Annals of Combinatorics     Hybrid Journal   (Followers: 3)
Annals of Data Science     Hybrid Journal   (Followers: 9)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 6)
Annals of Pure and Applied Logic     Open Access   (Followers: 2)
Annals of Software Engineering     Hybrid Journal   (Followers: 12)
Annual Reviews in Control     Hybrid Journal   (Followers: 6)
Anuario Americanista Europeo     Open Access  
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 2)
Applied and Computational Harmonic Analysis     Full-text available via subscription   (Followers: 2)
Applied Artificial Intelligence: An International Journal     Hybrid Journal   (Followers: 14)
Applied Categorical Structures     Hybrid Journal   (Followers: 2)
Applied Clinical Informatics     Hybrid Journal   (Followers: 2)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 12)
Applied Computer Systems     Open Access   (Followers: 1)
Applied Informatics     Open Access  
Applied Mathematics and Computation     Hybrid Journal   (Followers: 32)
Applied Medical Informatics     Open Access   (Followers: 10)
Applied Numerical Mathematics     Hybrid Journal   (Followers: 5)
Applied Soft Computing     Hybrid Journal   (Followers: 16)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 4)
Architectural Theory Review     Hybrid Journal   (Followers: 3)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 4)
Archive of Numerical Software     Open Access  
Archives and Museum Informatics     Hybrid Journal   (Followers: 121)
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 4)
Artifact     Hybrid Journal   (Followers: 2)
Artificial Life     Hybrid Journal   (Followers: 6)
Asia Pacific Journal on Computational Engineering     Open Access  
Asia-Pacific Journal of Information Technology and Multimedia     Open Access   (Followers: 1)
Asian Journal of Computer Science and Information Technology     Open Access  
Asian Journal of Control     Hybrid Journal  
Assembly Automation     Hybrid Journal   (Followers: 2)
at - Automatisierungstechnik     Hybrid Journal   (Followers: 1)
Australian Educational Computing     Open Access  
Automatic Control and Computer Sciences     Hybrid Journal   (Followers: 3)
Automatic Documentation and Mathematical Linguistics     Hybrid Journal   (Followers: 5)
Automatica     Hybrid Journal   (Followers: 9)
Automation in Construction     Hybrid Journal   (Followers: 6)
Autonomous Mental Development, IEEE Transactions on     Hybrid Journal   (Followers: 8)
Basin Research     Hybrid Journal   (Followers: 5)
Behaviour & Information Technology     Hybrid Journal   (Followers: 52)
Bioinformatics     Hybrid Journal   (Followers: 246)
Biomedical Engineering     Hybrid Journal   (Followers: 16)
Biomedical Engineering and Computational Biology     Open Access   (Followers: 13)
Biomedical Engineering, IEEE Reviews in     Full-text available via subscription   (Followers: 17)
Biomedical Engineering, IEEE Transactions on     Hybrid Journal   (Followers: 32)
Briefings in Bioinformatics     Hybrid Journal   (Followers: 45)
British Journal of Educational Technology     Hybrid Journal   (Followers: 126)
Broadcasting, IEEE Transactions on     Hybrid Journal   (Followers: 10)
c't Magazin fuer Computertechnik     Full-text available via subscription   (Followers: 2)
CALCOLO     Hybrid Journal  
Calphad     Hybrid Journal  
Canadian Journal of Electrical and Computer Engineering     Full-text available via subscription   (Followers: 14)
Catalysis in Industry     Hybrid Journal   (Followers: 1)
CEAS Space Journal     Hybrid Journal  
Cell Communication and Signaling     Open Access   (Followers: 1)
Central European Journal of Computer Science     Hybrid Journal   (Followers: 5)
CERN IdeaSquare Journal of Experimental Innovation     Open Access  
Chaos, Solitons & Fractals     Hybrid Journal   (Followers: 3)
Chemometrics and Intelligent Laboratory Systems     Hybrid Journal   (Followers: 15)
ChemSusChem     Hybrid Journal   (Followers: 7)
China Communications     Full-text available via subscription   (Followers: 7)
Chinese Journal of Catalysis     Full-text available via subscription   (Followers: 2)
CIN Computers Informatics Nursing     Full-text available via subscription   (Followers: 12)
Circuits and Systems     Open Access   (Followers: 16)
Clean Air Journal     Full-text available via subscription   (Followers: 2)
CLEI Electronic Journal     Open Access  
Clin-Alert     Hybrid Journal   (Followers: 1)
Cluster Computing     Hybrid Journal   (Followers: 1)
Cognitive Computation     Hybrid Journal   (Followers: 4)
COMBINATORICA     Hybrid Journal  
Combustion Theory and Modelling     Hybrid Journal   (Followers: 13)
Communication Methods and Measures     Hybrid Journal   (Followers: 11)
Communication Theory     Hybrid Journal   (Followers: 19)
Communications Engineer     Hybrid Journal   (Followers: 1)
Communications in Algebra     Hybrid Journal   (Followers: 3)
Communications in Partial Differential Equations     Hybrid Journal   (Followers: 3)
Communications of the ACM     Full-text available via subscription   (Followers: 53)
Communications of the Association for Information Systems     Open Access   (Followers: 18)
COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering     Hybrid Journal   (Followers: 3)
Complex & Intelligent Systems     Open Access  
Complex Adaptive Systems Modeling     Open Access  
Complex Analysis and Operator Theory     Hybrid Journal   (Followers: 2)
Complexity     Hybrid Journal   (Followers: 6)
Complexus     Full-text available via subscription  
Composite Materials Series     Full-text available via subscription   (Followers: 9)
Computación y Sistemas     Open Access  
Computation     Open Access  
Computational and Applied Mathematics     Hybrid Journal   (Followers: 2)
Computational and Mathematical Methods in Medicine     Open Access   (Followers: 2)
Computational and Mathematical Organization Theory     Hybrid Journal   (Followers: 2)
Computational and Structural Biotechnology Journal     Open Access   (Followers: 2)
Computational and Theoretical Chemistry     Hybrid Journal   (Followers: 9)
Computational Astrophysics and Cosmology     Open Access   (Followers: 1)
Computational Biology and Chemistry     Hybrid Journal   (Followers: 12)
Computational Chemistry     Open Access   (Followers: 2)
Computational Cognitive Science     Open Access   (Followers: 2)
Computational Complexity     Hybrid Journal   (Followers: 4)
Computational Condensed Matter     Open Access  
Computational Ecology and Software     Open Access   (Followers: 8)
Computational Economics     Hybrid Journal   (Followers: 9)
Computational Geosciences     Hybrid Journal   (Followers: 14)
Computational Linguistics     Open Access   (Followers: 23)
Computational Management Science     Hybrid Journal  
Computational Mathematics and Modeling     Hybrid Journal   (Followers: 8)
Computational Mechanics     Hybrid Journal   (Followers: 4)
Computational Methods and Function Theory     Hybrid Journal  
Computational Molecular Bioscience     Open Access   (Followers: 2)
Computational Optimization and Applications     Hybrid Journal   (Followers: 7)
Computational Particle Mechanics     Hybrid Journal   (Followers: 1)
Computational Research     Open Access   (Followers: 1)
Computational Science and Discovery     Full-text available via subscription   (Followers: 2)
Computational Science and Techniques     Open Access  
Computational Statistics     Hybrid Journal   (Followers: 13)
Computational Statistics & Data Analysis     Hybrid Journal   (Followers: 29)
Computer     Full-text available via subscription   (Followers: 84)
Computer Aided Surgery     Hybrid Journal   (Followers: 3)
Computer Applications in Engineering Education     Hybrid Journal   (Followers: 6)
Computer Communications     Hybrid Journal   (Followers: 10)
Computer Engineering and Applications Journal     Open Access   (Followers: 5)
Computer Journal     Hybrid Journal   (Followers: 7)
Computer Methods in Applied Mechanics and Engineering     Hybrid Journal   (Followers: 22)
Computer Methods in Biomechanics and Biomedical Engineering     Hybrid Journal   (Followers: 10)
Computer Methods in the Geosciences     Full-text available via subscription   (Followers: 1)
Computer Music Journal     Hybrid Journal   (Followers: 14)
Computer Physics Communications     Hybrid Journal   (Followers: 6)
Computer Science - Research and Development     Hybrid Journal   (Followers: 7)
Computer Science and Engineering     Open Access   (Followers: 17)
Computer Science and Information Technology     Open Access   (Followers: 11)
Computer Science Education     Hybrid Journal   (Followers: 12)
Computer Science Journal     Open Access   (Followers: 20)
Computer Science Master Research     Open Access   (Followers: 10)

        1 2 3 4 5 6 | Last

Journal Cover Applied Soft Computing
  [SJR: 1.763]   [H-I: 75]   [16 followers]  Follow
    
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1568-4946
   Published by Elsevier Homepage  [3043 journals]
  • Dynamic computing rough approximations approach to time-evolving
           information granule interval-valued ordered information system
    • Authors: Jianhang Yu; Minghao Chen; Weihua Xu
      Pages: 18 - 29
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Jianhang Yu, Minghao Chen, Weihua Xu
      With the advent of Big Data era has seen both the volumes and update rates of data increase rapidly. The granular structure of an information system is evolving with time when redundancy data leaves and new data arrives. In order to quickly achieve the rough approximations of dynamic attribute set interval-valued ordered information system that the attribute set varies over time. In this study, we proposed two dynamic computing rough approximations approaches for time-evolving information granule interval-valued ordered information system which induced by the deletion or addition some attributes, respectively. The updating mechanisms enable obtaining additional knowledge from the varied data without forgetting the prior knowledge. According to these established computing rules, two corresponding dynamic computing algorithms are designed and some examples are illustrated to explain updating principles and show computing process. Furthermore, a series of experiments were conducted to evaluate the computational efficiency of the studied updating mechanisms based on several UCI datasets. The experimental results clearly indicate that these methods significantly outperform the traditional approaches with a dramatic reduction in the computational efficiency to update the rough approximations.
      Graphical abstract image

      PubDate: 2017-07-03T01:38:23Z
      DOI: 10.1016/j.asoc.2017.06.009
      Issue No: Vol. 60 (2017)
       
  • Adaptive consensus model with multiplicative linguistic preferences based
           on fuzzy information granulation
    • Authors: Shitao Zhang; Jianjun Zhu; Xiaodi Liu; Ye Chen; Zhenzhen Ma
      Pages: 30 - 47
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Shitao Zhang, Jianjun Zhu, Xiaodi Liu, Ye Chen, Zhenzhen Ma
      An adaptive consensus model based on fuzzy information granulation (fuzzy IG) is presented for group consensus decision-making problems with multiplicative linguistic preference relations (MLPRs). Firstly, a granular representation of linguistic terms is concerned with the triangular fuzzy formation of a family of information granules over given Analytical Hierarchy Process (AHP) numerical scales. On this basis, the individual consistency and group consensus measure indices using fuzzy granulation technique are constructed, respectively. Then, the optimal cut-off points of fuzzy information granules are obtained by establishing a multi-objective optimization model together with a multi-objective particle swarm optimization (MOPSO) algorithm. A novel group consensus decision-making approach where consensus reaching process (CRP) is achieved by adaptively adjusting individual preferences through the optimization of the cut-off points is proposed. After conflict elimination, the obtained group preference gives the ranking of the alternatives. Finally, a real emergency decision-making case for liquid ammonia leak is given to illustrate the application steps of the proposed method and comparative analysis with the existing GDM methods. Comparative results demonstrate that the proposed method has some advantages in aspects of avoiding information loss or distortion and improving consensus performance.
      Graphical abstract image

      PubDate: 2017-07-03T01:38:23Z
      DOI: 10.1016/j.asoc.2017.06.028
      Issue No: Vol. 60 (2017)
       
  • Adaptive inverse position control of switched reluctance motor
    • Authors: Jia-Jun Wang
      Pages: 48 - 59
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Jia-Jun Wang
      In this paper, adaptive inverse position control is applied to switched reluctance motor (SRM) with simplified interval type-2 fuzzy neural networks (SIT2FNNs). The proposed adaptive inverse position control scheme for the SRM can be divided into the design of two control loops. The first loop is used for the position control, which is designed based on the adaptive inverse control (AIC). And the AIC is constructed with two SIT2FNNs, which are applied to identification and control for the SRM, respectively. The second loop is used for the current control, which is realized with the current-sharing method (CSM). Simulation results certify the effectiveness of the proposed control scheme in the achievement on high position control precision and perfect dynamic performance for the SRM.
      Graphical abstract image

      PubDate: 2017-07-03T01:38:23Z
      DOI: 10.1016/j.asoc.2017.06.014
      Issue No: Vol. 60 (2017)
       
  • Multimodal function optimizations with multiple maximums and multiple
           minimums using an improved PSO algorithm
    • Authors: Wei-Der Chang
      Pages: 60 - 72
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Wei-Der Chang
      In this paper, a multimodal function optimization problem consisting of multiple maximums and multiple minimums is solved using an improved particle swarm optimization (PSO) algorithm. In the proposed scheme, the original population needs to be randomly divided into two main groups in the first stage. One group is to tackle the maximum optimization of the multimodal function and the other then focuses on the function minimum optimization. In the second stage, each group is split up into several subgroups in order to seek for function optimums simultaneously. There is no relation among subgroups and each subgroup can individually seek for one of function optimums. To achieve that, it is necessary to enroll the best particle information of each subgroup. It means that the proposed structure contains a number of best particles, not a single global best particle. The third stage is to modify the velocity updating formula of the algorithm where the global best particle is simply replaced by the best particle of each subgroup. Under the proposed scheme, multiple maxima and minima of the multimodal function can probably be solved separately and synchronously. Finally, many different kinds of multimodal function problems are illustrated to certify the applicability of the presented method, including one maximum and one minimum, two maximums and two minimums, multiple maximums and multiple minimums, and a complex engineering optimization problem with inequality conditions.
      Graphical abstract image

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.06.039
      Issue No: Vol. 60 (2017)
       
  • Solving the p-median bilevel problem with order through a hybrid heuristic
    • Authors: Martha-Selene Casas-Ramírez; José-Fernando Camacho-Vallejo
      Pages: 73 - 86
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Martha-Selene Casas-Ramírez, José-Fernando Camacho-Vallejo
      A variant of the p-median problem is considered and presented in this paper. This variant is based on the assumption that customers are free to choose the located facility that will serve them. The latter decision is made by considering the customers preferences towards the facilities. To study this problem, a mathematical bilevel programming formulation is proposed. Given the difficulty in solving such bilevel programs, two reformulations are used for solving the problem. The first reformulation adds constraints and variables to the mathematical model, while the second one adds only constraints. Yet, both reformulations avoid the need to solve an optimization problem parameterized by the upper level variables to find the value of the lower level variables. The results of numerical experiments show that the required time for both reformulations is significant increased as the size of the instance increases. Moreover, the reformulations are unable to solve the large-size instances. This led us to develop a hybrid heuristic algorithm based on scatter search, which obtains high-quality solutions for all tested instances in less time than is required by the abovementioned reformulations. Furthermore, the proposed heuristic was able to solve larger-size instances obtaining the optimal or currently best known solution. The registered results from the computational experimentation show that the proposed algorithm performs steadily. A comparison against a scatter search with random construction, a scatter search with greedy construction, a GRASP and a genetic algorithm shows that the proposed hybrid heuristic outperforms the other algorithms.
      Graphical abstract image

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.06.026
      Issue No: Vol. 60 (2017)
       
  • On the robust PID adaptive controller for exoskeletons: A particle swarm
           optimization based approach
    • Authors: A. Belkadi; H. Oulhadj; Y. Touati; Safdar A. Khan; B. Daachi
      Pages: 87 - 100
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): A. Belkadi, H. Oulhadj, Y. Touati, Safdar A. Khan, B. Daachi
      This article proposes a robust PID adaptive controller for nonlinear systems with one or more degrees of freedom (DoF). The adaptive controller aims at minimizing the errors in trajectory tracking without requiring a prior modeling of the targeted nonlinear system. Furthermore, the proposed controller requires only the inputs and outputs of the system. And it is based on modified particle swarm optimization algorithm whose goal is to find the best PID parameters that optimize the execution of desired task by minimizing an objective function. The adaptation by the controller addresses two critical problems: The first problem is the instability of the control signal provided by the convergence phase of the classical PSO algorithm. This behavior adversely affects the lifetime of any actuator and, therefore, is undesirable. The second problem is the stagnation of the classical PSO algorithm after convergence at the immediately found optimal solution. The proposed adaptive PID controller is initially tested in simulation on a dynamical model of a robot manipulator evolving in the vertical plan. Which is followed by experimental tests performed on an actuated joint orthosis worn by human subjects having different morphologies. A comparative study with two other algorithms has been also conducted. Based on the obtained results, we conclude the efficiency of the proposed approach.
      Graphical abstract image

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.06.012
      Issue No: Vol. 60 (2017)
       
  • Learning-based EM clustering for data on the unit hypersphere with
           application to exoplanet data
    • Authors: Miin-Shen Yang; Shou-Jen Chang-Chien; Wen-Liang Hung
      Pages: 101 - 114
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Miin-Shen Yang, Shou-Jen Chang-Chien, Wen-Liang Hung
      This study focuses on clustering algorithms for data on the unit hypersphere. This type of directional data lain on the surface of a unit hypersphere is used in geology, biology, meteorology, medicine and oceanography. The EM algorithm with mixtures of von Mises-Fisher distributions is often used for model-based clustering for data on the unit hypersphere. However, the EM algorithm is sensitive to initial values and outliers and a number of clusters must be assigned a priori. In this paper, we propose an effective approach, called a learning-based EM algorithm with von Mises-Fisher distributions, to cluster this type of hyper-spherical data. The proposed clustering method is robust to outliers, without the need for initialization, and automatically determines the number of clusters. Thus, it becomes a fully-unsupervised model-based clustering method for data on the unit hypersphere. Some numerical and real examples with comparisons are given to demonstrate the effectiveness and superiority of the proposed method. We also apply the proposed learning-based EM algorithm to cluster exoplanet data in extrasolar planets. The clustering results have several important implications for exoplanet data and allow an interpretation of exoplanet migration.
      Graphical abstract image

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.06.037
      Issue No: Vol. 60 (2017)
       
  • Hierarchical genetic optimization of a fuzzy logic system for energy flows
           management in microgrids
    • Authors: Enrico De Santis; Antonello Rizzi; Alireza Sadeghian
      Pages: 135 - 149
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Enrico De Santis, Antonello Rizzi, Alireza Sadeghian
      Bio-inspired algorithms like Genetic Algorithms and Fuzzy Inference Systems (FIS) are nowadays widely adopted as hybrid techniques in improving goods and services. In this paper we present an interesting application of the fuzzy-GA paradigm to the problem of energy flows management in microgrids, concerning the design, through a data driven synthesis procedure, of an Energy Management System (EMS). The main aim consists in performing decision making for power flow management tasks in the proposed microgrid model, equipped by renewable sources and an energy storage system, aiming to maximize the accounting profit in energy trading with the main-grid. In particular this study focuses on the application of a Hierarchical Genetic Algorithm (HGA) for tuning the Rule Base (RB) of a Fuzzy Inference System (FIS), trying to discover a minimal fuzzy rules set as the core inference engine of an an EMS. The HGA rationale focuses on a particular encoding scheme, based on control genes and parametric genes, applied to the optimization of the FIS parameters, allowing to perform a reduction in the structural complexity of the RB. A performance comparison is performed with a simpler approach based on a classic fuzzy-GA scheme, where both FIS parameters and rule weights are tuned, while the number of fuzzy rules is fixed in advance. Experiments shows how the fuzzy-HGA approach adopted for the synthesis of the proposed controller outperforms the classic fuzzy-GA scheme, increasing the accounting profit by 67% in the considered energy trading problem, yielding at the same time a simpler RB.
      Graphical abstract image Highlights

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.05.059
      Issue No: Vol. 60 (2017)
       
  • Explicit formula of hedge-algebras-based fuzzy controller and applications
           in structural vibration control
    • Authors: Hai-Le Bui; Tung-Anh Le; Van-Binh Bui
      Pages: 150 - 166
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Hai-Le Bui, Tung-Anh Le, Van-Binh Bui
      In the present work, explicit formula or mathematical model of hedge-algebras-based controller (HAC) is proposed to represent relationship between control and state variables. In contrast to a conventional fuzzy controller (FC), when using Hedge Algebras (HA) theory to design HACs, their explicit formula or mathematical model can be expressed in term of a simple equation. Applications of HAC using the explicit formula in input time-delay and sliding-mode controls are also studied. Control performance of HACs is investigated by numerical simulations on active control of a building structure subjected to earthquake excitations, in which results obtained from the FC are also included for comparison.

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.06.045
      Issue No: Vol. 60 (2017)
       
  • The new extension of TOPSIS method for multiple criteria decision making
           with hesitant Pythagorean fuzzy sets
    • Authors: Decui Liang; Zeshui Xu
      Pages: 167 - 179
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Decui Liang, Zeshui Xu
      Pythagorean fuzzy sets (PFSs) as a new generalization of fuzzy sets (FSs) can handle uncertain information more flexibly in the process of decision making. In our real life, we also may encounter a hesitant fuzzy environment. In view of the effective tool of hesitant fuzzy sets (HFSs) for expressing the hesitant situation, we introduce HFSs into PFSs and extend the existing research work of PFSs. Concretely speaking, this paper considers that the membership degree and the non-membership degree of PFSs are expressed as hesitant fuzzy elements. First, we propose a new concept of hesitant Pythagorean fuzzy sets (HPFSs) by combining PFSs with HFSs. It provides a new semantic interpretation for our evaluation. Meanwhile, the properties and the operators of HPFSs are studied in detail. For the sake of application, we focus on investigating the normalization method and the distance measures of HPFSs in advance. Then, we explore the application of HPFSs to multi-criteria decision making (MCDM) by employing the technique for order preference by similarity to ideal solution (TOPSIS) method. A new extension of TOPSIS method is further designed in the context of MCDM with HPFSs. Finally, an example of the energy project selection is presented to elaborate on the performance of our approach.

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.06.034
      Issue No: Vol. 60 (2017)
       
  • Unit commitment by an improved binary quantum GSA
    • Authors: Fatemeh Barani; Mina Mirhosseini; Hossein Nezamabadi-pour; Malihe M. Farsangi
      Pages: 180 - 189
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Fatemeh Barani, Mina Mirhosseini, Hossein Nezamabadi-pour, Malihe M. Farsangi
      Unit commitment (UC) problem is an important optimizing task for scheduling the on/off states of generating units in power system operation over a time horizon such that the power generation cost is minimized. Since, increasing the number of generating units makes it difficult to solve in practice, many approaches have been introduced to solve the UC problem. This paper introduces an improved version of the binary quantum-inspired gravitational search algorithm (BQIGSA) and proposes a new approach to solve the UC problem based on the improved BQIGSA, called QGSA-UC. The proposed approach is applied to unit commitment problems with the number of generating units in the range of 10–120 along with 24-h scheduling horizon and is compared with nine state-of-the-art approaches. Furthermore, four different versions of gravitational approach are implemented for solving the UC problem and compared with those obtained by QGSA-UC. Comparative results clearly reveal the effectiveness of the proposed approach and show that it can be used as a reliable tool to solve UC problem.
      Graphical abstract image

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.06.051
      Issue No: Vol. 60 (2017)
       
  • A credit ranking model for a parafinancial company based on the
           ELECTRE-III method and a multiobjective evolutionary algorithm
    • Authors: Diego Alonso Gastelum Chavira; Juan Carlos Leyva Lopez; Jesus Jaime Solano Noriega; Omar Ahumada Valenzuela; Pavel Anselmo Alvarez Carrillo
      Pages: 190 - 201
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Diego Alonso Gastelum Chavira, Juan Carlos Leyva Lopez, Jesus Jaime Solano Noriega, Omar Ahumada Valenzuela, Pavel Anselmo Alvarez Carrillo
      Credit rating is an assessment performed by lenders or financial institutions to determine a person’s creditworthiness based on the proposed terms of the loan. Frequently, these institutions use rating models to obtain estimates for the probabilities of default for their clients (companies, organizations, government, and individuals) and to assess the risk of credit portfolios. Numerous statistical and data mining methods are used to develop such models. In this paper, the potential of a multicriteria decision-aiding approach is studied. As a first step, the proposed methodology models the problem as a multicriteria evaluation process with multiple and in some cases, conflicting dimensions, which are integrated to derive sound recommendation for DMs. The second step of the methodology involves building a multicriteria outranking model based on ELECTRE III method. An evolutionary algorithm is used to exploit the outranking model. The methodology is applied to a small-scale financial institution operating in the agricultural sector. We compare loan applications based on their attributes and the credit profile of the customer or credit applicant. Our methodology offers the flexibility of combining heterogeneous information together with the preferences of decision makers (DMs), generating both relative and fixed rules for selecting the best loan applications among new and existing customers, which is an improvement over traditional methods The results reveal that outranking models are well suited to credit rating, providing good ranking results and suitable understanding on the relative importance of the evaluation criteria.
      Graphical abstract image

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.06.021
      Issue No: Vol. 60 (2017)
       
  • The interactive consensus reaching process with the minimum and uncertain
           cost in group decision making
    • Authors: Yao Li; Hengjie Zhang; Yucheng Dong
      Pages: 202 - 212
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Yao Li, Hengjie Zhang, Yucheng Dong
      The consensus model with the minimum cost (or minimum adjustments or minimum information loss) is a powerful decision tool for consensus building in the group decision making (GDM). In the extant consensus models with the minimum cost, the unit adjustment cost of each expert is assumed to be exactly known, and an optimization-based consensus model is utilized to support the consensus building. In the practical GDM, however, it is difficult to obtain the exact unit adjustment costs, and the unit adjustment costs of experts are often uncertain. Moreover, we argue that the consensus cannot be achieved directly using the established optimization-based consensus model, because the consensus building is an interactive process that needs the participation of experts. This paper proposes an interactive consensus reaching process with the minimum and uncertain cost. In the consensus reaching process, an optimization-based consensus model with the uncertain unit cost is constructed to obtain the optimal adjusted opinions of experts. Then, the costs/resources are provided for experts to modify their opinions, and the obtained optimal adjusted opinions are used as a reference for the opinions-modifying in the consensus reaching process. Meanwhile, the unit adjustment costs of experts can be estimated according to the actual situation of the opinions-modifying in the consensus reaching process. The detailed numerical and simulation analysis are conducted to demonstrate the validity of the proposed consensus reaching model.
      Graphical abstract image

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.06.056
      Issue No: Vol. 60 (2017)
       
  • Comparative Assessment of the Hybrid Genetic Algorithm–Artificial Neural
           Network and Genetic Programming Methods for the Prediction of Longitudinal
           Velocity Field around a Single Straight Groyne
    • Authors: Akbar Safarzadeh; Amir Hossein Zaji; Hossein Bonakdari
      Pages: 213 - 228
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Akbar Safarzadeh, Amir Hossein Zaji, Hossein Bonakdari
      In the present paper, three-dimensional flow fields around single straight groynes with various lengths have been discussed. The dataset of the flow field is measured in the laboratory using Acoustic Doppler Velocimeter (ADV). Then, the longitudinal velocity field is modelled using a novel hybrid method of Genetic Algorithm based artificial neural network (GAA) that has the ability to automatically adjust the number of hidden neurons. To investigate the proposed method’s performance, the results of GAA is measured and compared with one of the most common genetic algorithm based prediction method, namely genetic programming (GP). It is concluded that that GAA model successfully simulates the complex velocity field, and both the velocity magnitudes and isovel shapes are well predicted by this model. The results show that GAA with RMSE of 0.1236 in test data has a significantly better performance than the GP model with RMSE of 0.2342. In addition, it was founded that the transverse coordinate of the measuring point (Y*) is the most important input variable.
      Graphical abstract image

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.06.048
      Issue No: Vol. 60 (2017)
       
  • Multivariate time series anomaly detection: A framework of Hidden Markov
           Models
    • Authors: Jinbo Li; Witold Pedrycz; Iqbal Jamal
      Pages: 229 - 240
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Jinbo Li, Witold Pedrycz, Iqbal Jamal
      In this study, we develop an approach to multivariate time series anomaly detection focused on the transformation of multivariate time series to univariate time series. Several transformation techniques involving Fuzzy C-Means (FCM) clustering and fuzzy integral are studied. In the sequel, a Hidden Markov Model (HMM), one of the commonly encountered statistical methods, is engaged here to detect anomalies in multivariate time series. We construct HMM-based anomaly detectors and in this context compare several transformation methods. A suite of experimental studies along with some comparative analysis is reported.
      Graphical abstract image

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.06.035
      Issue No: Vol. 60 (2017)
       
  • Comparative study of pheromone control heuristics in ACO algorithms for
           solving RCPSP problems
    • Authors: Antonio Gonzalez-Pardo; Javier Del Ser; David Camacho
      Pages: 241 - 255
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Antonio Gonzalez-Pardo, Javier Del Ser, David Camacho
      Constraint Satisfaction Problems (CSP) belong to a kind of traditional NP-hard problems with a high impact on both research and industrial domains. The goal of these problems is to find a feasible assignment for a group of variables where a set of imposed restrictions is satisfied. This family of NP-hard problems demands a huge amount of computational resources even for their simplest cases. For this reason, different heuristic methods have been studied so far in order to discover feasible solutions at an affordable complexity level. This paper elaborates on the application of Ant Colony Optimization (ACO) algorithms with a novel CSP-graph based model to solve Resource-Constrained Project Scheduling Problems (RCPSP). The main drawback of this ACO-based model is related to the high number of pheromones created in the system. To overcome this issue we propose two adaptive Oblivion Rate heuristics to control the number of pheromones: the first one, called Dynamic Oblivion Rate, takes into account the overall number of pheromones produced in the system, whereas the second one inspires from the recently contributed Coral Reef Optimization (CRO) solver. A thorough experimental analysis has been carried out using the public PSPLIB library, and the obtained results have been compared to those of the most relevant contributions from the related literature. The performed experiments reveal that the Oblivion Rate heuristic removes at least 79% of the pheromones in the system, whereas the ACO algorithm renders statistically better results than other algorithmic counterparts from the literature.
      Graphical abstract image

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.06.042
      Issue No: Vol. 60 (2017)
       
  • A modified ant system to achieve better balance between intensification
           and diversification for the traveling salesman problem
    • Authors: Yuzhe Yan; Han-suk Sohn; German Reyes
      Pages: 256 - 267
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Yuzhe Yan, Han-suk Sohn, German Reyes
      This paper presents a new variant of Ant Colony Optimization (ACO) for the Traveling Salesman Problem (TSP). ACO has been successfully used in many combinatorial optimization problems. However, ACO has a problem in reaching the global optimal solutions for TSPs, and the algorithmic performance of ACO tends to deteriorate significantly as the problem size increases. In the proposed modification, adaptive tour construction and pheromone updating strategies are embedded into the conventional Ant System (AS), to achieve better balance between intensification and diversification in the search process. The performance of the proposed algorithm is tested on randomly generated data and well-known existing data. The computational results indicate the proposed modification is effective and efficient for the TSP and competitive with Ant Colony System (ACS), Max-Min Ant System (MMAS), and Artificial Bee Colony (ABC) Meta-Heuristic.
      Graphical abstract image

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.06.049
      Issue No: Vol. 60 (2017)
       
  • A multiobjective approach for optimal placement and sizing of distributed
           generators and capacitors in distribution network
    • Authors: Partha P. Biswas; R. Mallipeddi; P.N. Suganthan; Gehan A.J. Amaratunga
      Pages: 268 - 280
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Partha P. Biswas, R. Mallipeddi, P.N. Suganthan, Gehan A.J. Amaratunga
      Both active and reactive power play important roles in power system transmission and distribution networks. While active power does the useful work, reactive power supports the voltage that necessitates control from system reliability aspect as deviation of voltage from nominal range may lead to inadvertent operation and premature failure of system components. Reactive power flow must also be controlled in the system to maximize the amount of real power that can be transferred across the power transmitting media. This paper proposes an approach to simultaneously minimize the real power loss and the net reactive power flow in the system when reinforced with distributed generators (DGs) and shunt capacitors (SCs). With the suggested method, the system performance, reliability and loading capacity can be increased by reduction of losses. A multiobjective evolutionary algorithm based on decomposition (MOEA/D) is adopted to select optimal sizes and locations of DGs and SCs in large scale distribution networks with objectives being minimizing system real and reactive power losses. MOEA/D is the process of decomposition of a multiobjective optimization problem into a number of scalar optimization subproblems and optimizing those concurrently. Case studies with standard IEEE 33-bus, 69-bus, 119-bus distribution networks and a practical 83-bus distribution network are performed. Output results of MOEA/D method are compared with similar past studies and notable improvement is observed.
      Graphical abstract image

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.07.004
      Issue No: Vol. 60 (2017)
       
  • Generation of Particle Swarm Optimization algorithms: An experimental
           study using Grammar-Guided Genetic Programming
    • Authors: Péricles B.C. Miranda; Ricardo B.C. Prudêncio
      Pages: 281 - 296
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Péricles B.C. Miranda, Ricardo B.C. Prudêncio
      Particle Swarm Optimization (PSO) is largely used to solve optimization problems effectively. Nonetheless, the PSO performance depends on the fine tuning of different parameters. To make the algorithm design process more independent from human intervention, some researchers have treated this task as an optimization problem. Grammar-Guided Genetic Programming (GGGP) algorithms, in particular, have been widely studied and applied in the context of algorithm optimization. GGGP algorithms produce customized designs based on a set of production rules defined in the grammar, differently from methods that simply select designs in a pre-defined limited search space. Although GGGP algorithms have been largely used in other contexts, they have not been deeply investigated in the generation of PSO algorithms. Thus, this work applies GGGP algorithms in the context of PSO algorithm design problem. Herein, we performed an experimental study comparing different GGGP approaches for the generation of PSO algorithms. The main goal is to perform a deep investigation aiming to identify pros and cons of each approach in the current task. In the experiments, a comparison between a tree-based GGGP approach and commonly used linear GGGP approaches for the generation of PSO algorithms was performed. The results showed that the tree-based GGGP produced better algorithms than the counterparts. We also compared the algorithms generated by the tree-based technique to state-of-the-art optimization algorithms, and it achieved competitive results.
      Graphical abstract image

      PubDate: 2017-07-12T03:58:40Z
      DOI: 10.1016/j.asoc.2017.06.040
      Issue No: Vol. 60 (2017)
       
  • Expected hesitant VaR for tail decision making under probabilistic
           hesitant fuzzy environment
    • Authors: Wei Zhou; Zeshui Xu
      Pages: 297 - 311
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Wei Zhou, Zeshui Xu
      Generally, to reasonably make decision, all evaluation information should be aggregated, and thus, the ranking and the optimal alternative can be obtained. However, in some extreme cases, the decision maker (DM) can only focus on the tail information such as the big-loss or big-gain values and wants to ask the simple question “How bad can a thing become?” or “How good can a thing become?” To address this type of decision-making issue, this paper introduces the definition of value at risk (VaR), which is a famous term in the financial field, and the probabilistic hesitant fuzzy element (PHFE), which is a general hesitant fuzzy element (HFE) and has recently become a popular topic. Then, the hesitant VaR (HVaR) is defined, and its mathematical presentation is provided to measure the tail information of the PHFEs. It is found that the tail information calculated by the HVaR is segmentary, and only the boundary value is used. Therefore, this paper further develops the expected HVaR (EHVaR) to improve the HVaR, which can describe the entire tail information. Two simple examples are provided to show and compare the proposed HVaR and EHVaR. To apply the EHVaR into a group decision making that focuses on the tail information, this paper proposes a dynamic programming model to calculate the weights of the DMs based on the principle that the more accurate PHFE should be given a bigger weight. Then, the tail group decision making steps based on the EHVaR are presented. Finally, this paper provides an example of selecting the optimal stock for four newly listed stocks in China to demonstrate the effectiveness of the proposed approaches.
      Graphical abstract image

      PubDate: 2017-07-24T03:47:33Z
      DOI: 10.1016/j.asoc.2017.06.057
      Issue No: Vol. 60 (2017)
       
  • A two-stage fuzzy multi-objective framework for segmentation of 3D MRI
           brain image data
    • Authors: Sayan Kahali; Sudip Kumar Adhikari; Jamuna Kanta Sing
      Pages: 312 - 327
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Sayan Kahali, Sudip Kumar Adhikari, Jamuna Kanta Sing
      Segmentation of Magnetic Resonance Imaging (MRI) brain image data has a significant impact on the computer guided medical image diagnosis and analysis. However, due to limitation of image acquisition devices and other related factors, MRI images are severely affected by the noise and inhomogeneity artefacts which lead to blurry edges in the intersection of the intra-organ soft tissue regions, making the segmentation process more difficult and challenging. This paper presents a novel two-stage fuzzy multi-objective framework (2sFMoF) for segmenting 3D MRI brain image data. In the first stage, a 3D spatial fuzzy c-means (3DSpFCM) algorithm is introduced by incorporating the 3D spatial neighbourhood information of the volume data to define a new local membership function along with the global membership function for each voxel. In particular, the membership functions actually define the underlying relationship between the voxels of a close cubic neighbourhood and image data in 3D image space. The cluster prototypes thus obtained are fed into a 3D modified fuzzy c-means (3DMFCM) algorithm, which further incorporates local voxel information to generate the final prototypes. The proposed framework addresses the shortcomings of the traditional FCM algorithm, which is highly sensitive to noise and may stuck into a local minima. The method is validated on a synthetic image volume and several simulated and in-vivo 3D MRI brain image volumes and found to be effective even in noisy data. The empirical results show the supremacy of the proposed method over the other FCM based algorithms and other related methods devised in the recent past.
      Graphical abstract image

      PubDate: 2017-07-24T03:47:33Z
      DOI: 10.1016/j.asoc.2017.07.001
      Issue No: Vol. 60 (2017)
       
  • Quaternion-based Deep Belief Networks fine-tuning
    • Authors: João Paulo Papa; Gustavo H. Rosa; Danillo R. Pereira; Xin-She Yang
      Pages: 328 - 335
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): João Paulo Papa, Gustavo H. Rosa, Danillo R. Pereira, Xin-She Yang
      Deep learning techniques have been paramount in the last years, mainly due to their outstanding results in a number of applications. In this paper, we address the issue of fine-tuning parameters of Deep Belief Networks by means of meta-heuristics in which real-valued decision variables are described by quaternions. Such approaches essentially perform optimization in fitness landscapes that are mapped to a different representation based on hypercomplex numbers that may generate smoother surfaces. We therefore can map the optimization process onto a new space representation that is more suitable to learning parameters. Also, we proposed two approaches based on Harmony Search and quaternions that outperform the state-of-the-art results obtained so far in three public datasets for the reconstruction of binary images.
      Graphical abstract image

      PubDate: 2017-07-24T03:47:33Z
      DOI: 10.1016/j.asoc.2017.06.046
      Issue No: Vol. 60 (2017)
       
  • Improved solution to the non-domination level update problem
    • Authors: Sumit Mishra; Samrat Mondal; Sriparna Saha
      Pages: 336 - 362
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Sumit Mishra, Samrat Mondal, Sriparna Saha
      In this paper, we present two approaches for non-domination level update problem. The first one is a space efficient non-domination level update (SENLU) approach. The second one is a binary search tree based efficient non-domination level update (BST-ENLU) approach which uses the basic property of binary search tree. Although the space complexity of BST-ENLU approach is higher than SENLU approach in case of insertion, but in terms of number of dominance comparisons, BST-ENLU approach can outperform SENLU approach. Thus, these two approaches are complementary to each other. The comparative results show that in case where all the solutions are in different fronts, the maximum number of dominance comparisons using BST-ENLU approach is very less than ENLU approach. A tree based approach is introduced to identify the correct position of the solution to be deleted efficiently. Also a theoretical upper bound to the maximum number of dominance comparisons is obtained for both the proposed approaches in case of both insertion and deletion operations.

      PubDate: 2017-07-24T03:47:33Z
      DOI: 10.1016/j.asoc.2017.06.038
      Issue No: Vol. 60 (2017)
       
  • Effective local search algorithms for high school timetabling problems
    • Authors: Landir Saviniec; Ademir Aparecido Constantino
      Pages: 363 - 373
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Landir Saviniec, Ademir Aparecido Constantino
      This paper addresses the high school timetabling problem. The problem consists in building weekly timetables for meetings between classes and teachers with the goal of minimizing violations of specific requirements. In the last decades, several mixed-integer programs have been proposed and tested for this family of problems. However, medium and large size instances are still not effectively solved by these programs using state-of-the-art solvers and the scientific community has given special attention to the devising of alternative soft computing algorithms. In this paper, we propose a soft computing approach based on Iterated Local Search and Variable Neighborhood Search metaheuristic frameworks. Our algorithms incorporate new neighborhood structures and local search routines to perform an effective search. We validated the proposed algorithms on variants of the problem using seven public instances and a new dataset with 34 real-world instances including large cases. The results demonstrate that the proposed algorithms outperform the state-of-the-art approaches in both cases, finding the best solutions in 38 out of the 41 tested instances.

      PubDate: 2017-07-24T03:47:33Z
      DOI: 10.1016/j.asoc.2017.06.047
      Issue No: Vol. 60 (2017)
       
  • A multiobjective robust controller synthesis approach aided by
           multicriteria decision analysis
    • Authors: Wagner Eustáquio Gomes Bachur; Eduardo Nunes Gonçalves; Jaime Arturo Ramírez; Lucas S. Batista
      Pages: 374 - 386
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Wagner Eustáquio Gomes Bachur, Eduardo Nunes Gonçalves, Jaime Arturo Ramírez, Lucas S. Batista
      This paper proposes a methodology for robust dynamic output-feedback control synthesis of uncertain linear systems represented by polytopic models. This control problem results in a semi-infinite optimization problem. The proposed synthesis procedure improves a previous two-step procedure, composed of synthesis and analysis, by employing both a multiobjective evolutionary algorithm (MOEA) and a multiple criteria decision making (MCDM) strategy in the synthesis step. The analysis stage is performed via a Branch and Bound (B&B) algorithm, enabling the validation of the former step. In the proposed multiobjective approach, the project aim is to meet the specifications of (i) reference signal tracking response, (ii) disturbance rejection and (iii) measurement noise attenuation. The project specifications are quantified in terms of H ∞ and H 2 norms of closed-loop transfer functions. Essentially, this technique combines the flexibility of a dedicated MOEA together with the minimax semi-infinite programming problem. Since a MOEA evolves a set of candidate solutions in parallel, the suggested strategy provides a diverse set of controller designs, which is very useful for an a posteriori decision-making process. A proposed multicriteria decision-aid strategy is employed, in addition, as a controller design tool, aiming to incorporate the decision-maker preferences throughout the process, which (i) enables a guided evolutionary search to a trade-off region (of solutions) of practical interest and (ii) assists the definition of an adequate final controller, characterized by a reasonable practical trade-off concerning the criteria. The application of the suggested framework is illustrated on three case studies in order to demonstrate the effectiveness of the method presented.
      Graphical abstract image

      PubDate: 2017-07-24T03:47:33Z
      DOI: 10.1016/j.asoc.2017.06.027
      Issue No: Vol. 60 (2017)
       
  • Slope stability evaluation using Gaussian processes with various
           covariance functions
    • Authors: Fei Kang; Bin Xu; Junjie Li; Sizeng Zhao
      Pages: 387 - 396
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Fei Kang, Bin Xu, Junjie Li, Sizeng Zhao
      This paper presents a stability evaluation method for slopes based on Gaussian processes (GPs), which is a popular machine learning technique for nonlinear system modeling. Covariance function is one of the most critical parts in GPs modeling, because it determines the properties of sample functions drawn from the Gaussian process prior. Sixteen covariance functions are tested on several datasets for slope stability evaluation problems. Experimental: results show that GPs models can reflect the complex relationship between input and output variables. The obtained results are better or similar to the results obtained by several other existing methods, such as artificial neural networks, support vector machines, etc. The other important attractions of GPs include a simple training process and a predictive distribution of the system output.
      Graphical abstract image

      PubDate: 2017-07-24T03:47:33Z
      DOI: 10.1016/j.asoc.2017.07.011
      Issue No: Vol. 60 (2017)
       
  • Implementation of regularization for separable nonlinear least squares
           problems
    • Authors: Xiaoyong Zeng; Hui Peng; Feng Zhou; Yanhui Xi
      Pages: 397 - 406
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Xiaoyong Zeng, Hui Peng, Feng Zhou, Yanhui Xi
      This paper considers a class of separable nonlinear least squares problems in which a model can be represented as a linear combination of nonlinear functions. A regularized nonlinear parameter optimization approach is presented for coping with the potential ill-conditioned problem of parameter divergence. Together with a regularization parameter detection technique, Tikhonov regularization and truncated singular value decomposition are utilized in the estimation of the linear parameters if the nonlinear parameters are changed during the parameter optimization process, which centers on a nonlinear parameter search using the Levenberg-Marquardt algorithm. Benefiting from the regularization in parameter optimization, the potential ill-conditioned issue can be avoided, and the multi-step-ahead forecasting accuracy of the estimated model may be largely improved. The usefulness of this approach is illustrated by means of a chaotic time-series prediction and nonlinear industrial process modeling.
      Graphical abstract image

      PubDate: 2017-07-24T03:47:33Z
      DOI: 10.1016/j.asoc.2017.07.006
      Issue No: Vol. 60 (2017)
       
  • A novel hybridization strategy for krill herd algorithm applied to
           clustering techniques
    • Authors: Laith Mohammad Abualigah; Ahamad Tajudin Khader; Essam Said Hanandeh; Amir Hossein Gandomi
      Pages: 423 - 435
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Laith Mohammad Abualigah, Ahamad Tajudin Khader, Essam Said Hanandeh, Amir Hossein Gandomi
      Krill herd (KH) is a stochastic nature-inspired optimization algorithm that has been successfully used to solve numerous complex optimization problems. This paper proposed a novel hybrid of KH algorithm with harmony search (HS) algorithm, namely, H-KHA, to improve the global (diversification) search ability. The enhancement includes adding global search operator (improvise a new solution) of the HS algorithm to the KH algorithm for improving the exploration search ability by a new probability factor, namely, Distance factor, thereby moving krill individuals toward the best global solution. The effectiveness of the proposed H-KHA is tested on seven standard datasets from the UCI Machine Learning Repository that are commonly used in the domain of data clustering, also six common text datasets that are used in the domain of text document clustering. The experiments reveal that the proposed hybrid KHA with HS algorithm (H-KHA) enhanced the results in terms of accurate clusters and high convergence rate. Mostly, the performance of H-KHA is superior or at least highly competitive with the original KH algorithm, well-known clustering techniques and other comparative optimization algorithms.

      PubDate: 2017-07-24T03:47:33Z
      DOI: 10.1016/j.asoc.2017.06.059
      Issue No: Vol. 60 (2017)
       
  • Statistical genetic programming for symbolic regression
    • Authors: Maryam Amir Haeri; Mohammad Mehdi Ebadzadeh; Gianluigi Folino
      Pages: 447 - 469
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Maryam Amir Haeri, Mohammad Mehdi Ebadzadeh, Gianluigi Folino
      In this paper, a new genetic programming (GP) algorithm for symbolic regression problems is proposed. The algorithm, named statistical genetic programming (SGP), uses statistical information—such as variance, mean and correlation coefficient—to improve GP. To this end, we define well-structured trees as a tree with the following property: nodes which are closer to the root have a higher correlation with the target. It is shown experimentally that on average, the trees with structures closer to well-structured trees are smaller than other trees. SGP biases the search process to find solutions whose structures are closer to a well-structured tree. For this purpose, it extends the terminal set by some small well-structured subtrees, and starts the search process in a search space that is limited to semi-well-structured trees (i.e., trees with at least one well-structured subtree). Moreover, SGP incorporates new genetic operators, i.e., correlation-based mutation and correlation-based crossover, which use the correlation between outputs of each subtree and the targets, to improve the functionality. Furthermore, we suggest a variance-based editing operator which reduces the size of the trees. SGP uses the new operators to explore the search space in a way that it obtains more accurate and smaller solutions in less time. SGP is tested on several symbolic regression benchmarks. The results show that it increases the evolution rate, the accuracy of the solutions, and the generalization ability, and decreases the rate of code growth.
      Graphical abstract image

      PubDate: 2017-08-02T20:19:00Z
      DOI: 10.1016/j.asoc.2017.06.050
      Issue No: Vol. 60 (2017)
       
  • The construction and analysis of the 3C manufacturer-led distributor
           optimization consignment model using global search particle swarm
           optimization
    • Authors: Shen-Tsu Wang
      Pages: 470 - 481
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Shen-Tsu Wang
      In Computer, Communications and Consumer-Electronics (3C) industries, manufacturers must provide the exact predicted demand or number of contracts with brand manufacturers so that distributors can prepare the correct inventory. Moreover, manufacturers are obligated to provide weekly or monthly production capacity and components consumption to distributors in order to facilitate distributor deliveries for timely stocking to maintain the right amount of inventory within Hub warehouses. Thus, the establishment of a consignment cooperation model is very important. This study considered the estimated proportion of profits assigned to distributors under the leadership of the manufacturers and established and analyzed the mathematical model of the final product unit sales prices, as well as the final product unit production cost using global search particle swarm optimization (PSO). According to the analysis results, the proportion of profits assigned to distributors is not necessarily higher when the product unit sales volume is higher; for distributors, more components in stock naturally raise the cost. The consignment cooperation model helps increase the profits of the manufacturer. It is expected that the establishment and analysis of the model proposed herein can provide manufacturers in the 3C industries with decision-making suggestions.

      PubDate: 2017-08-02T20:19:00Z
      DOI: 10.1016/j.asoc.2017.07.024
      Issue No: Vol. 60 (2017)
       
  • Occupancy estimation from environmental parameters using wrapper and
           hybrid feature selection
    • Authors: M.K. Masood; Yeng Chai Soh; Chaoyang Jiang
      Pages: 482 - 494
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): M.K. Masood, Yeng Chai Soh, Chaoyang Jiang
      Occupancy information is essential to facilitate demand-driven operations of air-conditioning and mechanical ventilation (ACMV) systems. Environmental sensors are increasingly being explored as cost effective and non-intrusive means to obtain the occupancy information. This requires the extraction and selection of useful features from the sensor data. In past works, feature selection has generally been implemented using filter-based approaches. In this work, we introduce the use of wrapper and hybrid feature selection for better occupancy estimation. To achieve a fast computation time, we introduce a ranking-based incremental search in our algorithms, which is more efficient than the exhaustive search used in past works. For wrapper feature selection, we propose the WRANK-ELM, which searches an ordered list of features using the extreme learning machine (ELM) classifier. For hybrid feature selection, we propose the RIG-ELM, which is a filter–wrapper hybrid that uses the relative information gain (RIG) criterion for feature ranking and the ELM for the incremental search. We present experimental results in an office space with a multi-sensory network to validate the proposed algorithms.

      PubDate: 2017-08-02T20:19:00Z
      DOI: 10.1016/j.asoc.2017.07.003
      Issue No: Vol. 60 (2017)
       
  • Radio-frequency inductor synthesis using evolutionary computation and
           Gaussian-process surrogate modeling
    • Authors: F. Passos; E. Roca; R. Castro-López; F.V. Fernández
      Pages: 495 - 507
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): F. Passos, E. Roca, R. Castro-López, F.V. Fernández
      In recent years, the application of evolutionary computation techniques to electronic circuit design problems, ranging from digital to analog and radiofrequency circuits, has received increasing attention. The level of maturity runs inversely to the complexity of the design task, less complex in digital circuits, higher in analog ones and still higher in radiofrequency circuits. Radiofrequency inductors are key culprits of such complexity. Their key performance parameters are inductance and quality factors, both a function of the frequency. The inductor optimization requires knowledge of such parameters at a few representative frequencies. Most common approaches for optimization-based radiofrequency circuit design use analytical models for the inductors. Although a lot of effort has been devoted to improve the accuracy of such analytical models, errors in inductance and quality factor in the range of 5%–25% are usual and it may go as high as 200% for some device sizes. When the analytical models are used in optimization-based circuit design approaches, these errors lead to suboptimal results, or, worse, to a disastrous non-fulfilment of specifications. Expert inductor designers rely on iterative evaluations with electromagnetic simulators, which, properly configured, are able to yield a highly accurate performance evaluation. Unfortunately, electromagnetic simulations typically take from some tens of seconds to a few hours, hampering their coupling to evolutionary computation algorithms. Therefore, analytical models and electromagnetic simulation represent extreme cases of the accuracy-efficiency trade-off in performance evaluation of radiofrequency inductors. Surrogate modeling strategies arise as promising candidates to improve such trade-off. However, obtaining the necessary accuracy is not that easy as inductance and quality factor at some representative frequencies must be obtained and both performances change abruptly around the self-resonance frequency, which is particular to each device and may be located above or below the frequencies of interest. Both, offline and online training methods will be considered in this work and a new two-step strategy for inductor modeling is proposed that significantly improves the accuracy of offline methods The new strategy is demonstrated and compared for both, single-objective and multi-objective optimization scenarios. Numerous experimental results show that the proposed two-step approach outperforms simpler application strategies of surrogate modelling techniques, getting comparable performances to approaches based on electromagnetic simulation but with orders of magnitude less computational effort.
      Graphical abstract image

      PubDate: 2017-08-02T20:19:00Z
      DOI: 10.1016/j.asoc.2017.07.036
      Issue No: Vol. 60 (2017)
       
  • Automated extraction of fragments of Bayesian networks from textual
           sources
    • Authors: Marcello Trovati; Jer Hayes; Francesco Palmieri; Nik Bessis
      Pages: 508 - 519
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Marcello Trovati, Jer Hayes, Francesco Palmieri, Nik Bessis
      Mining large amounts of unstructured data for extracting meaningful, accurate, and actionable information, is at the core of a variety of research disciplines including computer science, mathematical and statistical modelling, as well as knowledge engineering. In particular, the ability to model complex scenarios based on unstructured datasets is an important step towards an integrated and accurate knowledge extraction approach. This would provide a significant insight in any decision making process driven by Big Data analysis activities. However, there are multiple challenges that need to be fully addressed in order to achieve this, especially when large and unstructured data sets are considered. In this article we propose and analyse a novel method to extract and build fragments of Bayesian networks (BNs) from unstructured large data sources. The results of our analysis show the potential of our approach, and highlight its accuracy and efficiency. More specifically, when compared with existing approaches, our method addresses specific challenges posed by the automated extraction of BNs with extensive applications to unstructured and highly dynamic data sources. The aim of this work is to advance the current state-of-the-art approaches to the automated extraction of BNs from unstructured datasets, which provide a versatile and powerful modelling framework to facilitate knowledge discovery in complex decision scenarios.
      Graphical abstract image

      PubDate: 2017-08-02T20:19:00Z
      DOI: 10.1016/j.asoc.2017.07.009
      Issue No: Vol. 60 (2017)
       
  • Weighted support vector data description based on chaotic bat algorithm
    • Authors: Javad Hamidzadeh; Reza Sadeghi; Neda Namaei
      Pages: 540 - 551
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Javad Hamidzadeh, Reza Sadeghi, Neda Namaei
      Support Vector Data Description (SVDD) is a support vector based learning algorithm for anomaly detection. In this method, the target is to form a boundary around the normalcy data by building a hyper-sphere. To gain noticeable accuracy, a control parameter is used to regulate the hyper-sphere volume. The value of this parameter depends on the data characteristics. Thus, there is no proper way to estimate it. On the other hand, the number of free parameters increases in the more improved versions of SVDD. In this paper, an evolutionary algorithm, Chaotic Bat Algorithm, is used with the aim of designing effective description of data. The proposed method, weighted SVDD based on Chaotic Bat Algorithm (WSVDD-CBA) is constructed based on a new weight and ergodicity of chaotic functions and automatic switching between global and local searches of Bat Algorithm (BA). To evaluate this method several experiments have been conducted based on 10-fold cross-validation over some data sets from UCI repository. Experimental results show the superiority of the proposed algorithm to state-of-the-art methods in the terms of classification accuracy, precision and recall rate measures.

      PubDate: 2017-08-02T20:19:00Z
      DOI: 10.1016/j.asoc.2017.07.038
      Issue No: Vol. 60 (2017)
       
  • An oblique elliptical basis function network approach for supervised
           learning applications
    • Authors: Hung-Wen Peng; Shie-Jue Lee; Chie-Hong Lee
      Pages: 552 - 563
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Hung-Wen Peng, Shie-Jue Lee, Chie-Hong Lee
      We propose a neural network architecture based on the oblique elliptical basis function for supervised learning problems. In classification, a category can be a disconnected or non-convex region involving several overlapping or disjoint sub-regions of the feature space. Other existing supervised learning methods may have the restriction that only allows decision regions to be convex. Our proposed method overcomes this restriction by employing a rotational self-constructing clustering algorithm to decompose the feature space into a collection of sub-regions which can then be combined to make up individual categories. An unseen instance is classified to a certain category if its similarity to the category exceeds a threshold. The whole framework fits in a five-layer network consisting of input, component-similarity, cluster-similarity, aggregation, and output layers. A similar idea also applies to solving regression problems. A parameter learning algorithm based on least squares estimation is used to derive the weights of the underlying network. Our approach can offer some advantages in practicality. Through the incorporation of rotation, data can be clustered more appropriately than by standard elliptical basis functions. Also, our approach is applicable to single-label classification, multi-label classification, as well as regression problems. A number of experiments are conducted to show the effectiveness of the proposed approach.
      Graphical abstract image

      PubDate: 2017-08-02T20:19:00Z
      DOI: 10.1016/j.asoc.2017.07.019
      Issue No: Vol. 60 (2017)
       
  • A new extension to PROMETHEE under intuitionistic fuzzy environment for
           solving supplier selection problem with linguistic preferences
    • Authors: Krishankumar R; Ravichandran KS; A.B. Saeid
      Pages: 564 - 576
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Krishankumar R, Ravichandran KS, A.B. Saeid
      This paper presents a new two-tier decision making framework with linguistic preferences for scientific decision making. The major reason for adopting linguistic preference is to ease the process of rating of alternatives by allowing decision makers (DMs) to strongly emphasize their opinion on each alternative. In the first tier, aggregation is done using a newly proposed operator called linguistic based aggregation (LBA), which aggregates linguistic terms directly without making any conversion. The main motivation for this proposal is driven by the previous studies on aggregation theory which reveals that conversion leads to loss of information and formation of virtual sets which are no longer sensible and rational for decision making process. Secondly, in the next tier, a new ranking method called IFSP (intuitionistic fuzzy set based PROMETHEE) is proposed which is an extension to PROMETHEE (preference ranking organization method for enrichment evaluation) under intuitionistic fuzzy set (IFS) context. Unlike previous ranking methods, this ranking method follows a new formulation by considering personal choice of the DMs over each alternative. The main motivation for such formulation is derived from the notion of not just obtaining a suitable alternative but also coherently satisfying the DMs’ viewpoint during decision process. Finally, the practicality of the framework is tested by using supplier selection (SS) problem for an automobile factory. The strength and weakness of the proposed LBA-IFSP framework are verified by comparing with other methods under the realm of theoretical and numerical analysis. The results from the analysis infer that proposed LBA-IFSP framework is rationally coherent to DMs’ viewpoint, moderately consistent with other methods and highly stable and robust against rank reversal issue.
      Graphical abstract image

      PubDate: 2017-08-02T20:19:00Z
      DOI: 10.1016/j.asoc.2017.07.028
      Issue No: Vol. 60 (2017)
       
  • Neural network modeling relationship between inputs and state mapping
           plane obtained by FDA–t-SNE for visual industrial process monitoring
    • Authors: Jiawei Tang; Xuefeng Yan
      Pages: 577 - 590
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Jiawei Tang, Xuefeng Yan
      Fault monitoring and diagnosis can significantly help in understanding the actual operation of modern chemical processes. Data visualization can enable technical staff to visually detect and diagnose various fault conditions compared with other conventional techniques. Thus, fisher discriminant analysis (FDA), t-distributed stochastic neighbor embedding (t-SNE), and back-propagation (BP) artificial neural networks are implemented for visual fault monitoring and diagnosis. Three fundamental steps are involved. First, FDA is employed to extract the main features of the dataset, which contain different states of data. Second, t-SNE is applied for data visualization, and on the mapping plane, the various states of the chemical process have their own mapping areas. Third, BP is conducted to model the relationship between inputs and the location of mapping points on the mapping plane. Finally, the trained BP net can be utilized for fault monitoring and diagnosis. Detailed comparative experiments are studied based on the Tennessee Eastman process among FDA, SOM and FDA-SOM to analyze the performance of the combined method. This method is highly competitive for visual fault monitoring and diagnosis than other state-of-art methods.
      Graphical abstract image

      PubDate: 2017-08-02T20:19:00Z
      DOI: 10.1016/j.asoc.2017.07.022
      Issue No: Vol. 60 (2017)
       
  • An integrated logarithmic fuzzy preference programming based methodology
           for optimum maintenance strategies selection
    • Authors: Yawei Ge; Mingqing Xiao; Zhao Yang; Lei Zhang; Zewen Hu; Delong Feng
      Pages: 591 - 601
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Yawei Ge, Mingqing Xiao, Zhao Yang, Lei Zhang, Zewen Hu, Delong Feng
      Selecting optimum maintenance strategies plays a key role in saving cost, and improving the system reliability and availability. Analytic hierarchical process (AHP) is widely used for maintenance strategies selection in the Multiple Criteria Decision-Making (MCDM) field. But the traditional or hybrid AHP methods either produce multiple, even conflict priority results, or have complicated algorithm structures which are unstable to obtain the optimum solution. Therefore, this paper proposes an integrated Logarithmic Fuzzy Preference Programming (LFPP) based methodology in AHP to solve the optimum maintenance strategies selection problem. The multiplicative constraints and deviation variables are applied instead of additive ones to utilize both qualitative and quantitative data, and process the upper and lower triangular fuzzy judgments to obtain the same priorities. The proposed methodology can produce the unique normalized optimal priority vector for fuzzy pairwise comparison matrices, and it is capable of processing all comparison matrices to obtain the global priorities simultaneously and directly in the form of super-matrix according to the different requirements and judgments of decision-makers. Finally, an example is provided to demonstrate the feasibility and validity of the proposed methodology.
      Graphical abstract image

      PubDate: 2017-08-02T20:19:00Z
      DOI: 10.1016/j.asoc.2017.07.021
      Issue No: Vol. 60 (2017)
       
  • An evolutionary algorithm with directed weights for constrained
           multi-objective optimization
    • Authors: Chaoda Peng; Hai-Lin Liu; Fangqing Gu
      Pages: 613 - 622
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): Chaoda Peng, Hai-Lin Liu, Fangqing Gu
      When solving constrained multi-objective optimization problems (CMOPs), keeping infeasible individuals with good objective values and small constraint violations in the population can improve the performance of the algorithms, since they provide the information about the optimal direction towards Pareto front. By taking the constraint violation as an objective, we propose a novel constraint-handling technique based on directed weights to deal with CMOPs. This paper adopts two types of weights, i.e. feasible and infeasible weights distributing on feasible and infeasible regions respectively, to guide the search to the promising region. To utilize the useful information contained in infeasible individuals, this paper uses infeasible weights to maintain a number of well-diversified infeasible individuals. Meanwhile, they are dynamically changed along with the evolution to prefer infeasible individuals with better objective values and smaller constraint violations. Furthermore, 18 test instances and 2 engineering design problems are used to evaluate the effectiveness of the proposed algorithm. Several numerical experiments indicate that the proposed algorithm outperforms four compared algorithms in terms of finding a set of well-distributed non-domination solutions.

      PubDate: 2017-08-02T20:19:00Z
      DOI: 10.1016/j.asoc.2017.06.053
      Issue No: Vol. 60 (2017)
       
  • A new hybrid particle swarm and simulated annealing stochastic
           optimization method
    • Authors: F. Javidrad; M. Nazari
      Pages: 634 - 654
      Abstract: Publication date: November 2017
      Source:Applied Soft Computing, Volume 60
      Author(s): F. Javidrad, M. Nazari
      A novel hybrid particle swarm and simulated annealing stochastic optimization method is proposed. The proposed hybrid method uses both PSO and SA in sequence and integrates the merits of good exploration capability of PSO and good local search properties of SA. Numerical simulation has been performed for selection of near optimum parameters of the method. The performance of this hybrid optimization technique was evaluated by comparing optimization results of thirty benchmark functions of different dimensions with those obtained by other numerical methods considering three criteria. These criteria were stability, average trial function evaluations for successful runs and the total average trial function evaluations considering both successful and failed runs. Design of laminated composite materials with required effective stiffness properties and minimum weight design of a three-bar truss are addressed as typical applications of the proposed algorithm in various types of optimization problems. In general, the proposed hybrid PSO-SA algorithm demonstrates improved performance in solution of these problems compared to other evolutionary methods The results of this research show that the proposed algorithm can reliably and effectively be used for various optimization problems.
      Graphical abstract image

      PubDate: 2017-08-02T20:19:00Z
      DOI: 10.1016/j.asoc.2017.07.023
      Issue No: Vol. 60 (2017)
       
  • A method of defuzzification based on the approach of areas' ratio
    • Authors: Maxim V. Bobyr; Natalya A. Milostnaya; Sergey A. Kulabuhov
      Pages: 19 - 32
      Abstract: Publication date: October 2017
      Source:Applied Soft Computing, Volume 59
      Author(s): Maxim V. Bobyr, Natalya A. Milostnaya, Sergey A. Kulabuhov
      The new method of defuzzification of output parameters from the base of fuzzy rules for a Mamdani fuzzy controller is given in the paper. The peculiarity of the method is the usage of the universal equation for the area computation of the geometric shapes. During the realization of fuzzy inference linguistic terms, the structure changes from the triangular into a trapezoidal shape. That is why the universal equation is used. The method is limited and can be used only for the triangular and trapezoidal membership functions. Gaussian functions can also be used while modifying the proposed method. Traditional defuzzification models such as Middle of Maxima − MoM, First of Maxima − FoM, Last of Maxima − LoM, First of Suppport − FoS, Last of Support − LoS, Middle of Support − MoS, Center of Sums − CoS, Model of Height − MoH have a number of systematic errors: curse of dimensionality, partition of unity condition and absence of additivity. The above-mentioned methods can be seen as Center of Gravity − CoG, which has the same errors. These errors lead to the fact that accuracy of fuzzy systems decreases, because during the training root mean square error increases. One of the reasons that provokes the errors is that some of the activated fuzzy rules are excluded from the fuzzy inference. It is also possible to increase the accuracy of the fuzzy system through properties of continuity. The proposed method guarantees fulfilling of the property of continuity, as the intersection point of the adjustment linguistic terms equals 0.5 when a parametrized membership function is used. The causes of errors and a way to delete them are reviewed in the paper. The proposed method excludes errors which are inherent to the traditional and non- traditional models of defuzzification. Comparative analysis of the proposed method of defuzzification with traditional and non-traditional models shows its effectiveness.
      Graphical abstract image

      PubDate: 2017-06-02T02:21:18Z
      DOI: 10.1016/j.asoc.2017.05.040
      Issue No: Vol. 59 (2017)
       
  • Multi-objective differential evolution with performance-metric-based
           self-adaptive mutation operator for chemical and biochemical dynamic
           optimization problems
    • Authors: Qinqin Fan; Weili Wang; Xuefeng Yan
      Pages: 33 - 44
      Abstract: Publication date: October 2017
      Source:Applied Soft Computing, Volume 59
      Author(s): Qinqin Fan, Weili Wang, Xuefeng Yan
      Each mutation operator of differential evolution (DE) algorithm is generally suitable for certain specific types of multi-objective optimization problems (MOPs) or particular stages of the evolution. To automatically select an appropriate mutation operator for solving MOPs in different phases of the evolution, a multi-objective differential evolution with performance-metric-based self-adaptive mutation operator (MODE-PMSMO) is proposed in this study. In MODE-PMSMO, a modified inverted generational distance (IGD) is utilized to evaluate the performance of each mutation operator and guide the evolution of mutation operators. The proposed MODE-PMSMO is then compared with seven multi-objective evolutionary algorithms (MOEAs) on five bi-objective and five tri-objective optimization problems. Generally, MODE-PMSMO exhibits the best average performance among all compared algorithms on ten MOPs. Additionally, MODE-PMSMO is employed to solve four typical multi-objective dynamic optimization problems in chemical and biochemical processes. Experimental results indicate that MODE-PMSMO is suitable for solving these actual problems and can provide a set of nondominated solutions for references of decision makers.
      Graphical abstract image

      PubDate: 2017-06-12T06:00:37Z
      DOI: 10.1016/j.asoc.2017.05.044
      Issue No: Vol. 59 (2017)
       
  • Distributed generation allocation with on-load tap changer on radial
           distribution networks using adaptive genetic algorithm
    • Authors: Sanjib Ganguly; Dipanjan Samajpati
      Pages: 45 - 67
      Abstract: Publication date: October 2017
      Source:Applied Soft Computing, Volume 59
      Author(s): Sanjib Ganguly, Dipanjan Samajpati
      This paper presents a distribution generation (DG) allocation strategy along with on-load tap changer (OLTC) for radial distribution networks using adaptive genetic algorithm (AGA). The optimal locations for DG units and OLTC, the optimal generation for the DG units, and the OLTC tap ratio are determined by minimizing a weighted objective function comprising of network power loss and maximum bus voltage deviation. A planning model incorporating DG and OLTC models is devised. Three different types of DG units, i.e., DG operating at lagging, leading, and unity power factor are used in the planning. Two new AGA variants based on adaptively varying crossover and mutation probabilities are proposed and used in this work as solution strategies and their performances are compared with some of the existing similar type of AGA variants using the results of multiple runs. The performances of the proposed AGA variants are found to be better in terms of quality of the solutions and consistency. The results also show that the combined operation of DG and OLTC reduces significant amount of power loss and bus voltage deviation. A direct performance comparison with some of the similar approaches shows that the solutions obtained with the proposed approach provide similar amount of power loss reduction and bus voltage improvement with lesser amount of DG penetration level. The approach is demonstrated on a 69-bus test distribution network and a 52-bus Indian practical distribution network.
      Graphical abstract image

      PubDate: 2017-06-02T02:21:18Z
      DOI: 10.1016/j.asoc.2017.05.041
      Issue No: Vol. 59 (2017)
       
  • A hierarchical global path planning approach for mobile robots based on
           multi-objective particle swarm optimization
    • Authors: Thi Thoa Mac; Cosmin Copot; Duc Trung Tran; Robin De Keyser
      Pages: 68 - 76
      Abstract: Publication date: October 2017
      Source:Applied Soft Computing, Volume 59
      Author(s): Thi Thoa Mac, Cosmin Copot, Duc Trung Tran, Robin De Keyser
      In this paper, a novel hierarchical global path planning approach for mobile robots in a cluttered environment is proposed. This approach has a three-level structure to obtain a feasible, safe and optimal path. In the first level, the triangular decomposition method is used to quickly establish a geometric free configuration space of the robot. In the second level, Dijkstra's algorithm is applied to find a collision-free path used as input reference for the next level. Lastly, a proposed particle swarm optimization called constrained multi-objective particle swarm optimization with an accelerated update methodology based on Pareto dominance principle is employed to generate the global optimal path with the focus on minimizing the path length and maximizing the path smoothness. The contribution of this work consists in: (i) The development of a novel optimal hierarchical global path planning approach for mobile robots moving in a cluttered environment; (ii) The development of proposed particle swarm optimization with an accelerated update methodology based on Pareto dominance principle to solve robot path planning problems; (iii) Providing optimal global robot paths in terms of the path length and the path smoothness taking into account the physical robot system limitations with computational efficiency. Simulation results in various types of environments are conducted in order to illustrate the superiority of the hierarchical approach.
      Graphical abstract image

      PubDate: 2017-06-06T16:00:50Z
      DOI: 10.1016/j.asoc.2017.05.012
      Issue No: Vol. 59 (2017)
       
  • A study of overfitting in optimization of a manufacturing quality control
           procedure
    • Authors: Tea Tušar; Klemen Gantar; Valentin Koblar; Bernard Ženko; Bogdan Filipič
      Pages: 77 - 87
      Abstract: Publication date: October 2017
      Source:Applied Soft Computing, Volume 59
      Author(s): Tea Tušar, Klemen Gantar, Valentin Koblar, Bernard Ženko, Bogdan Filipič
      Quality control of the commutator manufacturing process can be automated by means of a machine learning model that can predict the quality of commutators as they are being manufactured. Such a model can be constructed by combining machine vision, machine learning and evolutionary optimization techniques. In this procedure, optimization is used to minimize the model error, which is estimated using single cross-validation. This work exposes the overfitting that emerges in such optimization. Overfitting is shown for three machine learning methods with different sensitivity to it (trees, additionally pruned trees and random forests) and assessed in two ways (repeated cross-validation and validation on a set of unseen instances). Results on two distinct quality control problems show that optimization amplifies overfitting, i.e., the single cross-validation error estimate for the optimized models is overly optimistic. Nevertheless, minimization of the error estimate by single cross-validation in general results in minimization of the other error estimates as well, showing that optimization is indeed beneficial in this context.
      Graphical abstract image

      PubDate: 2017-06-06T16:00:50Z
      DOI: 10.1016/j.asoc.2017.05.027
      Issue No: Vol. 59 (2017)
       
  • An improved MOEA/D algorithm for multi-objective multicast routing with
           network coding
    • Authors: Huanlai Xing; Zhaoyuan Wang; Tianrui Li; Hui Li; Rong Qu
      Pages: 88 - 103
      Abstract: Publication date: October 2017
      Source:Applied Soft Computing, Volume 59
      Author(s): Huanlai Xing, Zhaoyuan Wang, Tianrui Li, Hui Li, Rong Qu
      Network coding enables higher network throughput, more balanced traffic, and securer data transmission. However, complicated mathematical operations incur when packets are combined at intermediate nodes, which, if not operated properly, lead to very high network resource consumption and unacceptable delay. Therefore, it is of vital importance to minimize various network resources and end-to-end delays while exploiting promising benefits of network coding. Multicast has been used in increasingly more applications, such as video conferencing and remote education. In this paper the multicast routing problem with network coding is formulated as a multi-objective optimization problem (MOP), where the total coding cost, the total link cost and the end-to-end delay are minimized simultaneously. We adapt the multi-objective evolutionary algorithm based on decomposition (MOEA/D) for this MOP by hybridizing it with a population-based incremental learning technique which makes use of the global and historical information collected to provide additional guidance to the evolutionary search. Three new schemes are devised to facilitate the performance improvement, including a probability-based initialization scheme, a problem-specific population updating rule, and a hybridized reproduction operator. Experimental results clearly demonstrate that the proposed algorithm outperforms a number of state-of-the-art MOEAs regarding the solution quality and computational time.
      Graphical abstract image

      PubDate: 2017-06-12T06:00:37Z
      DOI: 10.1016/j.asoc.2017.05.033
      Issue No: Vol. 59 (2017)
       
  • Prey predator hyperheuristic
    • Authors: Surafel Luleseged Tilahun
      Pages: 104 - 114
      Abstract: Publication date: October 2017
      Source:Applied Soft Computing, Volume 59
      Author(s): Surafel Luleseged Tilahun
      Prey predator algorithm is a population based metaheuristic algorithm inspired by the interaction between a predator and its prey. In the algorithm, a solution with a better performance is called best prey and focuses totally on exploitation whereas the solution with least performance is called predator and focuses totally on exploration. The remaining solutions are called ordinary prey and either exploit promising regions by following better performing solutions or explore the solution space by randomly running away from the predator. Recently, it has been shown that by increasing the number of best prey or predator, it is possible to adjust the degree of exploitation and exploration. Even though, this tuning has the advantage of easily controlling these search behaviors, it is not an easy task. As any other metaheuristic algorithm, the performance of prey predator algorithm depends on the proper degree of exploration and exploitation of the decision space. In this paper, the concept of hyperheuristic is employed to balance the degree of exploration and exploitation of the algorithm. So that it learns and decides the best search behavior for the problem at hand in iterations. The ratio of the number of the best prey and the predators are used as low level heuristics. From the simulation results the balancing of the degree of exploration and exploitation by using hyperheuristic mechanism indeed improves the performance of the algorithm. Comparison with other algorithms shows the effectiveness of the proposed approach.
      Graphical abstract image

      PubDate: 2017-06-06T16:00:50Z
      DOI: 10.1016/j.asoc.2017.04.044
      Issue No: Vol. 59 (2017)
       
  • UFuzzy: Fuzzy models with Universum
    • Authors: L. Tencer; M. Reznakova; M. Cheriet
      Pages: 1296 - 1315
      Abstract: Publication date: October 2017
      Source:Applied Soft Computing, Volume 59
      Author(s): L. Tencer, M. Reznakova, M. Cheriet
      Recently, many works have begun to explore the possibility of using samples out of the training set to improve their results. One of these approaches, Universum, introduced by Vapnik had already been used in combination with several classifiers to increase their accuracy. In this paper, we present a novel approach for identifying the consequent parameters of the Takagi-Sugeno Fuzzy Model, U Fuzzy. It is based on the idea of the Universum set, which acts to regularize the optimization problem. It also helps with the introduction of prior knowledge to the tasks performed by the model. In addition, we explore the influence of the Universum set on identifying the structure of fuzzy rules using the c-means clustering algorithm. We evaluated our approach on several generated and real-world classification datasets and it shows promising results in comparison to the baseline methods, which do not use the Universum set.

      PubDate: 2017-06-02T02:21:18Z
      DOI: 10.1016/j.asoc.2016.05.041
      Issue No: Vol. 52 (2017)
       
  • Inside Front Cover - Editorial Board Page
    • Abstract: Publication date: October 2017
      Source:Applied Soft Computing, Volume 59


      PubDate: 2017-08-02T20:19:00Z
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs
Your IP address: 54.145.95.149
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016