Modifications of the variable neighborhood search method and their applications to solving the file transfer scheduling problem

Metoda promenljivih okolina se u praksi pokazala vrlo uspesnom za resavanje pro- blema diskretne i kontinualne optimizacije. Glavna ideja ove metode je sistematska promena okolina unutar prostora resenja u potrazi za boljim resenjem. Za opti- mizaciju funkcija vise promenljivih koriste se metode koje nalaze lokalni minimum polazeci od zadate pocetne tacke. U slucaju kada kontinualna funkcija ima mnostvo lokalnih minimuma, nalazenje globalnog minimuma obicno nije lak zadatak jer najcesce dostignuti lokalni minimumi nisu optimalni. Kod uobicajenih implementa- cija sa ogranicenim okolinama razlicitih dijametara iz proizvoljne tacke nije moguce dostici sve tacke prostora resenja. Zbog toga je strategija koriscenja konacnog broja ogranicenih okolina primenjiva na probleme kod kojih optimalno resenje pripada nekom unapred poznatom ogranicenom podskupu skupa IRn. U cilju prevazilazenja pomenutog ogranicenja predlozena je nova varijanta meto- de, Gausovska metoda promenljivih okolina. Umesto denisanja niza razlicitih okolina iz kojih ce se birati slucajna tacka, u ovoj metodi se sve okoline pokla- paju sa celim prostorom resenja, a slucajne tacke se generisu koriscenjem razlicitih slucajnih raspodela Gausovog tipa. Na ovaj nacin se i tacke na vecem rastojanju od tekuce tacke mogu teorijski dostici mada sa manjom verovatnocom. U osnovnoj verziji metode promenljivih okolina neophodno je unapred denisati sistem okolina, njihov ukupan broj i velicinu, kao i tip raspodele koja ce se koristiti za odabir slucajne tacke unutar tih okolina. Gausovska metoda promenljivih okolina za razliku od osnovne verzije ima manje parametara jer su sve okoline teorijski iste velicine (jednake celom prostoru pretrage) i imaju jedinstvenu jednoparametarsku familiju raspodela Gausovu raspodelu slucajnih brojeva sa promenljivom dispe- rzijom. Problem raspored-ivanja prenosa datoteka (File transfer scheduling problem - FTSP) je optimizacioni problem koji svoju primenu pronalazi u mnogim oblastima poput telekomunikacijama, LAN i WAN mrezama, raspored-ivanju u okviru MIMD (multiple instruction multiple data) racunarskih sistema i dr. Spada u klasu NP teskih problema za cije resavanje se uobicajeno koriste heuristicke metode. Za- datak optimizacije FTSP sastoji se u trazenju odgovarajuceg rasporeda pojedinacnih prenosa datoteka, tj. vremenskih trenutaka kada ce svaka datoteka zapoceti svoj prenos tako da duzina vremenskog intervala od trenutka kada prva datoteka zapocne prenos do trenutka u kom poslednja zavrsi bude sto manja...The Variable neighborhood search method proved to be very successful for solving discrete and continuous optimization problems. The basic idea is a systematic change of neighborhood structures in search for the better solution. For optimiza- tion of multiple variable functions, methods for obtaining the local minimum starting from certain initial point are used. In case when the continuous function has many local minima, nding the global minimum is usually not an easy task since the obta- ined local minima in most cases are not optimal. In typical implementations with bounded neighborhoods of various diameters it is not possible, from arbitrary point, to reach all points in solution space. Consequently, the strategy of using the nite number of neighborhoods is suitable for problems with solutions belonging to some known bounded subset of IRn. In order to overcome the previously mentioned limitation the new variant of the method is proposed, Gaussian Variable neighborhood search method. Instead of dening the sequence of dierent neighborhoods from which the random point will be chosen, all neighborhoods coincide with the whole solution space, but with die- rent probability distributions of Gaussian type. With this approach, from arbitrary point another more distant point is theoretically reachable, although with smaller probability. In basic version of Variable neighborhood search method one must dene in advance the neighborhood structure system, their number and size, as well as the type of random distribution to be used for obtaining the random point from it. Gaussian Variable neighborhood search method has less parameters since all the neighborhoods are theoretically the same (equal to the solution space), and uses only one distribution family - Gaussian multivariate distribution with variable dispersion. File transfer scheduling problem (FTSP) is an optimization problem widely appli- cable to many areas such as Wide Area computer Networks (WAN), Local Area Ne- tworks (LAN), telecommunications, multiprocessor scheduling in a MIMD machines, task assignments in companies, etc. As it belongs to the NP-hard class of problems, heuristic methods are usually used for solving this kind of problems. The problem is to minimize the overall time needed to transfer all les to their destinations for a given collection of various sized les in a computer network, i.e. to nd the le transfer schedule with minimal length..

