Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs

L Calvet, J de Armas, D Masip, AA Juan - Open Mathematics, 2017 - degruyter.com
This paper reviews the existing literature on the combination of metaheuristics with machine
learning methods and then introduces the concept of learnheuristics, a novel type of hybrid …

A walk into metaheuristics for engineering optimization: principles, methods and recent trends

N Xiong, D Molina, ML Ortiz… - international journal of …, 2015 - Taylor & Francis
Metaheuristics has attained increasing interest for solving complex real-world problems.
This paper studies the principles and the state-of-the-art of metaheuristic methods for …

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-based memetic algorithm for the distributed assembly permutation flow-shop scheduling problem

SY Wang, L Wang - IEEE Transactions on Systems, Man, and …, 2015 - ieeexplore.ieee.org
In this paper, an estimation of distribution algorithm (EDA)-based memetic algorithm (MA) is
proposed for solving the distributed assembly permutation flow-shop scheduling problem …

Optimal sizing and location of distributed generators based on PBIL and PSO techniques

LF Grisales-Noreña, D Gonzalez Montoya… - Energies, 2018 - mdpi.com
The optimal location and sizing of distributed generation is a suitable option for improving
the operation of electric systems. This paper proposes a parallel implementation of the …

An estimation of distribution algorithm-based hyper-heuristic for the distributed assembly mixed no-idle permutation flowshop scheduling problem

F Zhao, B Zhu, L Wang - IEEE Transactions on Systems, Man …, 2023 - ieeexplore.ieee.org
The distributed assembly mixed no-idle permutation flowshop scheduling problem
(DAMNIPFSP), a common occurrence in modern industries like integrated circuit production …

A matrix-cube-based estimation of distribution algorithm for the distributed assembly permutation flow-shop scheduling problem

ZQ Zhang, B Qian, R Hu, HP Jin, L Wang - Swarm and Evolutionary …, 2021 - Elsevier
The distributed assembly permutation flow-shop scheduling problem (DAPFSP) is a typical
NP-hard combinatorial optimization problem that has wide applications in advanced …

Evolutionary multitasking in permutation-based combinatorial optimization problems: Realization with TSP, QAP, LOP, and JSP

Y Yuan, YS Ong, A Gupta, PS Tan… - 2016 IEEE Region 10 …, 2016 - ieeexplore.ieee.org
Evolutionary computation (EC) has gained increasing popularity in dealing with permutation-
based combinatorial optimization problems (PCOPs). Traditionally, EC focuses on solving a …

Composite particle swarm optimizer with historical memory for function optimization

J Li, JQ Zhang, CJ Jiang… - IEEE transactions on …, 2015 - ieeexplore.ieee.org
Particle swarm optimization (PSO) algorithm is a population-based stochastic optimization
technique. It is characterized by the collaborative search in which each particle is attracted …

A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem

J Ceberio, E Irurozki, A Mendiburu… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
The aim of this paper is two-fold. First, we introduce a novel general estimation of distribution
algorithm to deal with permutation-based optimization problems. The algorithm is based on …