# Operations Research Available Projects

Title | Project Discription | Level | Supervisor |
---|---|---|---|

Move sedating bisphosphonates premaxillary sensation, re-advance emergencies. |
http://levitrageneric-cheapest-price.net/ - levitrageneric-cheapest-price.net.ankor cheapest-priceventolinonline.net.ankor... |
Summer Project | |

Player Valuation in Rugby League |
Traditional models of player valuation in Rugby League use summary statistics to estimate the value of a player. Some examples include: minutes played, tackles made, tackles missed, hit ups made, metres gained, tries scored, try assists, errors, penalties conceded and kick effectiveness.... |
Honours Project Summer Project Winter Project |
Dr Michael Forbes |

Truck Scheduling in the Postal Service Industry |
Consider other ways of formulating and solving the problem described in the attached paper. Specifically, consider Network Flow models with Lazy Constraints. |
Masters Project Honours Project |
Dr Michael Forbes |

Alternative Fuel Vehicle Scheduling |
Consider alternative solution techniques to the problem examined in the linked document. https://repository.asu.edu/attachments/134788/content/Adler_asu_0010E_13619.pdf |
Masters Project Honours Project |
Dr Michael Forbes |

Prioritization via Stochastic Optimization |
Implement the approaches described in the attached paper using disaggregated Benders Decomposition. |
Masters Project Honours Project |
Dr Michael Forbes |

Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming |
Re-implement the solution techniques in the attached paper, using Lazy Constraints where appropriate. |
Masters Project Honours Project |
Dr Michael Forbes |

Advanced Monte Carlo Methods |
Many real-world quantitative problems are solved nowadays through Monte Carlo methods: that is, through random experiments on a computer.... |
PhD Project Masters Project Honours Project Summer Project |
Professor Dirk Kroese |

Scheduling Arrivals to a Processor Sharing Congestion System with Linear Slowdown: Integer Programming Techniques |
Develop Integer Programming models and solution techniques for exact or heuristic solutions to the problems described in this paper: http://arxiv.org/abs/1508.03136 |
Honours Project Summer Project |
Dr Michael Forbes |

Flinders Hamiltonian Cycle Project |
Statistical analysis of and development of solution techniques for the problems in the FHCP Challenge Set ... |
Honours Project Summer Project |
Dr Michael Forbes |

Exploring the Phase Transition in Inhomogeneous Random Graphs |
In 2007, B. Bollobas, S. Janson, and O. Riordan published an important paper titled ``The Phase Transition in Inhomogeneous Random Graphs,'' which gives properties of a very... |
Honours Project Summer Project |
Dr Thomas Taimre |

