Hybrid 3D Localization for Visible Light Communication Systems

In this study, we investigate hybrid utilization of angle-of-arrival (AOA) and received signal strength (RSS) information in visible light communication (VLC) systems for 3D localization. We show that AOA-based localization method allows the receiver to locate itself via a least squares estimator by exploiting the directionality of light-emitting diodes (LEDs). We then prove that when the RSS information is taken into account, the positioning accuracy of AOA-based localization can be improved further using a weighted least squares solution. On the other hand, when the radiation patterns of LEDs are explicitly considered in the estimation, RSS-based localization yields highly accurate results. In order to deal with the system of nonlinear equations for RSS-based localization, we develop an analytical learning rule based on the Newton-Raphson method. The non-convex structure is addressed by initializing the learning rule based on 1) location estimates, and 2) a newly developed method, which we refer as random report and cluster algorithm. As a benchmark, we also derive analytical expression of the Cramer-Rao lower bound (CRLB) for RSS-based localization, which captures any deployment scenario positioning in 3D geometry. Finally, we demonstrate the effectiveness of the proposed solutions for a wide range of LED characteristics and orientations through extensive computer simulations.Comment: Submitted to IEEE/OSA Journal of Lightwave Technology (10 pages, 14 figures

Railway crew capacity planning problem with connectivity of schedules

We study a tactical level crew capacity planning problem in railways which determines the minimum required crew size in a region while both feasibility and connectivity of schedules are maintained. We present alternative mathematical formulations which depend on network representations of the problem. A path-based formulation in the form of a set-covering problem along with a column-and-row generation algorithm is proposed. An arc-based formulation of the problem is solved with a commercial linear programming solver. The computational study illustrates the effect of schedule connectivity on crew capacity decisions and shows that arc-based formulation is a viable approach

A note on "A LP-based heuristic for a time-constrained routing problem"

Avella et al. (2006) [Avella, P., D'Auria, B., Salerno, S. (2006). A LP-based heuristic for a time-constrained routing problem. European Journal of Operational Research 173:120-124] investigate a time-constrained routing (TCR) problem. The core of the proposed solution approach is a large-scale linear program (LP) that grows both row- and column-wise when new variables are introduced. Thus, a column-and-row generation algorithm is proposed to solve this LP optimally, and an optimality condition is presented to terminate the column-and-row generation algorithm. We demonstrate that this optimality condition is incorrect and may lead to a suboptimal solution at termination. We identify the source of this error and discuss how the generic column-and-row generation algorithm proposed by Muter et al. (2010) may be applied to this TCR problem in order to solve the proposed large-scale LP correctly

A note on "A LP-based heuristic for a time-constrained routing problem"

In their paper, Avella et al. (2006) investigate a time-constrained routing problem. The core of the proposed solution approach is a large-scale linear program that grows both row- and column-wise when new variables are introduced. Thus, a column-and-row generation algorithm is proposed to solve this linear program optimally, and an optimality condition is presented to terminate the column-and-row generation algorithm. We demonstrate by using Lagrangian duality that this optimality condition is incorrect and may lead to a suboptimal solution at termination

A review of hierarchical facility location models

In this study, we review the hierarchical facility location models. Although there have been a number of review papers on hierarchical facility problems, a comprehensive treatment of models has not been provided since the mid-80s. This review fills the gap in the literature. We first classify the hierarchical facility problems according to the features of systems studied, which are based on flow pattern, service availability at each level of the hierarchy, and spatial configuration of services in addition to the objectives to locate facilities. We then investigate the applications, mixed integer programming models, and solution methods presented for the problem. With an overview of the selected works, we consolidate the main results in the literature