Discrete particle swarm optimization based on estimation of distribution for terminal assignment problems

Terminal assignment problem (TEAP) is to determine minimum cost links to form a network by connecting a given set of terminals to a given collection of concentrators. This paper presents a novel discrete particle swarm optimization (PSO) based on estimation of distribution (EDA), named DPSO-EDA, for TEAP. EDAs sample new solutions from a probability model which characterizes the distribution of promising solutions in the search space at each generation. The DPSO-EDA incorporates the global statistical information collected from personal best solutions of all particles into the PSO, and therefore each particle has comprehensive learning and search ability. In the DPSO-EDA, a modified constraint handling method based on Hopfield neural network (HNN) is also introduced to fit nicely into the framework of the PSO and thus utilize the merit of the PSO. The DPSO-EDA adopts the asynchronous updating scheme. Further, the DPSO-EDA is applied to a problem directly related to TEAP, the task assignment problem (TAAP), in order to show that the DPSO-EDA can be generalized to other related combinatorial optimization problems. Simulation results on several problem instances show that the DPSO-EDA is better than previous methods.     

A new approach to the prediction of passenger flow in a transit system

A non-linear model is proposed for predicting the rate of passenger flow in a transit system, and its chaotic characteristic is observed. Using wavelets analysis, the passenger flow data for a whole day are decomposed in a multi-scale way to obtain decomposition sequences. Subsequently, a neural network approach is used to predict the sequences. Finally the passenger flow value can be predicted when the predicted sequences are reconstructed. Results show that the present approach is a feasible method for passenger flow prediction.     

Ordered mesoporous Pd/SnO2 synthesized by a nanocasting route for high hydrogen sensing performance

Ordered mesoporous SnO₂ and mesoporous Pd/SnO₂ have been successfully synthesized via nanocasting method using the hexagonal mesoporous SBA-15 as template. Two different procedures, impregnation technique and direct synthesis, were utilized for the doping of Pd in the mesoporous SnO₂. The results of small angle X-ray diffraction (SAXD), nitrogen adsorption–desorption and transmission electron microscopy (TEM) demonstrate that the SnO₂ and Pd/SnO₂ display ordered mesoporous structures and high surface areas. Wide angle X-ray diffraction (WAXD) and X-ray photoelectron spectroscopy (XPS) reveal tetragonal structure of SnO₂ and the existence of Pd element. The sensing properties of mesoporous SnO₂ and mesoporous Pd/SnO₂ for H₂ were detected. The sensor utilizing mesoporous Pd/SnO₂ via direct synthesis method exhibits excellent response and recovery behavior and much higher sensitivity to H₂, compared to those using mesoporous SnO₂ and mesoporous Pd/SnO₂ via impregnation technique. It is believed that its high gas sensing performance is derived from the large surface area, high activity and well dispersion of Pd additive, as well as high porosity, which lead to highly effective surface interaction between the target gas molecules and the surface active sites.     

A belief-rule-based inventory control method under nonstationary and uncertain demand

This paper is devoted to investigating inventory control problems under nonstationary and uncertain demand. A belief-rule-based inventory control (BRB-IC) method is developed, which can be applied in situations where demand and demand-forecast-error (DFE) do not follow certain stochastic distribution and forecasting demand is given in single-point or interval styles. The method can assist decision-making through a belief-rule structure that can be constructed, initialized and adjusted using both manager’s knowledge and operational data. An extended optimal base stock (EOBS) policy is proved for initializing the belief-rule-base (BRB), and a BRB-IC inference approach with interval inputs is proposed. A numerical example and a case study are examined to demonstrate potential applications of the BRB-IC method. These studies show that the belief-rule-based expert system is flexible and valid for inventory control. The case study also shows that the BRB-IC method can compensate DFE by training BRB using historical demand data for generating reliable ordering policy.     

A rough set approach to feature selection based on power set tree

