☆ 4.7 Article

A Discrete JAYA Algorithm Based on Reinforcement Learning and Simulated Annealing for the Traveling Salesman Problem

MATHEMATICS (2023)

Related references

Note: Only part of the references are listed.

Article Computer Science, Artificial Intelligence

Evolutionary Multimodal Multiobjective Optimization for Traveling Salesman Problems

Yiping Liu et al.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2023)

Add to Collection

Article Green & Sustainable Science & Technology

A Biogeography-Based Optimization with a Greedy Randomized Adaptive Search Procedure and the 2-Opt Algorithm for the Traveling Salesman Problem

Cheng-Hsiung Tsai et al.

Summary: We propose a novel method to enhance biogeography-based optimization (BBO) for solving the traveling salesman problem (TSP). The method combines a greedy randomized adaptive search procedure, the 2-opt algorithm, and G2BBO. G2BBO effectively tackles the local minimum problem and improves convergence by optimizing initial values. Experimental results on three TSP datasets demonstrate that G2BBO performs competitively against other well-known algorithms, particularly in cases with complex coordinates.

SUSTAINABILITY (2023)

Add to Collection

Article Computer Science, Artificial Intelligence

Discrete sparrow search algorithm for symmetric traveling salesman problem

Zhen Zhang et al.

Summary: This paper proposes a swarm intelligence approach using a discrete sparrow search algorithm (DSSA) with a global perturbation strategy to solve the traveling salesman problem (TSP). Experimental results show that the proposed method is more competitive and robust in solving the TSP.

APPLIED SOFT COMPUTING (2022)

Add to Collection

Article Computer Science, Interdisciplinary Applications

A discrete cuckoo search algorithm for traveling salesman problem and its application in cutting path optimization

Zicheng Zhang et al.

Summary: This paper proposes an improved discrete cuckoo search algorithm to solve the Traveling Salesman Problem. By using novel tools and optimization strategies, the algorithm achieves better stability and accuracy. Experimental results demonstrate that the proposed algorithm performs well in solving the TSP.

COMPUTERS & INDUSTRIAL ENGINEERING (2022)

Add to Collection

Article Computer Science, Interdisciplinary Applications

An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem

Jiongzhi Zheng et al.

Summary: In this paper, we propose an iterated two-stage heuristic algorithm called ITSHA to solve the multiple Traveling Salesmen Problem (mTSP). Experimental results show that ITSHA algorithm performs significantly better than the state-of-the-art heuristic algorithms in solving the mTSP with both the minsum objective and minmax objective.

COMPUTERS & OPERATIONS RESEARCH (2022)

Add to Collection

Article Mathematics

Visibility Adaptation in Ant Colony Optimization for Solving Traveling Salesman Problem

Abu Saleh Bin Shahadat et al.

Summary: Ant Colony Optimization (ACO) is a widely studied bio-inspired algorithm that generates feasible solutions for combinatorial optimization problems. This study proposes an improved ACO-based method, called ACO with Adaptive Visibility (ACOAV), which utilizes a new distance metric and partial solution updates to generate better solutions for the Traveling Salesman Problem (TSP).

MATHEMATICS (2022)

Add to Collection

Article Computer Science, Artificial Intelligence

A discrete bat algorithm based on Levy flights for Euclidean traveling salesman problem

Yassine Saji et al.

Summary: The bat algorithm, a swarm-intelligence-based metaheuristic introduced in 2010, continues to be widely used due to its simplicity and applicability. However, it may face the challenge of getting trapped in local optima when dealing with large complex problems.

EXPERT SYSTEMS WITH APPLICATIONS (2021)

Add to Collection

Review Computer Science, Interdisciplinary Applications

Reinforcement learning for combinatorial optimization: A survey

Nina Mazyavkina et al.

Summary: The study explores the recent advancements in applying reinforcement learning frameworks to hard combinatorial problems, showcasing their potential in training agents to automate the search for heuristics. It also compares RL methods with traditional algorithms, demonstrating that RL models could be a promising direction for solving combinatorial problems.

COMPUTERS & OPERATIONS RESEARCH (2021)

Add to Collection

Article Computer Science, Artificial Intelligence

DJAYA: A discrete Jaya algorithm for solving traveling salesman problem

Mesut Gunduz et al.

Summary: Jaya algorithm is a newly proposed stochastic population-based metaheuristic optimization algorithm that improves intensification and diversification of population by utilizing best and worst solutions. With discrete modifications, the algorithm, called DJAYA, has shown competitive performance in solving various discrete optimization problems like the symmetric traveling salesman problem.

APPLIED SOFT COMPUTING (2021)

Add to Collection

Article Computer Science, Hardware & Architecture

A hybrid feature selection method based on Binary Jaya algorithm for micro-array data classification

Abhilasha Chaudhuri et al.

Summary: The paper presents a hybrid feature selection method using TOPSIS filter and Binary Jaya wrapper for high-dimensional micro-array data. Experimental results show that the proposed approach outperforms existing methods in terms of classification accuracy and speed.

COMPUTERS & ELECTRICAL ENGINEERING (2021)

Add to Collection

Article Chemistry, Physical

Optimal identification of solid oxide fuel cell parameters using a competitive hybrid differential evolution and Jaya algorithm

Guojiang Xiong et al.

Summary: CHDJ is a hybrid metaheuristic optimizer that effectively identifies accurate values for the model parameters of solid oxide fuel cells. It utilizes competitive hybrid operations to explore global space and exploit local regions, generating promising candidate solutions. Experimental results demonstrate that CHDJ achieves good performance under different operating conditions.

