Related Experiment Video
Updated: Nov 5, 2025
06:57
Utilizing Electroencephalography Measurements for Comparison of Task-Specific Neural Efficiencies: Spatial Intelligence Tasks
Published on: August 9, 2016
11.6K
A Comparative Performance Analysis of Computational Intelligence Techniques to Solve the Asymmetric Travelling
Julius Beneoluchi Odili1, A Noraziah2,3, M Zarina4
1Department of Mathematical Sciences, Anchor University Lagos, Lagos, Nigeria.
Computational Intelligence and Neuroscience
|May 14, 2021
Summary
The African Buffalo Optimization (ABO) algorithm slightly outperformed other metaheuristics in solving the asymmetric Travelling Salesman Problem (ATSP). ABO achieved optimal results faster than Improved Extremal Optimization, Max-Min Ant System, and others.
Area of Science:
- Operations Research
- Computer Science
- Artificial Intelligence
Background:
- The asymmetric Travelling Salesman Problem (ATSP) is prevalent in real-world applications but under-researched compared to its symmetric counterpart.
- Existing metaheuristics show varied performance on ATSP instances.
Purpose of the Study:
- To conduct a comparative performance analysis of six metaheuristics for solving the ATSP.
- To evaluate the effectiveness of African Buffalo Optimization (ABO) against other leading algorithms.
Main Methods:
- Comparative analysis of African Buffalo Optimization (ABO), Improved Extremal Optimization (IEO), Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO), Max-Min Ant System (MMAS), Cooperative Genetic Ant System (CGAS), and Randomized Insertion Algorithm (RAI).
- Experiments were conducted on 15 ATSP instances from TSPLIB.
- Algorithms employed distinct search schemes: ABO (Karp-Steele mechanism), MIMM-ACO (path construction with patching), CGAS (natural selection/ordering), RAI (random insertion), IEO (grid search).
Main Results:
- The African Buffalo Optimization (ABO) algorithm demonstrated slightly superior performance.
- ABO achieved optimal results more consistently and at a significantly faster speed compared to the other evaluated algorithms.
- All tested algorithms were applied to challenging ATSP instances.
Conclusions:
- The African Buffalo Optimization (ABO) algorithm is a highly effective metaheuristic for solving the asymmetric Travelling Salesman Problem (ATSP).
- ABO offers a promising approach for tackling complex, real-world optimization problems due to its speed and accuracy.
- Further research into ATSP is warranted given its practical significance.
Related Concept Videos
01:29Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
153
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
153
00:59Biot-Savart Law: Problem-Solving
3.4K
The magnitude and direction of a magnetic field created by a steady current can be calculated using the Biot-Savart law.
Consider a mobile phone battery bank as a source of steady current, which flows through the wire connected between the two. What is the magnitude of the magnetic field created by this current at a field point P?
To estimate the magnitude of the total magnetic field, we first consider a small current element of length dl, at a distance r from the field point. Now the following...
Consider a mobile phone battery bank as a source of steady current, which flows through the wire connected between the two. What is the magnitude of the magnetic field created by this current at a field point P?
To estimate the magnitude of the total magnetic field, we first consider a small current element of length dl, at a distance r from the field point. Now the following...
3.4K
01:12Trial and Error and Algorithm
238
A problem-solving strategy is a plan of action used to find a solution. Different strategies have distinct action plans. Trial and error involves trying different solutions until one works. For instance, to fix a broken printer, you might check ink levels, ensure the paper tray isn't jammed, and verify the printer's connection to your laptop. This method can be time-consuming but is commonly used. Thomas Edison, for example, used trial and error to find a suitable filament for the light...
238
01:21Manipulation and Analysis
126
GIS manipulation and analysis functions are vital for decision-making and planning. These activities range from data retrieval tasks, such as selecting information based on specific criteria, to advanced analytical techniques that address complex spatial problems.One critical GIS analysis method is overlaying, which combines multiple data layers to examine impacts. For example, overlaying a river-dammed lake boundary with road networks can identify affected infrastructure. Another common...
126
01:24Area Computation by the Alternative Coordinate Method
253
The alternative coordinate method, also known as the Shoelace Formula, is a technique for determining the area of a traverse using Cartesian coordinates. This method relies on the sequential arrangement of x and y coordinates for each point of the shape, ensuring accuracy and ease of application.In this approach, each corner's x and y coordinates are listed as fractions, with the x-coordinate as the numerator and the y-coordinate as the denominator. These coordinates are arranged sequentially...
253
01:21Dot Product: Problem Solving
530
The dot product is a powerful tool in problem-solving involving vectors, given that the dot product of two vectors is the product of their magnitudes and the cosine of the angle between them measured anti-clockwise. Solving problems involving the dot product requires understanding its properties and developing a step-by-step process to solve them. Here are the main steps to follow when solving any general problem involving the dot product:
Identify the problem: Start by reading the problem and...
Identify the problem: Start by reading the problem and...
530