Hybrid ant colony system algorithm for static and dynamic job scheduling in grid computing

Grid computing is a distributed system with heterogeneous infrastructures. Resource management system (RMS) is one of the most important components which has great influence on the grid computing performance. The main part of RMS is the scheduler algorithm which has the responsibility to map submitted tasks to available resources. The complexity of scheduling problem is considered as a nondeterministic polynomial complete (NP-complete) problem and therefore, an intelligent algorithm is required to achieve better scheduling solution. One of the prominent intelligent algorithms is ant colony system (ACS) which is implemented widely to solve various types of scheduling problems. However, ACS suffers from stagnation problem in medium and large size grid computing system. ACS is based on exploitation and exploration mechanisms where the exploitation is sufficient but the exploration has a deficiency. The exploration in ACS is based on a random approach without any strategy. This study proposed four hybrid algorithms between ACS, Genetic Algorithm (GA), and Tabu Search (TS) algorithms to enhance the ACS performance. The algorithms are ACS(GA), ACS+GA, ACS(TS), and ACS+TS. These proposed hybrid algorithms will enhance ACS in terms of exploration mechanism and solution refinement by implementing low and high levels hybridization of ACS, GA, and TS algorithms. The proposed algorithms were evaluated against twelve metaheuristic algorithms in static (expected time to compute model) and dynamic (distribution pattern) grid computing environments. A simulator called ExSim was developed to mimic the static and dynamic nature of the grid computing. Experimental results show that the proposed algorithms outperform ACS in terms of best makespan values. Performance of ACS(GA), ACS+GA, ACS(TS), and ACS+TS are better than ACS by 0.35%, 2.03%, 4.65% and 6.99% respectively for static environment. For dynamic environment, performance of ACS(GA), ACS+GA, ACS+TS, and ACS(TS) are better than ACS by 0.01%, 0.56%, 1.16%, and 1.26% respectively. The proposed algorithms can be used to schedule tasks in grid computing with better performance in terms of makespan

Bacterial-foraging optimization algorithm for non-hazardous plant layouts

PresentationThe following article approaches a safe plant layout design problem based on a bacterial-foraging optimization algorithm. Our approach finds the position in the two dimensional plane for each main process unit and evaluates the possibility of secondary contention for pertinent units, in order to minimize capital costs associated to equipment loss, piping, secondary contention, and usage of area. Fire and Explosion hazard is considered as the relevant safety aspect for distribution, and it is assessed through Dow’s Fire and Explosion Index. The proposed solution approach provides an alternative to hard-optimization methods, by allowing greater flexibility in accounting for both safety and economic aspects, while providing high quality solutions in a limited computation time. The aim of our proposed solution approach is to provide support to expert decision-making during the early plant layout design steps. A case study based on an acrylic-acid production plant, which has been used by several other papers that appeared in the literature, serves the purposes of showing the appropriateness and effectiveness of the method

PID, BFO-optimized PID, and PD-FLC control of a two-wheeled machine with two-direction handling mechanism: a comparative study

In this paper; three control approaches are utilized in order to control the stability of a novel five-degrees-of-freedom two-wheeled robotic machine designed for industrial applications that demand a limited-space working environment. Proportional–integral–derivative (PID) control scheme, bacterial foraging optimization of PID control method, and fuzzy logic control method are applied to the wheeled machine to obtain the optimum control strategy that provides the best system stabilization performance. According to simulation results, considering multiple motion scenarios, the PID controller optimized by bacterial foraging optimization method outperformed the other two control methods in terms of minimum overshoot, rise time, and applied input forces

A Review of the Family of Artificial Fish Swarm Algorithms: Recent Advances and Applications

