Ant Colony Optimization of Multilayer Shielding for Mixed Neutron and Gamma Radiations: A Preliminary Study

2017 ◽  
Author(s):  
Muhammad Arif Bin Sazali ◽  
Nahrul Khair Alang Md Rashid ◽  
Khaidzir Hamzah
Keyword(s):  
Ant Colony Optimization ◽  
Gamma Rays ◽  
Radiation Spectrum ◽  
Optimization Problems ◽  
Ant Colony ◽  
Combinatorial Optimization Problems ◽  
Final Layer ◽  
Preliminary Study ◽  
Gamma Radiations ◽  
Combination Of Material

Mixed neutron and gamma radiations require different shielding materials as their interaction with materials is different. Composites were developed in order to combine the shielding capabilities of different materials. However, their homogeneity is difficult to be assured which can lead to pinholes where radiation can penetrate. To avoid this problem, several materials arranged in layers can be used to shield against mixed radiations. Since the multilayer shielding can be made from any material in many configurations, the ant colony optimization (ACO) is a promising method because it deals with combinatorial optimization problems. The candidate materials are HDPE, boron, cadmium, gadolinium, tungsten, bismuth, and iron. Preliminary MCNP simulations were done to observe the effect of arrangements, thicknesses, and types of materials on the radiation spectrum. It was found that: (1) the final layer should be made of high density material, (2) an increase beyond certain thicknesses did not result in a significant increase in attenuation, and (3) there should be an optimum combination of material that can effectively shield against both neutrons and gamma rays.

An Improved Ant Colony Optimization for VRP with Time Windows

2012 ◽  
Vol 263-266 ◽  
pp. 1609-1613 ◽  
Author(s):  
Su Ping Yu ◽  
Ya Ping Li
Keyword(s):  
Ant Colony Optimization ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Distribution Systems ◽  
Optimization Problems ◽  
Time Windows ◽  
Optimal Solution ◽  
Ant Colony ◽  
Routing Problem ◽  
Combinatorial Optimization Problems

The Vehicle Routing Problem (VRP) is an important problem occurring in many distribution systems, which is also defined as a family of different versions such as the Capacitated Vehicle Routing Problem (CVRP) and the Vehicle Routing Problem with Time Windows (VRPTW). The Ant Colony Optimization (ACO) is a metaheuristic for combinatorial optimization problems. Given the ACO inadequacy, the vehicle routing optimization model is improved and the transfer of the algorithm in corresponding rules and the trajectory updated regulations is reset in this paper, which is called the Improved Ant Colony Optimization (I-ACO). Compared to the calculated results with genetic algorithm (GA) and particle swarm optimization (PSO), the correctness of the model and algorithm is verified. Experimental results show that the I-ACO can quickly and effectively obtain the optimal solution of VRFTW.

scholarly journals Enhanced Hyper-Cube Framework Ant Colony Optimization for Combinatorial Optimization Problems

Algorithms ◽  
2021 ◽  
Vol 14 (10) ◽  
pp. 286
Author(s):  
Ali Ahmid ◽  
Thien-My Dao ◽  
Ngan Van Le
Keyword(s):  
Combinatorial Optimization ◽  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Real Life ◽  
Ant Colony ◽  
Combinatorial Optimization Problems ◽  
The Right ◽  
Design Cost ◽  
Laminated Structures

Solving of combinatorial optimization problems is a common practice in real-life engineering applications. Trusses, cranes, and composite laminated structures are some good examples that fall under this category of optimization problems. Those examples have a common feature of discrete design domain that turn them into a set of NP-hard optimization problems. Determining the right optimization algorithm for such problems is a precious point that tends to impact the overall cost of the design process. Furthermore, reinforcing the performance of a prospective optimization algorithm reduces the design cost. In the current study, a comprehensive assessment criterion has been developed to assess the performance of meta-heuristic (MH) solutions in the domain of structural design. Thereafter, the proposed criterion was employed to compare five different variants of Ant Colony Optimization (ACO). It was done by using a well-known structural optimization problem of laminate Stacking Sequence Design (SSD). The initial results of the comparison study reveal that the Hyper-Cube Framework (HCF) ACO variant outperforms the others. Consequently, an investigation of further improvement led to introducing an enhanced version of HCFACO (or EHCFACO). Eventually, the performance assessment of the EHCFACO variant showed that the average practical reliability became more than twice that of the standard ACO, and the normalized price decreased more to hold at 28.92 instead of 51.17.

Omicron ACO. A New Ant Colony Optimization Algorithm

2018 ◽  
Vol 8 (1) ◽  
Author(s):  
Benjamın Baran ◽  
Osvaldo Gomez
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Problems ◽  
Population Based ◽  
Analytical Tool ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Ant Colonies ◽  
Combinatorial Optimization Problems ◽  
The Traveling Salesman Problem

Ant Colony Optimization (ACO) is a metaheuristic inspired by the foraging behavior of ant colonies that has been successful in the resolution of hard combinatorial optimization problems like the Traveling Salesman Problem (TSP). This paper proposes the Omicron ACO (OA), a novel population-based ACO alternative originally designed as an analytical tool. To experimentally prove OA advantages, this work compares the behavior between the OA and the MMAS as a function of time in two well-known TSP problems. A simple study of the behavior of OA as a function of its parameters shows its robustness.

