Coordination of Mobile Mules via Facility Location Strategies

In this paper, we study the problem of wireless sensor network (WSN) maintenance using mobile entities called mules. The mules are deployed in the area of the WSN in such a way that would minimize the time it takes them to reach a failed sensor and fix it. The mules must constantly optimize their collective deployment to account for occupied mules. The objective is to define the optimal deployment and task allocation strategy for the mules, so that the sensors' downtime and the mules' traveling distance are minimized. Our solutions are inspired by research in the field of computational geometry and the design of our algorithms is based on state of the art approximation algorithms for the classical problem of facility location. Our empirical results demonstrate how cooperation enhances the team's performance, and indicate that a combination of k-Median based deployment with closest-available task allocation provides the best results in terms of minimizing the sensors' downtime but is inefficient in terms of the mules' travel distance. A k-Centroid based deployment produces good results in both criteria.Comment: 12 pages, 6 figures, conferenc

Reverse Nearest Neighbor Heat Maps: A Tool for Influence Exploration

We study the problem of constructing a reverse nearest neighbor (RNN) heat map by finding the RNN set of every point in a two-dimensional space. Based on the RNN set of a point, we obtain a quantitative influence (i.e., heat) for the point. The heat map provides a global view on the influence distribution in the space, and hence supports exploratory analyses in many applications such as marketing and resource management. To construct such a heat map, we first reduce it to a problem called Region Coloring (RC), which divides the space into disjoint regions within which all the points have the same RNN set. We then propose a novel algorithm named CREST that efficiently solves the RC problem by labeling each region with the heat value of its containing points. In CREST, we propose innovative techniques to avoid processing expensive RNN queries and greatly reduce the number of region labeling operations. We perform detailed analyses on the complexity of CREST and lower bounds of the RC problem, and prove that CREST is asymptotically optimal in the worst case. Extensive experiments with both real and synthetic data sets demonstrate that CREST outperforms alternative algorithms by several orders of magnitude.Comment: Accepted to appear in ICDE 201

On green routing and scheduling problem

The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools

A decomposition approach to a stochastic model for supply-and-return network design

This paper presents a generic stochastic model for the design of networks comprising both supply and return channels, organized in a closed loop system. Such situations are typical for manufacturing/re-manufacturing type of systems in reverse logistics. The model accounts for a number of alternative scenarios, which may be constructed based on critical levels of design parameters such as demand or returns. We propose a decomposition approach for this model based on the branch and cut procedure known as the integer L-shaped method. Computational results show a consistent performance efficiency of the method for the addressed location problem. The stochastic solutions obtained in a numerical setting generate a significant improvement in terms of average performance over the individual scenario solutions. A solution methodology as presented here can contribute to overcoming notorious challenges of stochastic network design models, such as increased problem sizes and computational difficulty.Decomposition;Location;Remanufacturing;Integer L-shaped;Uncertainty

Analysis of the separated boundary layer flow on the surface and in the wake of blunt trailing edge airfoils

The viscous flow phenomena associated with sharp and blunt trailing edge airfoils were investigated. Experimental measurements were obtained for a 17 percent thick, high performance GAW-1 airfoil. Experimental measurements consist of velocity and static pressure profiles which were obtained by the use of forward and reverse total pressure probes and disc type static pressure probes over the surface and in the wake of sharp and blunt trailing edge airfoils. Measurements of the upper surface boundary layer were obtained in both the attached and separated flow regions. In addition, static pressure data were acquired, and skin friction on the airfoil upper surface was measured with a specially constructed device. Comparison of the viscous flow data with data previously obtained elsewhere indicates reasonable agreement in the attached flow region. In the separated flow region, considerable differences exist between these two sets of measurements

Design of Closed Loop Supply Chains

Increased concern for the environment has lead to new techniques to design products and supply chains that are both economically and ecologically feasible. This paper deals with the product - and corresponding supply chain design for a refrigerator. Literature study shows that there are many models to support product design and logistics separately, but not in an integrated way. In our research we develop quantitative modelling to support an optimal design structure of a product, i.e. modularity, repairability, recyclability, as well as the optimal locations and goods flows allocation in the logistics system. Environmental impacts are measured by energy and waste. Economic costs are modelled as linear functions of volumes with a fixed set-up component for facilities. We apply this model using real life R&D data of a Japanese consumer electronics company. The model is run for different scenarios using different parameter settings such as centralised versus decentralised logistics, alternative product designs, varying return quality and quantity, and potential environmental legislation based on producer responsibility.supply chain management;reverse logistics;facility location;network design;product design

Quiet Clean Short-haul Experimental Engine (QCSEE). Aerodynamic and aeromechanical performance of a 50.8 cm (20 inch) diameter 1.34 PR variable pitch fan with core flow

The fan aerodynamic and aeromechanical performance tests of the quiet clean short haul experimental engine under the wing fan and inlet with a simulated core flow are described. Overall forward mode fan performance is presented at each rotor pitch angle setting with conventional flow pressure ratio efficiency fan maps, distinguishing the performance characteristics of the fan bypass and fan core regions. Effects of off design bypass ratio, hybrid inlet geometry, and tip radial inlet distortion on fan performance are determined. The nonaxisymmetric bypass OGV and pylon configuration is assessed relative to both total pressure loss and induced circumferential flow distortion. Reverse mode performance, obtained by resetting the rotor blades through both the stall pitch and flat pitch directions, is discussed in terms of the conventional flow pressure ratio relationship and its implications upon achievable reverse thrust. Core performance in reverse mode operation is presented in terms of overall recovery levels and radial profiles existing at the simulated core inlet plane. Observations of the starting phenomena associated with the initiation of stable rotor flow during acceleration in the reverse mode are briefly discussed. Aeromechanical response characteristics of the fan blades are presented as a separate appendix, along with a description of the vehicle instrumentation and method of data reduction

The Incremental Cooperative Design of Preventive Healthcare Networks

This document is the Accepted Manuscript version of the following article: Soheil Davari, 'The incremental cooperative design of preventive healthcare networks', Annals of Operations Research, first published online 27 June 2017. Under embargo. Embargo end date: 27 June 2018. The final publication is available at Springer via http://dx.doi.org/10.1007/s10479-017-2569-1.In the Preventive Healthcare Network Design Problem (PHNDP), one seeks to locate facilities in a way that the uptake of services is maximised given certain constraints such as congestion considerations. We introduce the incremental and cooperative version of the problem, IC-PHNDP for short, in which facilities are added incrementally to the network (one at a time), contributing to the service levels. We first develop a general non-linear model of this problem and then present a method to make it linear. As the problem is of a combinatorial nature, an efficient Variable Neighbourhood Search (VNS) algorithm is proposed to solve it. In order to gain insight into the problem, the computational studies were performed with randomly generated instances of different settings. Results clearly show that VNS performs well in solving IC-PHNDP with errors not more than 1.54%.Peer reviewe