Modifications of the variable neighborhood search method and their applications to solving the file transfer scheduling problem

Metoda promenljivih okolina se u praksi pokazala vrlo uspesnom za resavanje pro- blema diskretne i kontinualne optimizacije. Glavna ideja ove metode je sistematska promena okolina unutar prostora resenja u potrazi za boljim resenjem. Za opti- mizaciju funkcija vise promenljivih koriste se metode koje nalaze lokalni minimum polazeci od zadate pocetne tacke. U slucaju kada kontinualna funkcija ima mnostvo lokalnih minimuma, nalazenje globalnog minimuma obicno nije lak zadatak jer najcesce dostignuti lokalni minimumi nisu optimalni. Kod uobicajenih implementa- cija sa ogranicenim okolinama razlicitih dijametara iz proizvoljne tacke nije moguce dostici sve tacke prostora resenja. Zbog toga je strategija koriscenja konacnog broja ogranicenih okolina primenjiva na probleme kod kojih optimalno resenje pripada nekom unapred poznatom ogranicenom podskupu skupa IRn. U cilju prevazilazenja pomenutog ogranicenja predlozena je nova varijanta meto- de, Gausovska metoda promenljivih okolina. Umesto denisanja niza razlicitih okolina iz kojih ce se birati slucajna tacka, u ovoj metodi se sve okoline pokla- paju sa celim prostorom resenja, a slucajne tacke se generisu koriscenjem razlicitih slucajnih raspodela Gausovog tipa. Na ovaj nacin se i tacke na vecem rastojanju od tekuce tacke mogu teorijski dostici mada sa manjom verovatnocom. U osnovnoj verziji metode promenljivih okolina neophodno je unapred denisati sistem okolina, njihov ukupan broj i velicinu, kao i tip raspodele koja ce se koristiti za odabir slucajne tacke unutar tih okolina. Gausovska metoda promenljivih okolina za razliku od osnovne verzije ima manje parametara jer su sve okoline teorijski iste velicine (jednake celom prostoru pretrage) i imaju jedinstvenu jednoparametarsku familiju raspodela Gausovu raspodelu slucajnih brojeva sa promenljivom dispe- rzijom. Problem raspored-ivanja prenosa datoteka (File transfer scheduling problem - FTSP) je optimizacioni problem koji svoju primenu pronalazi u mnogim oblastima poput telekomunikacijama, LAN i WAN mrezama, raspored-ivanju u okviru MIMD (multiple instruction multiple data) racunarskih sistema i dr. Spada u klasu NP teskih problema za cije resavanje se uobicajeno koriste heuristicke metode. Za- datak optimizacije FTSP sastoji se u trazenju odgovarajuceg rasporeda pojedinacnih prenosa datoteka, tj. vremenskih trenutaka kada ce svaka datoteka zapoceti svoj prenos tako da duzina vremenskog intervala od trenutka kada prva datoteka zapocne prenos do trenutka u kom poslednja zavrsi bude sto manja...The Variable neighborhood search method proved to be very successful for solving discrete and continuous optimization problems. The basic idea is a systematic change of neighborhood structures in search for the better solution. For optimiza- tion of multiple variable functions, methods for obtaining the local minimum starting from certain initial point are used. In case when the continuous function has many local minima, nding the global minimum is usually not an easy task since the obta- ined local minima in most cases are not optimal. In typical implementations with bounded neighborhoods of various diameters it is not possible, from arbitrary point, to reach all points in solution space. Consequently, the strategy of using the nite number of neighborhoods is suitable for problems with solutions belonging to some known bounded subset of IRn. In order to overcome the previously mentioned limitation the new variant of the method is proposed, Gaussian Variable neighborhood search method. Instead of dening the sequence of dierent neighborhoods from which the random point will be chosen, all neighborhoods coincide with the whole solution space, but with die- rent probability distributions of Gaussian type. With this approach, from arbitrary point another more distant point is theoretically reachable, although with smaller probability. In basic version of Variable neighborhood search method one must dene in advance the neighborhood structure system, their number and size, as well as the type of random distribution to be used for obtaining the random point from it. Gaussian Variable neighborhood search method has less parameters since all the neighborhoods are theoretically the same (equal to the solution space), and uses only one distribution family - Gaussian multivariate distribution with variable dispersion. File transfer scheduling problem (FTSP) is an optimization problem widely appli- cable to many areas such as Wide Area computer Networks (WAN), Local Area Ne- tworks (LAN), telecommunications, multiprocessor scheduling in a MIMD machines, task assignments in companies, etc. As it belongs to the NP-hard class of problems, heuristic methods are usually used for solving this kind of problems. The problem is to minimize the overall time needed to transfer all les to their destinations for a given collection of various sized les in a computer network, i.e. to nd the le transfer schedule with minimal length..

