All Outputs (9)

Hyper-heuristics: a survey of the state of the art (2013)
Journal Article
Burke, E., Gendreau, M., Hyde, M., Kendall, G., Ocha, G., Özcan, E., & Qu, R. (2013). Hyper-heuristics: a survey of the state of the art. Journal of the Operational Research Society, 64, https://doi.org/10.1057/jors.2013.71

Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the goal of automating the design of heuristic methods to solve hard computational search problems. An underlying strategic research challenge is to develop more g... Read More about Hyper-heuristics: a survey of the state of the art.

Grammatical evolution hyper-heuristic for combinatorial optimization problems (2013)
Journal Article
Sabar, N., Ayob, M., Kendall, G., & Qu, R. (2013). Grammatical evolution hyper-heuristic for combinatorial optimization problems. IEEE Transactions on Evolutionary Computation, 17(6), https://doi.org/10.1109/TEVC.2013.2281527

Designing generic problem solvers that perform well across a diverse set of problems is a challenging task. In this work, we propose a hyper-heuristic framework to automatically generate an effective and generic solution method by utilizing grammatic... Read More about Grammatical evolution hyper-heuristic for combinatorial optimization problems.

A path-oriented encoding evolutionary algorithm for network coding resource minimization (2013)
Journal Article
Xing, H., Qu, R., Kendall, G., & Bai, R. (2014). A path-oriented encoding evolutionary algorithm for network coding resource minimization. Journal of the Operational Research Society, 65(8), https://doi.org/10.1057/jors.2013.79

Network coding is an emerging telecommunication technique, where any intermediate node is allowed to recombine incoming data if necessary. This technique helps to increase the throughput, however, very likely at the cost of huge amount of computation... Read More about A path-oriented encoding evolutionary algorithm for network coding resource minimization.

A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems (2013)
Journal Article
Xu, Y., Qu, R., & Li, R. (2013). A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems. Annals of Operations Research, 260(1), https://doi.org/10.1007/s10479-013-1322-7

This paper presents a new hybrid evolutionary algorithm to solve multi-objective multicast routing problems in telecommunication networks. The algorithm combines simulated annealing based strategies and a genetic local search, aiming at a more flexib... Read More about A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems.

A harmony search algorithm for nurse rostering problems (2013)
Journal Article
Hadwan, M., Ayob, M., Kendall, G., & Qu, R. (2013). A harmony search algorithm for nurse rostering problems. Information Sciences, 233, https://doi.org/10.1016/j.ins.2012.12.025

Harmony search algorithm (HSA) is a relatively new nature-inspired algorithm. It evolves solutions in the problem search space by mimicking the musical improvisation process in seeking agreeable harmony measured by aesthetic standards. The nurse rost... Read More about A harmony search algorithm for nurse rostering problems.

A nondominated sorting genetic algorithm for bi-objective network coding based multicast routing problems (2013)
Journal Article
Xing, H., & Qu, R. (2013). A nondominated sorting genetic algorithm for bi-objective network coding based multicast routing problems. Information Sciences, 233, https://doi.org/10.1016/j.ins.2013.01.014

Network coding is a new communication technique that generalizes routing, where, instead of simply forwarding the packets they receive, intermediate nodes are allowed to recombine (code) together some of the data packets received from different incom... Read More about A nondominated sorting genetic algorithm for bi-objective network coding based multicast routing problems.

Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems (2013)
Journal Article
Qu, R., Xu, Y., Castro-Gutierrez, J., & Landa-Silva, D. (2013). Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems. Journal of Heuristics, 19(2), https://doi.org/10.1007/s10732-012-9198-2

This paper presents the first investigation on applying a particle swarm optimization (PSO) algorithm to both the Steiner tree problem and the delay constrained multicast routing problem. Steiner tree problems, being the underlining models of many ap... Read More about Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems.

Domain transformation approach to deterministic optimization of examination timetables (2013)
Journal Article
Abdul Rahim, S., Bargiela, A., & Qu, R. (2013). Domain transformation approach to deterministic optimization of examination timetables. Artificial Intelligence Research, 2(1), https://doi.org/10.5430/air.v2n1p122

In this paper we introduce a new optimization method for the examinations scheduling problem. Rather than attempting direct optimization of assignments of exams to specific time-slots, we perform permutations of slots and reassignments of exams upon... Read More about Domain transformation approach to deterministic optimization of examination timetables.

A time predefined variable depth search for nurse rostering (2013)
Journal Article
Burke, E., Curtois, T., Qu, R., & Vanden Berghe, G. (2013). A time predefined variable depth search for nurse rostering. INFORMS Journal on Computing, 25(3), https://doi.org/10.1287/ijoc.1120.0510

This paper presents a variable depth search for the nurse rostering problem. The algorithm works by chaining together single neighbourhood swaps into more effective compound moves. It achieves this by using heuristics to decide whether to continue ex... Read More about A time predefined variable depth search for nurse rostering.