Feature selection is viewed as an important preprocessing step for pattern recognition, machine learning and data mining. Traditional hill-climbing search approaches to feature selection have difficulties to find optimal reducts. And the current stochastic search strategies, such as GA, ACO and PSO, provide a more robust solution but at the expense of increased computational effort. It is necessary to investigate fast and effective search algorithms. Rough set theory provides a mathematical tool to discover data dependencies and reduce the number of features contained in a dataset by purely structural methods. In this paper, we define a structure called power set tree (PS-tree), which is an order tree representing the power set, and each possible reduct is mapped to a node of the tree. Then, we present a rough set approach to feature selection based on PS-tree. Two kinds of pruning rules for PS-tree are given. And two novel feature selection algorithms based on PS-tree are also given. Experiment results demonstrate that our algorithms are effective and efficient.     

A computer-enabled solution procedure for food wholesalers’ distribution decision in cities with a circular transportation infrastructure

This paper addresses the food distribution decision from a wholesaler's perspective, as the wholesalers are often faced with thorny issues such as when, where, how to deliver products at the lowest costs to best satisfy the retailers’ changing needs. This research relies on a distribution problem encountered at Northern Grocery Company in Beijing as an example to develop a two-stage solution procedure and subsequent computer-enabled programs for identifying efficient vehicle routing alternatives. The solution process, which integrates heuristic search algorithms and an integer programming model, can be applied to a wide range of distribution problems with specified route durations and a circular transportation network structure as exemplified by City of Beijing.     

Utility function of TCP

Understanding the TCP congestion control mechanism from a global optimization point of view is not only important in its own right, but also crucial to the design of other transport layer traffic control protocols with provable properties. In this paper, we derive a global utility function and the corresponding optimal control law, known as TCP control law, which maximizes the global utility. The TCP control law captures the essential behaviors of TCP, including slow start, congestion avoidance, and the binary nature of congestion feedback in TCP. We find that the utility function of TCP is linear in the slow start phase and is proportional to the additive increase rate and approaches the well-known logarithm function as the data rate becomes large in the congestion avoidance phase. We also find that understanding the slow start phase with a fixed threshold is critical to the design of new transport layer control protocols to enable quality of service features. Finally, as an application, we design a Minimum Rate Guaranteed (MRG) traffic control law that shares the same utility function as the TCP control law. Our simulation study of the MRG control law indicates that it is indeed TCP friendly and can provide minimum rate guarantee as long as the percentage of network resource consumed by the MRG flows is moderately small.     

A passive tree-based backbone construction scheme for MANETs

Backbone-based broadcast schemes are effective in alleviating the broadcast storm problem in mobile ad hoc networks (MANETs). However, periodically hello packets used to maintain a backbone usually lead to extra control overhead. In this paper, passive tree-based backbone construction scheme (PTBCS) is proposed as a backbone construction scheme for MANETs. Different from other schemes, each node in PTBCS determines its role by intercepting packet transmissions in the air during a special waiting period. Hence, its most remarkable advantage is that there are no periodical packet transmissions specially for backbone construction. The property that the nodes selected by PTBCS make up a connected dominating set (CDS) of the network is proven with several ideal assumptions. Simulation results show that PTBCS is effective when compared with some other typical backbone construction schemes.     

Generalized predictive control of linear systems with actuator arrearage faults

Arrearage phenomenon commonly exists in actuators. With arrearages, the actuator cannot achieve the target suggested by the controller, so the control performance degrades. Deadzones and stuck faults can be considered to be two special classes of arrearages, which are studied widely; however, more general arrearage phenomenon cannot be described and treated by these forms. In this paper, a general formulation is introduced for this phenomenon, which is referred as actuator arrearage faults. Based on this formulation, an improved generalized predictive control scheme is proposed for a class of single-input single-output linear systems. With arrearage faults, the system becomes a stochastic process. Hence, a sufficient condition, which guarantees the output tracking error to be uniformly ultimately bounded in the mean-square sense, is presented in this paper. Simulations are given to illustrate the feasibility and effectiveness of the proposed scheme.