METHODOLOGIC CONDITIONING OF TRANSPORT OPTIMIZATION

Transkrypt

1 Joural of KONES Powertrai ad Trasport, Vol.14, METHODOLOGIC CONDITIONING OF TRANSPORT OPTIMIZATION Adrze Marczuk Akademia Rolicza w Lubliie Katedra Maszy i Urzdze Roliczych Gboka 28, Lubli, Polska tel.: , fax: e-meil: adrze.marczuk@ar.lubli.pl Abstract Departmet of Agricultural Machies ad Devices has coducted studies upo the improvemet of trasport orgaizatio i agriculture ad foodstuff idustry for may years. Computer systems for optimizatio of trasportig meas for agricultural goods were worked out assumig that the amout ad structure of trasportig meas is well kow. To solve the complex problem, the aalysis of stuff adherece to loadig works, loadig issues, optimum utilizatio of trasportig mea ad selectio of trasportig meas for a give task should be performed. The paper presets the method for selectio the umber ad type of trasportig meas to realize a give trasport task. The method was verified for ay umber of trasportig meas ad ay umber of receivig poits. It required describig ad programmig the database o trasportig meas as well as receivig poits. Curret software versio s limitatio is cosiderig at the most 4 differet trasportig mea types. The database gives a opportuity of easy ad fast chagig or modifyig data usig professioal programmig tools. The access to data processed is through properly defied iterface. As a effect, software lists a umber of all combiatios of type ad umber of trasportig meas that esure completig the desired task. The system also gives a simple opportuity to defie reserves of trasportig power aimig at guarateeig the trasport task i a emergecy. Keywords: trasport, agriculture, optimizatio of trasport, selectio of trasportig meas UWARUNKOWANIA METODYCZNE OPTYMALIZACJI PRZEWOZÓW Streszczeie W Katedrze Maszy i Urzdze Roliczych Akademii Rolicze w Lubliie od wielu lat prowadzoe s prace, których celem est poprawieie orgaizaci pracy przewozów realizowaych w rolictwie i przemyle rolospoywczym. Opracowao komputerowe systemy optymalizaci pracy rodków trasportu przemieszczacych róe pody role, zakadac, e zaa est ilo i struktura taboru uywaego do realizaci procesu przewozowego. Chcc rozwiza kompleksowo problem przemieszczaia aduków w rolictwie, aley przeprowadzi aaliz przydziau pracowików do prac adukowych, rozwiza zagadieie zaaduku - optymalego wykorzystaia adowoci rodka trasportu i dokoa doboru rodków, które ma by uyte do wykoaia zadaia przewozowego. W artykule przedstawioo metod doboru liczby i typów rodków trasportu do realizaci okreloego zadaia przewozowego. Metod opracowao dla dowole liczby typów rodków trasportu oraz dowole liczby puktów odbioru masy towarowe. Realizaca e wymagaa opisaia i oprogramowaia bazy daych o rodkach trasportu oraz puktach odbioru masy towarowe. Ograiczeiem obece wersi programu est rozpatrywaie w rozwizaiu docelowym awye 4 róych typów rodków trasportu. Opracowaa baza dae moliwo atwe i szybkie zmiay bd modyfikaci daych z wykorzystaiem profesoalych arzdzi programistyczych. Dostp do przetwarzaych daych odbywa si poprzez odpowiedio zdefiioway iterfes programu. W efekcie program okrela liczb wszystkich kombiaci typów i liczby rodków trasportu, które zapewia wykoaie plaowaego zadaia trasportowego. W systemie przewidziao prost moliwo okrelaia rezerw mocy przewozowe mace a celu zabezpieczeie wykoaia przewozów w przypadkach awaryych. Sowa kluczowe: trasport, rolictwo, optymalizaca trasportu, wybór rodków trasportu

