The bi-objective Pollution-Routing Problem

The bi-objective Pollution-Routing Problem is an extension of the Pollution-Routing Problem (PRP) which consists of routing a number of vehicles to serve a set of customers, and determining their speed on each route segment. The two objective functions pertaining to minimization of fuel consumption and driving time are conflicting and are thus considered separately. This paper presents an adaptive large neighborhood search algorithm (ALNS), combined with a speed optimization procedure, to solve the bi-objective PRP. Using the ALNS as the search engine, four a posteriori methods, namely the weighting method, the weighting method with normalization, the epsilon-constraint method and a new hybrid method (HM), are tested using a scalarization of the two objective functions. The HM combines adaptive weighting with the epsilon-constraint method. To evaluate the effectiveness of the algorithm, new sets of instances based on real geographic data are generated, and a library of bi-criteria PRP instances is compiled. Results of extensive computational experiments with the four methods are presented and compared with one another by means of the hypervolume and epsilon indicators. The results show that HM is highly effective in finding good-quality non-dominated solutions on PRP instances with 100 nodes.     

Wearable Sweat Sensors: Background and Current Trends

Sweat‐related physiology research has been well established over the years. However, it has only been around ten years that sweat‐based sensing devices started to be explored. With the recent advancements in wearable activity and physiology monitoring devices, sweat was investigated for its contents similar to blood and corresponding wearable devices were studied intensively. This article provides a thorough review on sweating mechanisms, sweat sensing devices, and electronic technologies for sweat sensor implementations. Potential future directions and recommendations based on current research trends were provided in each section. This review aims to offer a unique perspective from both physiology and engineering point‐of‐view to draw a complete landscape of the sweat sensing research.     

Symplectic tori in rational elliptic surfaces

Let E(1)_p denote the rational elliptic surface with a single multiple fiber f_p of multiplicity p. We construct an infinite family of homologous non-isotopic symplectic tori representing the primitive 2-dimensional homology class [f_p] in E(1)_p when p>1. As a consequence, we get infinitely many non-isotopic symplectic tori in the fiber class of the rational elliptic surface . We also show how these tori can be non-isotopically embedded as homologous symplectic submanifolds in other symplectic 4-manifolds.     

Hydrogen Bonded Supramolecular Network from a Mixed Valence Cobalt System: Synthesis and Crystal Structure of [Co(H2O)6][Co(pydc)2(en)]2·14H2O

Abstract  

The [Co(H₂O)₆][Co(pydc)₂(en)]₂·14H₂O (1) compound (H₂pydc = Pyridine-2,3-dicarboxylic acid and en = ethylenediamine) was synthesized and characterized by elemental analysis, magnetic and spectroscopic measurements (UV–Vis and IR spectra) and single crystal X-ray diffraction technique. There are two coordination spheres with different charges inside this aqueous compound of ionic character. The cationic part is composed of Co(II) encircled by six aqua ligand. Whereas the anionic part contains two anions complex unit each with −1 charge and have Co(III) ions in the centre. As a result different coordination spheres have cobalt ions with different states. The crystallographic analysis revealed that 1 consists of both discrete one-cationic and two-anionic entities, [Co(H₂O)₆]²⁺ and [Co(pydc)₂(en)]₂⁻ and fourteen crystal water molecules. Two water molecules within the water cluster act as hydrogen-bonding acceptors, whereas one water molecule acts as a hydrogen-bonding donor to form a discrete water trimer. These water molecules have stabilized the crystal structure by strong hydrogen bonding interactions.     

Implementation and Evaluation of Age-Aware Downlink Scheduling Policies in Push-Based and Pull-Based Communication

As communication systems evolve to better cater to the needs of machine-type applications such as remote monitoring and networked control, advanced perspectives are required for the design of link layer protocols. The age of information (AoI) metric has firmly taken its place in the literature as a metric and tool to measure and control the data freshness demands of various applications. AoI measures the timeliness of transferred information from the point of view of the destination. In this study, we experimentally investigate AoI of multiple packet flows on a wireless multi-user link consisting of a transmitter (base station) and several receivers, implemented using software-defined radios (SDRs). We examine the performance of various scheduling policies under push-based and pull-based communication scenarios. For the push-based communication scenario, we implement age-aware scheduling policies from the literature and compare their performance with those of conventional scheduling methods. Then, we investigate the query age of information (QAoI) metric, an adaptation of the AoI concept for pull-based scenarios. We modify the former age-aware policies to propose variants that have a QAoI minimization objective. We share experimental results obtained in a simulation environment as well as on the SDR testbed.     

Control of systems with flexible multi-server pools: a shadow routing approach

A general model with multiple input flows (classes) and several flexible multi-server pools is considered. We propose a robust, generic scheme for routing new arrivals, which optimally balances server pools’ loads, without the knowledge of the flow input rates and without solving any optimization problem. The scheme is based on Shadow routing in a virtual queueing system. We study the behavior of our scheme in the Halfin–Whitt (or, QED) asymptotic regime, when server pool sizes and the input rates are scaled up simultaneously by a factor r growing to infinity, while keeping the system load within \(O(\sqrt{r}\,)\) of its capacity.The main results are as follows. (i) We show that, in general, a system in a stationary regime has at least \(O(\sqrt{r}\,)\) average queue lengths, even if the so called null-controllability (Atar et al., Ann. Appl. Probab. 16, 1764–1804, 2006) on a finite time interval is possible; strategies achieving this \(O(\sqrt{r}\,)\) growth rate we call order-optimal. (ii) We show that some natural algorithms, such as MaxWeight, that guarantee stability, are not order-optimal. (iii) Under the complete resource pooling condition, we prove the diffusion limit of the arrival processes into server pools, under the Shadow routing. (We conjecture that result (iii) leads to order-optimality of the Shadow routing algorithm; a formal proof of this fact is an important subject of future work.) Simulation results demonstrate good performance and robustness of our scheme.