Column generation for stochastic green telecommunication network planning with switchable base stations

We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016     

IRA operational intelligence: the heartbeat of the war

This article will seek to provide a detailed examination of the IRA's operational intelligence methodologies. Providing not only a lengthy discussion on the organization's intelligence collection protocols, it will also examine the interplay between intelligence and IRA decision-making. It will be contended that intelligence's influence resided in its ability to introduce a strong element of predictability into the IRA's decision-making process. This depended on an ability to construct a detailed intelligence picture of the target and its geographical milieu so as to minimize the likelihood of volunteers encountering unforeseen circumstances that could adversely affect planned or anticipated outcomes.     

DEA models for two‐stage processes: Game approach and efficiency decomposition

Data envelopment analysis (DEA) is a method for measuring the efficiency of peer decision making units (DMUs). This tool has been utilized by a number of authors to examine two‐stage processes, where all the outputs from the first stage are the only inputs to the second stage. The current article examines and extends these models using game theory concepts. The resulting models are linear, and imply an efficiency decomposition where the overall efficiency of the two‐stage process is a product of the efficiencies of the two individual stages. When there is only one intermediate measure connecting the two stages, both the noncooperative and centralized models yield the same results as applying the standard DEA model to the two stages separately. As a result, the efficiency decomposition is unique. While the noncooperative approach yields a unique efficiency decomposition under multiple intermediate measures, the centralized approach is likely to yield multiple decompositions. Models are developed to test whether the efficiency decomposition arising from the centralized approach is unique. The relations among the noncooperative, centralized, and standard DEA approaches are investigated. Two real world data sets and a randomly generated data set are used to demonstrate the models and verify our findings. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A nested benders decomposition approach for telecommunication network planning

Despite its ability to result in more effective network plans, the telecommunication network planning problem with signal‐to‐interference ratio constraints gained less attention than the power‐based one because of its complexity. In this article, we provide an exact solution method for this class of problems that combines combinatorial Benders decomposition, classical Benders decomposition, and valid cuts in a nested way. Combinatorial Benders decomposition is first applied, leading to a binary master problem and a mixed integer subproblem. The subproblem is then decomposed using classical Benders decomposition. The algorithm is enhanced using valid cuts that are generated at the classical Benders subproblem and are added to the combinatorial Benders master problem. The valid cuts proved efficient in reducing the number of times the combinatorial Benders master problem is solved and in reducing the overall computational time. More than 120 instances of the W‐CDMA network planning problem ranging from 20 demand points and 10 base stations to 140 demand points and 30 base stations are solved to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Partial input to output impacts in DEA: Production considerations and resource sharing among business subunits

Data envelopment analysis (DEA) is a methodology for evaluating the relative efficiencies of peer decision‐making units (DMUs), in a multiple input/output setting. Although it is generally assumed that all outputs are impacted by all inputs, there are many situations where this may not be the case. This article extends the conventional DEA methodology to allow for the measurement of technical efficiency in situations where only partial input‐to‐output impacts exist. The new methodology involves viewing the DMU as a business unit, consisting of a set of mutually exclusive subunits, each of which can be treated in the conventional DEA sense. A further consideration involves the imposition of constraints in the form of assurance regions (AR) on pairs of multipliers. These AR constraints often arise at the level of the subunit, and as a result, there can be multiple and often inconsistent AR constraints on any given variable pair. We present a methodology for resolving such inconsistencies. To demonstrate the overall methodology, we apply it to the problem of evaluating the efficiencies of a set of steel fabrication plants. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013