Novel approach for integrated biomass supply chain synthesis and optimisation

Despite looming energy crises, fossil resources are still widely used for energy and chemical production. Growing awareness of the environmental impact from fossil fuels has made sustainability one of the main focuses in research and development. Towards that end, biomass is identified as a promising renewable source of carbon that can potentially replace fossil resources in energy and chemical productions. Although many researches on converting biomass to value-added product have been done, biomass is still considered underutilised in the industry. This is mainly due to challenges in the logistic and processing network of biomass. An integrated biomass supply chain synthesis and optimisation are therefore important. Thus, the ultimate goal of this thesis is to develop a novel approach for an integrated biomass supply chain. Firstly, a multiple biomass corridor (MBC) concept is presented to integrate various biomass and processing technologies into existing biomass supply chain system in urban and developed regions. Based on this approach, a framework is developed for the synthesis of a more diversified and economical biomass supply chain system. The work is then extended to consider the centralisation and decentralisation of supply chain structure. In this manner, P-graph-aided decomposition approach (PADA) is proposed, whereby it divides the complex supply chain problem into two smaller sub-problems – the processing network is solved via mixed-integer linear programming (MILP) model, whereas the binaries-intensive logistic network configuration is determined through P-graph framework. As existing works often focus on supply chain synthesis in urban regions with well-developed infrastructure, resources integrated network (RIN) – a novel approach for the synthesis of integrated biomass supply chain in rural and remote regions is introduced to enhance rural economies. This approach incorporates multiple resources (i.e. bioresources, food commodities, rural communities’ daily needs) into the value chain and utilises inland water system as the mode of transport, making the system more economically feasible. It extends the MBC approach for technology selection and adopts vehicle routing problem (VRP) for inland water supply and delivery network. To evaluate the performance of the proposed integrated biomass supply chain system, a FANP-based (fuzzy analytical network process) sustainability assessment tool is established. A framework is proposed to derive sustainability index (SI) from pairwise comparison done by supply chain stakeholders to assess the sustainability of a system. Fuzzy limits are introduced to reduce uncertainties in human judgment while conducting the pairwise comparison. To design a sustainable integrated biomass supply chain, a FANP-aided, a novel multiple objectives optimisation framework is proposed. This approach transforms multiple objective functions into single objective function by prioritising each of the objective through the FANP framework. The multiple objectives are then normalised via max-min aggregation to ensure the trade-off between objectives is performed on the same scale. At the end of this thesis, viable future works of the whole programme is presented for consideration

Novel approach for integrated biomass supply chain synthesis and optimisation

Despite looming energy crises, fossil resources are still widely used for energy and chemical production. Growing awareness of the environmental impact from fossil fuels has made sustainability one of the main focuses in research and development. Towards that end, biomass is identified as a promising renewable source of carbon that can potentially replace fossil resources in energy and chemical productions. Although many researches on converting biomass to value-added product have been done, biomass is still considered underutilised in the industry. This is mainly due to challenges in the logistic and processing network of biomass. An integrated biomass supply chain synthesis and optimisation are therefore important. Thus, the ultimate goal of this thesis is to develop a novel approach for an integrated biomass supply chain. Firstly, a multiple biomass corridor (MBC) concept is presented to integrate various biomass and processing technologies into existing biomass supply chain system in urban and developed regions. Based on this approach, a framework is developed for the synthesis of a more diversified and economical biomass supply chain system. The work is then extended to consider the centralisation and decentralisation of supply chain structure. In this manner, P-graph-aided decomposition approach (PADA) is proposed, whereby it divides the complex supply chain problem into two smaller sub-problems – the processing network is solved via mixed-integer linear programming (MILP) model, whereas the binaries-intensive logistic network configuration is determined through P-graph framework. As existing works often focus on supply chain synthesis in urban regions with well-developed infrastructure, resources integrated network (RIN) – a novel approach for the synthesis of integrated biomass supply chain in rural and remote regions is introduced to enhance rural economies. This approach incorporates multiple resources (i.e. bioresources, food commodities, rural communities’ daily needs) into the value chain and utilises inland water system as the mode of transport, making the system more economically feasible. It extends the MBC approach for technology selection and adopts vehicle routing problem (VRP) for inland water supply and delivery network. To evaluate the performance of the proposed integrated biomass supply chain system, a FANP-based (fuzzy analytical network process) sustainability assessment tool is established. A framework is proposed to derive sustainability index (SI) from pairwise comparison done by supply chain stakeholders to assess the sustainability of a system. Fuzzy limits are introduced to reduce uncertainties in human judgment while conducting the pairwise comparison. To design a sustainable integrated biomass supply chain, a FANP-aided, a novel multiple objectives optimisation framework is proposed. This approach transforms multiple objective functions into single objective function by prioritising each of the objective through the FANP framework. The multiple objectives are then normalised via max-min aggregation to ensure the trade-off between objectives is performed on the same scale. At the end of this thesis, viable future works of the whole programme is presented for consideration

