A Differential Evolution Approach for NTJ-NFSSP with SDSTs and RDs

An Enhanced Differential Evolution Algorithm with Fast Evaluating Strategies for TWT-NFSP with SSTs and RTs

“…Search. Since DE exhibited strong global search ability in many previous studies, DE_FES's global search is devised according to the DE/rand-to-best/1/ exp scheme [28,29,35,36], in which the base vector is set to the best of all individuals. is means the valuable information of the best individual can be shared among all individuals during the evolution process.…”

“…erefore, S123 Find Best N interchange (π) adopts the "comprehensive neighbourhood search scheme" similar to that in [29], instead of the "first-improvement-move neighbourhood search scheme" in [28] and the "random variable neighbourhood search scheme" in [35]. Meanwhile, due to the use of the low-bound property, the CC of S123 Find Best N interchange (π) is smaller than that of the neighbourhood search in [29], which allows DE_FES to have a more efficient local search engine.…”

“…Wang et al [27] designed an effective discrete DE for the blocking FSPs. Hu et al [28] designed an effective DE, namely, DE_NTJ, for the NFSP with SSTs and RTs. e criterion is to minimize the number of tardy jobs.…”

A Novel Differential Evolution Algorithm for TWET-NFSSP with SDSTs and RDs

“…Wang et al [9] proposed an efficient discrete differential evolution algorithm for FSSPs with blocking. Recently, Hu et al [10] presented a hybrid DE algorithm (DE_NTJ) for ∑ − j j sd U r ST wait no Fm / , , / , which is the current best approach for the problem considered. To the best of our knowledge, there has no promising results on w r ST wait no Fm , and there has no published work addressing it by using DE-based algorithm.…”

“…Wang et al [9] proposed an efficient discrete differential evolution algorithm for FSSPs with blocking. Recently, Hu et al [10] , and there has no published work addressing it by using DE-based algorithm.…”