Modifications of the variable neighborhood search method and their applications to solving the file transfer scheduling problem

Metoda promenljivih okolina se u praksi pokazala vrlo uspesnom za resavanje pro- blema diskretne i kontinualne optimizacije. Glavna ideja ove metode je sistematska promena okolina unutar prostora resenja u potrazi za boljim resenjem. Za opti- mizaciju funkcija vise promenljivih koriste se metode koje nalaze lokalni minimum polazeci od zadate pocetne tacke. U slucaju kada kontinualna funkcija ima mnostvo lokalnih minimuma, nalazenje globalnog minimuma obicno nije lak zadatak jer najcesce dostignuti lokalni minimumi nisu optimalni. Kod uobicajenih implementa- cija sa ogranicenim okolinama razlicitih dijametara iz proizvoljne tacke nije moguce dostici sve tacke prostora resenja. Zbog toga je strategija koriscenja konacnog broja ogranicenih okolina primenjiva na probleme kod kojih optimalno resenje pripada nekom unapred poznatom ogranicenom podskupu skupa IRn. U cilju prevazilazenja pomenutog ogranicenja predlozena je nova varijanta meto- de, Gausovska metoda promenljivih okolina. Umesto denisanja niza razlicitih okolina iz kojih ce se birati slucajna tacka, u ovoj metodi se sve okoline pokla- paju sa celim prostorom resenja, a slucajne tacke se generisu koriscenjem razlicitih slucajnih raspodela Gausovog tipa. Na ovaj nacin se i tacke na vecem rastojanju od tekuce tacke mogu teorijski dostici mada sa manjom verovatnocom. U osnovnoj verziji metode promenljivih okolina neophodno je unapred denisati sistem okolina, njihov ukupan broj i velicinu, kao i tip raspodele koja ce se koristiti za odabir slucajne tacke unutar tih okolina. Gausovska metoda promenljivih okolina za razliku od osnovne verzije ima manje parametara jer su sve okoline teorijski iste velicine (jednake celom prostoru pretrage) i imaju jedinstvenu jednoparametarsku familiju raspodela Gausovu raspodelu slucajnih brojeva sa promenljivom dispe- rzijom. Problem raspored-ivanja prenosa datoteka (File transfer scheduling problem - FTSP) je optimizacioni problem koji svoju primenu pronalazi u mnogim oblastima poput telekomunikacijama, LAN i WAN mrezama, raspored-ivanju u okviru MIMD (multiple instruction multiple data) racunarskih sistema i dr. Spada u klasu NP teskih problema za cije resavanje se uobicajeno koriste heuristicke metode. Za- datak optimizacije FTSP sastoji se u trazenju odgovarajuceg rasporeda pojedinacnih prenosa datoteka, tj. vremenskih trenutaka kada ce svaka datoteka zapoceti svoj prenos tako da duzina vremenskog intervala od trenutka kada prva datoteka zapocne prenos do trenutka u kom poslednja zavrsi bude sto manja...The Variable neighborhood search method proved to be very successful for solving discrete and continuous optimization problems. The basic idea is a systematic change of neighborhood structures in search for the better solution. For optimiza- tion of multiple variable functions, methods for obtaining the local minimum starting from certain initial point are used. In case when the continuous function has many local minima, nding the global minimum is usually not an easy task since the obta- ined local minima in most cases are not optimal. In typical implementations with bounded neighborhoods of various diameters it is not possible, from arbitrary point, to reach all points in solution space. Consequently, the strategy of using the nite number of neighborhoods is suitable for problems with solutions belonging to some known bounded subset of IRn. In order to overcome the previously mentioned limitation the new variant of the method is proposed, Gaussian Variable neighborhood search method. Instead of dening the sequence of dierent neighborhoods from which the random point will be chosen, all neighborhoods coincide with the whole solution space, but with die- rent probability distributions of Gaussian type. With this approach, from arbitrary point another more distant point is theoretically reachable, although with smaller probability. In basic version of Variable neighborhood search method one must dene in advance the neighborhood structure system, their number and size, as well as the type of random distribution to be used for obtaining the random point from it. Gaussian Variable neighborhood search method has less parameters since all the neighborhoods are theoretically the same (equal to the solution space), and uses only one distribution family - Gaussian multivariate distribution with variable dispersion. File transfer scheduling problem (FTSP) is an optimization problem widely appli- cable to many areas such as Wide Area computer Networks (WAN), Local Area Ne- tworks (LAN), telecommunications, multiprocessor scheduling in a MIMD machines, task assignments in companies, etc. As it belongs to the NP-hard class of problems, heuristic methods are usually used for solving this kind of problems. The problem is to minimize the overall time needed to transfer all les to their destinations for a given collection of various sized les in a computer network, i.e. to nd the le transfer schedule with minimal length..

