Extending process-network synthesis algorithms with time bounds for supply network design

Károly Kalauz, Zoltán Süle, Botond Bertók, Ferenc Friedler, L. T. Fan

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

It is highly desirable to develop a software for estimating the quality of supply networks and synthesizing potential alternative realizations to improve the quality of service or to satisfy service level agreements. In the present paper, methodology, algorithm, and software are proposed to improve supply networks where the quality is measured by cost and response time. The methodology is based on the combinatorial foundations of algorithmic process synthesis. Structure generation and evaluation of a supply scenario are the two major steps of the algorithm elaborated for synthesizing the optimal network structure. The algorithm, besides generating alternative structures, takes into account alternative orders of the activities as well. The structural alternatives are evaluated on the basis of the cost and duration of each individual operation. The cost and response time for a single operation are expressed as concave functions of its volume.

Original languageEnglish
Pages (from-to)259-264
Number of pages6
JournalChemical Engineering Transactions
Volume29
DOIs
Publication statusPublished - 2012

ASJC Scopus subject areas

  • Chemical Engineering(all)

Fingerprint Dive into the research topics of 'Extending process-network synthesis algorithms with time bounds for supply network design'. Together they form a unique fingerprint.

  • Cite this