Advanced Solution Techniques to Multi‐Component Optimisation Problems

This project addresses the Travelling Thief Problem, a benchmark multi-component nonlinear combinatorial optimisation problem. Problems of this class consist of several computationally challenging sub-problems of different nature. Solving them requires a thorough understanding of both their compounded and their individual natures. We focus on developing new superior approximate and exact solution techniques to the problem. The first part of the project constructs an efficient heuristic by adopting a probabilistic model-building evolutionary algorithm. The second part benefits from the first one and designs a logic-based Benders decomposition framework to provide a time-efficient exact solution to the problem of moderate size.

Duong Thuy Dung Le

Deakin University

Duong Thuy Dung (Amie) Le is a third-year student at the Deakin University, studying a Bachelor of Information Technology, majoring in App Development and Programming. Participating in Competitive Programming since high school creates her interest and strength in Data Structure and Algorithm.

She has interests in exploring vary of optimisation techniques to solving highly complex and challenging optimisation problems. She would like to proceed with an Honours/Master and later a PhD degree in related fields.

When she is not glued to the computer, she spends time with her family and friends or wanders around the parks.

 

You may be interested in

Christina Tait

Christina Tait

Association Network of World War One Primary Sources
Matthew Hanna

Matthew Hanna

Optimisation and Theoretical Implications of Probability Inequalities
David Perrella

David Perrella

Inner Product Spaces on Subsets of the Powerset of Riemannian Manifolds
David Adams

David Adams

Can Machines Learn like Fish? An Application of Simulated Multi-Timescale Nexting
Contact Us

We're not around right now. But you can send us an email and we'll get back to you, asap.

Not readable? Change text.