Soft Computing

SCOPUS (2000,2003-2023)SCIE-ISI

  1433-7479

  1432-7643

 

Cơ quản chủ quản:  Springer Verlag , SPRINGER

Lĩnh vực:
Theoretical Computer ScienceSoftwareGeometry and Topology

Các bài báo tiêu biểu

Red deer algorithm (RDA): a new nature-inspired meta-heuristic
- 2020
Amir M. Fathollahi-Fard, Mostafa Hajiaghaei–Keshteli, Reza Tavakkoli‐Moghaddam
A genetic algorithm-based method for feature subset selection
Tập 12 Số 2 - Trang 111-120 - 2007
Feng Tan, Xuezheng Fu, Yanqing Zhang, Anu G. Bourgeois
Hybridizing harmony search algorithm with cuckoo search for global numerical optimization
- 2016
Gai-Ge Wang, Amir H. Gandomi, Xiangjun Zhao, Hai Cheng Chu
A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem
Tập 22 - Trang 1669-1685 - 2016
Şaban Gülcü, Mostafa Mahi, Ömer Kaan Baykan, Halife Kodaz
This article presented a parallel cooperative hybrid algorithm for solving traveling salesman problem. Although heuristic approaches and hybrid methods obtain good results in solving the TSP, they cannot successfully avoid getting stuck to local optima. Furthermore, their processing duration unluckily takes a long time. To overcome these deficiencies, we propose the parallel cooperative hybrid algorithm (PACO-3Opt) based on ant colony optimization. This method uses the 3-Opt algorithm to avoid local minima. PACO-3Opt has multiple colonies and a master–slave paradigm. Each colony runs ACO to generate the solutions. After a predefined number of iterations, each colony primarily runs 3-Opt to improve the solutions and then shares the best tour with other colonies. This process continues until the termination criterion meets. Thus, it can reach the global optimum. PACO-3Opt was compared with previous algorithms in the literature. The experimental results show that PACO-3Opt is more efficient and reliable than the other algorithms.
Performance comparison of self-adaptive and adaptive differential evolution algorithms
Tập 11 Số 7 - Trang 617-629 - 2007
Janez Brest, Borko Bošković, S. Greiner, V. Žumer, Mirjam Sepesy Maučec
Dimensionality reduction of medical big data using neural-fuzzy classifier
- 2015
Ahmad Taher Azar, Aboul Ella Hassanien
A novel multicast routing method with minimum transmission for WSN of cloud computing service
Tập 19 Số 7 - Trang 1817-1827 - 2015
Degan Zhang, Ke Zheng, Ting Zhang, Xiang Wang
Fuzzy statistics: hypothesis testing
- 2005
James J. Buckley
An improved grid search algorithm to optimize SVR for prediction
Tập 25 - Trang 5633-5644 - 2021
Yuting Sun, Shifei Ding, Zichen Zhang, Weikuan Jia
Parameter optimization is an important step for support vector regression (SVR), since its prediction performance greatly depends on values of the related parameters. To solve the shortcomings of traditional grid search algorithms such as too many invalid search ranges and sensitivity to search step, an improved grid search algorithm is proposed to optimize SVR for prediction. The improved grid search (IGS) algorithm is used to optimize the penalty parameter and kernel function parameter of SVR by automatically changing the search range and step for several times, and then SVR is trained for the optimal solution. The available of the method is proved by predicting the values of soil and plant analyzer development (SPAD) in rice leaves. To predict SPAD values more quickly and accurately, some dimension reduction methods such as stepwise multiple linear regressions (SMLR) and principal component analysis (PCA) are processed the training data, and the results show that the nonlinear fitting and prediction performance of accuracy of SMLR-IGS-SVR and PCA-IGS-SVR are better than those of IGS-SVR.