Efficiency Analysis of Swarm Intelligence and Randomization Techniques

Swarm intelligence has becoming a powerful technique in solving design and scheduling tasks. Metaheuristic algorithms are an integrated part of this paradigm, and particle swarm optimization is often viewed as an important landmark. The outstanding performance and efficiency of swarm-based algorithms inspired many new developments, though mathematical understanding of metaheuristics remains partly a mystery. In contrast to the classic deterministic algorithms, metaheuristics such as PSO always use some form of randomness, and such randomization now employs various techniques. This paper intends to review and analyze some of the convergence and efficiency associated with metaheuristics such as firefly algorithm, random walks, and L\'evy flights. We will discuss how these techniques are used and their implications for further research.Comment: 10 pages. arXiv admin note: substantial text overlap with arXiv:1212.0220, arXiv:1208.0527, arXiv:1003.146

06061 Abstracts Collection -- Theory of Evolutionary Algorithms

From 05.02.06 to 10.02.06, the Dagstuhl Seminar 06061 ``Theory of Evolutionary Algorithms\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

The multiple pheromone Ant clustering algorithm

Ant Colony Optimisation algorithms mimic the way ants use pheromones for marking paths to important locations. Pheromone traces are followed and reinforced by other ants, but also evaporate over time. As a consequence, optimal paths attract more pheromone, whilst the less useful paths fade away. In the Multiple Pheromone Ant Clustering Algorithm (MPACA), ants detect features of objects represented as nodes within graph space. Each node has one or more ants assigned to each feature. Ants attempt to locate nodes with matching feature values, depositing pheromone traces on the way. This use of multiple pheromone values is a key innovation. Ants record other ant encounters, keeping a record of the features and colony membership of ants. The recorded values determine when ants should combine their features to look for conjunctions and whether they should merge into colonies. This ability to detect and deposit pheromone representative of feature combinations, and the resulting colony formation, renders the algorithm a powerful clustering tool. The MPACA operates as follows: (i) initially each node has ants assigned to each feature; (ii) ants roam the graph space searching for nodes with matching features; (iii) when departing matching nodes, ants deposit pheromones to inform other ants that the path goes to a node with the associated feature values; (iv) ant feature encounters are counted each time an ant arrives at a node; (v) if the feature encounters exceed a threshold value, feature combination occurs; (vi) a similar mechanism is used for colony merging. The model varies from traditional ACO in that: (i) a modified pheromone-driven movement mechanism is used; (ii) ants learn feature combinations and deposit multiple pheromone scents accordingly; (iii) ants merge into colonies, the basis of cluster formation. The MPACA is evaluated over synthetic and real-world datasets and its performance compares favourably with alternative approaches

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

An Intelligent Mobility Prediction Scheme for Location-Based Service over Cellular Communications Network

One of the trickiest challenges introduced by cellular communications networks is mobility prediction for Location Based-Services (LBSs). Hence, an accurate and efficient mobility prediction technique is particularly needed for these networks. The mobility prediction technique incurs overheads on the transmission process. These overheads affect properties of the cellular communications network such as delay, denial of services, manual filtering and bandwidth. The main goal of this research is to enhance a mobility prediction scheme in cellular communications networks through three phases. Firstly, current mobility prediction techniques will be investigated. Secondly, innovation and examination of new mobility prediction techniques will be based on three hypothesises that are suitable for cellular communications network and mobile user (MU) resources with low computation cost and high prediction success rate without using MU resources in the prediction process. Thirdly, a new mobility prediction scheme will be generated that is based on different levels of mobility prediction. In this thesis, a new mobility prediction scheme for LBSs is proposed. It could be considered as a combination of the cell and routing area (RA) prediction levels. For cell level prediction, most of the current location prediction research is focused on generalized location models, where the geographic extent is divided into regular-shape cells. These models are not suitable for certain LBSs where the objectives are to compute and present on-road services. Such techniques are the New Markov-Based Mobility Prediction (NMMP) and Prediction Location Model (PLM) that deal with inner cell structure and different levels of prediction, respectively. The NMMP and PLM techniques suffer from complex computation, accuracy rate regression and insufficient accuracy. In this thesis, Location Prediction based on a Sector Snapshot (LPSS) is introduced, which is based on a Novel Cell Splitting Algorithm (NCPA). This algorithm is implemented in a micro cell in parallel with the new prediction technique. The LPSS technique, compared with two classic prediction techniques and the experimental results, shows the effectiveness and robustness of the new splitting algorithm and prediction technique. In the cell side, the proposed approach reduces the complexity cost and prevents the cell level prediction technique from performing in time slots that are too close. For these reasons, the RA avoids cell-side problems. This research discusses a New Routing Area Displacement Prediction for Location-Based Services (NRADP) which is based on developed Ant Colony Optimization (ACO). The NRADP, compared with Mobility Prediction based on an Ant System (MPAS) and the experimental results, shows the effectiveness, higher prediction rate, reduced search stagnation ratio, and reduced computation cost of the new prediction technique

