Post-disaster debris reverse logistics management under psychological cost minimization

This work presents a novel reverse logistics system for post-disaster debris. Effectiveness of the proposed system is demonstrated by applying it to a case study in Wenchuan County of China. The county was the epicenter of the Wenchuan earthquake on May 12, 2008. A multi-objective linear programming model is also formulated capable of systematically minimizing total reverse logistical costs, corresponding environmental and operational risks, and psychological trauma experienced by local residents why they waited for medical treatment and removal of debris. The psychological stress induced during the debris reverse logistic process is the integral of an increasing marginal function of the waiting time for medical treatment and debris removal. Numerical results indicate that when considering risk-induced and psychological costs, the proposed model can reduce such costs associated with post-disaster debris reverse logistics by 22.62% and 54.93%, respectively, from their values when only the logistical costs are minimized. Although reducing the psychological cost of disaster victims, the temporary storage of disaster-hit sites increases the psychological costs of individuals who are processing the debris. We recommend increasing on-site storage and treatment capacities to reduce risk-induced and psychological costs with a lower increase in logistical costs. When the risk tolerance ranges from its minimum value to +25%, the Pareto fronts are closer than those of the risk tolerance increase by more than +25%. Efforts are underway to design a tool based on the Pareto analysis method for future decision making.     

Compromising system and user interests in shelter location and evacuation planning

Traffic management during an evacuation and the decision of where to locate the shelters are of critical importance to the performance of an evacuation plan. From the evacuation management authority’s point of view, the desirable goal is to minimize the total evacuation time by computing a system optimum (SO). However, evacuees may not be willing to take long routes enforced on them by a SO solution; but they may consent to taking routes with lengths not longer than the shortest path to the nearest shelter site by more than a tolerable factor. We develop a model that optimally locates shelters and assigns evacuees to the nearest shelter sites by assigning them to shortest paths, shortest and nearest with a given degree of tolerance, so that the total evacuation time is minimized. As the travel time on a road segment is often modeled as a nonlinear function of the flow on the segment, the resulting model is a nonlinear mixed integer programming model. We develop a solution method that can handle practical size problems using second order cone programming techniques. Using our model, we investigate the importance of the number and locations of shelter sites and the trade-off between efficiency and fairness.     

Risk-based spatial zone determination problem for stage-based evacuation operations

This study seeks to determine risk-based evacuation subzones for stage-based evacuation operations in a region threatened/affected by a disaster so that information-based evacuation strategies can be implemented in real-time for the subzone currently with highest evacuation risk to achieve some system-level performance objectives. Labeled the evacuation risk zone (ERZ), this subzone encompasses the spatial locations containing the population with highest evacuation risk which is a measure based on whether the population at a location can be safely evacuated before the disaster impacts it. The ERZ for a stage is calculated based on the evolving disaster characteristics, traffic demand pattern, and network supply conditions over the region in real-time subject to the resource limitations (personnel, equipment, etc.) of the disaster response operators related to implementing the evacuation strategies. Thereby, the estimated time-dependent lead time to disaster impact at a location and the estimated time-dependent clearance time based on evolving traffic conditions are used to compute evacuation risk. This time-unit measure of evacuation risk enables the ERZ concept to be seamlessly applied to different types of disasters, providing a generalized framework for mass evacuation operations in relation to disaster characteristics. Numerical experiments conducted to analyze the performance of the ERZ-based paradigm highlight its benefits in terms of better adapting to the dynamics of disaster impact and ensuring a certain level of operational performance effectiveness benchmarked against the idealized system optimal traffic pattern for the evacuation operation, while efficiently utilizing available disaster response resources.     

Pick‐up locations and bus allocation for transit‐based evacuation planning with demand uncertainty

