A Hybrid Firefly Algorithm €“ Ant Colony Optimization for Traveling Salesman Problem

Jurnal Buana Informatika

doi 10.24002/jbi.v7i1.484

Full Text

Abstract

Available in

Date

Authors

Publisher

Universitas Atma Jaya Yogyakarta

Related search

A Modified Ant Colony Algorithm for Traveling Salesman Problem

International Journal of Computers, Communications and Control
MathematicsComputer NetworksComputer Science ApplicationsComputational TheoryCommunications
2014English

An Improved Modular Hybrid Ant Colony Approach for Solving Traveling Salesman Problem

GSTF INTERNATIONAL JOURNAL ON COMPUTING
2011English

Research on an Improved Ant Colony Optimization Algorithm for Solving Traveling Salesmen Problem

International Journal of Database Theory and Application
Computer Science
2016English

A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem

PLoS ONE
Multidisciplinary
2016English

Solving the Traveling Salesman Problem Based on the Genetic Reactive Bone Route Algorithm Whit Ant Colony System

International Journal of Production Management and Engineering
2016English

A Discrete Particle Swarm Optimization Algorithm for the Generalized Traveling Salesman Problem

2007English

A Memetic Algorithm for the Generalized Traveling Salesman Problem

Natural Computing
Computer Science Applications
2009English

Comparative Study Between Elephant Herding Optimization (EHO) and U-Turning Ant Colony Optimization (U-Taco) in Solving Symmetric Traveling Salesman Problem (STSP)

Journal of Advanced Computer Science & Technology
2019English

Routing for Taxi-Pooling Problem Based on Ant Colony Optimization Algorithm

Revista de la Facultad de Ingenieria
EarthEngineeringPlanetary Sciences
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy