Dr Michael Forbes

Senior Lecturer
Located in Building 69 - Room 711
Phone: 56128
PhD
Research Interests Operations Research

Available Projects

Title Body Level
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
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
Prioritization via Stochastic Optimization

Implement the approaches described in the attached paper using disaggregated Benders Decomposition.

Masters Project
Honours Project
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
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
Flinders Hamiltonian Cycle Project

Statistical analysis of and development of solution techniques for the problems in the FHCP Challenge Set

...

Honours Project
Summer Project
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
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
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
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
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
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
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