DJAYA: A discrete Jaya algorithm for solving traveling salesman problem
Jaya algorithm is a newly proposed stochastic population-based metaheuristic optimization
algorithm to solve constrained and unconstrained continuous optimization problems. The …
algorithm to solve constrained and unconstrained continuous optimization problems. The …
[HTML][HTML] A discrete tree-seed algorithm for solving symmetric traveling salesman problem
Tree-Seed algorithm (TSA) is a recently developed nature inspired population-based
iterative search algorithm. TSA is proposed for solving continuous optimization problems by …
iterative search algorithm. TSA is proposed for solving continuous optimization problems by …
Discrete state transition algorithm for unconstrained integer optimization problems
A recently new intelligent optimization algorithm called discrete state transition algorithm is
considered in this study, for solving unconstrained integer optimization problems. Firstly …
considered in this study, for solving unconstrained integer optimization problems. Firstly …
Transformation operators based grey wolf optimizer for travelling salesman problem
In the field of swarm intelligence, the Grey Wolf Optimizer (GWO) is a popular algorithm
based on leadership hierarchy. Primarily, GWO was proposed to solve continuous …
based on leadership hierarchy. Primarily, GWO was proposed to solve continuous …
Discrete komodo algorithm for traveling salesman problem
GK Jati, G Kuwanto, T Hashmi, H Widjaja - Applied Soft Computing, 2023 - Elsevier
This work presents a Discrete Komodo Algorithm (DKA) to solve the traveling salesman
problem (TSP). Inspired by the Komodo Mlipir Algorithm, a swarm intelligence algorithm …
problem (TSP). Inspired by the Komodo Mlipir Algorithm, a swarm intelligence algorithm …
Discrete salp swarm algorithm for euclidean travelling salesman problem
Abstract The Salp Swarm Algorithm (SSA) is one of the recently proposed swarm
intelligence-based algorithms, which finds its motivation in the swarming behaviour of salps …
intelligence-based algorithms, which finds its motivation in the swarming behaviour of salps …
Evolutionary memetic algorithms supported by metaheuristic profiling effectively applied to the optimization of discrete routing problems
DA Wood - Journal of Natural Gas Science and Engineering, 2016 - Elsevier
Optimizing the routing of resources to multiple remote sites is a complex issue confronting
many sectors of the gas an oil industries with significant cost implications. When significant …
many sectors of the gas an oil industries with significant cost implications. When significant …
Numerical approach of symmetric traveling salesman problem using simulated annealing
I Iryanto, PH Gunawan - Jurnal RESTI (Rekayasa Sistem Dan …, 2021 - jurnal.iaii.or.id
The aim of this paper is to elaborate the performance of Simulated Annealing (SA) algorithm
for solving traveling salesmen problems. In this paper, SA algorithm is modified by using the …
for solving traveling salesmen problems. In this paper, SA algorithm is modified by using the …
A multiobjective state transition algorithm for single machine scheduling
In this paper, a discrete state transition algorithm is introduced to solve a multiobjective
single machine job shop scheduling problem. In the proposed approach, a non-dominated …
single machine job shop scheduling problem. In the proposed approach, a non-dominated …
A Discrete Particle Swarm Algorithm With Symmetry Methods for Discrete Optimization Problems
E Baş, G Yıldızdan - Konya Journal of Engineering Sciences, 2023 - dergipark.org.tr
Particle Swarm Optimization (PSO) is a commonly used optimization to solve many
problems. The PSO, which is developed for continuous optimization, is updated to solve …
problems. The PSO, which is developed for continuous optimization, is updated to solve …