2 A. Marczuk 1. Itroductio A complex itroductio of techical progress i agriculture plays a importat role at every stage of productio process. The icrease of weight of trasported agricultural products makes a eed to improve the trasport orgaizatio o a base of comprehesive studies upo the coditios the trasportig meas would be utilized. Therefore, the farm caot be equipped oly i oe type of trasportig meas. It should have trasportig sets meetig both properties of trasported goods ad cooperatio with machies for sowig, harvestig, etc. Departmet of Agricultural Machies ad Devices has coducted studies upo the improvemet of trasport orgaizatio i agriculture ad foodstuff idustry for may years. Computer systems for optimizatio of trasportig meas for agricultural goods were worked out assumig that the amout ad structure of trasportig meas is well kow. To solve the complex problem, the aalysis of stuff assigmet to loadig works, loadig issues, optimum utilizatio of trasportig mea ad selectio of trasportig meas for a give task should be performed. 2. Grouds for the issue udertakig A literature refereces give detailed ad precise methods to solve well defied trasportig tasks, i which delivery ad receivig poits as well as trasportig meas are well kow. Most of these methods are liear programmig that ot always are possible to direct use i a case of makig trasportig tasks ad defiig the schedule for trasportig mea work. There is a lack of methods that would solve ot-fully defied trasportig issues, e.g. where umber ad types of trasportig meas to use is ukow. Such kid of problems are ecoutered whe plaig the trasportig task that has ever bee realized or i a case of moderizatio of trasport park at a give compay. Such situatio forced to udertake the attempts to work out ad verify a geeralized method for iitial selectig the type ad umber of trasportig meas to realize ay trasport task. A set of solutios permissible i the method must be subsequetly subected to optimizatio calculatios accordig to a appropriate model of trasport task [2]. The paper is aimed at creatig the computer system for evaluatig the umber ad type of trasportig meas to realize a give trasport task. Buildig such system required to work out the algorithm for trasportig meas selectio ad the programmig it i Delphi laguage. Correctess of the software was verified usig real example. 3. Optimizatio of loadig process Assigmet task It is a matrix give: c = (c i )m, c i - usefuless of i-th worker to -th work. Followig matrix should be defied x * = (x * i)m, such that: where: m i1 1 * i i x m * f ( x ) c x max c x, (1) i1 1 i i x : m xi 1, 1, 1 xi x 1, i 1, m i 0, 1 1 i, (2) 300

3 ad: Methodologic Coditioig of Trasport Optimizatio 1 whe i-th worker is assiged to -th work, 0 i other cases. 1 x, i (3) 0 Thus, the task cosists i defiig such assigmet of workers to works i order to their total usefuless was maximum. Loadig task There are give: umber of loadig types, a weight of -th load 1,, c value of -th load 1,, b capacity of trasportig mea. t exceedig the capacity, trasportig mea should be loaded i such a way i order to weight of the load was maximum. It ca be writte as follows by defiig: such that: x * = (x * 1, x * 2,..., x * ) E, (4) 1 x * * f ( x ) c x max c x, (5) 1 where: x E : a x b, x 0,1, (6) 1 1 whe -th load is loaded, 0 whe -th load is ot loaded. Other versio ca be achieved whe: a - weight of the uit of -th load type, c - value of the uit of -th load type, x - umber of loaded uits of -th load type, x R [1]. 1 x, (7) 0 4. Algorithm for trasportig meas selectio Algorithm describig the procedure aimig at selectig the umber ad type of trasportig meas is preseted i Figure 1. It was accepted: lst umber of available trasportig mea types, vst[1..lst] capacity of trasportig mea [kg]. 301

4 A. Marczuk START Workig out the database o trasportig meas Workig out the database o supply ad demad rodtra Database will cotai data o trasportig meas - capacity; lst - umber of available trasportig meas; vst [1:lst] - table with capacity of trasportig meas [kg] Database will cotai data o supply ad demad poits; lpo - umber of suppliers; ppo[1:lpo] - table with weight demad from suppliers [kg] Settig permissible variats of umber ad types of trasportig meas For i=1 to lst Checkig if a give variat should be cosidered Readig-i ad cotrol over the correctess of data o trasportig meas capacity - vst[i] Receiver's eeds for trasportig goods For i=1 to lpo Readig-i ad cotrol o data correctess - ppo[i] smt = 0 Total trasportig possibility of selected trasportig meas [kg] For i = 1 to lst do st[i] = 1; smt = smt+st[i]*vst[i] Estimatio of possibilities of trasportig meas szd = 0 Total eeds of product's suppliers [kg] For i=1 to lpo szd =szd+ppo[i] For i=1 to lst rob = szd/vst[i] i= et(rob) st[i] = i Estimatio of miimum umber of trasportig meas of oe type Page 2 Rys.1. Schemat blokowy algorytmu doboru rodków trasportowych Fig. 1. Scheme of the algorithm for trasportig meas selectio 302

5 Methodologic Coditioig of Trasport Optimizatio Page 2 E1 i1 := 1 to lst -3 Ed k1 := st[i1] E2 i2 := i1+1 to lst -2 E1 k2 := st[i2] E3 i3 := i2+1 to lst -1 E2 k3 := st[i3] i4 := i3+1 to lst E3 k4 := st[i4] PROC J Procedure calculates ad writes all possible solutios referrig to umber ad types of trasportig meas Kotyuaca Rys.1 Cotiuatio of Fig. 1 lpo umber of receivig poits, ppo[1..lpo] receiver s demad for trasported goods [kg], i, i1, i2, i3, i4, k1, k2, k3, k4, 1, 2, 3, 4 work idices for programmig the loop defiig the selectio of trasportig mea, st[1..lst] umber of oe type trasportig meas that esure makig the trasport task, smt idirect variable total capacity of cosidered trasportig meas [kg], szd idirect variable total demad of receivig poits [tos]. rob, r1, r2, r3, r4 work variables used to complete the loop for trasportig mea umber i case whe additio of the followig mea is ot profitable, DopNap program for achievig permissible solutios, Ep1, Ep2, Ep3, E1, E2, E3 etiquettes, specific program s fragmets. rodtra checkig if aalyzed set of trasportig meas is able to make the trasport task. Proc J procedure of rememberig the permissible solutio. The program worked out cotais 20 procedures that are goig to be described i other publicatios. 303

6 A. Marczuk PROC J 1 :=0 Ep1 r1 := 1 *vst [i1] 1 := 1+1 r 1 >DopNap*szd 1<=k1 2 :=0 Ep1 Ep2 r2:= 2 * vst [i2] r2:=r2 + r1 2 := 2+1 r 2 >DopNapP*szd 2<=k2 3 :=0 Ep2 Ep3 r3:= 3 * vst [i3] r3:=r3 + r2 3 := 3+1 r 3 >DopNap*szd 3<=k3 4:=0 Ep3 r4:= 4 * vst [i4] r4:=r4 + r3 r4 >=1,0 *szd ad r4 <= 1,05*szd Procedure of rememberig the permissible solutio J4 <=k4 Ed Kotyuaca Rys.1 Cotiuatio of Fig

7 5. Verificatio of the system Methodologic Coditioig of Trasport Optimizatio Prior to system programmig, a database o trasportig meas ad receivig poits was worked out. The system was writte i Delphi laguage ad software was amed Trasport. Applicatio of evet programmig is ecessary for applicatios withi Widows eviromet programmig of evets that may occur durig applicatio performace. Those evets may be geerated by the system (activatio of applicatio widow, applicatio error, dividig by zero) or by user (pushig a key). Mai program is costatly ready to catch evets ad to idetify them. A specific evet ivokes the procedure for its operatig (etered by user or geerated by compiler), which allows for goig to various braches ad loops of program executio [3, 4]. The iitial fragmet of source code for software Trasport writte i Delphi laguage is preseted i Figure 2. Rys. 2. Fragmet kodu programu Trasport w rodowisku Delphi Fig. 2. Fragmet of source code for program Trasport writte i Delphi laguage Figure 3 presets resultig form illustratig the widow for maagemet of trasportig meas selectio alog with result table. Aalysis of the resultig form reveals that 10 suppliers had kg of goods trasported. To realize the trasport task, four of five trasportig meas ca be used; their total capacity is give i widow adowo poszczególych rodków trasportu. There are all possible combiatios of utilizatio of available trasportig meas preseted i lower part of the form. Vehicles selected to realize the trasport task are take ito accout i optimizatio calculatios i accordace to particular purpose fuctio. 305

8 A. Marczuk Rys. 3. Oko zarzdzaia wyborem rodków trasportu Fig. 3. Widow for trasportig meas selectio maagemet 6. Summary ad coclusios The study cosisted i workig out ad programmig the method for selectig the trasportig meas to trasport agricultural products. The method was worked out for ay type ad ay umber of trasportig meas as well as ay umber of receivig poits. Preseted algorithm describig the procedure aimed at makig a selectio of umber ad type of trasportig meas. The method realizatio required to describe ad program the database o trasportig meas as well as receivig poits. Cosiderig at most four differet types of trasportig meas is the oly limitatio of the solutio. The database gives a opportuity of easy ad fast chagig or modifyig data usig professioal programmig tools. The access to data processed is through properly defied iterface. As a effect, software lists a umber of all combiatios of type ad umber of trasportig meas that esure completig the desired task. The system also gives a simple opportuity to defie reserves of trasportig power aimig at guarateeig the trasport task i a emergecy. The method ad software allows for drawig followig coclusios: 1. It is versatile ad makes possible to solve ay large trasport task. 2. It may be used to solve ay trasportig task; it is oly importat to defie types ad parameters of trasportig meas as well as receivig etwork. 306

9 Methodologic Coditioig of Trasport Optimizatio 8. Refereces 1. Chudy, M., Wybrae metody optymalizaci, Dom Wydawiczy Belloa, Warszawa, Dorosiewicz, S., Modelowaie sieci trasportowych, Wydawictwa Szkoy Gówe Hadlowe, Gryko, J., Wykady z Delphi, Tczew, Reisdorph, K., Delphi 4 dla kadego, Wydawictwo Helio,

10