Webmaster: Yashesh Dhebar (dhebarya@egr.msu.edu) and Julian Blank (blankjul@egr.msu.edu), Created on 24 February 2018

Bi-objective Traveling Thief Problem

 

Real-world optimization problems often consist of several NP-hard combinatorial optimization problems that interact with each other. Such multi-component optimization problems are difficult to solve not only because of the contained hard optimization problems, but in particular, because of the interdependencies between the different components. Interdependence complicates a decision making by forcing each sub-problem to influence the quality and feasibility of solutions of the other sub-problems. This influence might be even stronger when one sub-problem changes the data used by another one through a solution construction process. Examples of multi-component problems are vehicle routing problems under loading constraints, the maximizing material utilization while respecting a production schedule, and the relocation of containers in a port while minimizing idle times of ships.

The goal of this competition is to provide a platform for researchers in computational intelligence working on multi-component optimization problems. The main focus of this competition is on the combination of TSP and Knapsack problems. However, we plan to extend this competition format to more complex combinations of problems (that have typically been dealt with individually in the past decades) in the upcoming years.

Problem Description: https://www.egr.msu.edu/coinlab/blankjul/emo19-thief/

Github: https://github.com/julesy89/emo19-thief

This site was designed with the
.com
website builder. Create your website today.
Start Now