Development of Deer Hunting linked Earthworm Optimization Algorithm for solving large scale Traveling Salesman Problem
Published 2021 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Development of Deer Hunting linked Earthworm Optimization Algorithm for solving large scale Traveling Salesman Problem
Authors
Keywords
Meta-heuristic algorithm, Hybridization, Traveling Salesman Problem, Minimized Traveling Distance, Earthworm-based Deer Hunting Optimization Algorithm
Journal
KNOWLEDGE-BASED SYSTEMS
Volume 227, Issue -, Pages 107199
Publisher
Elsevier BV
Online
2021-06-04
DOI
10.1016/j.knosys.2021.107199
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Hybrid genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen problem
- (2020) Xueshi Dong et al. Future Generation Computer Systems-The International Journal of eScience
- A novel genetic algorithm for large scale colored balanced traveling salesman problem
- (2019) Xueshi Dong et al. Future Generation Computer Systems-The International Journal of eScience
- A Novel Many-objective Evolutionary Algorithm Based on Transfer Matrix with Kriging model
- (2019) Lianbo Ma et al. INFORMATION SCIENCES
- Deer Hunting Optimization Algorithm: A New Nature-Inspired Meta-heuristic Paradigm
- (2019) G Brammya et al. COMPUTER JOURNAL
- Artificial bee colony algorithm with generating neighbourhood solution for large scale coloured traveling salesman problem
- (2019) Xueshi Dong et al. IET Intelligent Transport Systems
- Ant colony optimisation for coloured travelling salesman problem by multi-task learning
- (2018) Xueshi Dong et al. IET Intelligent Transport Systems
- Population-Based Incremental Learning Algorithm for a Serial Colored Traveling Salesman Problem
- (2018) Xianghu Meng et al. IEEE Transactions on Systems Man Cybernetics-Systems
- A hierarchical algorithm based on Density Peaks Clustering and Ant Colony Optimization for Traveling Salesman Problem
- (2018) Erchong Liao et al. IEEE Access
- Ant Colony Optimization Based Memetic Algorithm to Solve Bi-Objective Multiple Traveling Salesmen Problem for Multi-Robot Systems
- (2018) Xinye Chen et al. IEEE Access
- Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem
- (2017) Absalom El-Shamir Ezugwu et al. EXPERT SYSTEMS WITH APPLICATIONS
- Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing – tabu search algorithm to solve the symmetrical traveling salesman problem
- (2016) Yu Lin et al. APPLIED SOFT COMPUTING
- Earthworm optimization algorithm: a bio-inspired metaheuristic algorithm for global optimization problems
- (2015) Gai Ge Wang et al. International Journal of Bio-Inspired Computation
- 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
- A Hybrid Multi-Swarm Particle Swarm Optimization algorithm for the Probabilistic Traveling Salesman Problem
- (2009) Yannis Marinakis et al. COMPUTERS & OPERATIONS RESEARCH
- Solving traveling salesman problems using generalized chromosome genetic algorithm
- (2008) Jinhui Yang et al. Progress in Natural Science-Materials International
- A new grouping genetic algorithm approach to the multiple traveling salesperson problem
- (2008) Alok Singh et al. SOFT COMPUTING
- Solving a school bus scheduling problem with integer programming
- (2007) Armin Fügenschuh EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Create your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create NowBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started