This paper develops a decision‐support model for transit‐based evacuation planning under demand uncertainty. Demand uncertainty refers to the uncertainty associated with the number of transit‐dependent evacuees. A robust optimization model is proposed to determine the optimal pick‐up points for evacuees to assemble, and allocate available buses to transport the assembled evacuees between the pick‐up locations and different public shelters. The model is formulated as a mixed‐integer linear program and is solved via a cutting plane scheme. The numerical example based on the Sioux Falls network demonstrates that the robust plan yields lower total evacuation time and is reliable in serving the realized evacuee demand. Copyright © 2012 John Wiley & Sons, Ltd.     

A decision support system for integrated hazardous materials routing and emergency response decisions

Hazardous materials routing constitutes a critical decision in mitigating the associated transportation risk. This paper presents a decision support system for assessing alternative distribution routes in terms of travel time, risk and evacuation implications while coordinating the emergency response deployment decisions with the hazardous materials routes. The proposed system provides the following functionalities: (i) determination of alternative non-dominated hazardous materials distribution routes in terms of cost and risk minimization, (ii) specification of the hazardous materials first-response emergency service units locations in order to achieve timely response to an accident, and (iii) determination of evacuation paths from the impacted area to designated shelters and estimation of the associated evacuation time. The proposed system has been implemented, used and evaluated for assessing alternative hazardous materials routing decisions within the heavily industrialized area of Thriasion Pedion of Attica, Greece. The implementation of the aforementioned functionalities is based on two new integer programming models for the hazardous materials routing and the emergency response units location problems, respectively. A simplified version of the routing model is solved by an existing heuristic algorithm developed by the authors. A new Lagrangean relaxation heuristic algorithm has been developed for solving the emergency response units location problem. The focus of this paper is on the exposition of the proposed decision support system components and functionalities. Special emphasis is placed on the presentation of the two new mathematical models and the new solution method for the location model.     

System optimum and pricing for the day-long commute with distributed demand,autos and transit

The day-long system optimum (SO) commute for an urban area served by auto and transit is modeled as an auto bottleneck with a capacitated transit bypass. A public agency manages the system’s capacities optimally. Commuters are identical except for the times at which they wish to complete their morning trips and start their evening trips, which are given by an arbitrary joint distribution. They value unpunctuality – their lateness or earliness relative to their wish times – with a common penalty function. They must use the same mode for both trips. Commuters are assigned personalized mode and travel start times that collectively minimize society’s generalized cost for the whole day. This includes unpunctuality penalties, queuing delays, travel times and out-of-pocket costs for users, as well as travel supply costs and externalities for society.It is shown that in a SO solution there can be no queuing and that the set of SO solutions forms a convex set. Furthermore, if the schedule penalty that users suffer due to unpunctuality is separable into morning and evening components, then the set of commuters traveling by the same mode arrive at work and depart from work in the order of their wishes. These orders are in general different in the morning and the evening. It is also shown that there always is a SO solution in which users are at all times, and on both modes, either punctual or flowing at capacity. These problem properties are used to identify search methods, both, for SO solutions and for time-dependent tolls and transit fares that preserve the solutions as Nash equilibriums. In every case studied, these prices exist. They must peak concurrently for the two modes in both periods.In special cases involving only one mode, only one period or concentrated demand the solution to the complete problem decomposes by period conditional on the number of transit users, and this facilitates the solution. In these cases the day-long SO cost is the sum of the SO costs for the two peaks considered separately. However, this is not true in general – the solution obtained by combining the two single-period solutions can be infeasible. When this happens, the optimum day-long cost will exceed the sum of the single-period costs. The discrepancy is about 40% of the total schedule penalty for an example representing a large city. Thus, to develop realistic policies the day-long problem must be addressed head on. An approximate method that yields closed form formulas for the case with uniformly distributed wishes is presented.     

The location of public logistic centers: an expanded capacity-limited fixed cost location-allocation modeling approach

The location problem considered in this paper concerns the optimal number, size, and location of public logistic centers. To solve this problem, a mathematical model is developed based on an expanded capacity-limited fixed cost location-allocation model of a network incorporating handling costs and the costs of the temporary storage of cargo in the logistic center. The effectiveness of the proposed approach is evaluated with a numerical example of locating public logistic centers of international importance in the Republic of Serbia, based on two scenarios regarding the future development of import cargo flows into the Republic to the year 2020.     

