Assignment and Travelling Salesman Problems with Coefficients as LR Fuzzy Parameters
|
|
- Louisa James
- 6 years ago
- Views:
Transcription
1 Iteratioal Joural of Applied Sciece ad Egieerig., 3: 557 Assigmet ad Travellig Salesma Problems with Coefficiets as Fuzzy Parameters Amit Kumar ad Aila Gupta * School of Mathematics ad Computer Applicatios, Thapar Uiversity, Patiala, Idia Abstract: Mukherjee ad Basu (Applicatio of fuzzy rakig method for solvig assigmet problems with fuzzy costs, Iteratioal Joural of Computatioal ad Applied Mathematics, 5,, proposed a ew method for solvig fuzzy assigmet problems. I this paper, some fuzzy assigmet problems ad fuzzy travellig salesma problems are chose which caot be solved by usig the foremetioed method. Two ew methods are proposed for solvig such type of fuzzy assigmet problems ad fuzzy travellig salesma problems. The fuzzy assigmet problems ad fuzzy travellig salesma problems which ca be solved by usig the eistig method, ca also be solved by usig the proposed methods. But, there eist certai fuzzy assigmet problems ad fuzzy travellig salesma problems which ca be solved oly by usig the proposed methods. To illustrate the proposed methods, a fuzzy assigmet problem ad a fuzzy travellig salesma problem is solved. The proposed methods are easy to uderstad ad apply to fid optimal solutio of fuzzy assigmet problems ad fuzzy travellig salesma problems occurrig i real life situatios. Keywords: Fuzzy assigmet problem; fuzzy travellig salesma problem; Yager's rakig ide; fuzzy umber.. Itroductio The assigmet problem is a special type of liear programmig problem i which our objective is to assig umber of jobs to umber of persos at a miimum cost (time. The mathematical formulatio of the problem suggests that this is a programmig problem ad is highly degeerate. All the algorithms developed to fid optimal solutio of trasportatio problems are applicable to assigmet problem. However, due to its highly degeeracy ature, a specially desiged algorithm widely kow as Hugaria method proposed by Kuh [] is used for its solutio. Eamples of these types of problems are assigig me to offices, crew (drivers ad coductors to buses, trucks to delivery routes etc. Over the past 5 years, may variatios of the classical assigmet problem are proposed e.g. bottleeck assigmet problem, geeralized assigmet problem, quadratic assigmet problem etc. However, i real life situatios, the parameters of assigmet problem are imprecise umbers istead of fied real umbers because time/cost for doig a job by a facility (machie/perso might vary due to differet reasos. Zadeh [4] itroduced the cocept of fuzzy sets to deal with imprecisio ad vagueess i real life situatios. * Correspodig author; ailasigal@gmail.com Received 6 September Chaoyag Uiversity of Techology, ISSN 7794 Revised February Accepted 6 February It. J. Appl. Sci. Eg.,., 3 55
2 Amit Kumar ad Aila Gupta Sice the, sigificat advaces have bee made i developig umerous methodologies ad their applicatios to various decisio problems. Fuzzy assigmet problems have received great attetio i recet years [5, 8, 3, 8, ]. Travellig salesma problem is a wellkow NPhard problem i combiatorial optimizatio. I the ordiary form of travellig salesma problem, a map of cities is give to the salesma ad he has to visit all the cities oly oce ad retur to the startig poit to complete the tour i such a way that the legth of the tour is the shortest amog all possible tours for this map. The data cosists of weights assiged to the edges of a fiite complete graph ad the objective is to fid a cycle passig through all the vertices of the graph while havig the miimum total weight. There are differet approaches for solvig travellig salesma problem. Almost every ew approach for solvig egieerig ad optimizatio problems has bee tried o travellig salesma problem. May methods have bee developed for solvig travellig salesma problem. These methods cosist of heuristic methods ad populatio based optimizatio algorithms etc. Heuristic methods like cuttig plaes ad brach ad boud ca optimally solve oly small problems whereas the heuristic methods such as opt, 3opt, Markov chai, simulated aealig ad tabu search are good for large problems. Populatio based optimizatio algorithms are a kid of ature based optimizatio algorithms. The atural systems ad creatures which are workig ad developig i ature are oe of the iterestig ad valuable sources of ispiratio for desigig ad ivetig ew systems ad algorithms i differet fields of sciece ad techology. Particle Swarm Optimizatio, Neural Networks, Evolutioary Computatio, At Systems etc. are a few of the problem solvig techiques ispired from observig ature. Travellig salesma problems i crisp ad fuzzy eviromet have received great attetio i recet years [4, 6, 9, 4, 6, 7, 9, ]. With the use of fuzzy umbers, the computatioal efforts required to solve fuzzy assigmet problems ad fuzzy travellig salesma problem are cosiderably reduced [5]. Moreover, all types of crisp umbers, triagular fuzzy umbers ad trapezoidal fuzzy umbers ca be cosidered as particular cases of fuzzy umbers, thereby etedig the scope of use of fuzzy umbers. Mukherjee ad Basu [5] proposed a ew method for solvig fuzzy assigmet problems. I this paper, some fuzzy assigmet problems ad fuzzy travellig salesma problems are chose which caot be solved by usig the foremetioed method. Two ew methods are proposed for solvig such type of fuzzy assigmet problems ad fuzzy travellig salesma problems. The fuzzy assigmet problems ad fuzzy travellig salesma problems which ca be solved by usig the eistig method, ca also be solved by usig the proposed methods. But, there eist certai fuzzy assigmet problems ad fuzzy travellig salesma problems which ca be solved oly by usig the proposed methods. To illustrate the proposed methods, a fuzzy assigmet problem ad a fuzzy travellig salesma problem is solved. The proposed methods are easy to uderstad ad apply to fid optimal solutio of fuzzy assigmet problems ad fuzzy travellig salesma problems occurrig i real life situatios. This paper is orgaized as follows: I Sectio, basic defiitios ad Yager's rakig approach for the rakig of fuzzy umbers are discussed. I Sectio 3, formulatios of fuzzy assigmet problems ad fuzzy travellig salesma problems are preseted. I Sectio 4, limitatios of eistig method [5] are discussed. I Sectio 5, to overcome the limitatios discussed i Sectio 4, two ew methods are proposed to fid optimal solutio of fuzzy assigmet problems ad fuzzy travellig salesma 56 It. J. Appl. Sci. Eg.,., 3
3 Assigmet ad Travellig Salesma Problems with Coefficiets as Fuzzy Parameters problems. I Sectio 6, the advatages of proposed methods over eistig method are discussed ad illustrated by solvig two eamples. The results are discussed i Sectio 7 ad the coclusios are discussed i Sectio 8.]. Prelimiaries I this sectio, some basic defiitios ad Yager's rakig approach for the rakig of fuzzy umbers are preseted... Basic defiitios I this sectio, some basic defiitios are preseted. Defiitio. [7] A fuctio L :[, [,] (or R :[, [,] is said to be referece fuctio of fuzzy umber if ad oly if (i L ( L ( (or R ( R ( (ii L ( (or R ( (iii L (or R is oicreasig o [,. Defiitio. [7] A fuzzy umber A defied o the uiversal set of real umbers deoted as A (m,,,, is said to be a flat fuzzy umber if its membership fuctio A ( is give by: m L, A ( R, m,,.. Yager's rakig approach A umber of rakig approaches have bee proposed for comparig fuzzy umbers. I this paper, Yager's rakig approach [] is used for rakig of fuzzy umbers. This approach ivolves relatively simple computatioal ad is easily uderstadable. This approach ivolves a procedure for orderig fuzzy umbers i which a rakig ide ( A is calculated for a flat fuzzy umber A (m,,, from its A [m L (, R ( ] cut accordig to the followig formula: ( A ( ( m L ( d ( R ( d Let A ad B be two flat fuzzy umbers the (i A B if ( A ( B (ii (iii A B if ( A ( B A B if ( A ( B... Liearity property of Yager s rakig ide Let A (m ad B (m,,, be two flat fuzzy umbers ad k, k be two o egative real umbers. Usig Defiitio, the cut A ad B correspodig to A ad B are: A [ m L (, R m Defiitio 3. [7] Let A (m,,, be a flat fuzzy umber ad be a real umber i the iterval [,] the the crisp set A { X : A ( } [m L (, R ( ] ( ] ad B [ m L (, R ( ] Usig the property, ( A A ( A ( A, ( is set of real umbers, the cut (k A k B correspodig to k A k B is: is said to be cut of A. It. J. Appl. Sci. Eg.,., 3 57
4 Amit Kumar ad Aila Gupta k A k k m k m ( k k ( B [ L (, k k ( k k R ( ] Usig Sectio., the Yager's rakig ide ( k A k B correspodig to fuzzy umber k A k is: ( B ( B k A k k [ ( m L ( d ( R ( d k [ ( m L ( d ( R ( d] k ( A k ( B Similarly, it ca be proved that ( k A k B k ( A k ( B k k R 3. Liear programmig formulatios of fuzzy assigmet problems ad fuzzy travelig salesma problems I this sectio, liear programmig formulatios of fuzzy assigmet problems ad fuzzy travellig salesma problems are preseted [5]. 3.. Liear programmig formulatio of fuzzy assigmet problems Suppose there are jobs to be performed ad persos are available for doig these jobs. Assume that each perso ca do oe job at a time ad each job ca be assiged to oe perso oly. Let c be the fuzzy cost th i th (paymet if j job is assiged to perso. The problem is to fid a assigmet so that the total cost for performig all the jobs is miimum. The chose fuzzy assigmet problem may be formulated ito the followig fuzzy liear programmig problem (FLPP: Miimize subject i j to i j c j,, i,, or i, j P where, c is a trapezoidal fuzzy umber. i j c Total fuzzy cost : for performig all the jobs. ( 3.. Liear programmig formulatio of fuzzy travellig salesma problems Suppose a salesma has to visit cities. He starts from a particular city, visits each city oce ad the returs to the startig poit. th The fuzzy travellig costs from i city to th j city is give by c. The objective is to select the sequece (tour i which the cities are visited i such a way that the total travellig cost is miimum. The chose fuzzy travellig salesma problem may be formulated ito the followig FLPP: Miimize subject i j to i j c j,, ad j i ( i,, ad i j ( P i j (3 ji, i j k (4 ip jk p p ki p p3 p i ( 58 It. J. Appl. Sci. Eg.,., 3
5 Assigmet ad Travellig Salesma Problems with Coefficiets as Fuzzy Parameters, i p p, ( Optimal solutio of fuzzy travellig salesma problems where, c is a trapezoidal fuzzy umber. c : i j Total fuzzy travellig cost of completig the tour. if the salesma visits city j immediately after visitig city i ad otherwise. Costraits ( ad ( esure that each city is visited oly oce. Costrait (3 is kow as subtour elimiatio costrait ad elimiates all city subtours. Costrait (4 elimiates all 3city subtours. Costrait (5 elimiates all ( city subtours. For a feasible solutio of travellig salesma problem, the solutio should ot cotai subtours. So, for a 5city travellig salesma problem, we should ot have subtours of legth, 3 ad 4. For a 6city travellig salesma problem, we should ot have subtours of legth 3, 4 ad 5. Similarly, for a city travellig salesma problem, we should ot have subtours of legth to (. The optimal solutio of the fuzzy assigmet problem ( P is the set of oegative itegers { } which satisfies the followig characteristics: (i j,,, j i ad i i,,, i j ad also j satisfies subtour elimiatio costraits. (ii If there eist ay set of oegative itegers {' } such that ' j,,, j i ad i ' i,,, i j ad also j satisfies subtour elimiatio costraits, the ( c ( c '. i j i j 4. Limitatios of eistig method 3.3. Optimal solutio of fuzzy assigmet problems The optimal solutio of the fuzzy assigmet problem ( P is the set of oegative itegers { } which satisfies the followig characteristics: (i j,, ad i i,,. j (ii If there eist ay set of oegative itegers {' } such that ' j,, i ad ' i,,, j the ( i j c ( i j c '. I this sectio, the limitatios of eistig method are discussed. (i The eistig method [5] ca be applied oly to solve the followig type of fuzzy assigmet problems: Eample 4.. The fuzzy assigmet problem, solved by Mukherjee ad Basu [5], may be formulated ito the followig FLPP: Miimize (3,5,6,7 (5,8, (9,,5 3 (5,8,, 4 (7,8,, (3,5,6,7 (6,8,, (5,8,9, 4 (,4,5,6 3 (5,7,, 3 (8,3,5 33 (4,6,7, (6,8,, 4 (,5,6,7 4 (5,7,, 43 (,4,5,7 44 It. J. Appl. Sci. Eg.,., 3 59
6 Amit Kumar ad Aila Gupta + = = 3 4= = = + = 4 + = 33 + = = or i=, 3, 4 ad j =, 3, 4. The eistig method [5] caot be used for solvig the followig type of fuzzy assigmet problems: Miimize subject i j to i j j,, c i,, P or i, j where, c ( m,,, Fuzzy paymet to i i j c : th : perso for doig j th ( 3 job. Total fuzzy cost for performig all the jobs. Eample 4.. The fuzzy assigmet problem, for which the fuzzy costs are represeted by fuzzy umbers, may be formulated ito the followig FLPP: Miimize ((93,,, ((6,8,3,5 ((8,9,3 ((9,,,4 3 ((4,5,3 3 ( (,3,4 ((,3, ((7,8,3 ( ( 7,8,,3 33 3= = = 3= 3= 3 33= 3 = or i =, 3 ad j =, 3. where, L( maimum {, } ad R( maimum {, } (i The eistig method [5] ca be used for solvig followig type of fuzzy travellig salesma problems: Eample 4.3. The fuzzy travellig salesma problem, solved by eistig method [5], may be formulated ito the followig FLPP: Miimize (5, 8,, (9,,5 3 4 ( 7,8,, ( 5,8,9, 4 3 ( 5,7,, 3 ( 6,8,, 4 4 ( 5,7,, 43 ( 5,8,, (6,8,, (,4,5,6 ( 4,6,7, (,5,6,7 3+4= 3 4= + 4= 3 4= 3 3+ = 3 43= = = ,, = or i =,, 3, 4 ad j =,, 3, 4. The eistig method [5] caot be used for solvig the followig type of fuzzy travellig salesma problems: Miimize subject i j to i j c j,, ad j i i,, ad i j P i j ji, i j k jk ki ( 4 6 It. J. Appl. Sci. Eg.,., 3
7 Assigmet ad Travellig Salesma Problems with Coefficiets as Fuzzy Parameters ip p p p p3 p i, i p p, where, c (m,,, : Fuzzy travellig cost from i th city to j th city. c 5.. Method based o fuzzy liear programmig formulatio (FLPF : i j Total fuzzy travellig cost of completig the tour. if the salesma visits city j immediately after visi tig city i ad otherwise. Eample 4.4. The fuzzy travellig salesma problem, for which the fuzzy costs are represeted by fuzzy umbers, may be formulated ito the followig FLPP: Miimize I this sectio, two ew methods (based o fuzzy liear programmig formulatio ad classical methods are proposed to fid the optimal solutio of fuzzy assigmet problems ad fuzzy travellig salesma problems. ((9,,3 ((6,8,3,5 3 ( ( 8,9,3 4 ( ( 9,,,4 ( (,3, ( ( 4,5,3 4 ( ( 7,8,3 3 ( (,3,4 3 ( ( 7,8,,3 (( 9,, 3,5 4 (( 9, 3,4 4 (( 6, 8, = 3 4= + 4= 3 4= = 3 43= = 4 4 = I this sectio, a ew method (based o FLPF is proposed to fid the optimal solutio of fuzzy assigmet problems ad fuzzy travellig salesma problems occurrig i real life situatios. The steps of proposed method are as follows: Step Check that the chose problem is fuzzy assigmet problem or fuzzy travellig salesma problem. Case (i If the chose problem is fuzzy assigmet problem, the formulate it as ( P3. Case (ii If the chose problem is fuzzy travellig salesma problem, the formulate it as ( P4. Step Covert FLPP ( ( P3 or ( P4, obtaied i Step ito the followig crisp liear programmig problem: Miimize (c i j respective costraits. Step 3 Solve crisp liear programmig problem, obtaied i Step, to fid the optimal solutio {} ad = or i =,3,4 ad j =,3,4. where, Yager's rakig ide L ( maimum {, } ad R ( maimum {, } correspodig to miimum total fuzzy cost. 5. Proposed methods to fid the optimal solutio of fuzzy assigmet problems ad fuzzy travellig salesma problems (c i j 5.. Method based o classical methods I this sectio, a ew method (based o classical methods is proposed to fid the It. J. Appl. Sci. Eg.,., 3 6
8 Amit Kumar ad Aila Gupta optimal solutio of fuzzy assigmet problems or fuzzy travellig salesma problems occurrig i real life situatios. The steps of the proposed method are as follow: Step Check that the chose problem is fuzzy assigmet problem or fuzzy travellig salesma problem. Case (i If the chose problem is fuzzy assigmet problem, the formulate it as ( P 3. Represet ( P 3 ito tabular form as show i Table. Case (ii If the chose problem is fuzzy travellig salesma problem, the formulate it as ( P 4. Represet ( P 4 ito tabular form as show i Table. Step Covert the fuzzy assigmet problem or fuzzy travellig salesma problem obtaied i Step ito crisp problem as follows: Case (i For ( P 3 costruct a ew Table 3 as show below: Case (ii For ( P 4 costruct a ew Table 4 as show below: Step 3 Solve crisp liear programmig problem, obtaied i Step, to fid the optimal solutio } ad { Yager's rakig ide ( c i j correspodig to miimum total fuzzy cost. Job Perso P Table. Fuzzy assigmet costs J J J j J c c c j c P j c j c j c jj c j P c c c j c where, c ( m,,, Table. Fuzzy travellig costs City j c c j c j c j c j c j c c c j where, c ( m,,, 6 It. J. Appl. Sci. Eg.,., 3
9 Assigmet ad Travellig Salesma Problems with Coefficiets as Fuzzy Parameters Table 3. Crisp assigmet costs Job Perso J J Jj J P ( c ( c (c j (c Pj (cj (cj ( c jj (cj P (c (c ( cj (c where, ( c ( ( m L ( d ( R ( d Table 4. Crisp travellig costs City j ( c (c j (c j (cj (cj (cj (c (c ( cj where, ( c ( ( m L ( d ( R ( d 6. Advatage of the proposed methods over eistig method I this sectio, the advatage of the proposed methods over eistig method are discussed: The eistig method [5] ca be used for solvig oly such fuzzy assigmet problems wherei all the cost parameters are represeted by trapezoidal or triagular fuzzy umbers. However, i real life situatios, it is ot possible to represet all the parameters by trapezoidal or triagular fuzzy umbers i.e., there may eist certai fuzzy assigmet problems i which some ucertai parameters are represeted by fuzzy umbers give by model ( P3. The eistig method [5] ca ot be used for solvig such fuzzy assigmet problems ( P3. The mai advatage of both the proposed methods is that these ca be used for solvig both type of fuzzy assigmet problems ad i additio, both types of fuzzy travellig salesma problems. To show the advatage of proposed methods over eistig methods [5], fuzzy assigmet ad fuzzy travellig salesma problems chose i Eample 4. ad Eample 4.4, which caot be solved by usig the eistig method [5], are solved by usig the proposed methods. It. J. Appl. Sci. Eg.,., 3 63
10 Amit Kumar ad Aila Gupta 6.. Optimal solutio of fuzzy assigmet problem I this sectio, fuzzy assigmet problem chose i Eample 4., which caot be solved by usig the eistig method, is solved by usig the proposed methods Optimal solutio usig the method based o FLPF The optimal solutio of fuzzy assigmet problem, chose i Eample 4., may be obtaied by usig the followig steps of the proposed method: Step The FLPF of fuzzy assigmet problem, chose i Eample 4. is: Miimize (( 9,, 3 ((6,8,3,5 ((8,9,3 3 ((9,,,4 ((,3, ((4,5,3 ((7,8,3 3 ((,3,4 3 ((7,8,, = 3 = =, 3 = =, 3 33 = = or i=, 3 ad j=, 3. Step Usig Step of proposed method, the formulated FLPP is coverted ito the followig crisp liear programmig problem: Miimize ( (9,, 3 ( (6,8,3,5 ( (8,9,3 3 ( (,3, ( (7,8,3 3 3 ( (7,8,,3 33 ( (9,,,4 ( (4,5,3 ( (,3,4 = = 3 = 3 33 = = = 33 = or i=, 3 ad j=, 3. Step 3 Usig Defiitio ad Sectio., the values of c, i, j are , c 7.5, c , c , c 9.75, c , c , c 3.5, c c 3 3 Usig the values of c the crisp liear programmig problem obtaied i Step, may be writte as: Miimize ( = = 3 = 3 33 = = = 33 = or i=, 3 ad j=, 3. Step 4 Solvig the crisp liear programmig problem, obtaied i Step 3, the optimal solutio is 3 ad miimum total fuzzy cost is (7,5,. Yager's rakig ide correspodig to miimum total fuzzy cost is Optimal solutio usig method based o classical assigmet method The optimal solutio of fuzzy assigmet problem, chose i Eample 4., by usig the method based o classical assigmet method, proposed i Sectio 5., may be obtaied as follows: Step The tabular represetatio of fuzzy assigmet problem chose i Eample 4. is: Step Usig Step of proposed method the It. J. Appl. Sci. Eg.,., 3
11 Assigmet ad Travellig Salesma Problems with Coefficiets as Fuzzy Parameters fuzzy assigmet problem show i Table 5 may be coverted ito crisp assigmet problem as show i Table 6. Step 3 The optimal solutio of the crisp liear programmig problem, obtaied i 3 Step, is ad miimum total fuzzy cost is (7,5,. Yager's rakig ide correspodig to miimum total fuzzy cost is.83. The membership fuctio of the type fuzzy umber represetig the miimum total fuzzy cost of the fuzzy assigmet problem, chose i Eample 4., is show i Figure. Table 5. Fuzzy costs as fuzzy umbers Job Perso J J J3 P (9,,3 (6,8,3,5 (8,9,3 P ( 9,,,4 (,3, ( 4,5,3 P3 (7,8,3 (,3,4 (7,8,,3 Table 6. Crisp costs J J J3 P P P Degree of Membership fuctio Job Perso Left shape fuctio. Right shape fuctio Optimal cost Figure. Membership fuctio of LR fuzzy umber represetig the miimum total fuzzy assigmet cost It. J. Appl. Sci. Eg.,., 3 65
12 Amit Kumar ad Aila Gupta 6.. Optimal solutio of fuzzy travellig salesma problems I this sectio, fuzzy travellig salesma problem chose i Eample 4.4, which caot be solved by usig the eistig method, is solved by usig the proposed methods Optimal solutio usig the method based o FLPF The optimal solutio of fuzzy travellig salesma problem, chose i Eample 4.4, may be obtaied by usig the followig steps of the proposed method: Step The FLPF of the fuzzy travellig salesma problem, chose i Eample 4.4, is: Miimize (( 9,, 3 ((6,8,3,5 ((8,9,3 3 4 ((,3, 4 ((7,8,3 3 3 ((7,8,,3 4 ((9, 3,4 4 ((9,,,4 ((4,5,3 ((,3,4 (( 9,, 3,5 (( 6,8, = 3 4= + 4= 3 4= 3 3+= 3 43= = = ,,, = or i=, 3, 4 ad j=, 3, 4. Step Usig Step of proposed method, the formulated FLPP is coverted ito the followig crisp liear programmig problem: Miimize ( (9,, 3 ( (6,8,3,5 ( (8,9,3 3 4 ( (9,,,4 ( (,3, 4 ( (7,8,3 3 3 ( (7,8,,3 4 ( (9,3,4 4 ( (4,5,3 ( (,3,4 ( (9,,3,5 ( (6,8, = 3 4= + 4= 3 4= 3 3+ = 3 43= = = ,,, = or i=,, 3, 4 ad j=,, 3, 4. Step 3 Usig Defiitio ad Sectio., the values of c, i, j are c , c3 7.5, c , c , c 9.75, c , c , c3.5, c ,, c , c4, c Usig the values of c, the crisp liear programmig problem obtaied i Step, may be writte as: Miimize ( = 3 4= + 4= 3 4= 3 3+ = 3 43= = = ,,, 66 It. J. Appl. Sci. Eg.,., 3
13 Assigmet ad Travellig Salesma Problems with Coefficiets as Fuzzy Parameters Step The tabular represetatio of fuzzy travellig salesma problem, chose i Eample 4.4, is: Step Usig Step of proposed method, the travellig salesma problem show i Table 7 may be coverted ito crisp travellig salesma problem as show i Table 8. Step 3 The optimal solutio of the crisp liear programmig problem, obtaied i Step, is ad miimum total fuzzy cost is ( 6,,4. Yager's rakig ide correspodig to miimum total fuzzy cost is The membership fuctio of the type fuzzy umber represetig the miimum total fuzzy cost of the fuzzy travellig salesma problem, chose i Eample 4.4 is show i Figure. = or i =,3,4 ad j =,3,4. Step 4 The optimal solutio of the crisp liear programmig problem, obtaied i Step 3, is ad miimum total fuzzy cost is ( 6,,4. Yager's rakig ide correspodig to miimum total fuzzy cost is Optimal solutio usig the method based o classical travellig salesma method The optimal solutio of the fuzzy travellig salesma problem chose i Eample 4.4 by usig the method based o classical travellig salesma method, proposed i Sectio 5., ca be obtaied as follows: Table 7. Fuzzy costs as fuzzy umbers City 3 4 (9,,3 (6,8,3,5 (8,9,3 ( 9,,,4 (,3, ( 4,5,3 3 (7,8,3 (,3,4 (7,8,,3 4 (9,, 3,5 (9, 3,4 (6,8,5 Table 8. Crisp costs City It. J. Appl. Sci. Eg.,., 3 67
14 Amit Kumar ad Aila Gupta. Degree of membership fuctio left shape fuctio Right shape fuctio 4 6 Optimal cost Figure. Membership fuctio of LR fuzzy umber represetig the miimum total fuzzy travellig cost 7. Results ad discussio To compare the eistig [5] ad the proposed methods, the results of fuzzy assigmet problems ad fuzzy travellig salesma problems chose i Eample 4. Eample 4., Eample 4.3 ad Eample 4.4 obtaied by usig the eistig ad the proposed methods are show i Table 9. It is obvious from the results show i Table 9 that irrespective of whether we use eistig or proposed methods, same results are obtaied for Eample 4. ad Eample 4.3, while, Eample 4. ad Eample 4.4 ca be solved oly by usig the proposed methods. O the basis of above results, it ca be suggested that it is better to use the proposed methods istead of eistig method [5] to solve fuzzy assigmet problems ad fuzzy travellig salesma problems. limitatio, two ew methods are proposed. By comparig the results of the proposed methods ad eistig method, it is show that it is better to use the proposed methods istead of eistig method. I future, the proposed method may be modified to fid fuzzy optimal solutio of fuzzy assigmet problems, fuzzy travellig salesma problems ad geeralized assigmet problems with ituitioistic fuzzy umbers. 8. Coclusios I this paper, limitatio of a eistig method [5] for solvig fuzzy assigmet problems ad fuzzy travellig salesma problems is discussed ad to overcome this 68 It. J. Appl. Sci. Eg.,., 3
15 Assigmet ad Travellig Salesma Problems with Coefficiets as Fuzzy Parameters Table 9. Compariso of results obtaied by usig eistig ad proposed methods Proposed method Eistig method Proposed method Eamples based o classical [6] based o FLPF methods J P3, J P, J P3, J P, J P3, J P, 4. J 3 P, J 4 P4 ad miimum total (6,,7,35 4. Not applicable ad miimum total (5,5, Not applicable J 3 P, J 4 P4 ad miimum total (6,,7,35 J P3 J 3 P, J 4 P4 ad miimum total (6,,7,35 J P3 J P, J P, J 3 P ad miimum total (7,5, 4 3 ad miimum total (5,5, ad miimum total ( 6,,4 J 3 P ad miimum total (7,5, 4 3 ad miimum total (5,5, ad miimum total ( 6,,4 Refereces [ ] Adreae, T.. O the travellig salesma problem restricted to iputs satisfyig a relaed triagle iequality. Networks, 38: [ ] Blaser, M., Mathey, B., ad Sgall, J. 6. A improved approimatio algorithm for the asymmetric TSP with stregtheed triagle iequality. Joural of Discrete Algorithms, 4: 663. [ 3] Bockehauer, H. J., Hromkovi, J., Klasig, R., Seibert, S., ad Uger, W.. Towards the otio of stability of approimatio for hard optimizatio tasks ad the travellig salesma proble m. Theoretical Computer Sciece, 85:. [ 4] Chadra, L. S. ad Ram, L. S. 7. O the relatioship betwee ATSP ad the cycle cover problem. Theoretical Computer Sciece, 37: 88. [ 5] Che, M. S O a fuzzy assigmet problem. Tamkag J., : 474. [ 6] Crisa, G. C. ad Nechita, E. 8. Solvig Fuzzy TSP with At Algorithms. Iteratioal Joural of Computers, Commuicatios ad Cotrol, III (Suppl. It. J. Appl. Sci. Eg.,., 3 69
16 Amit Kumar ad Aila Gupta issue: Proceedigs of ICCCC 8, 8. [ 7] Dubois, D. ad Prade, H. 98. Fuzzy Sets ad Systems: Theory ad Applicatios. New York. [ 8] Feg, Y. ad Yag, L. 6. A twoobjective fuzzy kcardiality assigmet problem. Joural of Computatioal ad Applied Mathematics, 97: 4. [ 9] Fischer, R. ad Richter, K. 98. Solvig a multiobjective travellig salesma problem by dyamic programmig. Optimizatio, 3: 475. [] Kuh, H. W The Hugaria method for the assigmet problem. Naval Research Logistics Quarterly, : [] Li, C. J. ad We, U. P. 4. A labelig algorithm for the fuzzy assigmet problem. Fuzzy Sets ad Systems, 4: [] Liu, L. ad Gao, X. 9. Fuzzy weighted equilibrium multijob assigmet problem ad geetic algorithm. Applied Mathematical Modellig, 33: [3] Majumdar, J. ad Bhuia, A. K. 7. Elitist geetic algorithm for assigmet problem with imprecise goal. Europea Joural of Operatioal Research, 77: [4] Melamed, I. I. ad Sigal, I. K The liear covolutio of criteria i the bicriteria travellig salesma problem. Computatioal Mathematics ad Mathematical Physics, 37: 995. [5] Mukherjee S. ad Basu, K.. Applicatio of fuzzy rakig method for solvig assigmet problems with fuzzy costs. Iteratioal Joural of Computatioal ad Applied Mathematics, 5: [6] Padberg, M. ad Rialdi, G Optimizatio of a 53city symmetric travellig salesma problem by brach ad cut. Operatios Research Letters, 6: 7. [7] Rehmat, A., Saeed H., ad Cheema, M. S. 7. Fuzzy multiobjective liear programmig approach for travellig salesma problem. Pakista Joural of Statistics ad Operatio Research, 3: [8] Sakawa, M., Nishizaki, I., ad Uemura, Y.. Iteractive fuzzy programmig for twolevel liear ad liear fractioal productio ad assigmet problems: a case study. Europea Joural of Operatioal Research, 35: 457. [9] Segupta, A. ad Pal, T. K. 9. Fuzzy Preferece Orderig of Iterval Numbers i Decisio Problems. Berli. [] Sigal, I. K A algorithm for solvig largescale travellig salesma problem ad its umerical implemetatio. USSR Computatioal Mathematics ad Mathematical Physics, 7: 7. [] Wag, X Fuzzy optimal assigmet problem. Fuzzy Math., 3: 8. [] Yager, R. R. 98. A procedure for orderig fuzzy subsets of the uit iterval. Iformatio Scieces, 4: 436. [] Ye, X. ad Xu, J. 8. A fuzzy vehicle routig assigmet model with coectio etwork based o prioritybased geetic algorithm. World Joural of Modellig ad Simulatio, 4: [4] Zadeh, L. A Fuzzy sets. Iformatio ad Cotrol, 8: [5] Zimmerma, H. J Fuzzy Set Theory ad its Applicatio. Bosto. 7 It. J. Appl. Sci. Eg.,., 3
Solving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationA Method for Solving Balanced Intuitionistic Fuzzy Assignment Problem
P. Sethil Kumar et al t. Joural of Egieerig Research ad Applicatios SSN : 2248-9622, Vol. 4, ssue 3( Versio 1), March 2014, pp.897-903 RESEARCH ARTCLE OPEN ACCESS A Method for Solvig Balaced tuitioistic
More informationAn Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach
It. J. Cotemp. Math. Scieces, Vol. 6, 0, o. 34, 65-66 A Algorm to Solve Multi-Objective Assigmet Problem Usig Iteractive Fuzzy Goal Programmig Approach P. K. De ad Bharti Yadav Departmet of Mathematics
More informationFuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations
Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu
More informationAssignment Problems with fuzzy costs using Ones Assignment Method
IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha
More informationAn Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem
Iteratioal Joural of Systems Sciece ad Applied Mathematics 206; (4): 58-62 http://www.sciecepublishiggroup.com/j/ssam doi: 0.648/j.ssam.206004.4 A Algorithm to Solve Fuzzy Trapezoidal Trasshipmet Problem
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationTheory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators
Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationOptimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method
Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal
More informationA Polynomial Interval Shortest-Route Algorithm for Acyclic Network
A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationNeutrosophic Linear Programming Problems
Neutrosophic Operatioal Research I Neutrosophic Liear Programmig Problems Abdel-Nasser Hussia Mai Mohamed Mohamed Abdel-Baset 3 Floreti Smaradache 4 Departmet of Iformatio System, Faculty of Computers
More informationA Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm
A Novel Approach to Solve Multiple Travelig Salesme Problem by Geetic Algorithm Adrás Király, Jáos Aboyi Uiversity of Paoia, Departmet of Process Egieerig, P.O. Box 58. Veszprém H-8200, HUNGARY, e-mail:
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More informationAdaptive Resource Allocation for Electric Environmental Pollution through the Control Network
Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationHigher-order iterative methods free from second derivative for solving nonlinear equations
Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationAN OPTIMIZATION NETWORK FOR MATRIX INVERSION
397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationRelationship between augmented eccentric connectivity index and some other graph invariants
Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats
More informationFuzzy Transportation Problem Using Triangular Membership Function-A New approach
Vol3 No.. PP 8- March 03 ISSN: 3 006X Trasportatio Proble Usig Triagular Mebership Fuctio-A New approach a S. Solaiappaa* K. Jeyaraab Departet of Matheatics Aa UiversityUiversity College of Egieerig Raaathapura
More informationInternational Journal of Mathematics Trends and Technology (IJMTT) Volume 52 Number 9 December 2017
Iteratioal Joural of Mathematics Treds ad Techology (IJMTT) Volume 5 Number 9 December 7 Optimal Solutio of a Degeerate Trasportatio Problem Reea.G.patel, Dr.P.H.Bhathawala Assistat professor, Departmet
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationThe Counterchanged Crossed Cube Interconnection Network and Its Topology Properties
WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationSuper Vertex Magic and E-Super Vertex Magic. Total Labelling
Proceedigs of the Iteratioal Coferece o Applied Mathematics ad Theoretical Computer Sciece - 03 6 Super Vertex Magic ad E-Super Vertex Magic Total Labellig C.J. Deei ad D. Atoy Xavier Abstract--- For a
More informationCompactness of Fuzzy Sets
Compactess of uzzy Sets Amai E. Kadhm Departmet of Egieerig Programs, Uiversity College of Madeat Al-Elem, Baghdad, Iraq. Abstract The objective of this paper is to study the compactess of fuzzy sets i
More informationMałgorzata Sterna. Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak
Małgorzata Stera Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak Istitute of Computig Sciece Pozań Uiversity of Techology Pozań - Polad Scope of the Talk Problem defiitio MP Formulatio
More informationNeural Networks A Model of Boolean Functions
Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationOptimization for framework design of new product introduction management system Ma Ying, Wu Hongcui
2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationAn Estimation of Distribution Algorithm for solving the Knapsack problem
Vol.4,No.5, 214 Published olie: May 25, 214 DOI: 1.7321/jscse.v4.5.1 A Estimatio of Distributio Algorithm for solvig the Kapsack problem 1 Ricardo Pérez, 2 S. Jös, 3 Arturo Herádez, 4 Carlos A. Ochoa *1,
More informationOptimization of Multiple Traveling Salesmen Problem by a Novel Representation based Genetic Algorithm
Magyar Kutatók 0. Nemzetközi Szimpóziuma 0 th Iteratioal Symposium of Hugaria Researchers o Computatioal Itelligece ad Iformatics Optimizatio of Multiple Travelig Salesme Problem by a Novel Represetatio
More informationEvaluation of Fuzzy Quantities by Distance Method and its Application in Environmental Maps
Joural of pplied Sciece ad griculture, 8(3): 94-99, 23 ISSN 86-92 Evaluatio of Fuzzy Quatities by Distace Method ad its pplicatio i Evirometal Maps Saeifard ad L Talebi Departmet of pplied Mathematics,
More informationImproving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationLecture Notes on Integer Linear Programming
Lecture Notes o Iteger Liear Programmig Roel va de Broek October 15, 2018 These otes supplemet the material o (iteger) liear programmig covered by the lectures i the course Algorithms for Decisio Support.
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationMethod for Solving Unbalanced Transportation Problems Using Trapezoidal Fuzzy Numbers
Kadhirvel. K, Balauruga. K / Iteratioal Joural of Egieerig Research ad Applicatios (IJERA) ISSN: 48-96 www.ijera.co Vol., Issue 4, Jul-Aug 0, pp.59-596 Method for Solvig Ubalaced Trasportatio Probles Usig
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationA General Approach for Solving Assignment Problems Involving with Fuzzy Cost Coefficients
www.seet.org/mas Moder Applied Siee Vol. 6, No. 3; Marh 202 A Geeral Approah for Solvig Assigmet Problems Ivolvig with Fuzzy ost oeffiiets P. K. De Departmet of Mathematis, Natioal Istitute of Tehology,
More informationNovel Encryption Schemes Based on Catalan Numbers
D. Sravaa Kumar, H. Sueetha, A. hadrasekhar / Iteratioal Joural of Egieerig Research ad Applicatios (IJERA) ISSN: 48-96 www.iera.com Novel Ecryptio Schemes Based o atala Numbers 1 D. Sravaa Kumar H. Sueetha
More informationA Parallel DFA Minimization Algorithm
A Parallel DFA Miimizatio Algorithm Ambuj Tewari, Utkarsh Srivastava, ad P. Gupta Departmet of Computer Sciece & Egieerig Idia Istitute of Techology Kapur Kapur 208 016,INDIA pg@iitk.ac.i Abstract. I this
More informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationISSN (Print) Research Article. *Corresponding author Nengfa Hu
Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationBOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM
MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM Staislav Shidlovskiy 1, 1 Natioal Research
More informationA New Bit Wise Technique for 3-Partitioning Algorithm
Special Issue of Iteratioal Joural of Computer Applicatios (0975 8887) o Optimizatio ad O-chip Commuicatio, No.1. Feb.2012, ww.ijcaolie.org A New Bit Wise Techique for 3-Partitioig Algorithm Rajumar Jai
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationSOME NEW RESULTS ON THE TRAVELLING SALESMAN PROBLEM
Category: prelimiary commuicatio Domiika Crjac Milić 1 Ljiljaka Kvesić 2 SOME NEW RESULTS ON THE TRAVELLING SALESMAN PROBLEM Abstract: The travellig salesma problem (or The sales represetative problem)
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationPETRI NETS GENERATING KOLAM PATTERNS
. Lalitha et al / Idia Joural of omputer Sciece ad Egieerig (IJSE) PETRI NETS GENERATING KOLAM PATTERNS. Lalitha epartmet of Mathematics Sathyabama Uiversity, heai-119, Idia lalkrish_24@yahoo.co.i K. Ragaraja
More informationOptimization of Multiple Input Single Output Fuzzy Membership Functions Using Clonal Selection Algorithm
Optimizatio of Multiple Iput Sigle Output Fuzzy Membership Fuctios Usig Cloal Selectio Algorithm AYŞE MERVE ACILAR, AHMET ARSLAN Computer Egieerig Departmet Selcuk Uiversity Selcuk Uiversity, Eg.-Arch.
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationDesigning a learning system
CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please
More informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationThe Research Based on Fuzzy Sliding Mode Control for Linear Double. Inverted Pendulum
Advaced Materials Research Olie: 04-05-3 ISSN: 66-8985, Vols. 96-930, pp 463-467 doi:0.408/www.scietific.et/amr.96-930.463 04 Tras Tech Publicatios, Switzerlad The Research Based o Fuzzy Slidig Mode Cotrol
More informationPerhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where
ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationIntroduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP
Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible
More informationON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION
I terat. J. Mh. & Math. Sci. Vol. (1978) 125-132 125 ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION A. W. GOODMAN ad E. B. SAFF* Mathematics Dept, Uiversity of South Florida Tampa, Florida 33620 Dedicated
More informationMean cordiality of some snake graphs
Palestie Joural of Mathematics Vol. 4() (015), 49 445 Palestie Polytechic Uiversity-PPU 015 Mea cordiality of some sake graphs R. Poraj ad S. Sathish Narayaa Commuicated by Ayma Badawi MSC 010 Classificatios:
More informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationPrime Cordial Labeling on Graphs
World Academy of Sciece, Egieerig ad Techology Iteratioal Joural of Mathematical ad Computatioal Scieces Vol:7, No:5, 013 Prime Cordial Labelig o Graphs S. Babitha ad J. Baskar Babujee, Iteratioal Sciece
More informationMobile terminal 3D image reconstruction program development based on Android Lin Qinhua
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationA Modified Multiband U Shaped and Microcontroller Shaped Fractal Antenna
al Joural o Recet ad Iovatio Treds i Computig ad Commuicatio ISSN: 221-8169 A Modified Multibad U Shaped ad Microcotroller Shaped Fractal Atea Shweta Goyal 1, Yogedra Kumar Katiyar 2 1 M.tech Scholar,
More informationSome non-existence results on Leech trees
Some o-existece results o Leech trees László A.Székely Hua Wag Yog Zhag Uiversity of South Carolia This paper is dedicated to the memory of Domiique de Cae, who itroduced LAS to Leech trees.. Abstract
More informationJournal of Mathematical Nanoscience. Sanskruti Index of Bridge Graph and Some Nanocones
Joural of Mathematical Naoscieese 7 2) 2017) 85 95 Joural of Mathematical Naosciece Available Olie at: http://jmathaosrttuedu Saskruti Idex of Bridge Graph ad Some Naocoes K Pattabirama * Departmet of
More informationMulti Attributes Approach for Tourist Trips Design
Multi Attributes Approach for Tourist Trips Desig Ilaria Baffo 1, Pasquale Caroteuto 2, Atoella Petrillo 3, Fabio De Felice 4 1 Idustrial Egieerig School (DEIM) - Uiversity of Tuscia, Italy ilaria.baffo@uitus.it
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More information