A novel Physarum-Based ant colony system for solving the real-world traveling salesman problem

The solutions to Traveling Salesman Problem can be widely applied in many real-world problems. Ant colony optimization algorithms can provide an approximate solution to a Traveling Salesman Problem. However, most ant colony optimization algorithms suffer premature convergence and low convergence rate. With these observations in mind, a novel ant colony system is proposed, which employs the unique feature of critical tubes reserved in the Physaurm-inspired mathematical model. A series of experiments are conducted, which are consolidated by two realworld Traveling Salesman Problems. The experimental results show that the proposed new ant colony system outperforms classical ant colony system, genetic algorithm, and particle swarm optimization algorithm in efficiency and robustness.

Extending scheduling algorithms to minimise the impact of bounded uncertainty using interval programming

 This research proposed a new methodology to extend algorithms to accept interval-based uncertain parameters. The methodology is applied on scheduling algorithms, including heuristic and meta-heuristic algorithms and produced optimal results with higher accuracy. The research outcomes are effective for decision making process using uncertain or predicted data.

A computational framework for uncertainty integration in stochastic unit commitment with intermittent renewable energy sources

The penetration of intermittent renewable energy sources (IRESs) into power grids has increased in the last decade. Integration of wind farms and solar systems as the major IRESs have significantly boosted the level of uncertainty in operation of power systems. This paper proposes a comprehensive computational framework for quantification and integration of uncertainties in distributed power systems (DPSs) with IRESs. Different sources of uncertainties in DPSs such as electrical load, wind and solar power forecasts and generator outages are covered by the proposed framework. Load forecast uncertainty is assumed to follow a normal distribution. Wind and solar forecast are implemented by a list of prediction intervals (PIs) ranging from 5% to 95%. Their uncertainties are further represented as scenarios using a scenario generation method. Generator outage uncertainty is modeled as discrete scenarios. The integrated uncertainties are further incorporated into a stochastic security-constrained unit commitment (SCUC) problem and a heuristic genetic algorithm is utilized to solve this stochastic SCUC problem. To demonstrate the effectiveness of the proposed method, five deterministic and four stochastic case studies are implemented. Generation costs as well as different reserve strategies are discussed from the perspectives of system economics and reliability. Comparative results indicate that the planned generation costs and reserves are different from the realized ones. The stochastic models show better robustness than deterministic ones. Power systems run a higher level of risk during peak load hours.

An enhanced fuzzy min-max neural network for pattern classification

An enhanced fuzzy min-max (EFMM) network is proposed for pattern classification in this paper. The aim is to overcome a number of limitations of the original fuzzy min-max (FMM) network and improve its classification performance. The key contributions are three heuristic rules to enhance the learning algorithm of FMM. First, a new hyperbox expansion rule to eliminate the overlapping problem during the hyperbox expansion process is suggested. Second, the existing hyperbox overlap test rule is extended to discover other possible overlapping cases. Third, a new hyperbox contraction rule to resolve possible overlapping cases is provided. Efficacy of EFMM is evaluated using benchmark data sets and a real medical diagnosis task. The results are better than those from various FMM-based models, support vector machine-based, Bayesian-based, decision tree-based, fuzzy-based, and neural-based classifiers. The empirical findings show that the newly introduced rules are able to realize EFMM as a useful model for undertaking pattern classification problems.

'Turning around' to the affordances of digital games: English curriculum and students' lifeworlds

The need for English and literacy curriculum to connect with young people's lifeworlds to build bridges and frames of reference that connect traditional English curriculum with digital texts and literacies, are increasing priorities in curriculum frameworks in Australia and elsewhere. This paper reports on a project in which the authors worked with teachers and students in five secondary schools to research the ways in which digital games might be incorporated into the English curriculum. Central to this endeavour was 'turning around' to the affordances of digital games and their paratexts to understand how they can be understood as text and action. Drawing on classroom observations and literature in Games Studies and English curriculum we present a timely model and innovative heuristic that we argue facilitates teachers incorporating digital games into their English classrooms. We illustrate how each assists teachers in 'turning around' to digital games to make their English classrooms more relevant to students' lifeworlds.

Hybrid technique of ant colony and particle swarm optimization for short term wind energy forecasting

Wind farms are producing a considerable portion of the world renewable energy. Since the output power of any wind farm is highly dependent on the wind speed, the power extracted from a wind park is not always a constant value. In order to have a non-disruptive supply of electricity, it is important to have a good scheduling and forecasting system for the energy output of any wind park. In this paper, a new hybrid swarm technique (HAP) is used to forecast the energy output of a real wind farm located in Binaloud, Iran. The technique consists of the hybridization of the ant colony optimization (ACO) and particle swarm optimization (PSO) which are two meta-heuristic techniques under the category of swarm intelligence. The hybridization of the two algorithms to optimize the forecasting model leads to a higher quality result with a faster convergence profile. The empirical hourly wind power output of Binaloud Wind Farm for 364 days is collected and used to train and test the prepared model. The meteorological data consisting of wind speed and ambient temperature is used as the inputs to the mathematical model. The results indicate that the proposed technique can estimate the output wind power based on the wind speed and the ambient temperature with an MAPE of 3.513%.

Experiences in developing a micro-payment system for peer-to-peer networks

Micro-payment systems are an important part of peer-to-peer (P2P) networks and address the "free-rider" problem in most existing content sharing systems. To address this issue, the authors have developed a new micro-payment system for content sharing in P2P networks called P2P-Netpay. This is an offline, debit based protocol that provides a secure, flexible, usable and reliable credit service. This article compares micro-payment with non-micro-payment credit systems for file sharing applications and finds that this approach liberates the "free-rider" problem. The authors analyse the heuristic evaluation performed by a set of evaluators and present directions for research aiming to improve the overall satisfaction and efficiency of the proposed model.

Lingo: linearized grassmannian optimization for nuclear norm minimization

As a popular heuristic to the matrix rank minimization problem, nuclear norm minimization attracts intensive research attentions. Matrix factorization based algorithms can reduce the expensive computation cost of SVD for nuclear norm minimization. However, most matrix factorization based algorithms fail to provide the theoretical guarantee for convergence caused by their non-unique factorizations. This paper proposes an efficient and accurate Linearized Grass-mannian Optimization (Lingo) algorithm, which adopts matrix factorization and Grassmann manifold structure to alternatively minimize the subproblems. More specially, linearization strategy makes the auxiliary variables unnecessary and guarantees the close-form solution for low periteration complexity. Lingo then converts linearized objective function into a nuclear norm minimization over Grass-mannian manifold, which could remedy the non-unique of solution for the low-rank matrix factorization. Extensive comparison experiments demonstrate the accuracy and efficiency of Lingo algorithm. The global convergence of Lingo is guaranteed with theoretical proof, which also verifies the effectiveness of Lingo.

Optimal VM placement in data centres with architectural and resource constraints

Recent advance in virtualisation technology enables service provisioning in a flexible way by consolidating several virtual machines (VMs) into a single physical machine (PM). The inter-VM communications are inevitable when a group of VMs in a data centre provide services in a collaborative manner. With the increasing demands of such intra-data-centre traffics, it becomes essential to study the VM-to-PM placement such that the aggregated communication cost within a data centre is minimised. Such optimisation problem is proved NP-hard and formulated as an integer programming with quadratic constraints in this paper. Different from existing work, our formulation takes into consideration of data-centre architecture, inter-VM traffic pattern, and resource capacity of PMs. Furthermore, a heuristic algorithm is proposed and its high efficiency is extensively validated.