A multi-agent optimisation model for solving supply network configuration problems

Supply chain literature highlights the increasing importance of effective supply network configuration decisions that take into account such realities as market turbulence and demand volatility, as well as ever-expanding global production networks. These realities have been extensively discussed in the supply network literature under the structural (i.e., physical characteristics), spatial (i.e., geographical positions), and temporal (i.e., changing supply network conditions) dimensions. Supply network configuration decisions that account for these contingencies are expected to meet the evolving needs of consumers while delivering better outcomes for all parties involved and enhancing supply network performance against the key metrics of efficiency, speed and responsiveness. However, making supply network configuration decisions in the situations described above is an ongoing challenge. Taking a systems perspective, supply networks are typically viewed as socio-technical systems where SN entities (e.g., suppliers, manufacturers) are autonomous individuals with distinct goals, practices and policies, physically inter-connected transferring goods (e.g., raw materials, finished products), as well as socially connected with formal and informal interactions and information sharing. Since the structure and behaviour of such social and technical sub-systems of a supply network, as well as the interactions between those subsystems, determine the overall behaviour of the supply network, both systems should be considered in analysing the overall system

Multiagent Optimization Approach to Supply Network Configuration Problems With Varied Product-Market Profiles

IEEE This article demonstrates the application of a novel multiagent modeling approach to support supply network configuration (SNC) decisions toward addressing several challenges reported in the literature. These challenges include: enhancing supply network (SN)-level performance in alignment with the goals of individual SN entities; addressing the issue of limited information sharing between SN entities; and sustaining competitiveness of SNs in dynamic business environments. To this end, a multistage, multiechelon SN consisting of geographically dispersed SN entities catering to distinct product-market profiles was modeled. In modeling the SNC decision problem, two types of agents, each having distinct attributes and functions, were used. The modeling approach incorporated a reverse-auctioning process to simulate the behavior of SN entities with differing individual goals collectively contributing to enhance SN-level performance, by means of setting reserve values generated through the application of a genetic algorithm. A set of Pareto-optimal SNCs catering to distinct product-market profiles was generated using Nondominated Sorting Genetic Algorithm II. Further evaluation of these SNCs against additional criteria, using a rule-based approach, allowed the selection of the most appropriate SNC to meet a broader set of conditions. The model was tested using a refrigerator SN case study drawn from the literature. The results reveal that a number of SNC decisions can be supported by the proposed model, in particular, identifying and evaluating robust SNs to suit varied product-market profiles, enhancing SC capabilities to withstand disruptions and developing contingencies to recover from disruptions

Bio-inspired Medium Access Control for Wireless Sensor Networks

This thesis studies the applications of biologically inspired algorithms and behaviours to the Medium Access Control (MAC) layer of Wireless Sensor Networks (WSNs). By exploring the similarity between a general communications channel and control engineering theory, we propose a simple method to control transmissions that we refer to as transmission delay. We use this concept and create a protocol inspired by Particle Swarm Optimisation (PSO) to optimise the communications. The lessons learned from this protocol inspires us to move closer to behaviours found in nature and the Emergence MAC (E-MAC) protocol is presented. The E-MAC protocol shows emergent behaviours arising from simple interactions and provides great throughput, low end-to-end delay and high fairness. Enhancements to this protocol are later proposed. We empirically evaluate these protocols and provide relevant parameter sweeps to show their performance. We also provide a theoretical approach to proving the settling properties of E-MAC. The presented protocols and methods provide a different approach towards MAC in WSNs

