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

Alexandros M. Strouvalis, Istvan Heckl, Ferenc Friedler, Antonis C. Kokossis

Research output: Contribution to journalArticle

4 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)617-630
Number of pages14
JournalComputers and Chemical Engineering
Volume26
Issue number4-5
DOIs
Publication statusPublished - May 15 2002

    Fingerprint

Keywords

  • Hardware composites
  • MILP solvers
  • Maintenance scheduling
  • Operational planning
  • Turbine networks

ASJC Scopus subject areas

  • Chemical Engineering(all)
  • Computer Science Applications

Cite this