Biased random-key genetic algorithms: A review

MA Londe, LS Pessoa, CE Andrade… - European Journal of …, 2024 - Elsevier
This paper is a comprehensive literature review of Biased Random-Key Genetic Algorithms
(BRKGA). BRKGA is a metaheuristic that employs random-key-based chromosomes with …

Order acceptance and scheduling with sequence-dependent setup times: A new memetic algorithm and benchmark of the state of the art

L He, A Guijt, M de Weerdt, L **ng… - Computers & Industrial …, 2019 - Elsevier
Abstract The Order Acceptance and Scheduling (OAS) problem describes a class of real-
world problems such as in smart manufacturing and satellite scheduling. This problem …

Concurrent optimisation of modular product and Reconfigurable Manufacturing System configuration: a customer-oriented offer for mass customisation

R Campos Sabioni, J Daaboul… - International journal of …, 2022 - Taylor & Francis
ABSTRACT Reconfigurable Manufacturing Systems (RMS) emerged from companies' needs
to increase their responsiveness to an uncertain market, in which customers are increasingly …

A new efficient biased random key genetic algorithm for open shop scheduling with routing by capacitated single vehicle and makespan minimization

LR Abreu, RF Tavares-Neto, MS Nagano - Engineering Applications of …, 2021 - Elsevier
Over the last years, researchers have been paying particular attention to scheduling
problems integrating production environments and distribution systems to adopt more …

Optimizing deep neural networks to predict the effect of social distancing on COVID-19 spread

D Liu, W Ding, ZS Dong, W Pedrycz - Computers & Industrial Engineering, 2022 - Elsevier
Abstract Deep Neural Networks (DNN) form a powerful deep learning model that can
process unprecedented volumes of data. The hyperparameters of DNN have a significant …

Towards more efficient local search algorithms for constrained clustering

J Gao, X Tao, S Cai - Information sciences, 2023 - Elsevier
Constrained clustering extends clustering by integrating user constraints, and aims to
determine an optimal assignment under the constraints. In this paper, we propose a local …

[HTML][HTML] A matheuristic for large-scale capacitated clustering

M Gnägi, P Baumann - Computers & operations research, 2021 - Elsevier
Clustering addresses the problem of assigning similar objects to groups. Since the size of
the clusters is often constrained in practical clustering applications, various capacitated …

The dial-a-ride problem with private fleet and common carrier

CM Schenekemberg, AA Chaves, LC Coelho… - Computers & Operations …, 2022 - Elsevier
Dial-a-ride problems aim to design the least-costly door-to-door vehicle routes for
transporting individual users, subject to several service constraints like time windows …

A dual-population based evolutionary algorithm for multi-objective location problem under uncertainty of facilities

C Wang, Z Wang, Y Tian, X Zhang… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
Due to natural disasters or system failures, the facility has the risk of disruption, and thus
improving the location reliability under uncertainty of facilities becomes an important issue …

[HTML][HTML] Evolutionary algorithms for optimization sequence of cut in the laser cutting path problem

BA Junior, GN de Carvalho, MC Santos, PR Pinheio… - Applied Sciences, 2023 - mdpi.com
Efficiently cutting smaller two-dimensional parts from a larger surface area is a recurring
challenge in many manufacturing environments. This point falls under the cut-and-pack …