Unit Commitment by Evolving Ant Colony Optimization

2010 ◽  
Vol 1 (3) ◽  
pp. 67-77 ◽  
Author(s):  
K. Vaisakh ◽  
L. R. Srinivas
Keyword(s):  
Ant Colony Optimization ◽  
Unit Commitment ◽  
Optimization Problems ◽  
Problem Formulation ◽  
Ant Colony ◽  
Spinning Reserve ◽  
Combinatorial Optimization Problems ◽  
Start Up ◽  
The Traveling Salesman Problem ◽  
Optimal Set

Ant Colony Optimization is more suitable for combinatorial optimization problems. ACO is successfully applied to the traveling salesman problem, and multistage decision making of ACO has an edge over other conventional methods. In this paper, the authors propose the Evolving Ant Colony Optimization (EACO) method for solving unit commitment (UC) problem. The EACO employs Genetic Algorithm (GA) for finding optimal set of ACO parameters, while ACO solves the UC problem. Problem formulation takes into consideration the minimum up and down time constraints, start up cost, spinning reserve, and generation limit constraints. The feasibility of the proposed approach is demonstrated on the systems with number of generating units in the range of 10 to 60. The test results are encouraging and compared with those obtained by other methods.

scholarly journals Optimization of Branched Water Distribution Systems by Means of a Physarum—Inspired Algorithm

Proceedings ◽  
2018 ◽  
Vol 2 (11) ◽  
pp. 598
Author(s):  
Elias Koritsas ◽  
Epameinondas Sidiropoulos ◽  
Chris Evangelides
Keyword(s):  
Ant Colony Optimization ◽  
Distribution Systems ◽  
Water Distribution ◽  
Optimization Problems ◽  
Water Distribution Systems ◽  
Supply System ◽  
Ant Colony ◽  
Resources Allocation ◽  
Biologically Inspired ◽  
Combinatorial Optimization Problems

Optimizing water distribution systems is an essential part of water resources allocation planning. It leads to challenging combinatorial optimization problems, for which meta-heuristics have been applied, notably genetic algorithms and ant colony optimization. The present paper introduces the application of the physarum algorithm, a recent biologically inspired algorithm, utilized hitherto for path finding problems in networks. Direct comparison is presented to ant colony optimization applied to a typical water supply system.

scholarly journals A Multiple Pheromone Table Based Ant Colony Optimization for Clustering

2015 ◽  
Vol 2015 ◽  
pp. 1-11
Author(s):  
Kai-Cheng Hu ◽  
Chun-Wei Tsai ◽  
Ming-Chao Chiang ◽  
Chu-Sing Yang
Keyword(s):  
Approximate Solution ◽  
Combinatorial Optimization ◽  
Ant Colony Optimization ◽  
High Probability ◽  
Search Strategy ◽  
Optimization Problems ◽  
Clustering Algorithms ◽  
Ant Colony ◽  
Combinatorial Optimization Problems ◽  
Search Directions

Ant colony optimization (ACO) is an efficient heuristic algorithm for combinatorial optimization problems, such as clustering. Because the search strategy of ACO is similar to those of other well-known heuristics, the probability of searching particular regions will be increased if better results are found and kept. Although this kind of search strategy may find a better approximate solution, it also has a high probability of losing the potential search directions. To prevent the ACO from losing too many potential search directions at the early iterations, a novel pheromone updating strategy is presented in this paper. In addition to the “original” pheromone table used to keep track of thepromisinginformation, a second pheromone table is added to the proposed algorithm to keep track of theunpromisinginformation so as to increase the probability of searching directions worse than the current solutions. Several well-known clustering datasets are used to evaluate the performance of the proposed method in this paper. The experimental results show that the proposed method can provide better results than ACO and other clustering algorithms in terms of quality.

scholarly journals University course timetabling model using ant colony optimization algorithm approach

2019 ◽  
Vol 13 (1) ◽  
pp. 72 ◽  
Author(s):  
Munirah Mazlan ◽  
Mokhairi Makhtar ◽  
Ahmad Firdaus Khair Ahmad Khairi ◽  
Mohamad Afendee Mohamed
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Problems ◽  
Ant Colony ◽  
Data Set ◽  
Course Timetabling ◽  
Timetabling Problem ◽  
Combinatorial Optimization Problems ◽  
University Course Timetabling ◽  
Course Timetabling Problem ◽  
University Course

<p>Due to the increased number of students and regulations, all educational institutions have renewed their interest to appear in the number of complexity and flexibility since the resources and events are becoming more difficult to be scheduled. Timetabling is the type of problems where the events need to be organized into a number of timeslots to prevent the conflicts in using a given set of resources. Thus in the intervening decades, significant progress has been made in the course timetabling problem monitoring with meta-heuristic adjustment. In this study, ant colony optimization (ACO) algorithm approach has been developed for university course timetabling problem. ACO is believed to be a powerful solution approach for various combinatorial optimization problems. This approach is used according to the data set instances that have been collected. Its performance is presented using the appropriate algorithm. The results are arguably within the best results range from the literature. The performance assessment and results are used to determine whether they are reliable in preparing a qualifying course timetabling process.</p>

Sign in / Sign up

Export Citation Format

Share Document