This work addresses the flexible job shop scheduling problem with transportation (FJSPT), which can be seen as an extension of both the flexible job shop scheduling problem (FJSP) …
In this paper, we propose a novel hybrid fuzzy–metaheuristic approach with the aim of overcoming premature convergence when solving multimodal single and multi-objective …
A random-key genetic algorithm is an evolutionary metaheuristic for discrete and global optimization. Each solution is encoded as a vector of n random keys, where a random key is …
DBMM Fontes, SM Homayouni - Flexible Services and Manufacturing …, 2023 - Springer
This work formulates a mixed-integer linear programming (MILP) model and proposes a bi- objective multi-population biased random key genetic algorithm (mp-BRKGA) for the joint …
T Karabaş, S Meral - Computers & Industrial Engineering, 2023 - Elsevier
The unit commitment problem (UCP) is one of the fundamental problems in power systems planning and operations that comprises two decisions: commitment and dispatching of …
The minimization of tool switches problem (MTSP) seeks a sequence to process a set of jobs so that the number of tool switches required is minimized. The MTSP is well known to be NP …
Y Guan, K Pan, K Zhou - IISE transactions, 2018 - Taylor & Francis
Recently, increasing penetration of renewable energy generation has created challenges for power system operators to perform efficient power generation daily scheduling, due to the …
H De Faria, MGC Resende, D Ernst - Journal of Heuristics, 2017 - Springer
This work presents a biased random-key genetic algorithm (BRKGA) to solve the electric distribution network reconfiguration problem (DNR). The DNR is one of the most studied …
This paper presents a survey on studies devising biased-random key genetic algorithms (BRKGAs), a novel variant of the ordinary genetic algorithms (GAs) introduced in 2000s, for …