| Title: | Synthesis of regional networks for biomass and biofuel production |
|---|
| Authors: | ID Lam, Hon Loong (Author)
ID Kravanja, Zdravko (Mentor) More about this mentor... 
ID Klemeš, Jiří (Comentor) |
|---|
| Files: |  DR_Lam_Hon_Loong_2011.pdf (4,25 MB)
MD5: 6DD0B7A10F49E3DC8E6052065FF7FE4B
PID: 20.500.12556/dkum/ed1ce14f-691b-4658-b3a5-5531a8d8eef1
|
|---|
| Language: | English |
|---|
| Work type: | Dissertation |
|---|
| Organization: | FKKT - Faculty of Chemistry and Chemical Engineering
|
|---|
| Abstract: | This thesis presents two different approaches to the synthesis of regional networks for biomass and biofuel production and supply: Mathematical Programming and Graph Theoretic approach. The optimisation criterion for both approaches is the maximisation of profit.
The first approach is based on a generic optimisation model of biomass production and supply networks. This superstructure approach is based on a flexible number of network layers: plantation, collection using a pre-treatment, process, and consumption. A Mixed Integer Linear Programming (MILP) model has been successfully developed during this work.
However, the solution of this biomass production network model is very challenging due to the large sizes of the networks and the number of interconnections. The huge number of redundant variables reduces model efficiency (time taken to solve the model and the interpretation of the results). This model when representing very large size networks cannot be solved over a reasonable time even by professional mathematical programming software tools. Several model-size reduction techniques are therefore proposed for the solution of large-scale networks. In particular, methods are proposed for (i) reducing the connectivity within a biomass supply chain network by setting the maximum allowable distance between the supply zones to the collection centres, (ii) eliminating unnecessary variables and constrains to reduce the zero-flows in the full model, and (iii) aggregating the network and hence the synthesis process by merging the collection centres.
The network synthesis is also carried out by P-graph (Process Graph) tools. P-graph is a directed bipartite graph, having two types of vertices — one for operating units and another for those objects representing material or energy flows/quantities. In this procedure, firstly a maximum feasible superstructure for biomass production network is generated from which the optimal structure is then selected by the Branch and Bound method. This graph-based method clearly shows where, how, and what kind of material and energy carriers will be transferred from one supply chain layer to another.
In order to test the efficiency of the model, a small regional renewable network problem was solved using both methods. Their performances were tested and the results confirmed the applicability on a regional scale. The proposed model-size reduction techniques were also tested. A large-scale regional case study was created to demonstrate these techniques. The results are very positive and some suggestions for future work are given in the conclusion. |
|---|
| Keywords: | Biomass and bioenergy network synthesis, Model-size reduction
techniques, Mathematical Programming, MILP, P-Graph |
|---|
| Place of publishing: | Maribor |
|---|
| Publisher: | [H. L. Lam] |
|---|
| Year of publishing: | 2010 |
|---|
| PID: | 20.500.12556/DKUM-17206 |
|---|
| UDC: | 66.011:519.68(043.3) |
|---|
| COBISS.SI-ID: | 254123008 |
|---|
| NUK URN: | URN:SI:UM:DK:HLEIDZBC |
|---|
| Publication date in DKUM: | 06.01.2011 |
|---|
| Views: | 3905 |
|---|
| Downloads: | 151 |
|---|
| Metadata: |    |
|---|
| Categories: | KTFMB - FKKT
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
