|Last Update: 04 March 2015|
Back to Individual Dissertation
General Areas of Interest for Supervising Projects
The project ideas listed here are related to my areas of research, which in a summarised way include the application of search and optimisation methods including artificial intelligence techniques to tackle a range of real-world problems in the broad area of modelling and optimisation.
I would also supervise projects in other topics of computer science if the project is within my interests and I feel competent to supervise the project. Please contact me if you are interested in me supervising your project. I always prefer to have a face to face conversation before agreeing to supervise a project. Note that all the projects listed below involve both research and programming and can also be targeted to a practical application that is in your interests.
What is required to undertake the projects suggested here? One typical question is: is this project adequate for obtaining a high grade? and the answer for all projects listed here is YES BUT IT STRONGLY DEPENDS ON THE STUDENT'S COMMITTMENT TO DEVELOP A HIGH-QUALITY DISSERTATION. The projects listed here have the potential to carry out research and develop a computer system. You definitely need to do considerable programming but also search the literature, select, read and analyse sources of information (not only Google search). As a computing student you are expected to produce good quality computer code. At first sight, these projects might seem too challenging, particularly if you are not familar with the problems or techniques. However, these are project ideas for which I can offer specific guidance. But of course, I will not tell you exactly how to develop the project. Selecting a challenging project does not guarantee you to obtain a high grade, that is only a good start. It is your performance and achievements which will be reflected in the final grade.
Are these project ideas suitable for 60/40/20 credit dissertations? Most of the project ideas suggested here can be adapted for developing a dissertation according to the degree type (Master degree, UG single honours, UG joint honours, UG Major/Minor, etc.). Please refer to the corresponding handbook for more guidelines and the requirements that your project should meet according to your course.
Some ideas for individual projects are listed below, they are intentionally described very briefly in order not to be too
prescriptive. The intention is that such ideas trigger your interest, then you can conduct some research and shape the project idea to your
own liking. An addition to these project ideas, you can also look at the undergraduate
and postgraduate projects that I have supervised in previous years as they
could also trigger some project ideas of your own.
Some Ideas for Individual Projects
Mobile and Web Services for Scheduling Problems
The goal here is to develop software tools to facilitate the automated creation of schedules through modern smartphones and other mobile devices and via the Web. There is a variety of scenarios in which a schedule needs to be created in order to make the utilisation of resources more efficient. For example, workforce scheduling, meetings scheduling, sports scheduling, timetabling, tasks scheduling, etc. could be suitable scenarios for the application of search, optimisation and computational intelligence techniques. Note: Some previous dissertations have developed mobile applications and web-based applications for some scheduling scenarios, there is scope for extending this work.
Educational Software Tools for Search and Optimisation Methods
There is good variety of search and optimisation algorithms and many bibliographic resources that describe these algorithms at various levels of detail, but not many software tools to facilitate the 'self-learning' of how these methods work. Heuristic search is an important technique from Artificial Intelligence that is also subject to intensive research because it can help to solve very difficult and large search and optimisation problems. The goal here is to develop tools that interactively illustrate the way in which some algorithm works. The focus should be on effectively visualisation and interactivity, can be a tutorial or even a computer game. Note: Some previous dissertations have developed tutorials for the graphical method to solve linear programming problems and for heuristic local search.
Further Development With Existing Search and Optimisation Algorithms
Recent research work has resulted in the development of search and optimisation algorithms for tackling
some optimisation problems. There are various ideas that would seek to extend some of this work by for
example, conducting systematic computational experiments, adapting algorithms to different scenarios,
comparing the performance of different algorithms, etc. That is, projects that do not aim at conceiving
a new algorithm, but instead, aim at studying and/or modifying existing ones. For example, algorithms
that we have developed recently include non-linear great deluge, dynamic lexicographic approach, etc.
Computational Intelligence and Software Engineering for Puzzles
Project ideas can be conceived for the development of software aimed at solving puzzles. There is a great variety of puzzles and many are computationally difficult to solve. In some cases, well-known algorithms exist and hence projects could be about applying software engineering to develop interfaces, mobile apps, web applications, collaborative playing tools, etc. In other cases, identifying some computational intelligence approach to solve the puzzle could be a good project. There is scope for many ideas in this topic depending on the particular interests of the student. The solution of some puzzles through computational intelligence algorithms can give an insight into a variety of real-world applications of these techniques.
Search and Optimisation Through the Raspberry Pi Computer
The Raspberry Pi computer is a capable little PC with some decent computation capability. Traditionally,
search and optimisation algorithms are developed for running on powerful computers given that these type
of algorithms usually consume considerable computation power and memory. The goal here is to evaluate
the suitability of developing this kind of algorithms for the Raspberry Pi computer. Projects could be
about conducting a systematic evaluation of opportunities or about actually developing a computing solution
to some selected scenario using this computing device. Alternatively, projects could be about using the
Raspberry Pi computer for other functions that could support search and optimisation applications, others
ideas along these lines are welcome.
Benchmarks and Visualisation Tools for Selected Combinatorial Optimisation Problems
In combinatorial optimisation problems the aim is typically to find the best (optimal) arrangement of objects that satisfies a given set of constraints. Examples of these type of problems are the travelling salesman, bin packing, vehicle routing, timetabling, workforce scheduling, sudoku, etc. Projects can be conceived about the development of software tools that facilitate the better understanding of these problems, most of which have real-world applications in business and industry. Note: Some previous dissertations have done some work in this area. There is scope for more work in this area and projects can be oriented to software engineering, to algorithm implementation, or other area of interest.
Software Solutions for the Office Space Allocation Problem
The office space allocation problem refers to allocating people to office space in order to ensure an adequate utilisation of the available office space while also satisfying additional constraints. Various works have been done on this problem, developing algorithms, problem instance generators and graphical user interfaces. There are opportunties for developing various project ideas in this problem domain. The projects could be on computers algorithms, visualisation tools, survey and analysis of existing software, etc. Note: There is a number of resources (test data sets, various articles, several prototype systems, etc.) for projects in this area given the work that has been undertaken over several years.
Adaptive Room Layout Design: Problem Modelling and Solution Approaches
The goal here is to approach the problem of automating the design of rooms and buildings layout in an organisation. Making an efficient use of the office space is often a challenge in many organisations and the constant changes in staff and research students, makes this goal more difficut to achieve. It is commonly the case that the number and size of the available rooms is not the most adequate to allocate offices to staff, research students, visitors, etc. Therefore, this projects aims at developing a system to suggest adequate changes in the layout of rooms and buildings in order to better satisfy the space requirements. The system should serve as a decision support tool for space administrators. Note: A previous dissertation developed a first approach in which, given the current floor plans and the changes in the people to be assigned to the rooms, a modified floor plan is suggested by moving walls so that rooms can be merged and divided, there is scope for extending this work.
Forecasting Orders for Transport Planning
The supply and demand for transport is more relevant today than ever before. Hauliers want as much time as possible to plan and utilise their fleet whilst shippers are offering reduced lead times to their customers as a competitive advantage. Buying transport early means getting the best price and guaranteeing vehicle availability. Consequently the later an order is received the higher the price of transport and less chance of fulfilling the shipment. Anticipating the demand for transport and using predicted orders in transport planning means we can achieve the best rate and guarantee availability without the actual order. With a long standing customer base and therefore detailed order history, 3T Logistics is exploring the potential of predicting when consignees will order and what size the order will be. The predicted orders will then be used in the transport planning process to achieve best price and available vehicles. For this projects, historical data is available about the orders in the year 2013. Data includes the consignee id, the date and the order size. The goal of the project is to use computational techniques to analyse this data and "predict" future orders while also taking into account present conditions.