Research projects
Problems with multiple interdependent components
The Travelling Thief Problem
The Travelling Thief Problem (TTP) is a recent benchmark optimisation problem that combines the Travelling Salesman Problem and the 0/1-Knapsack Problem in order to provide a more realistic model. Interactions between TSP and KP are introduced in order to simulate the interdependence between components in real-world problems.
Ressources
-
Original TTP paper:
Mohammad Reza Bonyadi, Zbigniew Michalewicz, and Luigi Barone.
"The travelling thief problem: the first step in the transition from theoretical problems to realistic problems." IEEE CEC 2013.
-
Standard TTP formulation:
Sergey Polyakovskiy, Mohammad Reza Bonyadi, Markus Wagner, Zbigniew Michalewicz , and Frank Neumann.
"A comprehensive benchmark set and heuristics for the traveling thief problem." ACM GECCO 2014.
-
Source codes:
- TTPLAB: my TTP solver (java) and its jar executable,
- HSEDA (implemented with Marcella S. R. Martins): A hyper-heuristic based on EDA for the TTP (MATLAB & Java)
- Database: separate files or entire dataset
- Other ressources and people: OptLog group, The TTP '2017 competition, Markus Wagner, Mohammad Reza Bonyadi, Yi Mei, Frank Neumann, Sergey Polyakovskiy
Multi-component Job Shop Scheduling Problem
The goal of this project is to: (1) propose a realistic and abstract model for material flow through a multi-plant supply chain (machine scheduling, storage management, production cost, etc); and (2) study the dependencies between the different components of the model.
The idea was initiated by Mohammad Reza Bonyadi who developed an abstract model for the Multi-component Job Shop Scheduling Problem (MJSSP). I am currently working with Bonyadi and my PhD supervisor Belaïd Ahiod on studying and improving the models initially developed.