Evolutionary Techniques in Multi-Objective Optimization Problems in Non-Standardized Production Processes

Frutos, Mariano; Olivera, Ana Carolina; Tohmé, Fernando

doi:10.5772/36739

Cited by 1 publication

(1 citation statement)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some investigations have used the nearest neighbor methods in conjunction with repair techniques to block JSSP problems and with the intention of evaluating, generating a statistical analysis of a large set of generated neighbor solutions to detect critical characteristics of the repair scheme and the space search in general [29]. To solve the multi-objective JSSP, the nearest neighbor method was used to evaluate the density of solutions and guide the search more efficiently [30]. The closest neighbor was used to find not only the closest neighbor of distance 1 but also the closest neighbor of distances n where n>1.…”

Section: Introductionmentioning

confidence: 99%

Hybrid metaheuristic to solve job sequencing problem

Anaya-Fuentes

Rivera-Gómez

Montaño-Arango

et al. 2022

IJEECS

View full text Add to dashboard Cite

<p>In this article, the job shop scheduling problem was solved, which is considered as an NP - Hard problem, so it is difficult to solve. The proposed algorithm consists in the combination and adaptation of the nearest neighbor meta heuristics and iterated local search (ILS) to find optimal solutions. The proposed algorithm was evaluated by comparing the results with those presented in different instances and sizes of the literature. The results of the proposed method were close in high percentages to the best re sults and averages obtained by other methods in the literature and in some cases, they were improved. The above represents the feasibility of a new combination of efficient methods in solving task scheduling problems.</p>

show abstract

Section: Introductionmentioning

confidence: 99%