Joint inventory-location problem under the risk of probabilistic facility disruptions

This paper studies a reliable joint inventory-location problem that optimizes facility locations, customer allocations, and inventory management decisions when facilities are subject to disruption risks (e.g., due to natural or man-made hazards). When a facility fails, its customers may be reassigned to other operational facilities in order to avoid the high penalty costs associated with losing service. We propose an integer programming model that minimizes the sum of facility construction costs, expected inventory holding costs and expected customer costs under normal and failure scenarios. We develop a Lagrangian relaxation solution framework for this problem, including a polynomial-time exact algorithm for the relaxed nonlinear subproblems. Numerical experiment results show that this proposed model is capable of providing a near-optimum solution within a short computation time. Managerial insights on the optimal facility deployment, inventory control strategies, and the corresponding cost constitutions are drawn.     

Location planning for transit-based evacuation under the risk of service disruptions

The effectiveness of transit-based emergency evacuation highly depends on the location of pick-up facilities, resource allocation, and management. These facilities themselves are often subject to service disruptions during or after the emergency. This paper proposes a reliable emergency facility location model that determines both pre-emergency facility location planning and the evacuation operations afterwards, while facilities are subject to the risk of disruptions. We analyze how evacuation resource availability leverages individual evacuees’ response to service disruptions, and show how equilibrium of the evacuee arrival process could be reached at a functioning pick-up facility. Based on this equilibrium, an optimal resource allocation strategy is found to balance the tradeoff between the evacuees’ risks and the evacuation agency’s operation costs. This leads to the development of a compact polynomial-size linear integer programming formulation that minimizes the total expected system cost from both pre-emergency planning (e.g., facility set-up) and the evacuation operations (e.g., fleet management, transportation, and exposure to hazardous surroundings) across an exponential number of possible disruption scenarios. We also show how the model can be flexibly used to plan not only pre-disaster evacuation but also post-disaster rescue actions. Numerical experiments and an empirical case study for three coastal cities in the State of Mississippi (Biloxi, Gulfport, and D’lberville) are conducted to study the performance of the proposed models and to draw managerial insights.     

Multi‐objective airport gate assignment problem in planning and operations

We consider the assignment of gates to arriving and departing flights at a large hub airport. This problem is highly complex even in planning stage when all flight arrivals and departures are assumed to be known precisely in advance. There are various considerations that are involved while assigning gates to incoming and outgoing flights (such a flight pair for the same aircraft is called a turn) at an airport. Different gates have restrictions, such as adjacency, last‐in first‐out gates and towing requirements, which are known from the structure and layout of the airport. Some of the cost components in the objective function of the basic assignment model include notional penalty for not being able to assign a gate to an aircraft, penalty for the cost of towing an aircraft with a long layover, and penalty for not assigning preferred gates to certain turns. One of the major contributions of this paper is to provide mathematical model for all these complex constraints that are observed at a real airport. Further, we study the problem in both planning and operations modes simultaneously, and such an attempt is, perhaps, unique and unprecedented. For planning mode, we sequentially introduce new additional objectives to our gate assignment problem that have not been studied in the literature so far—(i) maximization of passenger connection revenues, (ii) minimization of zone usage costs, and (iii) maximization of gate plan robustness—and include them to the model along with the relevant constraints. For operations mode, the main objectives studied in this paper are recovery of schedule by minimizing schedule variations and maintaining feasibility by minimal retiming in the event of major disruptions. Additionally, the operations mode models must have very, very short run times of the order of a few seconds. These models are then applied to a functional airline at one of its most congested hubs. Implementation is carried out using Optimization Programming Language, and computational results for actual data sets are reported. For the planning mode, analyst perception of weights for the different objectives in the multi‐objective model is used wherever actual dollar value of the objective coefficient is not available. The results are also reported for large, reasonable changes in objective function coefficients. For the operations mode, flight delays are simulated, and the performance of the model is studied. The final results indicate that it is possible to apply this model to even large real‐life problems instances to optimality within short run times with clever formulation of conventional continuous time assignment model. Copyright © 2013 John Wiley & Sons, Ltd.     

