Graph-theoretic approach to optimal synthesis of supply networks: Distribution of gasoline from a refinery

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 364
  • Download : 0
The synthesis of a supply network is profoundly conveluted because of its combinatorial complexity. Global or even near optimal solutions are, more often than not, unobtainable through the heuristic methods. On the other hand, the majority of the algorithmic methods, which mainly resort to mixed integer programming, in theory, can give rise to global optima; however, they are effective only for relatively minute networks. Obviously, it is highly desirable that a novel paradigm be established for optimally synthesizing supply networks; the adoption of the graph-theoretic method based on P-graphs (process graphs) is proposed herein for the synthesis of optimal supply networks. The proposed method is illustrated with examples. Each example has yielded simultaneously the optimal and near optimal structures of the supply network performing a specific task in the ranked order. The example reveals a unique feature of the method.
Publisher
ESCAPE
Issue Date
2008-06
Language
ENG
Citation

ESCAPE 18, 18th European Symposium on Computer Aided Process Engineering, v.25, pp.247 - 252

URI
http://hdl.handle.net/10203/163127
Appears in Collection
CBE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0