The Artificial Fish Swarm Algorithm (AFSA) is inspired by the ecological behaviors of fish schooling in nature, viz., the preying, swarming, following and random behaviors. Owing to a number of salient properties, which include flexibility, fast convergence, and insensitivity to the initial parameter settings, the family of AFSA has emerged as an effective Swarm Intelligence (SI) methodology that has been widely applied to solve real-world optimization problems. Since its introduction in 2002, many improved and hybrid AFSA models have been developed to tackle continuous, binary, and combinatorial optimization problems. This paper aims to present a concise review of the family of AFSA, encompassing the original ASFA and its improvements, continuous, binary, discrete, and hybrid models, as well as the associated applications. A comprehensive survey on the AFSA from its introduction to 2012 can be found in [1]. As such, we focus on a total of {\color{blue}123} articles published in high-quality journals since 2013. We also discuss possible AFSA enhancements and highlight future research directions for the family of AFSA-based models.Comment: 37 pages, 3 figure

Improvements on the bees algorithm for continuous optimisation problems

This work focuses on the improvements of the Bees Algorithm in order to enhance the algorithm’s performance especially in terms of convergence rate. For the first enhancement, a pseudo-gradient Bees Algorithm (PG-BA) compares the fitness as well as the position of previous and current bees so that the best bees in each patch are appropriately guided towards a better search direction after each consecutive cycle. This method eliminates the need to differentiate the objective function which is unlike the typical gradient search method. The improved algorithm is subjected to several numerical benchmark test functions as well as the training of neural network. The results from the experiments are then compared to the standard variant of the Bees Algorithm and other swarm intelligence procedures. The data analysis generally confirmed that the PG-BA is effective at speeding up the convergence time to optimum. Next, an approach to avoid the formation of overlapping patches is proposed. The Patch Overlap Avoidance Bees Algorithm (POA-BA) is designed to avoid redundancy in search area especially if the site is deemed unprofitable. This method is quite similar to Tabu Search (TS) with the POA-BA forbids the exact exploitation of previously visited solutions along with their corresponding neighbourhood. Patches are not allowed to intersect not just in the next generation but also in the current cycle. This reduces the number of patches materialise in the same peak (maximisation) or valley (minimisation) which ensures a thorough search of the problem landscape as bees are distributed around the scaled down area. The same benchmark problems as PG-BA were applied against this modified strategy to a reasonable success. Finally, the Bees Algorithm is revised to have the capability of locating all of the global optimum as well as the substantial local peaks in a single run. These multi-solutions of comparable fitness offers some alternatives for the decision makers to choose from. The patches are formed only if the bees are the fittest from different peaks by using a hill-valley mechanism in this so called Extended Bees Algorithm (EBA). This permits the maintenance of diversified solutions throughout the search process in addition to minimising the chances of getting trap. This version is proven beneficial when tested with numerous multimodal optimisation problems

Desenvolvimento de algoritmo para otimização de linhas de montagem

O balanceamento de uma linha de produção tem como objetivo anular o “gargalo” de produção, promovendo o máximo de produtividade e eficiência, mantendo o ritmo de trabalho adequado do processo produtivo. Desta forma, o presente projeto foca-se na identificação e eliminação de desperdícios, melhorando os processos de montagem, mediante o estudo dos tempos de ciclo dos postos de trabalhos e as tarefas executadas por cada operador. Na análise feita à linha, é descrito o processo com todas as tarefas inerentes à montagem da cadeira porta-bebé, bem como as fotografias da instrução de trabalho e controlo que auxiliam a montagem da cadeira. De igual forma são apresentados os dados recolhidos inicialmente e a proposta de melhoria. Posto isto, foi criada uma interface com o Excel, que indica qual o número teórico de operadores necessários, dado o nº de encomendas requeridas para um determinado período de tempo. Esta interface recorre a um problema de otimização, que é resolvido com recurso do Solver para efetuar a afetação das diferentes tarefas aos operadores. A análise feita, se for implementada, poderá ter um impacto positivo na produção final das cadeiras porta-bebés, no que diz respeito à diminuição de filas de espera entre postos, diminuição dos tempos de inatividade e aumento da eficiência da linha. Este modelo proposto pode ser ajustado às restantes linhas de montagem com vista à sua otimização.Balancing a production line aims to eliminate the production “bottleneck”, promoting maximum productivity and efficiency, maintaining the proper work rhythm of the production process. In this way, the present project focuses on the identification and elimination of waste, improving the assembly processes, by studying the cycle times of the workstations and the tasks performed by each operator. In the analysis carried out on the line, the process is described with all the tasks inherent to the assembly of the baby seat, as well as the photographs of the work and control instructions that help the assembly of the chair. Likewise, the data collected initially and the improvement proposal are presented. Thus said, an interface was created with Excel, which indicates the theoretical number of operators needed, given the number of orders required for a certain period of time. This interface uses an optimization problem, which is solved using Solver to allocate the different tasks to the operators. The analysis carried out, if implemented, could have a positive impact on the final production of baby seats, in terms of reducing queues between stations, reducing downtime and increasing the efficiency of the line. This proposed model can be adjusted to the remaining assembly lines with a view to its optimization

