All Outputs (8)

A dynamic truck dispatching problem in marine container terminal (2016)
Presentation / Conference Contribution
Chen, J., Bai, R., Dong, H., Qu, R., & Kendall, G. (2016). A dynamic truck dispatching problem in marine container terminal.

In this paper, a dynamic truck dispatching problem of a marine container terminal is described and discussed. In this problem, a few containers, encoded as work instructions, need to be transferred between yard blocks and vessels by a fleet of trucks... Read More about A dynamic truck dispatching problem in marine container terminal.

An application programming interface with increased performance for optimisation problems data (2016)
Journal Article
Pinheiro, R. L., Landa-Silva, D., Qu, R., Constantino, A. A., & Yanaga, E. (in press). An application programming interface with increased performance for optimisation problems data. Journal of Management Analytics, 3(4), https://doi.org/10.1080/23270012.2016.1233514

An optimisation problem can have many forms and variants. It may consider different objectives, constraints, and variables. For that reason, providing a general application programming interface (API) to handle the problem data efficiently in all sce... Read More about An application programming interface with increased performance for optimisation problems data.

Solving the randomly generated university examination timetabling problem through Domain Transformation Approach (DTA) (2016)
Book Chapter
Nor Abdul Rahim, S. K., Bargiela, A., & Qu, R. (2016). Solving the randomly generated university examination timetabling problem through Domain Transformation Approach (DTA). In Proceedings of the International Conference on Computing, Mathematics and Statistics (iCMS 2015): bridging research endeavo. Springer Singapore. https://doi.org/10.1007/978-981-10-2772-7_8

Amongst the wide-ranging areas of the timetabling problems, educational timetabling was reported as one of the most studied and researched areas in the timetabling literature. In this paper, our focus is the university examination timetabling. Despit... Read More about Solving the randomly generated university examination timetabling problem through Domain Transformation Approach (DTA).

A quantum inspired evolutionary algorithm for dynamic multicast routing with network coding (2016)
Presentation / Conference Contribution
Xing, H., Xu, L., Qu, R., & Qu, Z. (2016). A quantum inspired evolutionary algorithm for dynamic multicast routing with network coding.

This paper studies and models the multicast routing problem with network coding in dynamic network environment, where computational and bandwidth resources are to be jointly optimized. A quantum inspired evolutionary algorithm (QEA) is developed to a... Read More about A quantum inspired evolutionary algorithm for dynamic multicast routing with network coding.

A PBIL for load balancing in network coding based multicasting (2016)
Journal Article
Xing, H., Xu, Y., Qu, R., & Xu, L. (2016). A PBIL for load balancing in network coding based multicasting. Lecture Notes in Artificial Intelligence, 9787, 34-44. https://doi.org/10.1007/978-3-319-42108-7_3

One of the most important issues in multicast is how to achieve a balanced traffic load within a communications network. This paper formulates a load balancing optimization problem in the context of multicast with network coding and proposes a modifi... Read More about A PBIL for load balancing in network coding based multicasting.

Hybridising local search with Branch-and-Bound for constrained portfolio selection problems (2016)
Presentation / Conference Contribution
He, F., & Qu, R. (2016). Hybridising local search with Branch-and-Bound for constrained portfolio selection problems.

In this paper, we investigate a constrained portfolio selection problem with cardinality constraint, minimum size and position constraints, and non-convex transaction cost. A hybrid method named Local Search Branch-and-Bound (LS-B&B) which integrates... Read More about Hybridising local search with Branch-and-Bound for constrained portfolio selection problems.

A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW (2016)
Presentation / Conference Contribution
Chen, B., Qu, R., Bai, R., & Ishibuchi, H. (2016). A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW.

The Vehicle Routing Problem with Time Windows (VRPTW) consists of constructing least cost routes from a depot to a set of geographically scattered service points and back to the depot, satisfying service time interval and capacity constraints. A Var... Read More about A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW.

Constrained portfolio optimisation: the state-of-the-art Markowitz models (2016)
Presentation / Conference Contribution
Jin, Y., Qu, R., & Atkin, J. (2016). Constrained portfolio optimisation: the state-of-the-art Markowitz models.

This paper studies the state-of-art constrained portfolio optimisation models, using exact solver to identify the optimal solutions or lower bound for the benchmark instances at the OR-library with extended constraints. The effects of pre-assignment,... Read More about Constrained portfolio optimisation: the state-of-the-art Markowitz models.