Show simple item record

dc.contributor.advisorBai, Li
dc.creatorLi, Zhuo
dc.date.accessioned2020-10-27T15:14:10Z
dc.date.available2020-10-27T15:14:10Z
dc.date.issued2011
dc.identifier.other864885263
dc.identifier.urihttp://hdl.handle.net/20.500.12613/1731
dc.description.abstractRedundancy Allocation Problem (RAP) is a well known mathematical problem for modeling series-parallel systems. It is a combinatorial optimization problem which focuses on determining an optimal assignment of components in a system design. Due to the diverse possible selection of components, the RAP is proved to be NP-hard. Therefore, many algorithms, especially heuristic algorithms were proposed and implemented in the past several decades, committed to provide innovative methods or better solutions. In recent years, multi-agent system (MAS) is proposed for modeling complex systems and solving large scale problems. It is a relatively new programming concept with the ability of self-organizing, self-adaptive, autonomous administrating, etc. These features of MAS inspire us to look at the RAP from another point of view. An RAP can be divided into multiple smaller problems that are solved by multiple agents. The agents can collaboratively solve optimal RAP solutions quickly and efficiently. In this research, we proposed to solve RAP using MAS. This novel approach, to the best of our knowledge, has not been proposed before, although multi-agent approaches have been widely used for solving other large and complex nonlinear problems. To demonstrate that, we analyzed and evaluated four benchmark RAP problems in the literature. From the results, the MAS approach is shown as an effective and extendable method for solving the RAP problems.
dc.format.extent60 pages
dc.language.isoeng
dc.publisherTemple University. Libraries
dc.relation.ispartofTheses and Dissertations
dc.rightsIN COPYRIGHT- This Rights Statement can be used for an Item that is in copyright. Using this statement implies that the organization making this Item available has determined that the Item is in copyright and either is the rights-holder, has obtained permission from the rights-holder(s) to make their Work(s) available, or makes the Item available under an exception or limitation to copyright (including Fair Use) that entitles it to make the Item available.
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subjectComputer Science
dc.subjectAlgorithm
dc.subjectCombinatorial Optimization
dc.subjectMulti-agent System
dc.subjectRap
dc.subjectRedundancy Allocation Problem
dc.titleA MULTI-AGENT BASED APPROACH FOR SOLVING THE REDUNDANCY ALLOCATION PROBLEM
dc.typeText
dc.type.genreThesis/Dissertation
dc.contributor.committeememberPicone, Joseph
dc.contributor.committeememberBiswas, Saroj K.
dc.description.departmentElectrical and Computer Engineering
dc.relation.doihttp://dx.doi.org/10.34944/dspace/1713
dc.ada.noteFor Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact scholarshare@temple.edu
dc.description.degreeM.S.E.
refterms.dateFOA2020-10-27T15:14:10Z


Files in this item

Thumbnail
Name:
Li_2011_155634.pdf
Size:
910.0Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record