Firefly Algorithm Solving Equal-Task Multiple Traveling Salesman Problem

Jianhua Ma; Mingfu Li; Yuyan Zhang; Houming Zhou

doi:10.1007/978-3-662-45049-9_49

ScienceGate Book Chapters

BOOK-CHAPTER

Firefly Algorithm Solving Equal-Task Multiple Traveling Salesman Problem

Jianhua Ma Mingfu Li Yuyan Zhang Houming Zhou

Year: 2014 Communications in computer and information science Pages: 304-307 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-662-45049-9_49

Get Full-Text PDF Get Analytical Report

Keywords:

Travelling salesman problem Firefly algorithm Task (project management) Computer science Algorithm Firefly protocol Series (stratigraphy) Mathematical optimization Mathematics Engineering Particle swarm optimization

Metrics

Cited By

1.71

FWCI (Field Weighted Citation Impact)

Refs

0.83

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Simulation and Modeling Applications

Physical Sciences → Engineering → Control and Systems Engineering

Advanced Computational Techniques and Applications

Physical Sciences → Computer Science → Artificial Intelligence

Industrial Technology and Control Systems

Physical Sciences → Engineering → Control and Systems Engineering

Firefly Algorithm Solving Equal-Task Multiple Traveling Salesman Problem

Metrics

Citation History

Topics

Related Documents

Firefly Algorithm Solving Multiple Traveling Salesman Problem

Solving Traveling Salesman Problem using Firefly algorithm and K-means Clustering

Discrete Firefly Algorithm for Traveling Salesman Problem

Solving the Multiple Traveling Salesman Problem Using Memetic Algorithm

A New Hybrid Discrete Firefly Algorithm for Solving the Traveling Salesman Problem