Discrete Social Spider Algorithm for Solving Traveling Salesman Problem

2021 ◽  
pp. 2150020
Author(s):  
Asieh Khosravanian ◽  
Mohammad Rahmanimanesh ◽  
Parviz Keshavarzi
Keyword(s):  
Genetic Algorithm ◽  
Discrete Optimization ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Fitness Function ◽  
Traveling Salesman ◽  
The Other ◽  
Discrete Optimization Problem ◽  
Social Spider ◽  
Social Spider Algorithm

The Social Spider Algorithm (SSA) was introduced based on the information-sharing foraging strategy of spiders to solve the continuous optimization problems. SSA was shown to have better performance than the other state-of-the-art meta-heuristic algorithms in terms of best-achieved fitness values, scalability, reliability, and convergence speed. By preserving all strengths and outstanding performance of SSA, we propose a novel algorithm named Discrete Social Spider Algorithm (DSSA), for solving discrete optimization problems by making some modifications to the calculation of distance function, construction of follow position, the movement method, and the fitness function of the original SSA. DSSA is employed to solve the symmetric and asymmetric traveling salesman problems. To prove the effectiveness of DSSA, TSPLIB benchmarks are used, and the results have been compared to the results obtained by six different optimization methods: discrete bat algorithm (IBA), genetic algorithm (GA), an island-based distributed genetic algorithm (IDGA), evolutionary simulated annealing (ESA), discrete imperialist competitive algorithm (DICA) and a discrete firefly algorithm (DFA). The simulation results demonstrate that DSSA outperforms the other techniques. The experimental results show that our method is better than other evolutionary algorithms for solving the TSP problems. DSSA can also be used for any other discrete optimization problem, such as routing problems.

A New Bio-Inspired Social Spider Algorithm

2021 ◽  
Vol 12 (1) ◽  
pp. 79-93
Author(s):  
Dharmpal Singh
Keyword(s):  
Swarm Intelligence ◽  
Real World ◽  
Optimization Problems ◽  
Fitness Function ◽  
Foraging Strategy ◽  
Superior Performance ◽  
Experimental Result ◽  
Social Spider ◽  
Spider Web ◽  
Social Spider Algorithm

The concept of bio-inspired algorithms is used in real-world problems to search the efficient problem-solving methods. Evolutionary computation and swarm intelligence are outstanding examples of nature-inspired solution techniques of metahuristics. In this paper, an effort has been made to propose a modified social spider algorithm to solve global optimization problems in the real world. Social spiders used the foraging strategy, vibrations on the spider web to determine the positions of prey. The selection of vibration, estimated new position and calculation of the fitness function, has been furnished in details way as compared to different previously proposed swarm intelligence algorithms. Moreover, experimental result has been carried out by modified social spider on series of widely-used benchmark problem with four benchmark algorithms. Furthermore, a modified form of the proposed algorithm has superior performance as compared to other state-of-the-art metaheuristics algorithms.

A Genetic Algorithm with the Mixed Heuristics for Traveling Salesman Problem

2015 ◽  
Vol 14 (01) ◽  
pp. 1550003 ◽  
Author(s):  
Yong Wang
Keyword(s):  
Genetic Algorithm ◽  
Traveling Salesman Problem ◽  
Discrete Optimization ◽  
Time Complexity ◽  
Optimization Problems ◽  
Traveling Salesman ◽  
Optimization Process ◽  
Hamiltonian Cycles ◽  
Improved Genetic Algorithm ◽  
Discrete Optimization Problems

Traveling salesman problem (TSP) is one of well-known discrete optimization problems. The genetic algorithm is improved with the mixed heuristics to resolve TSP. The first heuristics is the four vertices and three lines inequality, which is applied to the 4-vertex paths to generate the shorter Hamiltonian cycles (HC). The second local heuristics is executed to reverse the i-vertex paths with more than two vertices, which also generates the shorter HCs. It is necessary that the two heuristics coordinate with each other in the optimization process. The time complexity of the first and second heuristics are O(n) and O(n3), respectively. The two heuristics are merged into the original genetic algorithm. The computation results show that the improved genetic algorithm with the mixed heuristics can find better solutions than the original GA does under the same conditions.

scholarly journals Geometric and game approaches for some discrete optimization problems

2018 ◽  
Author(s):  
Boris Melnikov ◽  
◽  
Elena Melnikova ◽  
Svetlana Pivneva ◽  
Vladislav Dudnikov ◽  
...  
Keyword(s):  
Traveling Salesman Problem ◽  
Discrete Optimization ◽  
Optimization Problems ◽  
Traveling Salesman ◽  
Distance Functions ◽  
Statistical Characteristics ◽  
Discrete Optimization Problem ◽  
Geometrical Approach ◽  
Anytime Algorithms ◽  
Discrete Optimization Problems

We consider in this paper the adaptation of heuristics used for programming nondeterministic games to the problems of discrete optimization. In particular, we use some “game” heuristic methods of decision-making in various discrete optimization problems. The object of each of these problems is programming anytime algorithms. Among the problems described in this paper, there are the classical traveling salesman problem and some connected problems of minimization for nondeterministic finite automata. The first of the considered methods is the geometrical approach to some discrete optimization problems. For this approach, we define some special characteristics relating to some initial particular case of considered discrete optimization problem. For instance, one of such statistical characteristics for the traveling salesman problem is a significant development of the so-called “distance functions” up to the geometric variant such problem. And using this distance, we choose the corresponding specific algorithms for solving the problem. Besides, other considered methods for solving these problems are constructed on the basis of special combination of some heuristics, which belong to some different areas of the theory of artificial intelligence. More precisely, we shall use some modifications of unfinished branchand-bound method; for the selecting immediate step using some heuristics, we apply dynamic risk functions; simultaneously for the selection of coefficients of the averaging-out, we also use genetic algorithms; and the reductive self-learning by the same genetic methods is also used for the start of unfinished branch-and-bound method again. This combination of heuristics represents a special approach to construction of anytime-algorithms for the discrete optimization problems. This approach can be considered as an alternative to application of methods of linear programming, and to methods of multi-agent optimization, and also to neural networks.

scholarly journals Experimental Study of a Hybrid Genetic Algorithm for the Multiple Travelling Salesman Problem

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Maha Ata Al-Furhud ◽  
Zakir Hussain Ahmed
Keyword(s):  
Genetic Algorithm ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Travelling Salesman Problem ◽  
Hybrid Genetic Algorithm ◽  
Travelling Salesman ◽  
Complex Optimization ◽  
Problem Instances ◽  
Search Approach ◽  
Multiple Travelling Salesman Problem

The multiple travelling salesman problem (MTSP), an extension of the well-known travelling salesman problem (TSP), is studied here. In MTSP, starting from a depot, multiple salesmen require to visit all cities so that each city is required to be visited only once by one salesman only. It is NP-hard and is more complex than the usual TSP. So, exact optimal solutions can be obtained for smaller sized problem instances only. For large-sized problem instances, it is essential to apply heuristic algorithms, and amongst them, genetic algorithm is identified to be successfully deal with such complex optimization problems. So, we propose a hybrid genetic algorithm (HGA) that uses sequential constructive crossover, a local search approach along with an immigration technique to find high-quality solution to the MTSP. Then our proposed HGA is compared against some state-of-the-art algorithms by solving some TSPLIB symmetric instances of several sizes with various number of salesmen. Our experimental investigation demonstrates that the HGA is one of the best algorithms.

The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization

2010 ◽  
Vol 1 (2) ◽  
pp. 82-92 ◽  
Author(s):  
Gilbert Laporte
Keyword(s):  
Combinatorial Optimization ◽  
Vehicle Routing ◽  
Traveling Salesman Problem ◽  
Vehicle Routing Problem ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Traveling Salesman ◽  
Routing Problem ◽  
Combinatorial Optimization Problems ◽  
The Traveling Salesman Problem

The Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP) are two of the most popular problems in the field of combinatorial optimization. Due to the study of these two problems, there has been a significant growth in families of exact and heuristic algorithms being used today. The purpose of this paper is to show how their study has fostered developments of the most popular algorithms now applied to the solution of combinatorial optimization problems. These include exact algorithms, classical heuristics and metaheuristics.

Concurrent Societies Based on Genetic Algorithm and Particle Swarm Optimization

2010 ◽  
Vol 14 (1) ◽  
pp. 110-118
Author(s):  
Hrvoje Markovic ◽  
◽  
Fangyan Dong ◽  
Kaoru Hirota
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Nearest Neighbor ◽  
Optimization Problems ◽  
Fitness Function ◽  
Particle Swarm ◽  
Absolute Error ◽  
Population Based ◽  
Test Problems ◽  
Swarm Optimization

A parallel multi-population based metaheuristic optimization framework, called Concurrent Societies, inspired by human intellectual evolution, is proposed. It uses population based metaheuristics to evolve its populations, and fitness function approximations as representations of knowledge. By utilizing iteratively refined approximations it reduces the number of required evaluations and, as a byproduct, it produces models of the fitness function. The proposed framework is implemented as two Concurrent Societies: one based on genetic algorithm and one based on particle swarm optimization both using k -nearest neighbor regression as fitness approximation. The performance is evaluated on 10 standard test problems and compared to other commonly used metaheuristics. Results show that the usage of the framework considerably increases efficiency (by a factor of 7.6 to 977) and effectiveness (absolute error reduced by more than few orders of magnitude). The proposed framework is intended for optimization problems with expensive fitness functions, such as optimization in design and interactive optimization.

scholarly journals A Genetic Algorithm for Locating the Multiscale Critical Slip Surface in Jointed Rock Mass Slopes

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Qiang Xu ◽  
Jian-yun Chen ◽  
Jing Li ◽  
Hong-yuan Yue
Keyword(s):  
Genetic Algorithm ◽  
Rock Mass ◽  
Stress Field ◽  
Factor Of Safety ◽  
Optimization Problems ◽  
Slip Surface ◽  
Fitness Function ◽  
Jointed Rock ◽  
Jointed Rock Mass ◽  
Critical Slip Surface

The joints have great influence on the strength of jointed rock mass and lead to the multiscale, nonhomogeneous, and anisotropic characteristics. In order to consider these effects, a new model based on a genetic algorithm is proposed for locating the critical slip surface (CSS) in jointed rock mass slope (JRMS) from its stress field. A finite element method (FEM) was employed to analyze the stress field. A method of calculating the mechanical persistence ratio (MPR) was used. The calculated multiscale and anisotropic characteristics of the MPR were used in the fitness function of genetic algorithm (GA) to calculate the factor of safety. The GA was used to solve optimization problems of JRMS stability. Some numerical examples were given. The results show that the multiscale and anisotropic characteristics of the MPR played an important role in locating the CSS in JRMS. The proposed model calculated the CSS and the factor of safety of the slope with satisfactory precision.

scholarly journals A novel methodology for optimal land allocation for agricultural crops using Social Spider Algorithm

PeerJ ◽  
2019 ◽  
Vol 7 ◽  
pp. e7559
Author(s):  
N Thilagavathi ◽  
T Amudha
Keyword(s):  
Combinatorial Optimization ◽  
Optimization Problems ◽  
Crop Productivity ◽  
Research Field ◽  
Land Allocation ◽  
Net Income ◽  
Social Spider ◽  
Combinatorial Optimization Problems ◽  
Social Spider Algorithm ◽  
Land Holdings

In the current agricultural scenario, availability of suitable land for cultivation is less and profitable allocation of the land for cultivating crops seems to be a cumbersome task. Crop planning optimization is a major research field in agriculture, in which land optimization is a significant challenge, which falls under the category of combinatorial optimization problems. The main objective of the present research is to maximize the net income from agriculture through optimal land allocation. Bio-inspired algorithms are quite popular in solving combinatorial optimization problems. Social Spider Algorithm (SSA), a new bio-inspired algorithm, is used to solve land optimization problem in this research based on the simulation of cooperative behaviour of social spiders. The agricultural area chosen for case study is the Coimbatore region, located in Tamilnadu state, India and the relevant data for the crops are collected from Tamilnadu Agricultural University Coimbatore, India. The optimal planting area, crop productivity for various land holdings and the water requirements are computed by SSA and the results have shown better directions for agricultural planning to improve the profit with constrained land area and water limitations.

scholarly journals Higher Desirability in Solving Multiple Response Optimization Problems with Committee Machine

2014 ◽  
Vol 564 ◽  
pp. 608-613 ◽  
Author(s):  
Seyed Jafar Golestaneh ◽  
N. Ismail ◽  
M.K.A.M. Ariffin ◽  
S.H. Tang ◽  
Hassan Moslemi Naeini ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problems ◽  
Fitness Function ◽  
Multiple Response ◽  
Final Solution ◽  
Committee Machine ◽  
Average Value ◽  
Multiple Response Optimization ◽  
Response Optimization ◽  
Current Article

Many industrial problems need to be optimized several responses simultaneously. These problems are named multiple response optimization (MRO) and they can have different objectives such as Target, Minimization or Maximization. Committee machine (CM) as a set of some experts such as some artificial neural networks (ANNs) in combination with genetic algorithm (GA) is applied for modeling and optimization of MRO problems. In addition, optimization usually is done on Global Desirability (GD) function. Current article is a development for recent authors' work to determine economic run number for application of CM and GA in MRO problem solving. This study includes a committee machine with four different ANNs. The CM weights are determined with GA which its fitness function is minimizing the RMSE. Then, another GA specifies the final solution with object maximizing the global desirability. This algorithm was implemented on five case studies and the results represent the algorithm can get higher global desirability by repeating the runs and economic run number (ERN) depends on the MRO problem objective. ERN is ten for objective “Target”. This number for objectives which are mixture of minimization and maximization ERN is five. The repetition are continued until these ERN values have considerable increased in maximum GD with respect to average value of GD. More repetition from these ERN to forty five numbers cause a slight raise in maximum GD.

Sign in / Sign up

Export Citation Format

Share Document