Parameter Relaxation Methods in Memeti Algorithms

Memeti Algorithms for the Traveling Salesman Problem

Memeti Algorithms for the Un onstrained Binary Quadrati Programming Problem

Convergence of a semi-analytical method on the fuzzy linear systems

In this paper, we apply the  homotopy analysis method (HAM) for solving fuzzy  linear systems and present  the necessary and sufficient conditions for the convergence of series solution obtained via the HAM. Also, we present a new criterion for choosing a proper value of convergence-control parameter $hbar$ when the HAM is applied to linear system of equations. Comparisons are made between the ...

Dirichlet-neumann and Neumann-neumann Waveform Relaxation Algorithms for Parabolic Problems

We present and analyze waveform relaxation variants of the Dirichlet-Neumann and NeumannNeumann methods for parabolic problems. These methods are based on a non-overlapping spatial domain decomposition, and each iteration involves subdomain solves with Dirichlet boundary conditions followed by subdomain solves with Neumann boundary conditions. However, unlike for elliptic problems, each subdoma...

Efficient and Robust Parameter Tuning for Heuristic Algorithms

The main advantage of heuristic or metaheuristic algorithms compared to exact optimization methods is their ability in handling large-scale instances within a reasonable time, albeit at the expense of losing a guarantee for achieving the optimal solution. Therefore, metaheuristic techniques are appropriate choices for solving NP-hard problems to near optimality. Since the parameters of heuristi...