School of Engineering and Information Technology


Large Scale Optimisation

It is very difficult for existing algorithms to solve large problems with many variables. One popular approach to alleviating these problems is to divide the large problems into a number of subproblems, and to then solve these subproblems using independent computer processors. This can be suboptimal because when one subproblem is optimised, it may cause one or more other subproblems to become deoptimised. This occurs because the variables in one subproblem interact with those of another. In this research, we (Hasan, Daryl and Sarker) have identified such dependencies and have tailored the subproblems to limit such dependencies. Results so far, have supported the merits of this approach.



 Return to Operations Research and Optimisation homepage
 Return to Research homepage

Other topics for Operations Research and Optimisation during 2012:

 Production Scheduling under Disruption
 DMEA: a direction-based multiobjective evolutionary algorithm
 Real-time Routing and Tracking Algorithms
 An Optimisation Framework for the Design of Underwater Vehicles
 Handling Equality Constraints in Evolutionary Optimisation
 Multi Objective Learning Classifier Systems Based Hyperheuristics for Modularised Fleet Mix Problem
 Inventory System with Transportation Disruption
 Ship Inventory Routing and Scheduling
 Shape Representation and Optimisation
 A Novel Repair Mechanism based on Most Probable Point of Failure
 Learning from Evolutionary Algorithm based Design Optimization of Axisymmetric Scramjet Inlets
 An Evolutionary Multi-objective Scenario- Based Approach for Stochastic Resource Investment Project Scheduling
 Grid-Based Heuristic for Two-Dimensional Packing Problems
 User- and Application-Centric Multihomed Flow Management
 Kangaroo: An Efficient Constraint-Based Local Search System Using Lazy Propagation
 GA for Constrained Optimisation
 Soft Operations Research and System Dynamics Modelling
 OR in Bioinformatics