Multi-objective optimisation of safety-critical hierarchical systems

Achieving high reliability, particularly in safety critical systems, is an important and often mandatory requirement. At the same time costs should be kept as low as possible. Finding an optimum balance between maximising a system's reliability and minimising its cost is a hard combinatorial problem. As the size and complexity of a system increases, so does the scale of the problem faced by the designers. To address these difficulties, meta-heuristics such as Genetic Algorithms and Tabu Search algorithms have been applied in the past for automatically determining the optimal allocation of redundancies in a system as a mechanism for optimising the reliability and cost characteristics of that system. In all cases, simple reliability block diagrams with restrictive assumptions, such as failure independence and limited 2-state failure modes, were used for evaluating the reliability of the candidate designs produced by the various algorithms.This thesis argues that a departure from this restrictive evaluation model is possible by using a new model-based reliability evaluation technique called Hierachically Performed Hazard Origin and Propagation Studies (HiP-HOPS). HiP-HOPS can overcome the limitations imposed by reliability block diagrams by providing automatic analysis of complex engineering models with multiple failure modes. The thesis demonstrates that, used as the fitness evaluating component of a multi-objective Genetic Algorithm, HiP-HOPS can be used to solve the problem of redundancy allocation effectively and with relative efficiency. Furthermore, the ability of HiP-HOPS to model and automatically analyse complex engineering models, with multiple failure modes, allows the Genetic Algorithm to potentially optimise systems using more flexible strategies, not just series-parallel. The results of this thesis show the feasibility of the approach and point to a number of directions for future work to consider

Holistic, data-driven, service and supply chain optimisation: linked optimisation.

The intensity of competition and technological advancements in the business environment has made companies collaborate and cooperate together as a means of survival. This creates a chain of companies and business components with unified business objectives. However, managing the decision-making process (like scheduling, ordering, delivering and allocating) at the various business components and maintaining a holistic objective is a huge business challenge, as these operations are complex and dynamic. This is because the overall chain of business processes is widely distributed across all the supply chain participants; therefore, no individual collaborator has a complete overview of the processes. Increasingly, such decisions are automated and are strongly supported by optimisation algorithms - manufacturing optimisation, B2B ordering, financial trading, transportation scheduling and allocation. However, most of these algorithms do not incorporate the complexity associated with interacting decision-making systems like supply chains. It is well-known that decisions made at one point in supply chains can have significant consequences that ripple through linked production and transportation systems. Recently, global shocks to supply chains (COVID-19, climate change, blockage of the Suez Canal) have demonstrated the importance of these interdependencies, and the need to create supply chains that are more resilient and have significantly reduced impact on the environment. Such interacting decision-making systems need to be considered through an optimisation process. However, the interactions between such decision-making systems are not modelled. We therefore believe that modelling such interactions is an opportunity to provide computational extensions to current optimisation paradigms. This research study aims to develop a general framework for formulating and solving holistic, data-driven optimisation problems in service and supply chains. This research achieved this aim and contributes to scholarship by firstly considering the complexities of supply chain problems from a linked problem perspective. This leads to developing a formalism for characterising linked optimisation problems as a model for supply chains. Secondly, the research adopts a method for creating a linked optimisation problem benchmark by linking existing classical benchmark sets. This involves using a mix of classical optimisation problems, typically relating to supply chain decision problems, to describe different modes of linkages in linked optimisation problems. Thirdly, several techniques for linking supply chain fragmented data have been proposed in the literature to identify data relationships. Therefore, this thesis explores some of these techniques and combines them in specific ways to improve the data discovery process. Lastly, many state-of-the-art algorithms have been explored in the literature and these algorithms have been used to tackle problems relating to supply chain problems. This research therefore investigates the resilient state-of-the-art optimisation algorithms presented in the literature, and then designs suitable algorithmic approaches inspired by the existing algorithms and the nature of problem linkages to address different problem linkages in supply chains. Considering research findings and future perspectives, the study demonstrates the suitability of algorithms to different linked structures involving two sub-problems, which suggests further investigations on issues like the suitability of algorithms on more complex structures, benchmark methodologies, holistic goals and evaluation, processmining, game theory and dependency analysis