The single-row facility layout problem (SRFLP) is an NP-hard combinatorial optimization problem that is concerned with the arrangement of n departments of given lengths on a line so as to minimize the weighted sum of the distances between department pairs. (SRFLP) is the one-dimensional version of the facility layout problem that seeks to arrange rectangular facilities so as to minimize the ove...

In this paper we analyze various parallel implementations of the Ant Colony Optimization (ACO) applied to the Minimum Weight Vertex Cover Problem (MWVCP). We investigated the ACO algorithms applied to the MWCVP before. Here, we observe the behavior of different parallel topologies and corresponding algorithms like fully connected, replace worst, ring and independent parallel runs. We also prese...

Abstract In this paper, a surrogate merit function (SMF) is proposed to be evaluated instead of the traditional functions (i.e., penalized weight structure). The standard format conventional needs several expensive trial-and-error tuning processes enhance optimization convergence quality, retuning for different structural model configurations, and final manual local search in case converges inf...

Gate and runway combinational optimization (GRCO) problem is of great significance in airport operation. In this paper, experimental analysis is performed on the parameters characteristics of the discrete particle swarm optimization (DPSO) algorithm for combinatorial optimization problems. Inertia weight, acceleration constants and population size all have an important impact on the performance...