A Novel Hybrid Genetic Algorithm based Firefly Mating Algorithm for Solving TSP
Main Article Content
Abstract
TSP is an NP-complete based mathematical problem, which has enormous applications in the
field of vehicle routing problems, logistics, planning and scheduling etc. The traveling salesman
problem (TSP) is a problem in combinatorial optimization. Several heuristics are there to solve
this interesting structure. One of the heuristics, genetic algorithm (GA) is used by many
researchers to solve TSP effectively, but they face various problems. GA has so many lacunas,
and to overcome these, we have hybridized GA in a novel way. In this paper, we have developed
a hybrid genetic algorithm based firefly mating algorithm (HGFMA), which can solve TSP
instances with a greater success rate for easy, medium, and hard difficulty level based on number
of cities. Our proposed method has controlled ―getting stuck in local optima,‖ considering less
population and less generation.
Downloads
Metrics
Article Details
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
