Petak, 09. jun 2006. u 14h, sala 718 MF BG:

(zajednicki sastanak sa Odeljenjem za mehaniku)
STRATEGIJA RAZVOJA OSNOVNIH ISTRZIVANJA

Sadr^Þaj: Prof. Stevan Pilipovi? ?e izlo^Þiti probleme u vrednovanju nau?nih rezultata kao i svoje vidjenje budu?eg vrednovanja istra^Þiva?a i projekata.

Petak, 16. jun 2006. u 14h, sala 2 MI SANU:

Nema sastanka

Petak, 23. jun 2006. u 14h, sala 2 MI SANU:


Nema sastanka

Petak, 30. jun 2006. u 14h, sala 2, MI SANU BGD:

Guido Perboli, Department of Control and Computer Engineering Politecnico di Torino
EXTREME-POINT-BASED HEURISTICS FOR THREE-DIMENSIONAL PACKING PROBLEMS

Abstract: Given a set of items and a set of containers, packing problems are concerned with the loading of the items into the containers, according to some packing rules, in order to optimize a performance measure. Under this broad definition, we find a wide set of academic and real-life problems from the knapsack problem to the cargo loading and multi-dimensional bin packing problems with special balancing constraints. In particular, given a set of parallelepiped items $i\in I$ with sizes $w_{i}$, $l_{i}$, and $h_{i}$ and an unlimited number of containers of fixed sizes $W$, $L$, and $H$ called bins, the Three-Dimensional Bin Packing (3D-BP) problem consists in orthogonally packing, without overlapping and rotation, all the items into the minimum number of bins. The aim of this paper is twofold. First, a new rule for packing items inside a container, called the Extreme Point (EP) rule, is presented. The Extreme Point rule is independent from the particular packing problem that is addressed. Second, new heuristics that use the EP rule to efficiently solve the 3D-BP problem are given.

Ako zelite da se obavestenja o Vasim naucnim skupovima pojave u Newsletter of EMS (European Mathematical Society) i na Internetu na lokaciji EMS, onda se obratite na emsvesti@mi.sanu.ac.yu gde cete dobiti format obavestenja.