Synthesis of regional networks for biomass and biofuel production Hon Loong Lam
, 2010, dissertation
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
Published: 06.01.2011; Views: 2469; Downloads: 83
Full text (4,25 MB)
Modelling medium access control in IEEE 802.15.4 nonbeacon-enabled networks with probabilistic timed automataTatjana Kapus
, original scientific article
Abstract: This paper concerns the formal modelling of medium access control in nonbeacon-enabled IEEE 802.15.4 wireless personal area networks with probabilistic timed automata supported by the PRISM probabilistic model checker. In these networks, the devices contend for the medium by executing an unslotted carrier sense multiple access with collision avoidance algorithm. In the literature, a model of a network which consists of two stations sending data to two different destination stations is introduced. We have improved this model and, based on it, we propose two ways of modelling a network with an arbitrary number of sending stations, each having its own destination. We show that the same models are valid representations of a star-shaped network with an arbitrary number of stations which send data to the same destination station. We also propose how to model such a network if some of the sending stations are not within radio range of the others, i.e. if they are hidden. We present some results obtained for these models by probabilistic model checking using PRISM.
Keywords: wireless personal area network, medium access control, hidden station, formal specification, probabilistic model checking
Published: 15.06.2017; Views: 240; Downloads: 96
Full text (2,25 MB)
This document has many files! More...
Multiphase approach to developing model of logistics for coastal tourist destinationsSanja Bauk
, Željko Ivanović
, 2016, independent scientific component part or a chapter in a monograph
Abstract: The process of urbanization of coastal tourist destinations (CTDs) is taking place at high speed and at the same time creating a lot of complex problems. The positive trend of urbanization has resulted in increased volume of freight transport which leads to burdening the traffic network, time losses and causes traffic congestion problems on the streets with increased environmental pollution due to emissions, noise and vibration. These findings brought to some research being started on the EU level, aiming to develop new logistic solutions, so these areas could be developed on a sustainable basis. With this in mind, the paper proposes a method of developing a novel model of logistics (MoL) for CTDs through several stages. The point of proposed MoL lies in achieving optimal connectivity of transportation, warehousing and physical distribution of goods, and making it a single functional model, so as to allow simultaneous optimization of logistic processes in a CTD, and to incorporate logistics in tourist offer.
Keywords: coastal tourist destinations, urbanization, traffic network, sustainable logistic solutions, model of logistics, optimization
Published: 09.05.2018; Views: 163; Downloads: 92
Full text (445,23 KB)
This document has many files! More...