Outputs (104)

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.

A Survey on Workforce Scheduling and Routing Problems (2012)
Presentation / Conference Contribution
Castillo-Salazar, J. A., Landa-Silva, D., & Qu, R. (2012, August). A Survey on Workforce Scheduling and Routing Problems. Presented at PATAT 2012 - Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling, Oslo, Norway

© PATAT 2012. In the context of workforce scheduling, there are many scenarios in which personnel must carry out tasks at different locations hence requiring some form of transportation. Examples of these type of scenarios include nurses visiting pat... Read More about A Survey on Workforce Scheduling and Routing Problems.

A survey of workforce scheduling and routing (2012)
Presentation / Conference Contribution
Castillo-Salazar, A., Landa-Silva, D., & Qu, R. A survey of workforce scheduling and routing. Presented at Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012)

In the context of workforce scheduling, there are many scenarios in which personnel must carry out tasks at different locations hence requiring some form of transportation. Examples of these type of scenarios include nurses visiting patients at home,... Read More about A survey of workforce scheduling and routing.

Tabu assisted guided local search approaches for freight service network design (2011)
Journal Article
Bai, R., Kendall, G., Qu, R., & Atkin, J. A. (2012). Tabu assisted guided local search approaches for freight service network design. Information Sciences, 189, https://doi.org/10.1016/j.ins.2011.11.028

The service network design problem (SNDP) is a core problem in freight transportation. It involves the determination of the most cost-effective transportation network and the character- istics of the corresponding services, subject to various constra... Read More about Tabu assisted guided local search approaches for freight service network design.

A survey of search methodologies and automated system development for examination timetabling (2008)
Journal Article
Qu, R., Burke, E., McCollum, B., Merlot, L., & Lee, S. (2008). A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling, 12(1), https://doi.org/10.1007/s10951-008-0077-5

Examination timetabling is one of the most important administrative activities that takes place in all academic institutions. In this paper, we present a critical discussion of the research on exam timetabling which has taken place in the last decade... Read More about A survey of search methodologies and automated system development for examination timetabling.

Hybridizations within a graph based hyper-heuristic framework for university timetabling problems (2008)
Journal Article
Qu, R., & Burke, E. (2008). Hybridizations within a graph based hyper-heuristic framework for university timetabling problems. Journal of the Operational Research Society, 60(9), https://doi.org/10.1057/jors.2008.102

A significant body of recent literature has explored various research directions in hyper-heuristics (which can be thought as heuristics to choose heuristics). In this paper, we extend our previous work to construct a unified graph-based hyper-heuris... Read More about Hybridizations within a graph based hyper-heuristic framework for university timetabling problems.