45 research outputs found
Recommended from our members
Visual analytics approach to user-controlled evacuation scheduling
Application of the ideas of visual analytics is a promising approach to supporting decision making, in particular, where the problems have geographic (or spatial) and temporal aspects. Visual analytics may be especially helpful in time-critical applications, which pose hard challenges to decision support. We have designed a suite of tools to support transportation-planning tasks such as emergency evacuation of people from a disaster-affected area. The suite combines a tool for automated scheduling based on a genetic algorithm with visual analytics techniques allowing the user to evaluate tool results and direct its work. A transportation schedule, which is generated by the tool, is a complex construct involving geographical space, time, and heterogeneous objects (people and vehicles) with states and positions varying in time. We apply task-analytical approach to design techniques that could effectively support a human planner in the analysis of this complex information
Two-stage network design in humanitarian logistics.
Natural disasters such as floods and earthquakes can cause multiple deaths, injuries, and severe damage to properties. In order to minimize the impact of such disasters, emergency response plans should be developed well in advance of such events. Moreover, because different organizations such as non-governmental organizations (NGOs), governments, and militaries are involved in emergency response, the development of a coordination scheme is necessary to efficiently organize all the activities and minimize the impact of disasters. The logistics network design component of emergency management includes determining where to store emergency relief materials, the corresponding quantities and distribution to the affected areas in a cost effective and timely manner. In a two-echelon humanitarian relief chain, relief materials are pre-positioned first in regional rescue centers (RRCs), supply sources, or they are donated to centers. These materials are then shipped to local rescue centers (LRCs) that distribute these materials locally. Finally, different relief materials will be delivered to demand points (also called affected areas or AAs). Before the occurrence of a disaster, exact data pertaining to the origin of demand, amount of demand at these points, availability of routes, availability of LRCs, percentage of usable pre-positioned material, and others are not available. Hence, in order to make a location-allocation model for pre-positioning relief material, we can estimate data based on prior events and consequently develop a stochastic model. The outputs of this model are the location and the amount of pre-positioned material at each RRC as well as the distribution of relief materials through LRCs to demand points. Once the disaster occurs, actual values of the parameters we seek (e.g., demand) will be available. Also, other supply sources such as donation centers and vendors can be taken into account. Hence, using updated data, a new location-allocation plan should be developed and used. It should be mentioned that in the aftermath of the disaster, new parameters such as reliability of routes, ransack probability of routes and priority of singular demand points will be accessible. Therefore, the related model will have multiple objectives. In this dissertation, we first develop a comprehensive pre-positioning model that minimizes the total cost while considering a time limit for deliveries. The model incorporates shortage, transportation, and holding costs. It also considers limited capacities for each RRC and LRC. Moreover, it has the availability of direct shipments (i.e., shipments can be done from RRCs directly to AAs) and also has service quality. Because this model is in the class of two-stage stochastic facility location problems, it is NP-hard and should be solved heuristically. In order to solve this model, we propose using Lagrangian Heuristic that is based on Lagrangian Relaxation. Results from the first model are amounts and locations of pre-positioned relief materials as well as their allocation plan for each possible scenario. This information is then used as a part of the input for the second model, where the facility location problem will be formulated using real data. In fact, with pre-positioned items in hand, other supplies sources can be considered as necessary. The resulting multi-objective problem is formulated based on a widely used method called lexicography goal programming. The real-time facility location model of this dissertation is multi-product. It also considers the location problem for LRCs using real-time data. Moreover, it considers the minimization of the total cost as one of the objectives in the model and it has the availability of direct shipments. This model is also NP-hard and is solved using the Lagrangian Heuristic. One of the contributions of this dissertation is the development of Lagrangian Heuristic method for solving the pre-positioning and the real- time models. Based on the results of Lagrangian Heuristic for the pre-positioning model, almost all the deviations from optimal values are below 5%, which shows that the Heuristics works acceptably for the problem. Also, the execution times are no more than 780 seconds for the largest test instances. Moreover, for the real-time model, though not directly comparable, the solutions are fairly close to optimal and the execution time for the largest test instance is below 660 seconds. Hence, the efficiency of the heuristic for real-time model is satisfactory
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization
International audienceThe Cologne-Twente Workshop (CTW) on Graphs and Combinatorial Optimization started off as a series of workshops organized bi-annually by either Köln University or Twente University. As its importance grew over time, it re-centered its geographical focus by including northern Italy (CTW04 in Menaggio, on the lake Como and CTW08 in Gargnano, on the Garda lake). This year, CTW (in its eighth edition) will be staged in France for the first time: more precisely in the heart of Paris, at the Conservatoire National d’Arts et Métiers (CNAM), between 2nd and 4th June 2009, by a mixed organizing committee with members from LIX, Ecole Polytechnique and CEDRIC, CNAM
Control Systems in Engineering and Optimization Techniques
The portfolio diversification strategy study is useful to help investors to plan for the best investment strategy in maximizing return with the given level of risk or minimizing risk. Further, a new set of generalized sufficient conditions for the existence and uniqueness of the solution and finite-time stability has been achieved by using Generalized Gronwall-Bellman inequality. Moreover, a novel development is proposed to solve classical control theory’s difference diagrams and transfer functions. Advanced TCP strategies and free parametrization for continuous-time LTI systems and quality of operation of control systems are presented
Dynamic Capacity Control in Air Cargo Revenue Management
This book studies air cargo capacity control problems. The focus is on analyzing decision models with intuitive optimal decisions as well as on developing efficient heuristics and bounds. Three different models are studied: First, a model for steering the availability of cargo space on single legs. Second, a model that simultaneously optimizes the availability of both seats and cargo capacity. Third, a decision model that controls the availability of cargo capacity on a network of flights
商業集積を促進する地域差別政策の厚生分析:小売企業と居住者の空間分布と市場の失敗
Tohoku University博士(学術)thesi
Coarse preferences: representation, elicitation, and decision making
In this thesis we present a theory for learning and inference of user preferences with a
novel hierarchical representation that captures preferential indifference. Such models
of ’Coarse Preferences’ represent the space of solutions with a uni-dimensional, discrete
latent space of ’categories’. This results in a partitioning of the space of solutions
into preferential equivalence classes. This hierarchical model significantly reduces the
computational burden of learning and inference, with improvements both in computation
time and convergence behaviour with respect to number of samples. We argue that
this Coarse Preferences model facilitates the efficient solution of previously computationally
prohibitive recommendation procedures. The new problem of ’coordination
through set recommendation’ is one such procedure where we formulate an optimisation
problem by leveraging the factored nature of our representation. Furthermore, we
show how an on-line learning algorithm can be used for the efficient solution of this
problem. Other benefits of our proposed model include increased quality of recommendations
in Recommender Systems applications, in domains where users’ behaviour
is consistent with such a hierarchical preference structure. We evaluate the usefulness
of our proposed model and algorithms through experiments with two recommendation
domains - a clothing retailer’s online interface, and a popular movie database. Our experimental
results demonstrate computational gains over state of the art methods that
use an additive decomposition of preferences in on-line active learning for recommendation
Dynamic Capacity Control in Air Cargo Revenue Management
This work studies air cargo capacity control problems. The focus is on analyzing decision models with intuitive optimal decisions as well as on developing efficient heuristics and bounds. Three different models are studied: First, a model for steering the availability of cargo space on single legs. Second, a model that simultaneously optimizes the availability of both seats and cargo capacity. Third, a decision model that controls the availability of cargo capacity on a network of flights