Civil & Environmental Engineering

Permanent URI for this communityhttp://hdl.handle.net/1903/2221

Browse

Subject: search.filters.subject.Operations Research

Search Results

Now showing 1 - 10 of 15
  • Thumbnail Image
    Item
    Containership Load Planning with Crane Operations
    (2011) Hamedi, Masoud; Haghani, Ali; Civil Engineering; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)
    Since the start of the containerization revolution in 1950's, not only the TEU capacity of the vessels has been increasing constantly, but also the number of fully cellular container ships has expanded substantially. Because of the tense competition among ports in recent years, improving the operational efficiency of ports has become an important issue in containership operations. Arrangement of containers both within the container terminal and on the containership play an important role in determining the berthing time. The berthing time of a containership is mainly composed of the unloading and loading time of containers. Containers in a containership are stored in stacks, making a container directly accessible only if it is on the top of one stack. The task of determining a good container arrangement to minimize the number of re-handlings while maintaining the ship's stability over several ports is called stowage planning, which is an everyday problem solved by ship planners. The horizontal distribution of the containers over the bays affects crane utilization and overall ship berthing time. In order to increase the terminal productivity and reduce the turnaround time, the stowage planning must conform to the berth design. Given the configuration of berths and cranes at each visiting port, the stowage planning must take into account the utilization of quay cranes as well as the reduction of unnecessary shifts to minimize the total time at all ports over the voyage. This dissertation introduces an optimization model to solve the stowage planning problem with crane utilization considerations. The optimization model covers a wide range of operational and structural constraints for containership load planning. In order to solve real-size problems, a meta-heuristic approach based on genetic algorithms is designed and implemented which embeds a crane split approximation routine. The genetic encoding is ultra-compact and represents grouping, sorting and assignment strategies that might be applied to form the stowage pattern. The evaluation procedure accounts for technical specification of the cranes as well as the crane split. Numerical results show that timely solution for ultra large size containerships can be obtained under different scenarios.
  • Thumbnail Image
    Item
    A MATHEMATICAL FRAMEWORK FOR OPTIMIZING DISASTER RELIEF LOGISTICS
    (2011) Mohasel Afshar, Abbas; Haghani, Ali; Civil Engineering; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)
    In today's society that disasters seem to be striking all corners of the globe, the importance of emergency management is undeniable. Much human loss and unnecessary destruction of infrastructure can be avoided with better planning and foresight. When a disaster strikes, various aid organizations often face significant problems of transporting large amounts of many different commodities including food, clothing, medicine, medical supplies, machinery, and personnel from several points of origin to a number of destinations in the disaster areas. The transportation of supplies and relief personnel must be done quickly and efficiently to maximize the survival rate of the affected population. The goal of this research is to develop a comprehensive model that describes the integrated logistics operations in response to natural disasters at the operational level. The proposed mathematical model integrates three main components. First, it controls the flow of several relief commodities from sources through the supply chain until they are delivered to the hands of recipients. Second, it considers a large-scale unconventional vehicle routing problem with mixed pickup and delivery schedules for multiple transportation modes. And third, following FEMA's complex logistics structure, a special facility location problem is considered that involves four layers of temporary facilities at the federal and state levels. Such integrated model provides the opportunity for a centralized operation plan that can effectively eliminate delays and assign the limited resources in a way that is optimal for the entire system. The proposed model is a large-scale mixed integer program. To solve the model, two sets of heuristic algorithms are proposed. For solving the multi-echelon facility location problem, four heuristic approaches are proposed. Also four heuristic algorithms are proposed to solve the general integer vehicle routing problem. Overall, the proposed heuristics could efficiently find optimal or near optimal solution in minutes of CPU time where solving the same problems with a commercial solver needed hours of computation time. Numerical case studies and extensive sensitivity analysis are conducted to evaluate the properties of the model and solution algorithms. The numerical analysis indicated the capabilities of the model to handle large-scale relief operations with adequate details. Solution algorithms were tested for several random generated cases and showed robustness in solution quality as well as computation time.
  • Thumbnail Image
    Item
    TOOLS TO SUPPORT TRANSPORTATION EMISSIONS REDUCTION EFFORTS: A MULTIFACETED APPROACH
    (2011) Erdogan, Sevgi; Miller-Hooks, Elise D; Civil Engineering; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)
    The transportation sector is a significant contributor to current global climatic problems, one of the most prominent problems that today's society faces. In this dissertation, three complementary problems are addressed to support emissions reduction efforts by providing tools to help reduce demand for fossil fuels. The first problem addresses alternative fuel vehicle (AFV) fleet operations considering limited infrastructure availability and vehicle characteristics that contribute to emission reduction efforts by: supporting alternative fuel use and reducing carbon-intensive freight activity. A Green Vehicle Routing Problem (G-VRP) is formulated and techniques are proposed for its solution. These techniques will aid organizations with AFV fleets in overcoming difficulties that exist as a result of limited refueling infrastructure and will allow companies considering conversion to a fleet of AFVs to understand the potential impact of their decision on daily operations and costs. The second problem is aimed at supporting SOV commute trip reduction efforts through alternative transportation options. This problem contributes to emission reduction efforts by supporting reduction of carbon-intensive travel activity. Following a descriptive analysis of commuter survey data obtained from the University of Maryland, College Park campus, ordered-response models were developed to investigate the market for vanpooling. The model results show that demand for vanpooling in the role of passenger and driver have differences and the factors affecting these demands are not necessarily the same. Factors considered include: status, willingness-to-pay, distance, residential location, commuting habits, demographics and service characteristics. The third problem focuses on providing essential input data, origin-destination (OD) demand, for analysis of various strategies, to address emission reduction by helping to improve system efficiency and reducing carbon-intensive travel activity. A two-stage subarea OD demand estimation procedure is proposed to construct and update important time-dependent OD demand input for subarea analysis in an effort to overcome the computational limits of Dynamic Traffic Assignment (DTA) methodologies. The proposed method in conjunction with path-based simulation-assignment systems can provide an evolving platform for integrating operational considerations in planning models for effective decision support for agencies that are considering strategies for transportation emissions reduction.
  • Thumbnail Image
    Item
    Multi-Period Natural Gas Market Modeling - Applications, Stochastic Extensions and Solution Approaches
    (2010) Egging, Rudolf Gerardus; Gabriel, Steven A; Civil Engineering; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)
    This dissertation develops deterministic and stochastic multi-period mixed complementarity problems (MCP) for the global natural gas market, as well as solution approaches for large-scale stochastic MCP. The deterministic model is unique in the combination of the level of detail of the actors in the natural gas markets and the transport options, the detailed regional and global coverage, the multi-period approach with endogenous capacity expansions for transportation and storage infrastructure, the seasonal variation in demand and the representation of market power according to Nash-Cournot theory. The model is applied to several scenarios for the natural gas market that cover the formation of a cartel by the members of the Gas Exporting Countries Forum, a low availability of unconventional gas in the United States, and cost reductions in long-distance gas transportation. The results provide insights in how different regions are affected by various developments, in terms of production, consumption, traded volumes, prices and profits of market participants. The stochastic MCP is developed and applied to a global natural gas market problem with four scenarios for a time horizon until 2050 with nineteen regions and containing 78,768 variables. The scenarios vary in the possibility of a gas market cartel formation and varying depletion rates of gas reserves in the major gas importing regions. Outcomes for hedging decisions of market participants show some significant shifts in the timing and location of infrastructure investments, thereby affecting local market situations. A first application of Benders decomposition (BD) is presented to solve a large-scale stochastic MCP for the global gas market with many hundreds of first-stage capacity expansion variables and market players exerting various levels of market power. The largest problem solved successfully using BD contained 47,373 variables of which 763 first-stage variables, however using BD did not result in shorter solution times relative to solving the extensive-forms. Larger problems, up to 117,481 variables, were solved in extensive-form, but not when applying BD due to numerical issues. It is discussed how BD could significantly reduce the solution time of large-scale stochastic models, but various challenges remain and more research is needed to assess the potential of Benders decomposition for solving large-scale stochastic MCP.
  • Thumbnail Image
    Item
    Efficient Spectrum Management for Mobile Ad Hoc Networks
    (2010) Jones, Leo Henry; Baecher, Gregory B; Civil Engineering; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)
    The successful deployment of advanced wireless network applications for defense, homeland security, and public safety depends on the availability of relatively interference-free spectrum. Setup and maintenance of mobile networks for military and civilian first-response units often requires temporary allocation of spectrum resources for operations of finite, but uncertain, duration. As currently practiced, this is a very labor-intensive process with direct parallels to project management. Given the wide range of real-time local variation in propagation conditions, spatial distribution of nodes, and evolving technical and mission priorities current human-in-the loop conflict resolution approaches seem untenable. If the conventional radio regulatory structure is strictly adhered to, demand for spectrum will soon exceed supply. Software defined radio is one technology with potential to exploit local inefficiencies in spectrum usage, but questions regarding the management of such network have persisted for years. This dissertation examines a real-time spectrum distribution approach that is based on principles of economic utility and equilibrium among multiple competitors for limited goods in a free market. The spectrum distribution problem may be viewed as a special case of multi-objective optimization of a constrained resource. A computer simulation was developed to create hundreds of cases of local spectrum crowding, to which simultaneous perturbation simulated annealing (SPSA) was applied as a nominal optimization algorithm. Two control architectures were modeled for comparison, one requiring a local monitoring infrastructure and coordination ("top down") the other more market based ("bottom up"). The analysis described herein indicates that in both cases "hands-off" local spectrum management by trusted algorithms is not only feasible, but that conditions of entry for new networks may be determined a priori, with a degree of confidence described by relatively simple algebraic formulas.
  • Thumbnail Image
    Item
    AN INTEGRATED TRAFFIC CONTROL SYSTEM FOR FREEWAY CORRIDORS UNDER NON-RECURRENT CONGESTION
    (2009) Liu, Yue; Chang, Gang-Len; Civil Engineering; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)
    This research has focused on developing an advanced dynamic corridor traffic control system that can assist responsible traffic professionals in generating effective control strategies for contending with non-recurrent congestion that often concurrently plagues both the freeway and arterial systems. The developed system features its hierarchical operating structure that consists of an integrated-level control and a local-level module for bottleneck management. The primary function of the integrated-level control is to maximize the capacity utilization of the entire corridor under incident conditions with concurrently implemented strategies over dynamically computed windows, including diversion control at critical off-ramps, on-ramp metering, and optimal arterial signal timings. The system development process starts with design of a set of innovative network formulations that can accurately and efficiently capture the operational characteristics of traffic flows in the entire corridor optimization process. Grounded on the proposed formulations for network flows, the second part of the system development process is to construct two integrated control models, where the base model is designed for a single-segment detour operation and the extended model is designated for general network applications. To efficiently explore the control effectiveness under different policy priorities between the target freeway and available detour routes, this study has further proposed a multi-objective control process for best managing the complex traffic conditions during incident operations. Due to the nonlinear nature of the proposed formulations and the concerns of computing efficiency, this study has also developed a GA-based heuristic along with a successive optimization process that can yield sufficiently reliable solutions for operating the proposed system in a real-time traffic environment. To evaluate the effectiveness and efficiency of the developed system, this study has conducted extensive numerical experiments with real-world cases. The experimental results have demonstrated that with the information generated from the proposed models, the responsible agency can effectively implement control strategies in a timely manner at all control points to substantially improve the efficiency of the corridor control operations. In view of potential spillback blockage due to detour operations, this study has further developed a local-level bottleneck management module with enhanced arterial flow formulations that can fully capture the complex interrelations between the overflow in each lane group and its impact on the neighboring lanes. As a supplemental component for corridor control, this module has been integrated with the optimization model to fine-tune the arterial signal timings and to prevent the queue spillback or blockages at off-ramps and intersections. The results of extensive numerical experiments have shown that the supplemental module is quite effective in producing local control strategies that can prevent the formation of intersection bottlenecks in the local arterial.
  • Thumbnail Image
    Item
    Optimal Number and Location of Bluetooth Sensors for Travel Time Data Collection in Networks
    (2009) Asudegi, Mona; Haghani, Ali; Civil Engineering; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)
    The importance of accurate prediction of travel time in transportation engineering is irrefutable. Travel time is highly used in traffic management and planning. The accuracy of travel time prediction relies on the accuracy of the travel time data. Various methods are being used in collecting travel time data. Recently, a new method in collecting travel time data is introduced that is called Bluetooth technology. In this method, a number of Bluetooth sensors are deployed over the traffic network that can detect the Bluetooth devices in the vehicles to determine the vehicles' travel time based on matching identification and time of identification of the same Bluetooth device at two consecutive sensors. The goal of this study is to find the optimal number and location of the Bluetooth sensors in a network in order to collect travel time data with a high reliability. Two formulations are proposed for modeling this problem. The formulations consider a new collection of reliability issues. Furthermore, the proposed formulations are able to solve the problem on large networks exactly. Moreover, various case studies of real world networks are conducted for both formulations and the results are compared.
  • Thumbnail Image
    Item
    Multiobjective Optimization Models for Distributing Biosolids to Reuse Fields
    (2008-01-24) Sahakij, Prawat; Gabriel, Steven A; Civil Engineering; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)
    The District of Columbia Water and Sewer Authority (DCWASA) operates the Blue Plains Wastewater Treatment Plant located in Washington, DC. It serves more than two million Washington Metro Area customers, and treats more than 330 million gallons a day of raw sewage from area jurisdictions, including Montgomery and Prince George's Counties in Maryland, and Fairfax and Loudoun Counties in Virginia. Each day, DCWASA produces approximately 1,200 tons of biosolids or byproducts of wastewater that have been treated to reduce pathogens and can be used as fertilizer for agricultural purposes. These generated biosolids require removal from the treatment facility and distribution to reuse fields located in Maryland and Virginia. In spite of the benefits of reuse, biosolids are generally considered by many as potentially malodorous. Recently, DCWASA has received complaints from the surrounding communities and needed to minimize biosolids odors. However, trying to minimize biosolids odors could result in costly treatment processes. Therefore, one needs to determine how to minimize the odors while at the same time minimizing the treatment costs. This compromise of balancing the competing objectives of odors and costs results in a two-objective or more generally, multiobjective optimization problem. In this dissertation, we develop multiobjective optimization models to simultaneously minimize biosolids odors as well as wastewater treatment process and biosolids distribution costs. A weighting method and constraint method were employed to find tradeoff, so called Pareto optimal, points between costs and odors. Schur's decomposition and special order set type two variables were used to approximate the product of two decision variables. A Dantzig-Wolfe decomposition technique was successfully applied to break apart and solve a large optimization model encountered in this dissertation. Using the Blue Plains advanced wastewater treatment plant as a case study, we find several Pareto optimal points between costs and odors where different treatments (e.g., lime addition) and biosolids distribution (e.g., to what reuse fields biosolids should be applied) strategies should be employed. In addition, to hedge the risk of equipment failures as well as for historical reasons, an on-site dewatering contractor has also been incorporated into the model. The optimal solutions indicate different uses of the contractor (e.g., percent flow assigned) when dewatering cost employed by DCWASA varies. This model can be used proactively by any typical advanced wastewater treatment plants to produce the least malodorous biosolids at minimal costs and to our knowledge, this is the first instance of such a model.
  • Thumbnail Image
    Item
    Topology Control and Pointing in Free Space Optical Networks
    (2007-12-05) Shim, Yohan; Gabriel, Steven A; Civil Engineering; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)
    Free space optical (FSO) communication provides functionalities that are different from fiber optic networks and omnidirectional RF wireless communications in that FSO is optical wireless (no infrastructure installation cost involving fibers) and is highly directional (no frequency interference). Moreover, its high-speed data transmission capability is an attractive solution to the first or last mile problem to bridge to current fiber optic network and is a preferable alternative to the low data rate directional point-to-point RF communications for inter-building wireless local area networks. FSO networking depends critically on pointing, acquisition and tracking techniques for rapidly and precisely establishing and maintaining optical wireless links between network nodes (physical reconfiguration), and uses topology reconfiguration algorithms for optimizing network performance in terms of network cost and congestion (logical reconfiguration). The physical and logical reconfiguration process is called Topology Control and can allow FSO networks to offer quality of service by quickly responding to various traffic demands of network users and by efficiently managing network connectivity. The overall objective of this thesis research is to develop a methodology for self-organized pointing along with the associated autonomous and precise pointing technique as well as heuristic optimization methods for Topology Control in bi-connected FSO ring networks, in which each network node has two FSO transceivers. This research provides a unique, autonomous, and precise pointing method using GPS and local angular sensors, which is applicable to both mobile and static nodes in FSO networking and directional point-to-point RF communications with precise tracking. Through medium (264 meter) and short (40 meter) range pointing experiments using an outdoor testbed on the University of Maryland campus in College Park, sub-milliradian pointing accuracy is presented. In addition, this research develops fast and accurate heuristic methods for autonomous logical reconfiguration of bi-connected ring network topologies as well as a formal optimality gap measure tested on an extensive set of problems. The heuristics are polynomial time algorithms for a congestion minimization problem at the network layer and for a multiobjective stochastic optimization of network cost and congestion at both the physical and network layers.
  • Thumbnail Image
    Item
    Air Express Network Design with Hub Sorting
    (2007-11-05) Ngamchai, Somnuk; Schonfeld, Paul M.; Civil Engineering; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)
    This dissertation examines an innovative strategic operation for next day air package delivery. The proposed system, in which some packages are sorted twice at two distinct hubs before arriving at their destinations, is investigated for its potential savings. A two-stage sorting operation is proposed and compared to the currently operated single-stage sorting operation. By considering the endogenous optimization of hub sorting and storage capacities, cost minimization models are developed for both operations and used for performance comparison. Two solution approaches are presented in this study, namely the Column Generation (CG) approach and the Genetic Algorithm (GA) approach. The first method is implemented to optimize the problem by means of linear programming (LP) relaxation, in which the resulting model is then embedded into a branch-and-bound approach to generate an integer solution. However, for solving realistic problem sizes, the model is intractable with the conventional time-space formulation. Therefore, a Genetic Algorithm is developed for solving a large-scale problem. The GA solution representation is classified into two parts, a grouping representation for hub assignment and an aircraft route representation for aircraft route cycles. Several genetic operators are specifically developed based on the problem characteristics to facilitate the search. After optimizing the solution, we compare not only the potential cost saving from the proposed system, but also the system's reliability based on its slack. To provide some insights on the effects of two-stage operation, several factors are explored such as the location of regional hubs, single and multiple two-stage routings and aircraft mix. Sensitivity analyses are conducted under different inputs, including different demand levels, aircraft operating costs and hub operating costs. Additional statistics on aircraft utilization, hub capacity utilization, circuity factor, average transfers per package, and system slack gain/loss by commodity, are analyzed to elucidate the changes in system characteristics.