In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to be NP-complete; so that heuristic techniques are usually used. The main contribution of this work is twofold: (i) a technique for de-composing a CSP into a DFS-tree CSP structure; (ii) an heuristic search technique for solving ...

Industry 4.0 houses diverse technologies including wireless communication and shared networks for internal external operations. Due to the nature remote operability, exposure security threats is high. Cyber risk detection mitigation are prominent secure industrial operations planned outcomes. In addition, system faces threat of intelligence attacks, standards issues, privacy concerns scalabilit...

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

Over the last decade, metaheuristic algorithms have emerged as a powerful paradigm for global optimization of multimodal functions formulated by nonlinear problems arising from various engineering subjects. However, numerical analyses many complex design may be performed using finite element method (FEM) or computational fluid dynamics (CFD), which function evaluations population-based are repe...