Evolving comprehensible and scalable solvers using CGP for solving some real-world inspired problems

My original contribution to knowledge is the application of Cartesian Genetic Programming to design some scalable and human-understandable metaheuristics automatically; those find some suitable solutions for real-world NP-hard and discrete problems. This technique is thought to possess the ability to raise the generality of a problem-solving process, allowing some supervised machine learning tasks and being able to evolve non-deterministic algorithms. \\ Two extensions of Cartesian Genetic Programming are presented. Iterative My original contribution to knowledge is the application of Cartesian Genetic Programming to design some scalable and human-understandable metaheuristics automatically; those find some suitable solutions for real-world NP-hard and discrete problems. This technique is thought to possess the ability to raise the generality of a problem-solving process, allowing some supervised machine learning tasks and being able to evolve non-deterministic algorithms. \\ Two extensions of Cartesian Genetic Programming are presented. Iterative Cartesian Genetic Programming can encode loops and nested loop with their termination criteria, making susceptible to evolutionary modification the whole programming construct. This newly developed extension and its application to metaheuristics are demonstrated to discover effective solvers for NP-hard and discrete problems. This thesis also extends Cartesian Genetic Programming and Iterative Cartesian Genetic Programming to adapt a hyper-heuristic reproductive operator at the same time of exploring the automatic design space. It is demonstrated the exploration of an automated design space can be improved when specific types of active and non-active genes are mutated. \\ A series of rigorous empirical investigations demonstrate that lowering the comprehension barrier of automatically designed algorithms can help communicating and identifying an effective and ineffective pattern of primitives. The complete evolution of loops and nested loops without imposing a hard limit on the number of recursive calls is shown to broaden the automatic design space. Finally, it is argued the capability of a learning objective function to assess the scalable potential of a generated algorithm can be beneficial to a generative hyper-heuristic

Towards adaptive and autonomous humanoid robots: from vision to actions

Although robotics research has seen advances over the last decades robots are still not in widespread use outside industrial applications. Yet a range of proposed scenarios have robots working together, helping and coexisting with humans in daily life. In all these a clear need to deal with a more unstructured, changing environment arises. I herein present a system that aims to overcome the limitations of highly complex robotic systems, in terms of autonomy and adaptation. The main focus of research is to investigate the use of visual feedback for improving reaching and grasping capabilities of complex robots. To facilitate this a combined integration of computer vision and machine learning techniques is employed. From a robot vision point of view the combination of domain knowledge from both imaging processing and machine learning techniques, can expand the capabilities of robots. I present a novel framework called Cartesian Genetic Programming for Image Processing (CGP-IP). CGP-IP can be trained to detect objects in the incoming camera streams and successfully demonstrated on many different problem domains. The approach requires only a few training images (it was tested with 5 to 10 images per experiment) is fast, scalable and robust yet requires very small training sets. Additionally, it can generate human readable programs that can be further customized and tuned. While CGP-IP is a supervised-learning technique, I show an integration on the iCub, that allows for the autonomous learning of object detection and identification. Finally this dissertation includes two proof-of-concepts that integrate the motion and action sides. First, reactive reaching and grasping is shown. It allows the robot to avoid obstacles detected in the visual stream, while reaching for the intended target object. Furthermore the integration enables us to use the robot in non-static environments, i.e. the reaching is adapted on-the- fly from the visual feedback received, e.g. when an obstacle is moved into the trajectory. The second integration highlights the capabilities of these frameworks, by improving the visual detection by performing object manipulation actions

Evolving Problem Heuristics with On-line ACGP

Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. The sufficiency principle requires that the set be sufficient to label the desired solution trees, often forcing the user to enlarge the set, thus also enlarging the search space. Structure-preserving crossover, STGP, CGP, and CFG-based GP give the user the power to reduce the space by specifying rules for valid tree construction: types, syntax, and heuristics. However, in general the user may not be aware of the best representation space, including heuristics, to solve a particular problem. Recently, the ACGP methodology for extracting problem-specific heuristics, and thus for learning model of the problem domain, was introduced with preliminary off-line results. This paper overviews ACGP, pointing out its strength and limitations in the off-line mode. It then introduces a new on-line model, for learning while solving a problem, illustrated with experiments involving the multiplexer and the Santa Fe trail