[Solomonov Seminar] 37. in 38. Solomonov seminar
Marko Grobelnik
marko.grobelnik@ijs.si
Sun, 11 Mar 2001 20:49:33 +0100
Vabim vas na 37. in 38. Solomonov seminar, ki bosta
v torek (13.3.2001) ob 13h v sejni sobi IJS in
v sredo (14.2.2001) ob 13h v veliki predavalnici IJS.
Prvi seminar (v torek) bo imel Andrej Orel iz Maranda, ki bo
predstavil pojem virtualnega podjetja: kaj je to, kako so
organizirana, kako delujejo, ipd.
Drugi seminar (v sredo) bo imel nas gost, profesor iz Japonske,
Toshihiko Ono na temo resevanja problemov 2D razrezov z
genetskimi algoritmi.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Andrej Orel:
Resnicnost navideznih podjetij
Zasnov navideznih podjetij je skoraj toliko kot njihovih tvorcev, zato zanje obstaja tudi
vecje stevilo definicij. Ena izmed zelo preciznih in hkrati vseobsegajocih pravi, da je
navidezno podjetje zacasni konzorcij podjetij, ki zdruzujejo sredstva in vire ter so
medsebojno povezana z racunalniskimi omrezji, zaradi boljsega odziva poslovnim
priloznostim. V tej definiciji se skriva njihova spretnost; gibcnost, zivahnost, delavnost
ali s skupnim tujim izrazom - agilnost. Ko je poslovna priloznost mimo oziroma je delo
opravljeno se navidezno podjetje razpusti, ceprav njihovi clani obstajajo tudi v bodoce in
bodo verjetno sodelovali v drugih dinamicnih zdruzbah. Ko se poslovna priloznost pojavi,
je potrebno izredno hitro nacrtovati naslednje korake. V vecini primerov se elementi
nove zdruzbe povezejo okoli tvorca navideznega podjetja, obstajajo pa tudi nacini, kjer
vloga tvorca dinamicna in v casu priprave in zivljenja navideznega podjetja prehaja med
clani. Za neproblematicno delovanje navideznega podjetja je potrebno dolociti sticne
tocke in medsebojne odnose, ki pokrivajo naloge, vloge, financne vidike in nenazadnje
probleme intelektualne lastnine.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Application of Genetic Algorithms to Two-Dimensional Cutting
Professor Toshihiko Ono
Department of Computer Science and Engineering
Fukuoka Institute of Technology
Fukuoka, Japan
Abstract - We have been studying application of genetic algorithms
to various applications. Taking this opportunity, I would like to
introduce one of them, the application of genetic algorithms to
two-dimensional cutting. My talk includes the following two topics.
The first topic is the application to optimal cutting of free
pattern. The object of the study is to investigate the method to
arrange various shape of parts on a sheet so that the required sheet
becomes minimal. There is no restriction to the shape of the parts.
The method can be used in the clothing process and also in the sheet
metal cutting process.
The second topic is how to cut various size of rectangular parts
from a sheet by the Guillotine cutting so that the minimum amount of
waste is achieved. The condition of being able to do Guillotine
cutting gives a constraint to the arrangement of parts on the sheet.
By expressing the layout of the parts on a sheet by using two
operators and applying the genetic algorithms, we have succeeded to
resolve the problem.
To the above problems, the genetic algorithms in collaboration
with part arrangement algorithms specially designed for each
application are used.