Genetic algorithm to optimize routing problem modelled as the travelling salesman problem
This study presents genetic algorithm (GA) to solve routing problem modelled as the travelling salesman problem (TSP). Genetic algorithm conceptually follows steps inspired by the biological process of evolution. GA is following the ideas of "survival of the fittest" which meant better...
Main Author: | Muhammad Azrul Faiz , Nor Adzmi |
---|---|
Format: | Undergraduates Project Papers |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/7666/ http://umpir.ump.edu.my/id/eprint/7666/ http://umpir.ump.edu.my/id/eprint/7666/1/MUHAMMAD_AZRUL_FAIZ_BIN_NOR_ADZMI.PDF |
Similar Items
-
Genetic algortihm to solve pcb component placement modeled as travelling salesman problem
by: Mohd Khazzarul Khazreen, Mohd Zaidi
Published: (2013) -
African Buffalo Optimization and the Randomized Insertion Algorithm for the Asymmetric Travelling Salesman’s Problems
by: Odili, Julius Beneoluchi, et al.
Published: (2016) -
Tutorials on African Buffalo Optimization for Solving the Travelling Salesman Problem
by: Odili, Julius Beneoluchi, et al.
Published: (2017) -
Solving the Traveling Salesman’s Problem using the African Buffalo Optimization
by: Odili, Julius Beneoluchi, et al.
Published: (2016) -
Optimization of Traveling Salesman Problem with Precedence Constraint using Particle Swarm Optimization
by: M. F. F., Ab Rashid, et al.
Published: (2015)