• Industrial Engineering and Management Systems
• /
• 제12권4호
• /
• pp.336-350
• /
• 2013

This paper proposes a mathematical modeling-based approach for assessing disaster effects and selecting suitable mitigation alternatives to provide humanitarian relief (HR) supplies, shelter, rescue services, and long-term services after a disaster event. Mitigation steps, such as arrangement of shelter and providing HR items (food, water, medicine, etc.) are the immediate requirements after a disaster. Since governments and non-governmental organizations (NGOs) providing humanitarian aid need to know the requirements of relief supplies and resources for collecting relief supplies, organizing and initiating mitigation steps, a quick assessment of the requirements is the precondition for effective disaster management. Based on satellite images from weather forecasting channels, an area/dimension of the disaster-affected zones and the extent of the overall damage may often be obtained. The proposed approach then estimates the requirements for HR supplies, supporting resources, and rescue services using the census and other government data. It then determines reliable transportation routes, optimum collection and distribution centers, alternatives for resource support, rescue services, and long-term help needed for the disaster-affected zones. A numerical example illustrates the applicability of the model in disaster mitigation planning.

• Wind and Structures
• /
• 제9권1호
• /
• pp.37-58
• /
• 2006

The paper describes a study about effects of upstream hills on design wind loads using two mathematical approaches: Computational Fluid Dynamics (CFD) and Artificial Neural Network (NN for short). For this purpose CFD and NN tools have been developed using an object-oriented approach and C++ programming language. The CFD tool consists of solving the Reynolds time-averaged Navier-Stokes equations and $k-{\varepsilon}$ turbulence model using body-fitted nearly-orthogonal coordinate system. Subsequently, design wind load parameters such as speed-up ratio values have been generated for a wide spectrum of two-dimensional hill geometries that includes isolated and multiple steep and shallow hills. Ground roughness effect has also been considered. Such CFD solutions, however, normally require among other things ample computational time, background knowledge and high-capacity hardware. To assist the enduser, an easier, faster and more inexpensive NN model trained with the CFD-generated data is proposed in this paper. Prior to using the CFD data for training purposes, extensive validation work has been carried out by comparing with boundary layer wind tunnel (BLWT) data. The CFD trained NN (CFD-NN) has produced speed-up ratio values for cases such as multiple hills that are not covered by wind design standards such as the Commentaries of the National Building Code of Canada (1995). The CFD-NN results compare well with BLWT data available in literature and the proposed approach requires fewer resources compared to running BLWT experiments.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1994년도 추계학술발표회 및 정기총회
• /
• pp.1-2
• /
• 1994

With the prevalence of computers in modern organizations, simulation is receiving more atention as an effectvie decision -making tool. Simualtion is a computer-based numerical technique which uses mathmatical and logical models to approximate the behaviror of a real-world system. However, iptimization of synamic stochastic systems often defy analytical and algorithmic soluions. Although a simulation approach is often free fo the liminting assumption s of mathematical modeling, cost and time consiceration s make simulation the henayst's last resort. Therefore, whenever possible, analytical and algorithmica solutions are favored over simulation. This paper discussed the issues and procedrues for using simulation as a tool for optimization of stochastic complex systems that are dmodeled by computer simulation . Its emphasis is mostly on issues that are speicific to simulation optimization instead of consentrating on the general optimizationand mathematical programming techniques . A simulation optimization problem is an optimization problem where the objective function. constraints, or both are response that can only be evauated by computer simulation. As such, these functions are only implicit functions of decision parameters of the system, and often stochastic in nature as well. Most of optimization techniqes can be classified as single or multiple-resoneses techniques . The optimization of single response functins has been researched extensively and consists of many techniques. In the single response category, these strategies are gradient based search techniques, stochastic approximate techniques, response surface techniques, and heuristic search techniques. In the multiple response categroy, there are basically five distinct strategies for treating the responses and finding the optimum solution. These strategies are graphica techniqes, direct search techniques, constrained optimization techniques, unconstrained optimization techniques, and goal programming techniques. The choice of theprocedreu to employ in simulation optimization depends on the analyst and the problem to be solved. For many practival and industrial optimization problems where some or all of the system components are stochastic, the objective functions cannot be represented analytically. Therefore, modeling by computersimulation is one of the most effective means of studying such complex systems. In this paper, after discussion of simulation optmization techniques, the applications of above techniques will be presented in the modeling process of many flexible manufacturing systems.

• 한국컴퓨터정보학회논문지
• /
• 제21권5호
• /
• pp.73-77
• /
• 2016

