An accelerated Branch-and-Bound algorithm for assignment problems of utility systems.pdfVIP

下载本文档

4
0
约4.31万字
约 14页
2017-04-05 发布于江苏
举报
版权申诉

An accelerated Branch-and-Bound algorithm for assignment problems of utility systems.pdf

1、本文档共14页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

An accelerated Branch-and-Bound algorithm for assignment problems of utility systems

Computers and Chemical Engineering 26 (2002) 617–630 An accelerated Branch-and-Bound algorithm for assignment problems of utility systems Alexandros M. Strouvalis a, Istvan Heckl b, Ferenc Friedler b, Antonis C. Kokossis c,* a Department of Process Integration, Uniersity of Manchester, Institute of Science and Technology, PO Box 88, Manchester M60 1QD, UK b Department of Computer Science, Uniersity of Veszpre?m, Egyetem u.10, Veszpre?m H-8200, Hungary c Department of Chemical and Process Engineering, School of Engineering in the Enironment, Uniersity of Surrey, Guildford GU2 7XH, UK Abstract A methodology is proposed for implementing logic and engineering knowledge within a Branch-and-Bound algorithm and with a purpose to accelerate convergence. The development addresses assignment problems of utility networks with an emphasis on the optimal allocation of units for maintenance problems. Proposed criteria are presented to automatically tailor the solution strategy and fully customise the optimisation solver. Model and problem properties are exploited to reduce the solution space, prioritise the branching of nodes, calculate lower bounds, and prune inferior parts of the binary tree. Comparisons with commercial MILP solvers demonstrate the significant merits of customising the solution search engine to the particular solution space. Extraction of knowledge and analysis of operations is conceptually supported by the graphical environment of the Hardware Composites. ? 2002 Published by Elsevier Science Ltd. Keywords: Turbine networks; Maintenance scheduling; Operational planning; MILP solvers; Hardware composites /locate/compchemeng 1. Introduction The impact of Mathematical Programming proves significant through a wide range of applications. Opera- tions Research groups developed and contributed con- siderable part of the available optimisation tools. At their best, they epitomise general theoretical, computa- tional and numerical knowledge in relevance to the diffe