Analysis of cost estimation disclosure in environmental impact statements for surface transportation projects

Reliability in cost estimates in publicly funded projects is more important today than ever with increased governmental funding to infrastructure projects and associated accountability requirements, but surface transportation projects, large and small, in the United States have a legacy of cost overruns. The problems with these overruns start with the cost estimation process before projects begin. Studies have shown that early cost estimations reflect best-case scenarios rather than realistic expectations, and have attributed technical, economic, psychological, and political reasons for underestimation. The primary objectives of this research were to determine how costs have been presented and updated in environmental impact statements, to identify endemic technical problems with cost estimation during the environmental review of surface transportation projects, and to develop recommendations for improving cost estimation and disclosure. Cost estimation methods were analyzed from the documents of 100 projects, including draft environmental impact statements, final environmental impact statements, and records of decision. The study concluded that the lack of guidance on how to include cost estimation in environmental review revealed itself in the level of detail and attention given to estimating costs. Agencies omitted or included various aspects of cost estimation randomly. Professional organizations should fill the gap of the need for specific guidance to cost estimation for environmental review so it can evolve as a state of the practice.     

A conflict-based path-generation heuristic for evacuation planning

Evacuation planning and scheduling is a critical aspect of disaster management and national security applications. This paper proposes a conflict-based path-generation approach for evacuation planning. Its key idea is to decompose the evacuation planning problem into a master and a subproblem. The subproblem generates new evacuation paths for each evacuated area, while the master problem optimizes the flow of evacuees and produce an evacuation plan. Each new path is generated to remedy conflicts in the evacuation flows and adds new columns and a new row in the master problem. The algorithm is applied to a set of large-scale evacuation scenarios ranging from the Hawkesbury-Nepean flood plain (West Sydney, Australia) which require evacuating in the order of 70,000 persons, to the New Orleans metropolitan area and its 1,000,000 residents. Experiments illustrate the scalability of the approach which is able to produce evacuation for scenarios with more than 1200 nodes, while a direct Mixed Integer Programming formulation becomes intractable for instances with more than 5 nodes. With this approach, realistic evacuations scenarios can be solved near-optimally in reasonable time, supporting both evacuation planning in strategic, tactical, and operational environments.     

Feeder-trunk or direct lines? Economies of density,transfer costs and transit structure in an urban context

A feeder-trunk scheme has been labeled as superior in urban areas due to the presence of economies of density (decreasing average operating cost) along the avenues served by trunk lines. We compare this structure against three types of direct lines structures (no transfers) to serve a stylized public transport network where several flows converge into a main avenue, simultaneously optimizing fleet and vehicle sizes considering both users’ and operators’ costs. The best structure is shown to depend not only on the total passenger volume but also on demand imbalance, demand dispersion in the origins and the length of the trunk line. The region where the feeder-trunk structure dominates depends largely on the value assigned to the pure transfer penalty.     

Effects of shadow evacuation on megaregion evacuations

Transportation systems serve important roles during emergencies, in particular for evacuations. However, efficient travel during these life-and-death scenarios can be adversely impacted by external conditions, such as unnecessary and unneeded travel. This research sought to enhance the understanding of the effects of these conditions by analyzing shadow evacuations, and their impact on regional traffic operations in megaregions, more broadly. The research was based on simulations of a range of hurricane evacuation threat scenarios in the Gulf of Mexico building upon prior study using TRANSIMS. These assessments are also targeted at what many assume could be worst case evacuation conditions and pushing the limits of current simulation modeling capability. Among the broader findings of this work was that shadow evacuation participation rates did not significantly impact the evacuation clearance times within mandatory evacuation areas of the megaregion as long as demand could be temporarily spread out. This finding does not, however, suggest that the shadow evacuations have no impact on evacuation processes. High rates of shadow evacuees can cause significant congestion if they are not able to exit critical routes before mandatory evacuees reach areas further away from the coast.     

