Hybrid ant systems for the dynamic facility layout problem

Domain Decomposition of Finite Element Models and Bandwidth Reduction of Sparse Matrices

“…Then, the optimal medians in graph are selected through the sum of distance of nodes to optimum medians. Recently, metaheuristics algorithms such as Genetic algorithms [15,16], bionomic approaches [17] and ant colony [18,19] are developed in order to obtain solutions for k-median problem.…”

A New Trend in Designing Plant Layouts for the Process Industry

“…Genetic algorithms are able to solve optimization problems containing non-differentiable objective functions thought the global optimum is not guaranteed (Castell et al, 1998;Martens, 2004;Mavridou and Pardalos, 1997;Wu et al, 2007). In addition, simulated annealing has been applied in the layout of manufacturing systems (Balakrishnan et al, 2003;McKendall and Shang, 2006 The models to solve the layout problems cited above did not directly include safety issues. A new trend in designing plant layouts for the process industry consists of extending the layout formulations with safety issues.…”

Locating Emergency Facilities Using the Weighted k-median Problem: A Graph-metaheuristic Approach

“…Then, the optimal medians of the graph are selected through the sum of the distances of the nodes from medians. Recently, metaheuristics such as Genetic algorithms [14,15], bionomic approaches [16] and ant colony algorithm [17,18] have been developed in order to obtain solutions for the k-median problem.…”