Skip to main content

News

11-Nov-2016: Results announced

The results were announced at the project's final meeting in Bologna and the winners presented their approaches there. More details can be found in the Results page.

 

14-Sep-2016: Submitted solvers

A bug fix in the solution verification tool was fixed. Please check the new version.

 

28-Jun-2016: Submitted solvers

Four solvers have been submitted for the competition. The next stage is to evaluate each on the new test instances and rank the solvers based on performanc on both the test and training instances.

 

17-Jun-2016: Deadline extension

The submission deadline for the solvers has been extended till 23:59 CET on the 24th-Jun-2016.

 

16-June-2016: Minor bug fixes to the solution verifier regarding batch instances

Due to numerical computational issues, some have found feasible solutions that the verifier reports as infeasible. The problem is avoided by rounding the numbers in the solution file to four decimal places, as instructed in the solution file description. We also modified the verifier to do the rounding by itself upon reading the solution file. If any still faces this problem, please report it. 

 

10-June-2016: Minor change to the "Problem description, constraints, and objective" document

The change clarifies that a batch instance is one where one, or all, of the PUs and/or TUs have a non-zero processing or treatment times. So it is possible to have some of the PUs and/or TUs operating in steady-state, while others operate in batch mode, as in the instances given.

 

08-June-2016: Regular update of the leaderboard's page

  • As the training period is ending soon, the Leaderboard's page will be updated more often, as soon as new solutions are submitted. Please check it regularly.

 

30-May-2016: A new solution found

  • A new solution to Instance 3 has been found by one of the participants. The solution quality and running time are on the Leaderboard's page
  • A batch variant of instances 2 and 3 has been uploaded with two feasible solutions obtained by two different solvers for each. Note that these solutions are only feasible solutions obtained by optimizing a trivial constant objective function, not the cost function required for the competition. The optimal solution for the cost objective was not found within the allowed time limit. The proposed feasible solutions can serve as a starting point to your algorithm. Another instance will be uploaded soon.

 

26-May-2016: Solution verifier

Minor bug fixes to the solution verifier have been made. The old file is now replaced with a new one. 

 

20-April-2016: Mathematical model

Minor modifications to the mathematical model have been made. The old file is now replaced with a new one. 

 

11th-April-2016: Competition announcement

The Mixed Integer Nonlinear Optimization (MINO) industrial challenge brings together practitioners and researchers from different fields who are interested in finding better solutions to complex real-world problems. The objective of the challenge is to compare different modeling and search approaches for a specific real-world problem, it being the total waste water network design and operation optimization. Click here for more information about the problem.

 

The competitors are free to model the problem in any way they please, and design a search algorithm suitable for their models, such that they obtain high quality solutions while satisfying the problem’s constraints, and within the allowed time limit. The combination of a model and an algorithm will be referred to as a "Solver".

 

As a reference, a mathematical model of the problem is made available to the competitors to help them better understand the problem's characteristics, constraints, and objective. The mathematical model can be used, or modified, in any way, yet the participants are encouraged to build their own models, not necessarily a mathematical one, and design algorithms accordingly.

 

The top three competitors will be invited (with expenses covered) to present their work at the MINO project's final meeting taking place at the University of Bologna around mid-October 2016. More details will follow on the exact date and venue of the meeting. The current prize fund is 2500 Euros, that is to be split between the first (1300), second (800) and third (400) place competitors. Moreover, a special issue of an international journal will be edited to publish the best contributions to the competition.

 

The competition is organized by ORTEC, the Mixed Integer Nonlinear Optimization initial training network (MINO), and Royal Dutch Shell.