文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Multilevel Refinement for Combinatorial Optimisation Problems
侵权投诉

Multilevel Refinement for Combinatorial Optimisation Problems

We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic involves recursive coarsening to create a hierarchy of approximations to the

MultilevelRe nement

forCombinatorialOptimisationProblems

ChrisWalshaw

ComputingandMathematicalSciences,UniversityofGreenwich,

OldRoyalNavalCollege,Greenwich,London,SE109LS,UK.

Email:C.Walshaw@gre.ac.uk;URL:doc.guandang.net

MathematicsResearchReport:01/IM/73

June21,2001

Abstract

Weconsiderthemultilevelparadigmanditspotentialtoaidthesolutionofcombinatorialoptimisationproblems.Themultilevelparadigmisasimpleone,whichatitsmostbasicinvolvesrecursivecoarseningtocreateahierarchyofapproximationstotheoriginalproblem.Aninitialsolutionisfound(sometimesfortheoriginalproblem,sometimesatthecoarsestlevel)andtheniterativelyre nedateachlevel.Asageneralsolutionstrategythemultilevelprocedurehasbeeninuseformanyyearsandhasbeenappliedtomanyproblemareas(mostnotablymultigrid).However,withtheexceptionofthegraphpartitioningproblem,multileveltechniqueshavenotbeenwidelyappliedtocombinatorialoptimisationproblems.Inthispaperweaddresstheissueofmultilevelre nementforsuchproblemsand,withtheaidofexamplesandresultsingraphpartitioning,graphcolouringandthetravellingsalesmanproblem,makeacaseforitsuseasameta-heuristic.Theresultsprovidecompellingevidencethat,althoughthemultilevelframeworkcannotbeconsideredasapanaceaforcombinatorialproblems,itcanprovideausefuladditiontothecombinatorialoptimisationtoolkit.Wealsogiveapossibleexplanationfortheunderlyingprocessandextractsomegenericguidelinesforitsfutureuseonothercombinatorialproblems.

Keywords:MultilevelRe nement;CombinatorialOptimisation;Meta-heuristic;GraphPartitioning;TravellingSalesman;GraphColouring.

1Introduction

Inthispaperweconsiderthemultilevelparadigmanditspotentialtoaidthesolutionofcombinatorialoptimisationproblems.Themultilevelparadigmisasimpleone,whichatitsmostbasicinvolvesrecursivecoarseningtocreateahierarchyofapproximationstotheoriginalproblem.Aninitialsolutionisfound(sometimesfortheoriginalproblem,sometimesatthecoarsestlevel)andtheniterativelyre nedateachlevel.Projectionoperatorscantransferthesolutionfromoneleveltoanother.

Asageneralsolutionstrategythemultilevelprocedurehasbeeninuseformanyyearsandhasbeenap-pliedtomanyproblemareas(forexamplemultigridtechniquescanbeviewedasaprimeexampleofthemultilevelparadigm).Surveypaperssuchas[55]attesttoitsef cacy.However,withtheexceptionofthegraphpartitioningproblem,multileveltechniqueshavenotbeenwidelyappliedtocombinatorialoptimi-sationproblemsandinthispaperweconsidertheirpotentialbene ts.Inparticularweareinterestedinthebroadclassofdiscretesystems,witha nitebutusuallyexponentialnumberofstates,inwhichthe

1

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email