InternationalJournalofEmergingTechnologyandAdvancedEngineeringWebsite:www.
ijetae.
com(ISSN2250-2459,ISO9001:2008CertifiedJournal,Volume3,Issue9,September2013)365AnOverviewofUseofLinearDataStructureinHeuristicSearchTechniqueGirishPPotdar1,Dr.
RCThool21AssociateProfessor,ComputerEngineeringDepartment,P.
I.
C.
T,Pune,2Professor,DepartmentofInformationTechnology,SGGSIE&T,Nanded,Abstract—Searchproblemscanbeclassifiedbytheamountofinformationthatisavailabletothesearchprocess.
Whennoinformationisknownapriori,asearchprogrammustperformblindoruninformedsearch.
Whenmoreinformationthaninitialstate,operatorandthegoaltestisavailablethesizeofsearchspacecanusuallybeconstrained.
Thesemethodsareknownasinformedsearchmethods.
Theseoftendependonuseofheuristicinformation.
Aheuristicisaruleofthumb,strategy,trick,simplificationoranyotherkindofdevicewhichdrasticallylimitssearchforsolutionsinlargeproblemspaces.
Heuristicsdoesn'tguaranteeoptimalsolutions;infacttheydonotguaranteeanysolutionatall;theyoffersolutionswhicharegoodenoughmostofthetime.
Optimizationistheprocessoffindingthebestsolutionfromasetofsolutions.
Insomecasesoptimizationmaynotbepossibleorsimplynotefficientenoughtogeneratesolutionsintherequiredtime,soheuristicmaybeusedinstead.
Ifaproblemissolvedrepetitivelyandtheparameterschangeoften,heuristicsaremorelikelytofallapart.
Heuristicperformancemaybeimprovedbyincorporatingoptimizationalgorithms.
Bettersolutionsaregeneratedforabroaderrangeofparametersbyoptimizinginsidesomestepsoftheheuristicsearchalgorithm.
ThepaperexploredifferentheuristicsearchtechniquesandproposeaheuristicsearchmethodthataimstoovercomethedrawbacksofexistingtechniquesbymakingchangesinthedatastructuresusedinordertoachievebestpossiblesolutionandtoimprovetheperformanceefficiencyKeywords—MultiLevelLinkedList,A*algorithm,AO*algorithm,hillclimbing,Generalizedlinkedlist.
I.
INTRODUCTIONArtificialIntelligencetechniquesarebeingusedinanincreasingnumberofcomputerapplicationsincludingspeechrecognition,robotics,expertsystems,drugdesign,andmoleculesynthesis.
Almostallthesearchingalgorithmsgeneratethesearchtree.
ThesesearchingtechniquesarealsocalledastheHeuristicsearchingtechniques[1,12].
Aswebeginfromthestartstate,generatethesearchtree;selecttheavailableoptimalpathtillwegetthegoalstate.
Priorwegoaheadwiththediscussion,let'sdefinetheterm"Heuristic".
Heuristicmeanstodiscover.
Onecandefineheuristicsearch,as"Itisthesearchingprocesswhichtriestolocatethepredefinedstatebyapplyingheuristic.
"Theprogramstatements,whichrefertotheheuristic,arecalled"heuristicfunction".
Onemayidentifythefollowingconditionswhereinwemaymakeuseofheuristicsuchas:1.
Whenanuncertaintyinthestatespaceisforesighted.
2.
Whentheproblemspacedemandsit.
3.
Retrievalwithconstraintandreasoningisessential.
Thesearevariousheuristicsearchingtechniqueslike:BESTFIRSTSEARCH,A*algorithm[3,4,9].
Theaimhereistodesignanovelheuristicalgorithmwithadifferentdatastructurethantheconventionaloneandprovideheuristicsearchalgorithmresultsusingvariousmeasurementsparametersliketime,space,solutionquality,andsearcheffectiveness.
Generally,searchalgorithmscanbeclassifiedintothreegroups.
Theseare,constant-space,linear-space,andexponential-spacestrategies[7,8,9,10].
Inaconstant-spacesearchstrategy,anapplicableruleisselectedandappliedirrevocablywithoutleavinganymeansforreconsiderationatalaterpoint.
Theprocedurerepeatedlyexpandsnodes,inspectingnewlygeneratedsuccessorsandselectingforexpansionthebestamongthesuccessors,whileretainingnofurtherreferencetothefatherortheancestor.
Inlinear-spacesearchstrategies,iftheselectedruledoesn'tleadtoasolution,theintermediatestepsarediscardedandanotherruleisselectedinstead.
Linear-spacestrategiesareperfectlyadequateforproblemsrequiringsmallamountofsearch.
TheAIapplicationsthatusetheheuristictechniqueneed,andhencebuildtheirownheuristicfunctionwithintheapplicationconstraints.
Theexistenceofheuristicfunctionisbasicallytoevaluatethetwocosts,gandh'.
Whereingreferstothecostfromstartstatetothecurrentstate,andh'referstotheevaluatedcostfromcurrentstatetothegoalstate.
InternationalJournalofEmergingTechnologyandAdvancedEngineeringWebsite:www.
ijetae.
com(ISSN2250-2459,ISO9001:2008CertifiedJournal,Volume3,Issue9,September2013)366Sothetotalevaluatedcostfromtheheuristicfunctionf'isthesummationofthetwocostsgandh'.
Thatisf'=g+h'.
Thistotalevaluatedcostrefersto,howfarthegoalstateisfromthecurrentstate.
TheheuristicsearchingtechniqueslikeA*evaluatetheheuristiccostusingheuristicfunction,[2,3].
GRAPHSEARCHprocedure[1,9,10,11,16]usestwolists,OPENandCLOSED,inordertostoresearch-graphnodes.
NodesonOPENarethosetipnodesofthesearch-graphthathavenotbeenselectedforexpansion.
NodesinCLOSEDareeithertipnodesselectedforexpansionandgeneratednosuccessors,ornon-tipnodes.
NodesinOPENaretraversedbytheproceduresothatthe"bestnodeisselectedforexpansion.
Theselectioncanbebasedonavarietyofheuristicideas.
Wheneverthenodeselectedforexpansionisagoalnode,theprocessterminatessuccessfullyandthepathisdeterminedfromthestartnodetothefoundgoalbytracingbackthepointers.
Theprocessterminatesunsuccessfullywheneverthesearchtreehasnoremainingtipnodes(i.
e.
OPENisempty).
Inthiscasethegoalnodeisinaccessiblefromthestartnode.
Normally,Heuristicsearchalgorithmsuseaevaluationfunctionf--real-valuedfunctiontoselectnodesfromOPENforfurtherexpansion.
Thisevaluationfunctioniscomputedforanodeninthesearch-graphasfollows[5,11,14,15]:f(n)=wg(n)+(1-w)h(n)Whereg(n)isthecostofthemshortestpathfromthestartnodetothenoden,h(n)iscostoftheoptimalpathfromntoagoalnode,and0w1istheweightgiventotheestimatesgandh.
Indeterminingtheestimateh,werelyonheuristicinformationavailablefromtheproblemdomain.
Theestimatehiscalledtheheuristicfunction.
TheheuristicfunctionhissaidtobeadmissibleifitisalowerboundontheactualcostTheestimatehissaidtobeconsistentif,foreachpairofnodesnandm,h(m)-h(n)islessthanorequaltotheactualdistancebetweenthetwonodesnandm.
Anybest-firstheuristicsearchalgorithmthatusesanadmissibleheuristicfunctionalwaysterminatewiththeoptimalsolutionpath,ifsuchpathexists.
Suchalgorithmsarecalledadmissiblealgorithms[6,10].
Thememoryrequirementforaheuristicsearchalgorithmisprimarilymeasuredbytheaveragesizeofthesearch-graph.
ThisisequaltothesizeofthetwolistsOPENandCLOSED.
BasicideaTheideaofbehindthispaperistooptimizetheperformanceofheuristicsearchalgorithm.
Hereweproposeanewapproachbymakingchangesinthedatastructuresandmethodsusedinconventionalalgorithms.
NeedTherearemanyexistingheuristicsearchalgorithmslikehillclimbing,A*,AO*,simulatedannealing.
Hillclimbingsuffersfromproblemslikelocalmaximum,plateau,ridge.
ThegracefuldecayofadmissibilityisthemajordrawbackofA*algorithm.
AO*hasoverheadofexpandingthepartialgraphonestateatatimeandrecomputingthebestpolicyoverthegraphaftereachstep.
Mostoftheseexistingheuristicsearchalgorithmsmaintainlistswhichareentered,updatedandmanipulatedon.
Maintainingandmanagingtheselistssimultaneouslyistediousandcomplextask.
Toreducethiscomplexityweuseadatastructurethataimsatmakingagooduseofmemoryspacewithoutcompromisingonthecompletenessandoptimalityofthealgorithm[13].
ScopeThescopeoftheworkisrestricteduseheuristicsearchmethodusingMultiLevelLinkedList(MLL)toimprovetheperformanceofthesealgorithms.
Proposedworkistoimprovetheperformancebyoptimizinginsidethestepsofalgorithmbyremovingtheredundantlistswhichisthemaindrawbackofmostexistingalgorithms.
Thealgorithmmaybeappliedtoanygraphbasedrealtimeapplications.
II.
BLOCKSCHEMATICTheproposedworkcanbeseeninFig1.
Fig1.
Overviewofblockschematic.
InputmoduleHeuristicSystemProcessingUnitComparatorUnitTimeandspacemonitorDisplayUnitInternationalJournalofEmergingTechnologyandAdvancedEngineeringWebsite:www.
ijetae.
com(ISSN2250-2459,ISO9001:2008CertifiedJournal,Volume3,Issue9,September2013)367III.
DATADESCRIPTIONDataconsistsofdatarelatedtotheapplicationthealgorithmwillbeappliedon.
Thealgorithmifimplementedontravellingsalesmanproblemasanexample;wheredataconsistsofthedistancematrixandthestartingcity.
ThedataisorganizedintoMultilinkedlist(MLL)insteadoftheconventionalGeneralizedlinkedlist(GLL).
Fig2-DFDTheaboveDFDgivesdifferentpossiblemodulesthatcanbeusedwhileimplementingtheproposedworkandpossibledatainteractionbetweenthesemodules.
IV.
ARCHITECTURALDESIGNThefigure3describesthecompletemoduledescriptionforthecurrentwork.
Theuseofproposeddatastructurecanresultinsubstantialtimesavingforlargedataset.
Thesamemaybeappliedtographbasedapplicationssuchastravellingsalespersonproblem,graphpartionioningandmanysuchapplications.
Fig3.
ArchitecturalDesignV.
INTERNALSOFTWAREDATASTRUCTUREMultilinklist(MLL)isusedintheproposedalgorithm.
Itisadynamicallocationmethod.
MLLmaintainsaparentlistandsuccessorlist.
Everyparentnodemaintainsitslistofsuccessors.
AlltheseparentnodesarelinkedtogethertoformMLL.
Fig4.
MLLdatastructureInputModuleAcceptInputProcessInputHeuristicSearchSystemTime&SpaceMonitorGenerateoutput&measureperformanceComparetheResultsDisplayPanelResultGraphDataTimeandspaceparametersSolutionOrganizeddataInputModuleOuralgorithmmoduleAO*algorithmmoduleA*algorithmmoduleComparemoduleOutputModuleP1S1S2P2S1S2P3S1S2InternationalJournalofEmergingTechnologyandAdvancedEngineeringWebsite:www.
ijetae.
com(ISSN2250-2459,ISO9001:2008CertifiedJournal,Volume3,Issue9,September2013)368VI.
CONCLUSIONMLLcanbeprovedtobeverypowerfulstructure.
Iftheapplicationpermitsthenonecanusethereferencelistasthesupportinglist,thuscanavoidstoringthesamestatesagainandagain.
Thusweaimatconductingexperimentationdesignedtogiveresultsconcerningtheroleofheuristicsinachievingsearchefficiency.
ThisapproachusingMLLisidealforcommunicationapplications.
REFERENCES[1]EricHansen,RongZhou–"AnytimeHeuristicSearch",JournalofArtificialIntelligenceResearch28,2007.
[2]Davis,H.
,R.
PollackandD.
Golden,TowardsaDomainIndependentMethodforComparingSearchAlgorithmRun-times,Proceedingsofthe6thCanadianConferenceonAI,240-244(1986b).
[3]AnneL.
Gardner"Search:AnOverview",AImagazine,Volume2,Number1,Sept1980.
[4]ABDEL-ELAHAL-AYYOUB,FAWAZMASOUD"HeuristicSearchRevisited",JournalofSystemsandsoftware,Vol55,No2,2000,103-113[5]Hermankaindl,GerhardKainz–"BidirectionalHeuristicsearchreconsidered",JournalofArtificialIntelligenceResearch7,1997.
[6]AlokKumar,AnshulKumar,M.
Balkrihnan"HeuristicSearchasedApproachtoScheduling,AllocationandBindinginDataPathSynthesis"8thInternationalConferenceonVLSIdesign–Jan1995.
[7]JosephCMusto,LKenLauderbaugh"AHeuristicSearchAlgorithmForOnlineSystemIdentfication"IEEEInternationalsymposiumonIntelligentControl,August1991.
[8]Davis,H.
,R.
PollackandD.
Golden,ATechniqueforComparingSearchAlgorithmRuntimes,ProceedingsoftheFourteenthAnnualACMCSC-86,301-308(1986a).
[9]Dechter,R.
andJ.
Pearl,GeneralizedBest-FirstSearchStrategiesandtheOptimalityofA*,JournaloftheACM,Vol.
32,No.
3,505-536(1985).
[10]Korf,R.
,Depth-FirstIterativeDeepening:AnOptimalAdmissibleTreeSearch,ArtificialIntelligence,Vol.
27,97-109(1985).
[11]Bagchi,A.
andA.
Manhanti,SearchAlgorithmsUnderDifferentKindofHeuristics:AComparativeStudy,JournaloftheACM,Vol.
30,1-21(1983).
[12]Annev.
d.
LGardner"SearchanOverview",AIMagazineWinter81.
[13]StevenWalczak"Knowledge-BasedSearchinCompetitiveDomains"[14]LucaDiGasperoAndreaSchaerf"ATabuSearchApproachtotheTravelingTournamentProblem"[15]EugeneCharniakandDrewMcDermott,"IntroductiontoArtificialIntelligence".
AddisonWesley.
[16]NilsJNilsson,"PrincipalsofArtificialIntelligence"NarosaPublishingHouse.
官方网站:点击访问创梦网络宿迁BGP高防活动方案:机房CPU内存硬盘带宽IP防护流量原价活动价开通方式宿迁BGP4vCPU4G40G+50G20Mbps1个100G不限流量299元/月 209.3元/月点击自助购买成都电信优化线路8vCPU8G40G+50G20Mbps1个100G不限流量399元/月 279.3元/月点击自助购买成都电信优化线路8vCPU16G40G+50G2...
咖啡主机怎么样?咖啡主机是一家国人主机销售商,成立于2016年8月,之前云服务器网已经多次分享过他家的云服务器产品了,商家主要销售香港、洛杉矶等地的VPS产品,Cera机房 三网直连去程 回程CUVIP优化 本产品并非原生地区本土IP,线路方面都有CN2直连国内,机器比较稳定。咖啡主机目前推出美国洛杉矶弹性轻量云主机仅13元/月起,高防云20G防御仅18元/月;香港弹性云服务器,香港HKBN CN...
近日华纳云发布了最新的618返场优惠活动,主要针对旗下的免备案香港云服务器、香港独立服务器、香港高防御服务器等产品,月付6折优惠起,高防御服务器可提供20G DDOS防御,采用E5处理器V4CPU性能,10Mbps独享CN2 GIA高速优质带宽,有需要免备案香港服务器、香港云服务器、香港独立服务器、香港高防御服务器、香港物理服务器的朋友可以尝试一下。华纳云好不好?华纳云怎么样?华纳云服务器怎么样?...
graphsearch为你推荐
补丁安装前必读Intentsandroid模式ios8支持ipadpublicationethics.orgeaccelerator使用apmsevr中eAccelerator显示NO是什么问题ipad连不上wifiipad2 wifi连接不上,刚连上就弹出一个 success页面windows键是哪个Windows键是哪个键啊?iphone连不上wifi我的苹果手机连不上无线,其它手机能,怎么回事?只是家里的连不上iphone连不上wifi苹果手机“无法加入网络”怎么办
万网域名空间 免费申请域名 便宜服务器 韩国空间 koss css样式大全 网站被封 qq数据库 免费全能空间 个人空间申请 华为云盘 工信部icp备案查询 xuni 电信宽带测速软件 godaddy空间 免备案cdn加速 网络速度 网站防护 国外免费网盘 香港博客 更多