DJAYA: A discrete Jaya algorithm for solving traveling salesman problem
Published 2021 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
DJAYA: A discrete Jaya algorithm for solving traveling salesman problem
Authors
Keywords
Discrete optimization, JAYA, Transformation operator, Traveling salesman problem
Journal
APPLIED SOFT COMPUTING
Volume -, Issue -, Pages 107275
Publisher
Elsevier BV
Online
2021-03-10
DOI
10.1016/j.asoc.2021.107275
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- A discrete shuffled frog-leaping algorithm based on heuristic information for traveling salesman problem
- (2021) Yao Huang et al. APPLIED SOFT COMPUTING
- JayaX: Jaya algorithm with xor operator for binary optimization
- (2019) Murat Aslan et al. APPLIED SOFT COMPUTING
- Discrete Spider Monkey Optimization for Travelling Salesman Problem
- (2019) M.A.H. Akhand et al. APPLIED SOFT COMPUTING
- A GPU-accelerated parallel Jaya algorithm for efficiently estimating Li-ion battery model parameters
- (2018) Long Wang et al. APPLIED SOFT COMPUTING
- A novel Elite Opposition-based Jaya algorithm for parameter estimation of photovoltaic cell models
- (2018) Long Wang et al. OPTIK
- Design optimization and analysis of selected thermal devices using self-adaptive Jaya algorithm
- (2017) R.V. Rao et al. ENERGY CONVERSION AND MANAGEMENT
- A multi-objective algorithm for optimization of modern machining processes
- (2017) R. Venkata Rao et al. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
- Solving travelling salesman problem using black hole algorithm
- (2017) Abdolreza Hatamlou SOFT COMPUTING
- Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator
- (2017) Abid Hussain et al. Computational Intelligence and Neuroscience
- A new optimization algorithm for solving complex constrained design optimization problems
- (2016) R. Venkata Rao et al. ENGINEERING OPTIMIZATION
- Discrete state transition algorithm for unconstrained integer optimization problems
- (2016) Xiaojun Zhou et al. NEUROCOMPUTING
- A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem
- (2016) Şaban Gülcü et al. SOFT COMPUTING
- A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem
- (2015) Mostafa Mahi et al. APPLIED SOFT COMPUTING
- TSA: Tree-seed algorithm for continuous optimization
- (2015) Mustafa Servet Kiran EXPERT SYSTEMS WITH APPLICATIONS
- A hierarchic approach based on swarm intelligence to solve the traveling salesman problem
- (2015) Mesut GÜNDÜZ et al. Turkish Journal of Electrical Engineering and Computer Sciences
- Discrete cuckoo search algorithm for the travelling salesman problem
- (2013) Aziz Ouaarab et al. NEURAL COMPUTING & APPLICATIONS
- Firefly-inspired algorithm for discrete optimization problems: An application to manufacturing cell formation
- (2012) Mohammad Kazem Sayadi et al. JOURNAL OF MANUFACTURING SYSTEMS
- The analysis of discrete artificial bee colony algorithm with neighborhood operator on traveling salesman problem
- (2012) Mustafa Servet Kıran et al. NEURAL COMPUTING & APPLICATIONS
- Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search
- (2011) Xiutang Geng et al. APPLIED SOFT COMPUTING
- Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques
- (2011) Shyi-Ming Chen et al. EXPERT SYSTEMS WITH APPLICATIONS
Add your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload NowCreate your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create Now