A grouping hyper-heuristic framework: application on graph colouring

A grouping hyper-heuristic framework: application on graph colouring

Grouping problems are hard to solve combinatorial optimisation problems which require partitioning of objects into a minimum number of subsets while a given objective is simultaneously optimised. Selection hyper-heuristics are high level general purpose search methodologies that operate on a space f...

Full description

Bibliographic Details
Main Authors: Elhag, Anas, Özcan, Ender
Format: Article
Published: Elsevier 2015
Subjects:
Combinatorial optimization; Computer software reusability; Economic and social effects; Graph theory; Iterative methods; Optimization; Problem solving; Scheduling
Examination timetabling; Graph colouring; Grouping problem; Heuristic selections; High-quality solutions; Hyper-heuristics; Timetabling; Tradeoff solution
Heuristic methods
Online Access:https://eprints.nottingham.ac.uk/32183/

Internet

https://eprints.nottingham.ac.uk/32183/

Similar Items