Determination of the protective properties of electrodeposited organic epoxy coatings on aluminium and modified aluminium surfaces

The electrochemical and transport properties and thermal stability of epoxy coatings electrodeposited on aluminium and modified aluminium surfaces (anodized, phosphatized and chromatized-phosphatized aluminium) have been investigated during exposure to 3% NaCl solution. From the results obtained from electrochemical impedance spectroscopy (EIS), gravimetric liquid sorption experiment and thermogravimetric analysis (TGA) it can be concluded that electrochemical and transport properties of epoxy coatings on anodized and chromatized-phosphatized aluminium are significantly improved with respect to the same epoxy coatings on aluminium and phosphatized aluminium: higher values of pore resistance and charge-transfer resistance and lower values of coating capacitance and double-layer capacitance, from EIS; smaller values of diffusion coefficient of water through epoxy coating, from sorption measurements and smaller amount of absorbed water inside the coating, from TGA. On the other hand, the somewhat lower thermal stability of these coatings was obtained

Corrosion behaviour of epoxy coatings on modified aluminium surfaces

The electrochemical and transport properties and thermal stability of epoxy coatings electrodeposited on aluminium and modified aluminium surfaces (anodized phosphatized and chromatized-phosphatized aluminium) have been investigated in 3% NaCl solution by electrochemical impedance spectroscopy (EIS) gravimetric liquid sorption experiment and thermogravimetric analysis (TGA). Higher values of pore resistance and charge-transfer resistance and lower values of coating capacitance and double layer capacitance were observed for epoxy coatings on anodized and chromatized and phosphatized aluminium. Smaller values of diffusion coefficient of water through epoxy coating from sorption measurements and smaller amount of absorbed water inside the coatings from TGA were obtained for coatings on anodized and chromatized-phosphatized aluminium. On the other hand the somewhat lower thermal stability of these coatings was obtained

