Home Contact Admin

OR@DII - Operational Research at Department of Information Engineering

Simple Ideas Are Often The Best                                                                                                                           University of Brescia



Contacts

Operational Research Group
Dip. di Ingegneria dell'Informazione
via Branze, 38
(25123) Brescia
Italy

Telephone:
+39 030 371 5448
+39 030 371 5935


Since 2007, OR@DII is the Operational Reserch group working at the Department of Information Engineering (DII) of the University of Brescia. Its research activity is focused on the development of optimization models and algorithms. OR@DII is part of OR@BRESCIA, the interdepartmental Operational Research group of the University of Brescia.

Arc Routing Problems: optimization models, algorithms, and applications

PhD course - Nov 4 and Dec 1-2, 2016 - Verona (Italy)

Prof. R. Mansini and PhD D. Manerba will teach a mini-course for PhD students entitled "Arc Routing Problems: optimization models, algorithms, and applications". The course will have a duration of 8 hours and take place at the Dept. of Computer Science - University of Verona (Italy).

2016-11-03

Modelling Week - Verona, Sept. 4-11, 2016

Optimization in City Logistics

Prof. R. Mansini and PhD D. Manerba of OR@DII group, in collaboration of Prof. R. Rizzi (University of Verona, Italy), have organized an OR stream titled "Optimization in City Logistics" during the Modelling Week PhD school recently held in Verona (http://profs.scienze.univr.it/caliari/phdmw/). The stream have consisted in theoretical and laboratory lectures to the students and in project assignments to complete and present to the other groups during the week. 

The experience was great. PhD students, which for the most part are not doing research in OR, have highly appreciated the subject and put high efford and passion in completing their projects.

The event has been cited by different magazines and some interview to students and professors are available at http://www.univrmagazine.it/sito/vedi_articolo.php?id=4215 

Interested people can find some materials (video lessons, project proposal, and so on..) at the following link: http://profs.sci.univr.it/~rrizzi/classes/ModelingWeekOR/index.html

2016-09-15

OR@DII seminars by Prof. Hanafi

We are glad to announce that Prof. Said Hanafi from University of Valenciennes and Hainaut-Cambresis (Nord-Pas-de-Calais, France), during his research visit to the OR@DII group, will give two seminars at the University of Brescia:

  • ​S. Hanafi - Hybrid approaches combining Metaheuristics and Mathematical Programming for 0-1 mixed integer programming - Wednesday, May 04, 2016 - 15h30 - Room B1.2  >> Download flyer
  • S. Hanafi - On the convergence of Scatter Search and Star Paths with Directional Rounding for 0-1 Mixed Integer Programs - Thursday, May 05, 2016 - 16h30 - Room N4  >> Download flyer

Both seminars are free and open to all students and professors. 

 

2016-04-22

Hello world!!

The renewed OR@DII website is online

Herewith the launch of the new OR@DII website, renewed in style and in contents. Here you can find all the information relating to the group and its research activities. Feedbacks are welcome.

Cheers!

2015-08-27

New IMAMAN publication

Stochastic TPP

The paper

A Stochastic Programming Approach for the Traveling Purchaser Problem

co-authored by Patrizia Beraldi, Maria Elena Bruni (from University of Calabria, Italy), Daniele Manerba, and Renata Mansini has been accepted for publication in IMA Journal of Management Mathematics. You can find the paper here

2015-08-04

New EJOR publication

MVTPP-PIC

The paper

A Multi-Vehicle Traveling Purchaser Problem with Pairwise Incompatibility Contraints: A Branch-and-Price Approach

co-authored by Michel Gendreau (from CIRRELT, Montreal, Canada), Daniele Manerba, and Renata Mansini has been accepted for publication in European Journal of Operational Research. You can find the paper here

2015-06-11

The Traveling Constellation Problem (TCP)

OR doesn't go on vacations for Christmas

A TCP instance The heuristic solution The final result.. Merry Christmas!! :)

Let us introduce the following optimization problem: given a Christmas Village sky, a set of stars (representing several constellations) and a string of Christmas lights, the Traveling Constellation Problem aims at finding a simple tour of the string lights starting and ending at the power socket that visits all the stars minimizing the lenght of the string (the string lights has a cost proportional to its lenght).
We propose a heuristic solution for the problem and test the method on a real case instance.

2014-12-20

New COR publication

CTQDP

The paper

An effective matheuristic for the capacitated total quantity discount problem

co-authored by Daniele Manerba and Renata Mansini has been accepted for publication in Computers & Operations Research. You can find the paper here

2013-07-21

A gold medal for OR@BRESCIA

Quality of research 2004-2010

OR@BRESCIA, the Operational Research Group at the University of Brescia (which includes the OR@DII group), has been ranked FIRST among all the small-medium size Italian universities for quality and number of scientific publications in the period 2004-2010. Here is the report.

2013-06-30

New EJOR publication

CTQDP

We are glad to announce that the paper

An exact algorithm for the capacitated total quantity discount problem

co-authored by Daniele Manerba and Renata Mansini has been accepted for publication in European Journal of Operational Research. You can find the paper here

2012-04-20