A GPU accelerated parallel genetic algorithm for the traveling salesman problem by Binjubier, Mohammed, Mohd Arfian, Ismail, Tusher, Ekramul Haque, Aljanabi, Mohammad

“…The Traveling Salesman Problem (TSP) is a widely studied challenge in combinatorial optimization. Given a set of cities and their pairwise distance, the problem seeks to find the minimum-distance tour that the salesman can make such that he visits every city once and goes back to the origin. …”
Get full text

Multi-objective multi-verse optimiser for integrated two-sided assembly sequence planning and line balancing by Mohd Fadzil Faisae, Ab Rashid, Nik Mohd Zuki, Nik Mohamed, Ahmad Nasser, Mohd Rose

Get full text
Get full text

Hybrid Metaheuristics for QoS-Aware Service Composition: A Systematic Mapping Study by Hadi Naghavipour, Tey, Kok Soon, Mohd Yamani Idna bin Idris, Morteza Namvar, Rosli bin Salleh, Abdullah Gani

“…Service composition has regarded as a multi-objective combinatorial optimization problem that falls in the category of NP-hard. …”
Get full text
Get full text

Menyelesaikan masalah perancangan jujukan pemasangan menggunakan algoritma penapis Kalman diselakukan by Ainizar, Mustapa

“…Maka, bagi tujuan menyelesaikan masalah pengoptimuman gabungan (Combinatorial Optimization Problem - COP) yang diskret menggunakan metaheuristik serta menilai prestasi algoritma yang dicadangkan, satu kajian kes ASP telah dijalankan. …”
Get full text

An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

“…The Traveling Salesman Problem (TSP) is a combinatorial optimization problem that is useful in a number of applications. …”
Get full text
Get full text

Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Saraf, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

“…Feature Selection in High Dimensional Space is a combinatory optimization problem with an NP-hard nature. Meta-heuristic searching with embedding information theory-based criteria in the fitness function for selecting the relevant features is used widely in current feature selection algorithms. …”
Get full text

Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Saraf, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

“…Feature Selection in High Dimensional Space is a combinatory optimization problem with an NP-hard nature. Meta-heuristic searching with embedding information theory-based criteria in the fitness function for selecting the relevant features is used widely in current feature selection algorithms. …”
Get full text

Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Sara, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

“…Feature Selection in High Dimensional Space is a combinatory optimization problem with an NP-hard nature. Meta-heuristic searching with embedding information theory-based criteria in the fitness function for selecting the relevant features is used widely in current feature selection algorithms. …”
Get full text