A New Approach Based on K-Means Clustering and Shuffled Frog Leaping Algorithm to Solve Travelling Salesman Problem

Academic Perspective Procedia
doi 10.33793/acperpro.02.03.31
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Academic Perspective

Related search

Shuffled Frog Leaping Algorithm Based on Quantum Rotation Angle

MATEC Web of Conferences
Materials ScienceEngineeringChemistry
2020English

MPPT Control Strategy of PV Based on Improved Shuffled Frog Leaping Algorithm Under Complex Environments

Journal of Control Science and Engineering
Electronic EngineeringSimulationComputer Science ApplicationsElectricalModeling
2017English

A Modified Shuffled Frog Leaping Algorithm for PAPR Reduction in OFDM Systems

2014English

Application of Shuffled Frog Leaping Algorithm to Long Term Generation Expansion Planning

International Journal of Computer and Electrical Engineering
2012English

Asynchronous Parallel Disassembly Sequence Planning for Multi-Manipulator Based on Improved Shuffled Frog Leaping Algorithm

SN Applied Sciences
2020English

Solution to Travelling Salesman Problem by Nature Inspired Algorithm

International Journal of Computer Applications
2015English

Can the Agent With Limited Information Solve Travelling Salesman Problem?

Complexity
MultidisciplinaryComputer Science
2017English

ISPO: A New Way to Solve Traveling Salesman Problem

Intelligent Control and Automation
2013English

Hybridizing Shuffled Frog Leaping and Shuffled Complex Evolution Algorithms Using Local Search Methods

International Journal of Applied Evolutionary Computation
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy