HEURISTIC APPROACHES FOR THE NO-DEPOT K-TRAVELING

HEURISTIC APPROACHES FOR THE NO-DEPOT K-TRAVELING

ID:39505344

大小:419.95 KB

页数:68页

时间:2019-07-04

HEURISTIC APPROACHES FOR THE NO-DEPOT K-TRAVELING_第1页
HEURISTIC APPROACHES FOR THE NO-DEPOT K-TRAVELING_第2页
HEURISTIC APPROACHES FOR THE NO-DEPOT K-TRAVELING_第3页
HEURISTIC APPROACHES FOR THE NO-DEPOT K-TRAVELING_第4页
HEURISTIC APPROACHES FOR THE NO-DEPOT K-TRAVELING_第5页
资源描述:

《HEURISTIC APPROACHES FOR THE NO-DEPOT K-TRAVELING》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、HEURISTICAPPROACHESFORTHENO-DEPOTK-TRAVELINGSALESMENPROBLEMWITHAMINMAXOBJECTIVEAThesisbyBYUNGSOONASubmittedtotheOceofGraduateStudiesofTexasA&MUniversityinpartialful llmentoftherequirementsforthedegreeofMASTEROFSCIENCEMay2006MajorSubject:IndustrialEngineeringHEURISTI

2、CAPPROACHFORTHENO-DEPOTK-TRAVELINGSALESMENPROBLEMWITHAMINMAXOBJECTIVEAThesisbyBYUNGSOONASubmittedtotheOceofGraduateStudiesofTexasA&MUniversityinpartialful llmentoftherequirementsforthedegreeofMASTEROFSCIENCEApprovedby:ChairofCommittee,SergiyButenkoCommitteeMembers,I

3、llyaHicksYunlongZhangHeadofDepartment,BrettA.PetersMay2006MajorSubject:IndustrialEngineeringiiiABSTRACTHeuristicApproachesfortheNo-Depotk-TravelingSalesmenProblemwithaMinmaxObjective.(May2006)ByungsooNa,B.S.,PohangUniversityofScience&TechnologyChairofAdvisoryCommitte

4、e:Dr.SergiyButenkoThisthesisdealswiththeno-depotminmaxMultipleTravelingSalesmenProblem(MTSP),whichcanbeformulatedasfollows.Givenasetofncitiesandksalesmen, ndkdisjointtours(oneforeachsalesmen)suchthateachcitybelongstoexactlyonetourandthelengthofthelongestofktoursismin

5、imized.Theno-depotassumptionmeansthatthesalesmendonotstartfromandreturntoone xeddepot.Theno-depotmodelcanbeappliedindesigningpatrollingroutes,aswellasinbusinesssituations,especiallywheresalesmenworkfromhomeorthecompanyhasnocentraloce.Thismodelcanbealsoappliedtothejo

6、bschedulingproblemwithnjobsandkidenticalmachines.Despiteitspotentialapplicabilitytoanumberofimportantsituations,there-searchliteratureontheno-depotminmaxk-TSPhasbeenlimited,withnoreportsoncomputationalexperiments.ThepreviouslypublishedresultsincludedtheproofofNP-hard

7、nessoftheproblemofinterest,whichmotivatesusingheuristicsforitssolution.Thisthesisproposesseveralconstructionheuristicalgorithms,includinggreedyalgorithms,cluster rstandroutesecondalgorithms,androute rstandclus-tersecondalgorithms.Asalocalsearchmethodforasingletour,2-

8、optsearchandLin-Kernighanwereused,andforalocalsearchmethodbetweenmultipletours,relocationandexchange(edgeheuristics)wereused.Furthe

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。