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

Abdulqader M. Mohsen; Wedad Al-Sorori

doi:10.1007/978-3-319-51472-7_12

ScienceGate Book Chapters

BOOK-CHAPTER

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

Abdulqader M. Mohsen Wedad Al-Sorori

Year: 2017 Studies in computational intelligence Pages: 169-180 Publisher: Springer Nature

DOI: 10.1007/978-3-319-51472-7_12

Get Full-Text PDF Get Analytical Report

Keywords:

Firefly algorithm Travelling salesman problem Mathematical optimization Local optimum Benchmark (surveying) Crossover Convergence (economics) Computer science Algorithm Heuristic Genetic algorithm Mathematics Artificial intelligence Particle swarm optimization

Metrics

Cited By

1.72

FWCI (Field Weighted Citation Impact)

Refs

0.86

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Metaheuristic Optimization Algorithms Research

Physical Sciences → Computer Science → Artificial Intelligence

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Advanced Multi-Objective Optimization Algorithms

Physical Sciences → Computer Science → Computational Theory and Mathematics

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

Metrics

Citation History

Topics

Related Documents

Firefly Algorithm Solving Multiple Traveling Salesman Problem

Discrete Firefly Algorithm for Traveling Salesman Problem

Firefly Algorithm Solving Equal-Task Multiple Traveling Salesman Problem

Swap-Based Discrete Firefly Algorithm for Traveling Salesman Problem

Hybrid Algorithm for Solving Traveling Salesman Problem