The study of corrosion stability of organic epoxy protective coatings on aluminium and modified aluminium surfaces

Epoxy coatings were formed by cathodic electrodeposition of an epoxy resin on aluminium and modified aluminium surfaces (phosphatized, chromatized-phosphatized and anodized aluminium) using a constant voltage method (resin concentration 10 wt.%, temperature 27 degrees C, applied voltage 250 V). The corrosion behavior of these coatings was investigated during exposure to 3% NaCl using electrochemical impedance spectroscopy (EIS) and polarization measurements. From the dependence of resistance, capacitance and relative permittivity of the coating, obtained from EIS, on the rate of hydrogen evolution reaction in the electrodeposition bath, obtained from polarization curves, it can be observed that the epoxy coating on aluminium and modified aluminium surfaces is a good barrier against the transport of corrosive agents. The time corresponding to contact between electrolyte and aluminium surface under the coating is greater in the case of surface modification by chromato-phosphatized and anodized aluminium than in the case of phosphatize one

Epoksidne kataforetske prevlake na aluminijumu i modifikovanim površinama aluminijuma

The corrosion behaviour and thermal stability of epoxy coatings electrodeposited on modified aluminum surfaces (anodized, phosphatized and chromatized-phosphatized aluminium) were monitored during exposure to 3% NaCl solution, using electrochemical impedance spectroscopy (EIS) and thermogravimetric analysis (TGA). Better protective properties of the epoxy coatings on anodized and chromatized-phosphatized aluminum with respect to the same epoxy coatings on aluminum and phosphatized aluminum were obtained: higher values of Rp and Rct and smaller values of Cc and Cd, from EIS, and a smaller amount of absorbed water inside the coating, from TGA. On the other hand, a somewhat lower thermal stability of these coatings was obtained (smaller values of the ipdt temperature). This behavior can be explained by the less porous structure of epoxy coatings on anodized and chromatized-phosphatized aluminum, caused by a lower rate of H2 evolution and better wet ability.Postupkom kataforetskog taloženja dobijene su epoksidne zaštitne prevlake na aluminijumu i modifikovanim površinama aluminijuma (anodizirani aluminijum fosfatirani i hromatno-fosfatirani aluminijum). Za ispitivanje zaštitnih osobina ovako dobijenih epoksidnih prevlaka korišćena je spektroskopija elektrohemijske impedancije i termogravimetrijska analiza. Cilj ovog rada je bio da se objasni uticaj modifikacije supstrata na elektrohemijske karakteristike i termičku stabilnost epoksidnih prevlaka taloženih na aluminijumu

The sorption characteristics of epoxy coatings electrodeposited on steel during exposure to different corrosive agents

Organic protective coatings on steel were formed by cathodic electrodeposition of an epoxy resin modified by an amine and isocyanate using a constant voltage method (resin concentration 10% wt, temperature 26 degrees C, applied voltage 250 V). The corrosion behaviour of these coatings was investigated during exposure to different corrosive agents (H2O, 3% NaCl, 3% Na2SO4, 3% sodium salt of 2-naphthol-3,6 disulphonic acid) using a.c. impedance measurements, gravimetric liquid sorption experiments and differential scanning calorimetry (DSC), with the aim of explaining the mechanism of coating degradation. The time required to saturate the coating with pure water, obtained from the sorption data, coincides with the initial increase in coating capacitance and initial decrease in pore resistance, obtained from a.c. impedance measurements, denoting the entry of electrolyte into the coating. The first step of electrolyte penetration through the coating is related to water uptake, when molecules of pure water diffuse in the micropores of polymer net according to Fick's law and it is independent of type and dimensions of ions in the electrolyte. Similar values of enthalpy of vaporization of different volatile electrolytes and the quantity of water inside the coating, obtained from DSC measurements were in agreement with the proposed mechanism. From the calculated diffusion coefficient for coatings where external layers were mechanically removed, it can be concluded that the micropores of the polymer net are homogeneously distributed throughout the coating