INTERNATIONAL JOURNAL OF HYDROGEN ENERGY (2021)

Add to Collection

Article Computer Science, Artificial Intelligence

Optimization of hydropower reservoir operation based on hedging policy using Jaya algorithm

Kai Lun Chong et al.

Summary: The study investigates the parameter-free Jaya algorithm as an optimization method for reservoir operation, introducing a hedging strategy to mitigate the impact of reduced water supply. It shows the efficiency of the proposed algorithm in the reservoir system, with higher hydropower generation compared to other algorithms.

APPLIED SOFT COMPUTING (2021)

Add to Collection

Article Computer Science, Artificial Intelligence

A hybrid approach for text document clustering using Jaya optimization algorithm

Karpagalingam Thirumoorthy et al.

Summary: In this study, the Hybrid Jaya Optimization algorithm was utilized for text document clustering, and it achieved the highest quality clustering compared to other techniques.

EXPERT SYSTEMS WITH APPLICATIONS (2021)

Add to Collection

Article Computer Science, Artificial Intelligence

An improved shuffled frog-leaping algorithm for the minmax multiple traveling salesman problem

Yafei Dong et al.

Summary: The multiple traveling salesman problem (mTSP) is an extended version of the well-known traveling salesman problem, involving multiple salesmen visiting a set of cities, aiming to balance workload among salesmen or find the optimal solution when travel time is prioritized. The novel improved shuffled frog-leaping algorithm (ISFLA) proposed in this paper outperforms some state-of-the-art approaches for this problem, demonstrating its superiority in solving the minmax mTSP.

NEURAL COMPUTING & APPLICATIONS (2021)

Add to Collection

Article Automation & Control Systems

DEACO: Adopting dynamic evaporation strategy to enhance ACO algorithm for the traveling salesman problem

Sahar Ebadinezhad

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2020)

Add to Collection

Article Computer Science, Artificial Intelligence

An improved Jaya algorithm for solving the flexible job shop scheduling problem with transportation and setup times

Jun-qing Li et al.

KNOWLEDGE-BASED SYSTEMS (2020)

Add to Collection

Article Mathematics

Opposition-Based Ant Colony Optimization Algorithm for the Traveling Salesman Problem

Zhaojun Zhang et al.

MATHEMATICS (2020)

Add to Collection

Article Computer Science, Artificial Intelligence

A swap sequence based Artificial Bee Colony algorithm for Traveling Salesman Problem

Indadul Khan et al.

SWARM AND EVOLUTIONARY COMPUTATION (2019)

Add to Collection

Article Computer Science, Artificial Intelligence

Solving Traveling Salesman Problem by Using Combinatorial Artificial Bee Colony Algorithms

Dervis Karaboga et al.

INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS (2019)

Add to Collection

Article Computer Science, Artificial Intelligence

JayaX: Jaya algorithm with xor operator for binary optimization

Murat Aslan et al.

APPLIED SOFT COMPUTING (2019)

Add to Collection

Article Computer Science, Artificial Intelligence

An artificial bee colony algorithm with a Modified Choice Function for the traveling salesman problem

Shin Siang Choong et al.

SWARM AND EVOLUTIONARY COMPUTATION (2019)

Add to Collection

Article Automation & Control Systems

Online load frequency control in wind integrated power systems using modified Jaya optimization

Chittaranjan Pradhan et al.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2019)

Add to Collection

Article Computer Science, Artificial Intelligence

A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem

Saban Gulcu et al.

SOFT COMPUTING (2018)

Add to Collection

Article Computer Science, Artificial Intelligence

Solving travelling salesman problem using black hole algorithm

Abdolreza Hatamlou

SOFT COMPUTING (2018)

Add to Collection

Article Computer Science, Artificial Intelligence

A GPU-accelerated parallel Jaya algorithm for efficiently estimating Li-ion battery model parameters

Long Wang et al.

APPLIED SOFT COMPUTING (2018)

Add to Collection

Article Management

A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods

Zhao Yang et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2018)

Add to Collection

Article Computer Science, Information Systems

A hyper-heuristic based artificial bee colony algorithm for k-Interconnected multi-depot multi-traveling salesman problem

Venkatesh Pandiri et al.

INFORMATION SCIENCES (2018)

Add to Collection

Article Thermodynamics

Design optimization and analysis of selected thermal devices using self-adaptive Jaya algorithm

R. V. Rao et al.

ENERGY CONVERSION AND MANAGEMENT (2017)

Add to Collection

Article Computer Science, Information Systems

Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem

Yiwen Zhong et al.

INFORMATION SCIENCES (2017)

Add to Collection

Article Computer Science, Artificial Intelligence

A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem

Mostafa Mahi et al.

APPLIED SOFT COMPUTING (2015)

Add to Collection

Article Computer Science, Artificial Intelligence

A hierarchic approach based on swarm intelligence to solve the traveling salesman problem

Mesut Gunduz et al.

TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES (2015)

Add to Collection

Article Computer Science, Artificial Intelligence

Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search

Xiutang Geng et al.

APPLIED SOFT COMPUTING (2011)

Add to Collection

Article Computer Science, Artificial Intelligence

A hybrid heuristic for the traveling salesman problem

R Baraglia et al.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2001)

Add to Collection

© Peeref 2019-2024. All rights reserved.