Assembly sequence planning using hybrid binary particle swarm optimization

Assembly Sequence Planning (ASP) is known as a large-scale, timeconsuming combinatorial problem. Therefore time is the main factor in production planning. Recently, ASP in production planning had been studied widely especially to minimize the time and consequently reduce the cost. The first objective of this research is to formulate and analyse a mathematical model of the ASP problem. The second objective is to minimize the time of the ASP problem and hence reduce the product cost. A case study of a product consists of 19 components have been used in this research, and the fitness function of the problem had been calculated using Binary Particle Swarm Optimization (BPSO), and hybrid algorithm of BPSO and Differential Evolution (DE). The novel algorithm of BPSODE has been assessed with performance-evaluated criteria (performance measure). The algorithm has been validated using 8 comprehensive benchmark problems from the literature. The results show that the BPSO algorithm has an improved performance and can reduce further the time of assembly of the 19 parts of the ASP compared to the Simulated Annealing and Genetic Algorithm. The novel hybrid BPSODE algorithm shows a superior performance when assessed via performance-evaluated criteria compared to BPSO. The BPSODE algorithm also demonstrated a good generation of the recorded optimal value for the 8 standard benchmark problems

Enhancing the bees algorithm using the traplining metaphor

This work aims to improve the performance of the Bees Algorithm (BA), particularly in terms of simplicity, accuracy, and convergence. Three improvements were made in this study as a result of bees’ traplining behaviour. The first improvement was the parameter reduction of the Bees Algorithm. This strategy recruits and assigns worker bees to exploit and explore all patches. Both searching processes are assigned using the Triangular Distribution Random Number Generator. The most promising patches have more workers and are subject to more exploitation than the less productive patches. This technique reduced the original parameters into two parameters. The results show that the Bi-BA is just as efficient as the basic BA, although it has fewer parameters. Following that, another improvement was proposed to increase the diversification performance of the Combinatorial Bees Algorithm (CBA). The technique employs a novel constructive heuristic that considers the distance and the turning angle of the bees’ flight. When foraging for honey, bees generally avoid making a sharp turn. By including this turning angle as the second consideration, it can control CBA’s initial solution diversity. Third, the CBA is strengthened to enable an intensification strategy that avoids falling into a local optima trap. The approach is based on the behaviour of bees when confronted with threats. They will keep away from re-visiting those flowers during the next bout for reasons like predators, rivals, or honey run out. The approach will remove temporarily threatened flowers from the whole tour, eliminating the sharp turn, and reintroduces them again to the habitual tour’s nearest edge. The technique could effectively achieve an equilibrium between exploration and exploitation mechanisms. The results show that the strategy is very competitive compared to other population-based nature-inspired algorithms. Finally, the enhanced Bees Algorithms are demonstrated on two real-world engineering problems, namely, Printed Circuit Board insertion sequencing and vehicles routing problem