Dynamic Spatial Network Models |
Random networks are often modelled without reference the particular space which they inhabit. There is some work in this area (for example Penrose’s Random Geometric... |
PhD Project Masters Project |
Dr Thomas Taimre |

Weighted Network Models |
In many social networks, selection of friends on the basis of social status is very common. Similarly, websites may link to more popular websites in the hope of gaining more traffic. Simple models of these phenomena, where the benefits of connection vary according to some metric (for example... |
PhD Project Masters Project |
Dr Thomas Taimre |

Self-Organizing Phenomena in Real-World Networks |
Many networks from crystalline lattices to social networks display so-called self-organizing phenomena. This essentially means that global order or chaos can emerge from simple local rules. Particular interest has been paid to these phenomena in light of residential segregation in the US... |
PhD Project Masters Project |
Dr Thomas Taimre |

Efficient Simulation of Random Networks |
The properties of complex networks are difficult to study without the aid of simulation, and so efficient and reliable simulation techniques for random networks are of great interest. Two such methods are degree distributions and graph motifs. In this project, you will investigate... |
Honours Project Summer Project |
Dr Thomas Taimre |

Empirical Study of Stochastic Network Games |
Stochastic game theory is the study of strategic interactions between actors in an environment where their payoffs are affected by the actions of all players in the past. In this project, you will investigate in simulation simple models for stochastic network games, where the environment... |
Honours Project Summer Project |
Dr Thomas Taimre |

Estimation and Inference on Random Networks |
Social, economic, and infrastructure networks are crucially important to today's increasingly connected world. In this project you will investigate how to estimate models of dynamic networks and conduct inference for these... |
Honours Project Summer Project |
Dr Thomas Taimre |

Combinatorial Benders' Cuts for the Strip Packing Problem |
In this project students will implement the algorithms in the attached paper, possibly improving them by making more general use of lazy constraints. |
Masters Project Honours Project Summer Project |
Dr Michael Forbes |

World Championship Scrabble |
The aim of this project is to implement and improve upon the algorithms in the attached paper. This will likely be done using Stochastic Dynamic Programming for the end game and Approximate Dynamic Programming, or similar, for the early and middle game. Would suit someone with very... |
Masters Project Honours Project Summer Project |
Dr Michael Forbes |

BYOP - Bring Your Own Problem |
Due to the rapid advances in solution techniques in many areas of Operations Research, interesting projects can arise from applying up to date solution techniques to past papers, even very recent papers. At an Honours level this may... |
PhD Project Masters Project Honours Project Summer Project |
Dr Michael Forbes |

Algorithms for the Minimum Connected Dominating Set Problem |
This project considers the attached paper: Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem. The paper applies Benders Decomposition by repeatedly solving the master problem and adding Benders cuts. This... |
PhD Project Masters Project Honours Project Summer Project |
Dr Michael Forbes |

Mathematical models for real time or turn based strategy games |
Many real time and turn based strategy games have an initial phase of game play, before interaction with any opponents, that is almost completely focused on economic and/or military development. This project would look to build stochastic dynamic programming models of this stage of one or... |
Masters Project Honours Project Summer Project |
Dr Michael Forbes |

Efficient Simulation for the Poisson Lily-Pond Model |
The Poisson lily-pond model is a spatial germ--grain process, whose ``germs'' are points of a Poisson process with ``grains'' growing at uniform rate from these germs, stopping when their boundaries touch. While some results regarding the size of the largest connected... |
Honours Project Summer Project |
Dr Thomas Taimre |

Importance Sampling for Diffusion Processes via Path-Dependent Mapping |
A diffusion process on a Riemannian manifold has infinitesimal generator which is fundamentally related to the Laplace--Beltrami operator on that manifold. For a... |
Masters Project Honours Project |
Dr Thomas Taimre |

Efficient Parameter Estimation for Signals from Laser Interferometers |
The excess-phase model for interferometric signals is a simple model which well captures much of the complex behaviour observed in laser interferometers. ... |
Honours Project Summer Project |
Dr Thomas Taimre |

Sequential Importance Sampling with Mixture Models |
Mixture models are a powerful tool for many statistical applications, including density estimation from data. |
Honours Project Summer Project |
Dr Thomas Taimre |

Numerically Stable Simulation of Stochastic Differential Equations Driven by Empirical Processes |
Stochastic differential equations driven by Brownian motion or L\'evy processes are well established as models for many real-world phenomena. Just as there are efficient... |
Masters Project Honours Project |
Dr Thomas Taimre |

Efficient Estimation for Heavy-tailed Random Sums of Light-Tailed Random Variables |
Random sums of random variables arise in many contexts of applied probability such as the probability of buffer overflow in queues, or when considering the probability of ruin for risk models. When such quantities of interest cannot be evaluated precisely, there are many well established... |
Masters Project Honours Project |
Dr Thomas Taimre |

Two tier integer programming using Benders style objective estimates |
Benders Decomposition can be applied to problems with two tiers of decision variables, where the top tier are integer variables and the second tier are continuous variables. This project would look at the application of similar approaches to problems where both tiers have integer... |
PhD Project Masters Project Honours Project |
Dr Michael Forbes |

Applications of Approximate Dynamic Programming |
Approximate Dynamic Programming (ADP) is an emerging area within Operations Research. Projects could investigate the application of ADP to a specific difficult stochastic optimisation problem, especially in a domain where the... |
PhD Project Masters Project Honours Project |
Dr Michael Forbes |

System Identification Theory for Queuing Networks |
Queueing networks are stochastic mathematical models that are often used for analyzing service, manufacturing and communication systems. One often attempts to model the situation at hand by means of a... |
PhD Project Masters Project |
Dr Yoni Nazarathy |