Some considerations in the thyristors' reactive effects on the power supply

Silicon Controlled Rectifier (SCR) drives have become a standard technique for transit systems. Their utilization meets the most demanding specifications and results in an effective decrease in power consumption which translates in decreased costs for energy. The regenerative DC power may be inverted to 3-phase AC power and returned to the line as usable power. However, regenerative capability is at a cost penalty.     

广西农村便民候车亭建设现状及对策研究

当前,广西交通部门为贯彻落实中央＂三农精神＂,把农民出行问题落到实处,正掀起一股发展农村客运的热潮,其中便民候车亭就是一个新亮点,截至2010年底,全区共建成农村便民候车亭1 119个。文章对现有农村便民候车亭在建设和使用过程中存在的问题进行了分析,提出了解决问题的对策和建议,对于促进广西农村经济建设,推动道路运输发展...     

Total cost minimizing transit route structures considering trips towards CBD and periphery

The total cost minimizing approach to design transit systems is extended here beyond the usual dimensions of fleet (frequency) and vehicle size in order to examine the most appropriate spatial setting of transit lines as well. Motivated by the case of large cities in Latin America, characterized by high volumes of relatively long urban trips, we analyze the best ways to provide public transport services in a simplified urban setting represented by an extended cross-shaped network, where short trips (periphery–center) and long trips (periphery–periphery) coexist, generating economies of density. Three families of strategic lines structures are compared: mostly direct, feeder–trunk and hub and spoke. For each structure fleet and vehicle sizes are optimized, considering total (users’ and operators’) costs. The best structure is found parametrically in total passenger volume, the proportion of long trips and the value of the transfer penalty. The advantages of each dominating structure are explained in terms of factors like idle capacity, waiting or in-vehicle times and number of transfers.     

Parking permits management and optimal parking supply considering traffic emission cost

Given a many-to-one bi-modal transportation network where each origin is connected to the destination by a bottleneck-constrained highway and a parallel transit line, we investigate the parking permit management methods to minimize traffic time cost and traffic emission cost simultaneously. More importantly, the optimal supply of parking spots is also discussed in the policies of parking permit. First, we derive the total travel costs and emission costs for the two cases of sufficient and insufficient parking spot provisions at the destination. Second, we propose a bi-objective model and solve the Pareto optimal parking permit distribution, given a certain level of parking supply. Third, we investigate the optimal parking supply in the policy of parking permit distribution, with the objectives of minimizing both total travel cost and traffic emission. Fourth, we provide a model of optimizing parking supply, in the policy of free trading of parking permits. Finally, the numerical examples are presented to illustrate the effectiveness of these schemes, and the numerical results show that restricting parking supply at the city center could be efficient to reduce traffic emission.     

Disruption risk management in railroad networks: An optimization-based methodology and a case study

We propose an optimization-based methodology for recovery from random disruptions in service legs and train services in a railroad network. A network optimization model is solved for each service leg to evaluate a number of what-if scenarios. The solutions of these optimization problems are then used in a predictive model to identify the critical disruption factors and accordingly design a suitable mitigation strategy. A mitigation strategy, such as adding flexible or redundant capacity in the network, is an action that is deliberately taken by management in order to hedge against the cost and impact of disruption if it occurs. It is important that managers consider the trade-offs between the cost of mitigation strategy and the expected cost of disruption. The proposed methodology is applied to a case study built using the realistic infrastructure of a railroad network in the mid-west United States. The resulting analysis underscores the importance of accepting a slight increase in pre-disruption transportation costs, which in turn will enhance network resiliency by building dis-similar paths for train services, and by installing alternative links around critical service legs.