This paper deals with the network reliability problem that decides the communication line between main two districts while the k districts were destroyed in military communication network that the n communication lines are connected in m districts. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with O(n) linear time complexity to solve the optimal solution for this problem. This paper suggests the flow path algorithm (FPA) and level path algorithm (LPA). The FPA is to search the maximum number of distinct paths between two districts. The LPA is to construct the levels and delete the unnecessary nodes and edges. The proposed algorithm can be get the same optimal solution as LP for experimental data.

• 한국항해항만학회지
• /
• 제35권9호
• /
• pp.707-715
• /
• 2011

To propose an ergonomic layout on the bridge, this study conducted a usability evaluation on the on-bridge navigational equipment of a college training ship that is in use at present. Through the usability evaluation on the training ship navigators, the possibility of operational errors with navigational equipment, the possibility of readout errors with display devices and even the effect of navigational equipment on navigation were evaluated beyond the scope of existing layouts, which adopt only the importance and usage frequency of navigational equipment. By taking ergonomic variables into consideration, this study suggested an optimized layout for on-bridge navigational equipment using a mathematical programming model.

• Journal of Information Technology Applications and Management
• /
• 제17권1호
• /
• pp.141-155
• /
• 2010

We develop an intelligent information system in a multilayer electronic supply chain network. Using the internet for supply chain management (SCM) is a key interest for contemporary managers and researchers. It has been realized that the internet can facilitate SCM by making real time information available and enabling collaboration between trading partners. Here, we propose a multi-agent system to analyze the performance of the elements of a supply network based on the attributes of the information flow. Each layer consists of elements which are differentiated by their performance throughout the supply network. The proposed agents measure and record the performance flow of elements considering their web interactions for a dynamic route selection. A dynamic programming approach is applied to determine the optimal route for a customer in the end-user layer.

• 한국경영과학회지
• /
• 제25권4호
• /
• pp.97-109
• /
• 2000

This work proposes a neural network approach to solve vehicle routing problems which have diverse application areas such as vehicle routing and robot programming. In solving these problems, classical mathematical approaches have many difficulties. In particular, it is almost impossible to implement a real-time vehicle routing with multiple vehicles. Recently, many researchers proposed methods to overcome the limitation by adopting heuristic algorithms, genetic algorithms, neural network techniques and others. The most basic model for path planning is the Travelling Salesman Problem(TSP) for a minimum distance path. We extend this for a problem with dynamic upcoming of new positions with multiple vehicles. In this paper, we propose an algorithm based on SOM(Self-Organization Map) to obtain a sub-optimal solution for a real-time vehicle routing problem. We develope a model of a generalized multiple TSP and suggest and efficient solving procedure.

• Journal of applied mathematics & informatics
• /
• 제14권1_2호
• /
• pp.173-183
• /
• 2004

Data envelopment analysis(DEA) is a mathematical programming approach to asses s relative efficiency of a group of decision-making units. In view of the defects of existing models in evaluating efficiency of the system with P independent subsystems, Yang et al. [10] introduced YMK model with the assumption that decision-making unit(DMU) is independent of each other. But in some production systems, decision-making units usually have some relationships in this way or that. In this paper, DEA model is given by assuming that DMUs can cooperate with others in its subgroups. Some property and the efficiency relationship of the whole system and its subsystems are given.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1990년도 춘계공동학술대회논문집; 한국과학기술원; 28 Apr. 1990
• /
• pp.49-60
• /
• 1990

Structured modeling provides a formal mathematical framework, language, and computer-based environment for conceiving, representing, and manipulating a wide variety of models. It provides a natural framework for integrated modeling owing to its explicit representation power for computational dependencies among submodels. Nevertheless, it doesn't seem to offer a systematic way of composing a structured model from submodels. In order to develop a systematic way, this paper discusses three key issues; (1) Genus structure of validated submodel, (2) Storing method of genus structure, and (3) Integration of genus structures to generate a new genus structure. To visualize the approach, a programming module is developed to implement the step-by-step integration.

• 한국컴퓨터정보학회논문지
• /
• 제21권6호
• /
• pp.77-81
• /
• 2016

This paper deals with the optimization problem that decides the routing of connection between multi-source and multi-sink. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with $O(mn)^2$ time complexity to solve the optimal solution for this problem. This paper suggests the simple method that assigns the possible call flow quantity to augmenting path of ($s_i,t_i$) city pair satisfied with demand of ($s_i,t_i$). The proposed algorithm can be get the same optimal solution as LP for experimental data.