Design Of Perturbative Hyper-Heuristics For Combinatorial Optimisation
Combinatorial optimisation is an area which seeks to identify optimal solution(s) from a discrete solution search space. Approaches for solving combinatorial optimisation problems can be separated into two main sub-classes, i.e. exact and approximation algorithms. Exact algorithm is a sub-class of t...
Saved in:
Main Author: | Choong, Shin Siang |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | http://eprints.usm.my/46600/1/Choong_Shin_Siang_PhD_Thesis24.pdf http://eprints.usm.my/46600/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Harmony Search-Based Hyper-Heuristic For Scheduling Problems
by: Anwar, Khairul
Published: (2018) -
A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem
by: Kelvin, Lim Ching Wei
Published: (2023) -
A Social- And Knowledge-Based Coalition Formation Using Modified Combinatorial Particle Swarm Optimization
by: Kassim, Azleena Mohd
Published: (2017) -
Approach for solving active perturbation attack problem in stepping stone detection.
by: Omar, Mohd Nizam
Published: (2011) -
A Background Study on Ant Colony Optimization Metaheuristic
and its Application Principles in Resolving Three Combinatorial Optimization Problem.
by: Sallim, Jamaludin, et al.
Published: (2007)