An optimization approach for planning daily drayage operations

Daily drayage operations involve moving loaded or empty equipment between customer locations and rail ramps. Our goal is to minimize the cost of daily drayage operations in a region on a given day. Drayage orders are generally pickup and delivery requests with time windows. The repositioning of empty equipment may also be required in order to facilitate loaded movements. The drayage orders are satisfied by a heterogeneous fleet of drivers. Driver routes must satisfy various operational constraints. We present an optimization methodology for finding cost-effective schedules for regional daily drayage operations. The core of the formulation is a set partitioning model whose columns represent routes. Routes are added to the formulation by column generation. We present numerical results for real-world data which demonstrate that our methodology produces low cost solutions in a reasonably short time.     

Uniqueness of the group topology of some homeomorphism groups

In this paper, we generalize a theorem of Kallman [2, Theorem 1.1] and we resolve the unsettled case there.     

Preservice Elementary Teachers' Use of Mathematics in a Project‐Based Science Approach

The use of a project‐based science (PBS) approach to teaching encourages students to integrate mathematics and science in meaningful ways as they create projects. As a beginning study of how students use mathematics in such an approach, an analysis of 23 projects developed by preservice elementary teachers enrolled in an elementary science course was conducted. Findings showed that students made a number of different types of mathematical errors and underutilized data representation and summary forms. Implications included the importance of developing methods for supporting the use of mathematical tools in utilizing a project‐based approach and considering ways that such tools mediate scientific thinking.     

Enhancement of mass spectrometric detection of LTC4, LTD4, and LTE4 by derivatization

Several acylating reagents are synthesized and used to introduce quatemary phosphonium or ammonium or ternary sulfonium functions into a simple model of a peptido leukotriene (PLT). One of these reagents was selected for further study with LTE₄, LTD₄, and LTC₄. We demonstrate that acylation of the free amine function of PLTs to produce the 5-triphenylphosphoniumvaleryl-amide (TPPV) derivatives enhances chemical stabilities and significantly increases responses in fast-atom bombardment and continuous-flow liquid secondary ion mass spectrometry (CF-LSIMS) relative to the native PLTs. With high-performance liquid chromatography inlet to CF-LSIMS, we demonstrate the facile detection in selected ion monitoring of the TPPV derivative of 3 pg of LTD₄.     

Evolution of the high power THz source program at Jefferson Lab

We report the evolution of the high power THz source program at Jefferson Lab. The source is based on coherent synchrotron radiation in which short bunches of relativistic electrons radiate when traversing a dipolar magnetic field. In our first accelerator we produced 20 W of broadband THz light. Our upgraded accelerator with higher current and improved THz extraction optics will considerably enhance the output power to >100 W. In this paper we describe the source in some detail and present theoretical calculations for the upgrade.     

Stationary Distributions of GI/M/c Queue with PH Type Vacations

We study a GI/M/c type queueing system with vacations in which all servers take vacations together when the system becomes empty. These servers keep taking synchronous vacations until they find waiting customers in the system at a vacation completion instant.The vacation time is a phase-type (PH) distributed random variable. Using embedded Markov chain modeling and the matrix geometric solution methods, we obtain explicit expressions for the stationary probability distributions of the queue length at arrivals and the waiting time. To compare the vacation model with the classical GI/M/c queue without vacations, we prove conditional stochastic decomposition properties for the queue length and the waiting time when all servers are busy. Our model is a generalization of several previous studies.