Amanote Research

Amanote Research

    RegisterSign In

A Modified Ant Colony Algorithm for Traveling Salesman Problem

International Journal of Computers, Communications and Control - Romania
doi 10.15837/ijccc.2014.5.1280
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsComputer NetworksComputer Science ApplicationsComputational TheoryCommunications
Date

August 5, 2014

Authors
Xianmin WeiLiqi HanLu Hong
Publisher

Agora University of Oradea


Related search

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

Jurnal Buana Informatika
2016English

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

GSTF INTERNATIONAL JOURNAL ON COMPUTING
2011English

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 Memetic Algorithm for the Generalized Traveling Salesman Problem

Natural Computing
Computer Science Applications
2009English

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

Traveling Salesman Problem

2011English

Traveling Salesman Problem

English

Modified Continuous Ant Colony Algorithm for Function Optimization

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy