東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Solving optimization problems using ...

Kasinadhuni, Maheswara Prasad.

Linked to FindBook

Google Book

Amazon

博客來

Solving optimization problems using genetic algorithms with multiple genome coding.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Solving optimization problems using genetic algorithms with multiple genome coding./
Author:	Kasinadhuni, Maheswara Prasad.
Description:	394 p.
Notes:	Source: Dissertation Abstracts International, Volume: 65-03, Section: B, page: 1401.
Contained By:	Dissertation Abstracts International65-03B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3127381

Solving optimization problems using genetic algorithms with multiple genome coding.
Kasinadhuni, Maheswara Prasad.

Solving optimization problems using genetic algorithms with multiple genome coding. - 394 p.

Source: Dissertation Abstracts International, Volume: 65-03, Section: B, page: 1401.

Thesis (D.P.S.)--Pace University, 2004.

Researchers (Gargano and Edelson, 2001) developed several theoretical models to study the use of Genetic Algorithms (GAs) on an interesting category of Optimization Problems [19, 20, 21, 22]. Some of these models were implemented in applications of optimal matroid basis models where the element costs are not fixed, but are time dependent.Subjects--Topical Terms:

626642
Computer Science.

Solving optimization problems using genetic algorithms with multiple genome coding.
LDR:03063nmm 2200337 4500 001 1864351
005 20041217072321.5
008 130614s2004 eng d
035 $a (UnM)AAI3127381
035 $a AAI3127381
040 $a UnM $c UnM
100 1 $a Kasinadhuni, Maheswara Prasad. $3 1951848
245 1 0 $a Solving optimization problems using genetic algorithms with multiple genome coding.
300 $a 394 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-03, Section: B, page: 1401.
500 $a Chairperson: Michael L. Gargano.
502 $a Thesis (D.P.S.)--Pace University, 2004.
520 $a Researchers (Gargano and Edelson, 2001) developed several theoretical models to study the use of Genetic Algorithms (GAs) on an interesting category of Optimization Problems [19, 20, 21, 22]. Some of these models were implemented in applications of optimal matroid basis models where the element costs are not fixed, but are time dependent.
520 $a This problem is an extension of the study and research suggested by DeCicco, 2002 [7, 8, 9, 10]. While DeCicco investigated and researched the Sensitivity Analysis of Certain Time Dependent Matroid Base Models Solved by Genetic Algorithms using single coding technique, I propose to implement a Multiple Genome Coding method with a focus towards determining whether a Multiple Genome Coding with forward, reverse and permutation coding in combination works out better than a single coding in stand-alone mode. I also studied the way the GA self adapts and tends to use different codings at various stages of the search. Also, I focus on determining the most advantageous in terms of number of generations, mean and standard deviation parameters as a metric measure for comparing multiple genome coding.
520 $a This dissertation study while implementing multiple genome coding focused on three objectives for the purposes of comparing with single coding. First the effectiveness of GAs with respect to each of the genome coding depending on the variations in the cost table is investigated, in comparison with standalone coding. In addition, the multiple genome coding content in each generation is evaluated. All studies involve a benchmark comparison of the GAs against the brute force method.
520 $a A discount component is introduced in the cost table with no loss of generality, leading to the best fitness calculation as a result of which, a company with two accepted bids is given preferential dispensation under the pay-off option. This algorithm is translated into one for solving the widely known NP-Problem, known as the Rooted Hamiltonian Directed Path and the related conclusions are reported for values of S = 5 to 10, 15 and N = 5 to 10, 15.
590 $a School code: 0483.
650 4 $a Computer Science. $3 626642
650 4 $a Operations Research. $3 626629
650 4 $a Biology, Genetics. $3 1017730
650 4 $a Biology, Molecular. $3 1017719
650 4 $a Engineering, Biomedical. $3 1017684
690 $a 0984
690 $a 0796
690 $a 0369
690 $a 0307
690 $a 0541
710 2 0 $a Pace University. $3 1024552
773 0 $t Dissertation Abstracts International $g 65-03B.
790 1 0 $a Gargano, Michael L., $e advisor
790 $a 0483
791 $a D.P.S.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3127381