A new co-evolutionary decomposition-based algorithm for bi-level combinatorial optimization

Bi-Level Optimization Problems (BLOPs) are a class of challenging problems with two levels of optimization tasks. The main goal is to optimize the upper level problem which has another optimization problem as a constraint. The latter is called the lower level problem. In this way, the evaluation of each upper level solution requires finding an (near) optimal solution to the corresponding lower level problem, which is computationally very expensive. Many real world applications are bi-level by nature, ranging from logistics to software engineering. Further, proposed bi-level approaches have been restricted to solve linear BLOPs. This fact has attracted the evolutionary computation community to tackle such complex problems and many interesting works have recently been proposed. Unfortunately, most of these works are restricted to the continuous case. Motivated by this observation, we propose in this paper a new Co-evolutionary Decomposition Algorithm inspired from Chemical Reaction Optimization algorithm, called E-CODBA (Energy-based CODBA), to solve combinatorial bi-level problems. Our algorithm is based on our previous works within this research area. The main idea behind E-CODBA is to exploit co-evolution, decomposition, and energy laws to come up with good solution(s) within an acceptable execution time. The statistical analysis of the experimental results on the Bi-level Multi-Depot Vehicle Routing Problem (Bi-MDVRP) show the out-performance of our E-CODBA against four recently proposed works in terms of effectiveness and efficiency.     

Capacity limits of spectrum‐sharing systems over hyper‐fading channels

Cognitive radio (CR) with spectrum‐sharing feature is a promising technique to address the spectrum under‐utilization problem in dynamically changing environments. In this paper, the achievable capacity gain of spectrum‐sharing systems over dynamic fading environments is studied. To perform a general analysis, a theoretical fading model called hyper‐fading model that is suitable to the dynamic nature of CR channel is proposed. Closed‐form expressions of probability density function (PDF) and cumulative density function (CDF) of the signal‐to‐noise ratio (SNR) for secondary users (SUs) in spectrum‐sharing systems are derived. In addition, the capacity gains achievable with spectrum‐sharing systems in high and low power regions are obtained. The effects of different fading figures, average fading powers, interference temperatures, peak powers of secondary transmitters, and numbers of SUs on the achievable capacity are investigated. The analytical and simulation results show that the fading figure of the channel between SUs and primary base‐station (PBS), which describes the diversity of the channel, does not contribute significantly to the system performance gain. Copyright © 2011 John Wiley & Sons, Ltd.     

Performance analysis of single carrier and multicarrier DS‐CDMA systems over generalized fading channels

Using a recently developed moment generating function‐based approach for the performance evaluation of digital communications over fading channels, we present a unified approach for the exact performance analysis of binary direct‐sequence code division multiple access (DS‐CDMA) systems operating over generalized frequency‐selective fading channels. The results are applicable to single carrier systems employing RAKE reception as well as to multicarrier DS‐CDMA systems with frequency diversity. Aside from simplifying previous results both analytically and computationally, the proposed approach also gives a solution for many situations which heretofore defied a simple form. Copyright © 2001 John Wiley & Sons, Ltd.     

Performance analysis of switch‐based multiuser scheduling schemes with adaptive modulation in spectrum sharing systems

This paper focuses on the development of multiuser access schemes for spectrum sharing systems whereby secondary users are allowed to share the spectrum with primary users under the condition that the interference observed at the primary receiver is below a predetermined threshold. In particular, two scheduling schemes are proposed for selecting a user among those that satisfy the interference constraint and achieve an acceptable signal‐to‐noise ratio level. The first scheme focuses on optimizing the average spectral efficiency by selecting the user that reports the best channel quality. In order to alleviate the relatively high feedback required by the first scheme, a second scheme based on the concept of switched diversity is proposed, where the base station (BS) scans the secondary users in a sequential manner until a user whose channel quality is above an acceptable predetermined threshold is found. We develop expressions for the statistics of the signal‐to‐interference and noise ratio as well as the average spectral efficiency, average feedback load, and the delay at the secondary BS. We then present numerical results for the effect of the number of users and the interference constraint on the optimal switching threshold and the system performance and show that our analysis results are in perfect agreement with the numerical results. Copyright © 2014 John Wiley & Sons, Ltd.