Adaptive multimodal continuous ant colony optimization

Q Yang, WN Chen, Z Yu, T Gu, Y Li… - IEEE Transactions …, 2016 - ieeexplore.ieee.org
Seeking multiple optima simultaneously, which multimodal optimization aims at, has
attracted increasing attention but remains challenging. Taking advantage of ant colony …

Model-based methods for continuous and discrete global optimization

T Bartz-Beielstein, M Zaefferer - Applied Soft Computing, 2017 - Elsevier
The use of surrogate models is a standard method for dealing with complex real-world
optimization problems. The first surrogate models were applied to continuous optimization …

An estimation of distribution algorithm for mixed-variable newsvendor problems

F Wang, Y Li, A Zhou, K Tang - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
As one of the classical problems in the economic market, the newsvendor problem aims to
make maximal profit by determining the optimal order quantity of products. However, the …

Dual-strategy differential evolution with affinity propagation clustering for multimodal optimization problems

ZJ Wang, ZH Zhan, Y Lin, WJ Yu… - IEEE Transactions …, 2017 - ieeexplore.ieee.org
Multimodal optimization problem (MMOP), which targets at searching for multiple optimal
solutions simultaneously, is one of the most challenging problems for optimization. There …

An efficient feature selection algorithm for evolving job shop scheduling rules with genetic programming

Y Mei, S Nguyen, B Xue… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Automated design of job shop scheduling rules using genetic programming as a hyper-
heuristic is an emerging topic that has become more and more popular in recent years. For …

Algebraic differential evolution algorithm for the permutation flowshop scheduling problem with total flowtime criterion

V Santucci, M Baioletti, A Milani - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
This paper introduces an original algebraic approach to differential evolution (DE)
algorithms for combinatorial search spaces. An abstract algebraic differential mutation for …

[PDF][PDF] Permutation flow shop scheduling problem with makespan criterion: literature review

ANH Zaied, MM Ismail, SS Mohamed - J. Theor. Appl. Inf. Technol, 2021 - jatit.org
With the evolution of the industry, the production process becomes a large-scale problem
that made scheduling jobs process as a combinatorial optimization problem. The most …

Dimensionality reduction for intrusion detection systems in multi-data streams—A review and proposal of unsupervised feature selection scheme

NY Almusallam, Z Tari, P Bertok, AY Zomaya - Emergent Computation: a …, 2017 - Springer
Abstract An Intrusion Detection System (IDS) is a security mechanism that is intended to
dynamically inspect traffic in order to detect any suspicious behaviour or launched attacks …

A hybrid estimation of distribution algorithm for the vehicle routing problem with time windows

R Pérez-Rodríguez, A Hernández-Aguirre - Computers & Industrial …, 2019 - Elsevier
Abstract The Vehicle Routing Problem (VRP) seeks to find minimum-travel routes for a set of
vehicles. The routes contain a set of customers with known demands. Each vehicle departs …

Variable neighborhood search for a colored traveling salesman problem

X Meng, J Li, X Dai, J Dou - IEEE Transactions on Intelligent …, 2017 - ieeexplore.ieee.org
A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple
traveling salesman problem. In our prior CTSP, each salesman is allocated a particular color …