Wastewater treatment by novel hybrid biological – ion exchange processes

This study presents two novel methods for treating important environmental contaminants from two different wastewater streams. One process utilizes the kinetic advantages and reliability of ion exchanging clinoptilolite in combination with biological treatment to remove ammonium from municipal sewage. A second process, HAMBgR (Hybrid Adsorption Membrane Biological Reactor), combines both ion exchange resin and bacteria into a single reactor to treat perchlorate contaminated waters. Combining physicochemical adsorptive treatment with biological treatment can provide synergistic benefits to the overall removal processes. Ion exchange removal solves some of the common operational reliability limitations of biological treatment, like slow response to environmental changes and leaching. Biological activity can in turn help reduce the economic and environmental challenges of ion exchange processes, like regenerant cost and brine disposal. The second section of this study presents continuous flow column experiments, used to demonstrate the ability of clinoptilolite to remove wastewater ammonium, as well as the effectiveness of salt regeneration using highly concentrated sea salt solutions. The working capacity of clinoptilolite more than doubled over the first few loading cycles, while regeneration recovered more than 98% of ammonium. Using the regenerant brine for subsequent halotolerant algae growth allowed for its repeated use, which could lead to cost savings and production of valuable algal biomass. The algae were able to uptake all ammonium in solution, and the brine was able to be used again with no loss in regeneration efficiency. This process has significant advantages over conventional biological nitrification; shorter retention times, wider range of operational conditions, and higher quality effluent free of nitrate. Also, since the clinoptilolite is continually regenerated and the regenerant is rejuvenated by algae, overall input costs are expected to be low. The third section of this study introduces the HAMBgR process for the elimination of perchlorate and presents batch isotherm experiments and pilot reactor tests. Results showed that a variety of ion-exchange resins can be effectively and repeatedly regenerated biologically, and maintain an acceptable working capacity. The presence of an adsorbent in the HAMBgR process improved bioreactor performance during operational fluctuations by providing a physicochemical backup to the biological process. Pilot reactor tests showed that the HAMBgR process reduced effluent perchlorate spikes by up to 97% in comparison to a conventional membrane bio-reactor (MBR) that was subject to sudden changes in influent conditions. Also, the HAMBgR process stimulated biological activity and lead to higher biomass concentrations during increased contaminant loading conditions. Conventional MBR systems can be converted into HAMBgR’s at a low cost, easily justifiable by the realized benefits. The concepts employed in the HAMBgR process can be adapted to treat other target contaminants, not just perchlorate.

Scheduling of track inspection and maintenance activities in railroad networks

The U.S. railroad companies spend billions of dollars every year on railroad track maintenance in order to ensure safety and operational efficiency of their railroad networks. Besides maintenance costs, other costs such as train accident costs, train and shipment delay costs and rolling stock maintenance costs are also closely related to track maintenance activities. Optimizing the track maintenance process on the extensive railroad networks is a very complex problem with major cost implications. Currently, the decision making process for track maintenance planning is largely manual and primarily relies on the knowledge and judgment of experts. There is considerable potential to improve the process by using operations research techniques to develop solutions to the optimization problems on track maintenance. In this dissertation study, we propose a range of mathematical models and solution algorithms for three network-level scheduling problems on track maintenance: track inspection scheduling problem (TISP), production team scheduling problem (PTSP) and job-to-project clustering problem (JTPCP). TISP involves a set of inspection teams which travel over the railroad network to identify track defects. It is a large-scale routing and scheduling problem where thousands of tasks are to be scheduled subject to many difficult side constraints such as periodicity constraints and discrete working time constraints. A vehicle routing problem formulation was proposed for TISP, and a customized heuristic algorithm was developed to solve the model. The algorithm iteratively applies a constructive heuristic and a local search algorithm in an incremental scheduling horizon framework. The proposed model and algorithm have been adopted by a Class I railroad in its decision making process. Real-world case studies show the proposed approach outperforms the manual approach in short-term scheduling and can be used to conduct long-term what-if analyses to yield managerial insights. PTSP schedules capital track maintenance projects, which are the largest track maintenance activities and account for the majority of railroad capital spending. A time-space network model was proposed to formulate PTSP. More than ten types of side constraints were considered in the model, including very complex constraints such as mutual exclusion constraints and consecution constraints. A multiple neighborhood search algorithm, including a decomposition and restriction search and a block-interchange search, was developed to solve the model. Various performance enhancement techniques, such as data reduction, augmented cost function and subproblem prioritization, were developed to improve the algorithm. The proposed approach has been adopted by a Class I railroad for two years. Our numerical results show the model solutions are able to satisfy all hard constraints and most soft constraints. Compared with the existing manual procedure, the proposed approach is able to bring significant cost savings and operational efficiency improvement. JTPCP is an intermediate problem between TISP and PTSP. It focuses on clustering thousands of capital track maintenance jobs (based on the defects identified in track inspection) into projects so that the projects can be scheduled in PTSP. A vehicle routing problem based model and a multiple-step heuristic algorithm were developed to solve this problem. Various side constraints such as mutual exclusion constraints and rounding constraints were considered. The proposed approach has been applied in practice and has shown good performance in both solution quality and efficiency.