Bird mating optimizer for combinatorial optimization problems
The bird mating optimizer is a new metaheuristic algorithm that was originally proposed to
solve continuous optimization problems with a very promising performance. However, the …
solve continuous optimization problems with a very promising performance. However, the …
Discrete spider monkey optimization for travelling salesman problem
Meta-heuristic algorithms inspired by biological species have become very popular in recent
years. Collective intelligence of various social insects such as ants, bees, wasps, termites …
years. Collective intelligence of various social insects such as ants, bees, wasps, termites …
Ant colony hyper-heuristics for travelling salesman problem
Z Abd Aziz - Procedia Computer Science, 2015 - Elsevier
Metaheuristics are capable of producing good quality solutions. However, they often need to
perform some adjustment of relevant parameters in order to be applied to new problems or …
perform some adjustment of relevant parameters in order to be applied to new problems or …
Algoritma optimasi untuk penyelesaian travelling salesman problem
DT Wiyanti - Jurnal Transformatika, 2013 - journals.usm.ac.id
Abstract Travelling Salesman Problem (TSP) masih menjadi topik menarik untuk dibahas.
TSP termasuk bagian dari permasalahan optimasi di dunia nyata. Pada TSP ini terdapat n …
TSP termasuk bagian dari permasalahan optimasi di dunia nyata. Pada TSP ini terdapat n …
Artificial Bee Colony Algorithm untuk Menyelesaikan Travelling Salesman Problem
F Amri, EB Nababan… - Jurnal Dunia Teknologi …, 2012 - garuda.kemdikbud.go.id
Abstract Permasalahan Traveling Salesman Problem (TSP) dikenal dengan sebagai
permasalahan yang bersifat Nondeterministic Polynomial-Hard (NP-Hard). Penyelesaian …
permasalahan yang bersifat Nondeterministic Polynomial-Hard (NP-Hard). Penyelesaian …