Search results for: German tank problem

Authors: Mehmet Hakan Karaata

Abstract:

In this paper, we first coin a new graph theocratic problem with numerous applications. Second, we provide two algorithms for the problem. The first solution is using a brute-force techniques, whereas the second solution is based on an initial identification of the cycles in the given graph. We then provide a correctness proof of the algorithm. The applications of the problem include graph analysis, graph drawing and network structuring.

Keywords: algorithm, cycle, graph algorithm, graph theory, network structuring

Procedia PDF Downloads 376

Authors: Hashini E. Mohottala

Abstract:

We report the combine use of Wikispaces (WikiS) and Group Problem Solving (GPS) sessions conducted in the introductory level physics classes. As a part of this new teaching tool, some essay type problems were posted on the WikiS in weekly basis and students were encouraged to participate in problem solving without providing numerical final answers but the steps. Wikispace is used as a platform for students to meet online and create discussions. Each week students were further evaluated on problem solving skills opening up more opportunity for peer interaction through GPS. Each group was given a different problem to solve and the answers were graded. Students developed a set of skills in decision-making, problem solving, communication, negotiation, critical and independent thinking and teamwork through the combination of WikiS and GPS.

Keywords: group problem solving (GPS), wikispace (WikiS), physics education, learning

Procedia PDF Downloads 408

Authors: Sourabh Joshi, Tarun Sharma, Anurag Sharma

Abstract:

Ant Colony Optimization is heuristic Algorithm which has been proven a successful technique applied on number of combinatorial optimization problems. Two variants of Ant Colony Optimization algorithm named Ant System and Max-Min Ant System are implemented in MATLAB to solve travelling Salesman Problem and the results are compared. In, this paper both systems are analyzed by solving the some Travelling Salesman Problem and depict which system solve the problem better in term of cost and time.

Keywords: Ant Colony Optimization, Travelling Salesman Problem, Ant System, Max-Min Ant System

Procedia PDF Downloads 470

Authors: Boris Melnikov, Dmitrii Chaikovskii, Elena Melnikova

Abstract:

The traveling salesman problem (TSP) is a well-known optimization problem that seeks to find the shortest possible route that visits a set of points and returns to the starting point. In this paper, we apply some heuristics of the TSP for the task of restoring the DNA matrix. This restoration problem is often considered in biocybernetics. For it, we must recover the matrix of distances between DNA sequences if not all the elements of the matrix under consideration are known at the input. We consider the possibility of using this method in the testing of distance calculation algorithms between a pair of DNAs to restore the partially filled matrix.

Keywords: optimization problems, DNA matrix, partially filled matrix, traveling salesman problem, heuristic algorithms

Procedia PDF Downloads 142

Authors: Wahid Sharif

Abstract:

Germany is a country that is traditionally highly regarded in the countries of South Asia. The German people and German products are valued and generate a positive response in South Asia. The main objective of this research is to evaluate and analyze various dimensions of a Such Comparative Study of Geography (German & Pakistan). Basically, Germany is located in Central Europe; it has common borders with Denmark, the Netherlands, Belgium, Luxembourg, France, Switzerland, Austria, the Czech Republic and Poland, Its total area is around 356,854 sq km. Pakistan has a strategic geo-political location at the corridor of the world's major maritime oil supply lines and has close proximity to the resource and oil-rich Central Asian countries. Germany and Pakistan enjoy intimately cordial relations. Germany has taken large measures to aid the south Asian countries in its economic and governmental hardship. Commercial trade between Berlin and Islamabad has also been essential as Germany is Pakistan’s fourth largest trade partner, also Germany is home to 35,081 Pakistani immigrants overall, and the two nations have almost always had a friendly bond. The aim of this research is to initiate fruitful discussions about appropriate strategies and actions in the face of the economic and geopolitical challenges faced by Pakistan and the role that societies of each country can play in assisting the region in overcoming its problems. The research would aim to serve as a facilitator for developing collaborative research projects between different institutions and disciplines in the Germany and Pakistan institutions. This is important, as the issues of poverty, illiteracy, unemployment and social inequities need to be understood properly. Though geographically far apart from each other and not having gone through the experience that the Asian states had undergone in their relations with the Portuguese, Dutch, French and English. Pakistan and Germany did not have to forget any unpleasant memories of a colonial past. On the contrary, the freedom fighters of the Indo-Pak subcontinent did not make secret of their sympathy-nay-admiration for Germany, which, though defeated in World War I and World War II by Anglo-French and Anglo-American blocs respectively, had shaken the British and French empires to their foundation in the protracted wars.

Keywords: relations, cultural, socio economic, bilateral agreement

Procedia PDF Downloads 29

Authors: Terence Soule, Tami Al Ghamdi

Abstract:

To study how to transfer knowledge from multiple source problems to the target problem, we modeled the Transfer Learning (TL) process using Genetic Algorithms as the model solver. TL is the process that aims to transfer learned data from one problem to another problem. The TL process aims to help Machine Learning (ML) algorithms find a solution to the problems. The Genetic Algorithms (GA) give researchers access to information that we have about how the old problem is solved. In this paper, we have five different source problems, and we transfer the knowledge to the target problem. We studied different scenarios of the target problem. The results showed combined knowledge from multiple source problems improves the GA performance. Also, the process of combining knowledge from several problems results in promoting diversity of the transferred population.

Keywords: transfer learning, genetic algorithm, evolutionary computation, source and target

Procedia PDF Downloads 131

Authors: Ocotlán Díaz-Parra, Jorge A. Ruiz-Vanoye, Alejandro Fuentes-Penna, Beatriz Bernabe-Loranca, Patricia Ambrocio-Cruz, José J. Hernández-Flores

Abstract:

The Maritime Platform Transport Problem of Solid, Special and Dangerous Waste consist of to minimize the monetary value of carry different types of waste from one location to another location using ships. We offer a novel mathematical, the characterization of the problem and the use CPLEX to find the optimal values to solve the Solid, Special and Hazardous Waste Transportation Problem of offshore platforms instances of Mexican state-owned petroleum company (PEMEX). The set of instances used are WTPLib real instances and the tool CPLEX solver to solve the MPTPSSDW problem.

Keywords: oil platform, transport problem, waste, solid waste

Procedia PDF Downloads 462

Authors: Kalpana Dahiya

Abstract:

This paper discusses a two-level hierarchical time minimization transportation problem, which is an important class of transportation problems arising in industries. This problem has been studied by various researchers, and a number of polynomial time iterative algorithms are available to find its solution. All the existing algorithms, though efficient, have some shortcomings. The current study proposes an alternate solution algorithm for the problem that is more efficient in terms of computational time than the existing algorithms. The results justifying the underlying theory of the proposed algorithm are given. Further, a detailed comparison of the computational behaviour of all the algorithms for randomly generated instances of this problem of different sizes validates the efficiency of the proposed algorithm.

Keywords: global optimization, hierarchical optimization, transportation problem, concave minimization

Procedia PDF Downloads 155

Authors: Farzaneh Rajabighamchi, Stan van Hoesel, Christof Defryn

Abstract:

The generalized traveling salesman problem (GTSP) is an extension of the traveling salesman problem (TSP) where the set of nodes is partitioned into clusters, and the salesman must visit exactly one node per cluster. In this research, we apply the definition of the GTSP to an order picker routing problem with multiple locations per product. As such, each product represents a cluster and its corresponding nodes are the locations at which the product can be retrieved. To pick a certain product item from the warehouse, the picker needs to visit one of these locations during its pick tour. As all products are scattered throughout the warehouse, the product clusters not separated geographically. We propose an exact LP model as well as heuristic and meta-heuristic solution algorithms for the order picking problem with multiple product locations.

Keywords: warehouse optimization, order picking problem, generalised travelling salesman problem, heuristic algorithm

Procedia PDF Downloads 103

Authors: Daniela Greven, Kathrin Endres, Shugana Sundralingam

Abstract:

The use of chatbots has hardly been established in B2B companies to date and involves various challenges. The goal of this paper is to identify the biggest obstacles to the successful implementation of chatbots in B2B companies and to develop measures to overcome them. The obstacles are identified by conducting expert interviews within the framework of Eisenhardt's case study research. These are examined through a socio-technical analysis focusing on people, technology, and organization. By means of systematic literature research and in-depth interviews with German chatbot providers and customers of chatbots, measures for overcoming the obstacles are identified. Using interviews with experts from German chatbot providers, the responsible stakeholders of each measure according to the RASCI Responsibility Matrix are identified. The study shows that there are major obstacles in all areas of a socio-technical system that can cause the implementation of a chatbot to fail. A total of 44 implementation obstacles and 58 measures to overcome these obstacles are identified. The study shows that there are major obstacles in the areas of people, technology, and organization of a socio-technical system that can cause the implementation of a chatbot to fail. A holistic view is therefore essential. The results provide firms with a guideline on how to overcome potential obstacles during chatbot implementation in B2B customer service.

Keywords: chatbots, socio-technical analysis, B2B customer service, implementation success factors

Procedia PDF Downloads 84

Authors: Ivan Baravy

Abstract:

Interpolation problem, as it was initially posed in terms of polynomials, is well researched. However, further mathematical developments extended it significantly. Trigonometric interpolation is widely used in Fourier analysis, while its generalized representation as exponential interpolation is applicable to such problem of mathematical physics as modelling of Ziegler-Biersack-Littmark repulsive interatomic potentials. Formulated for finite fields, this problem arises in decoding Reed--Solomon codes. This paper shows the relation between different interpretations of the problem through the class of matrices of special structure - Hankel matrices.

Keywords: Berlekamp-Massey algorithm, exponential interpolation, finite fields, Hankel matrices, Hankel polynomials

Procedia PDF Downloads 510

Authors: Mahmoud Lot

Abstract:

In this article, we will discuss the solution of elliptic optimal control problem. First, by using the nite element method, we obtain the discrete form of the problem. The obtained discrete problem is actually a large scale constrained optimization problem. Solving this optimization problem with traditional methods is difficult and requires a lot of CPU time and memory. But split Bergman method converts the constrained problem to an unconstrained, and hence it saves time and memory requirement. Then we use the split Bregman method for solving this problem, and examples show the speed and accuracy of split Bregman methods for solving these types of problems. We also use the SQP method for solving the examples and compare with the split Bregman method.

Keywords: Split Bregman Method, optimal control with elliptic partial differential equation constraint, finite element method

Procedia PDF Downloads 147

Authors: Mohsen Ziaee

Abstract:

Almost all existing researches on the flowshop scheduling problems focus on the permutation schedules and there is insufficient study dedicated to the general flowshop scheduling problems in the literature, since the modeling and solving of the general flowshop scheduling problems are more difficult than the permutation ones, especially for the large-size problem instances. This paper considers the general flowshop scheduling problem with the objective function of the makespan (F//Cmax). We first find the optimal solution of the problem by solving a mixed integer linear programming model. An efficient heuristic method is then presented to solve the problem. An ant colony optimization algorithm is also proposed for the problem. In order to evaluate the performance of the methods, computational experiments are designed and performed. Numerical results show that the heuristic algorithm can result in reasonable solutions with low computational effort and even achieve optimal solutions in some cases.

Keywords: scheduling, general flow shop scheduling problem, makespan, heuristic

Procedia PDF Downloads 200

Authors: Karan Bhandari

Abstract:

Almost quarter region of Indian terrain is covered by grasslands. Grass being a low maintenance perennial crop is in abundance. Farmers are well acquainted with its nature, yield and storage. The aim of this paper is to study and identify the applicability of grass as a source of bio fuel. Anaerobic break down is a well-recognized technology. This process is vital for harnessing bio fuel from grass. Grass is a lignocellulosic material which is fibrous and can readily cause problems with parts in motion. Further, it also has a tendency to float. This paper also deals with the ideal digester configuration for biogas generation from grass. Intensive analysis of the literature is studied on the optimum production of grass storage in accordance with bio digester specifications. Subsequent to this two different digester systems were designed, fabricated, analyzed. The first setup was a double stage wet continuous arrangement usually known as a Continuously Stirred Tank Reactor (CSTR). The next was a double stage, double phase system implementing Sequentially Fed Leach Beds using an Upflow Anaerobic Sludge Blanket (SLBR-UASB). The above methodologies were carried for the same feedstock acquired from the same field. Examination of grass silage was undertaken using Biomethane Potential values. The outcomes portrayed that the Continuously Stirred Tank Reactor system produced about 450 liters of methane per Kg of volatile solids, at a detention period of 48 days. The second method involving Leach Beds produced about 340 liters of methane per Kg of volatile solids with a detention period of 28 days. The results showcased that CSTR when designed exclusively for grass proved to be extremely efficient in methane production. The SLBR-UASB has significant potential to allow for lower detention times with significant levels of methane production. This technology has immense future for research and development in India in terms utilizing of grass crop as a non-conventional source of fuel.

Keywords: biomethane potential values, bio digester specifications, continuously stirred tank reactor, upflow anaerobic sludge blanket

Procedia PDF Downloads 238

Authors: Doyin Afolabi, Phillip Adewole, Oladipupo Sennaike

Abstract:

Most well-known classifiers, including the decision tree algorithm, can make predictions on balanced datasets efficiently. However, the decision tree algorithm tends to be biased towards imbalanced datasets because of the skewness of the distribution of such datasets. To overcome this problem, this study proposes a weighted decision tree algorithm that aims to remove the bias toward the majority class and prevents the reduction of majority observations in imbalance datasets classification. The proposed weighted decision tree algorithm was tested on three imbalanced datasets- cancer dataset, german credit dataset, and banknote dataset. The specificity, sensitivity, and accuracy metrics were used to evaluate the performance of the proposed decision tree algorithm on the datasets. The evaluation results show that for some of the weights of our proposed decision tree, the specificity, sensitivity, and accuracy metrics gave better results compared to that of the ID3 decision tree and decision tree induced with minority entropy for all three datasets.

Keywords: data mining, decision tree, classification, imbalance dataset

Procedia PDF Downloads 115

Authors: Cagri Memis, Muzaffer Kapanoglu

Abstract:

The school bus routing problem (SBRP) is a variant of the Vehicle Routing Problem (VRP) classified as a location-allocation-routing problem. In this study, the SBRP is decomposed into two sub-problems: (1) bus route generation and (2) bus stop selection to solve large instances of the SBRP in reasonable computational times. To solve the first sub-problem, we propose a genetic algorithm to generate bus routes. Once the routes have been fixed, a sub-problem remains of allocating students to stops considering the capacity of the buses and the walkability constraints of the students. While the exact method solves small-scale problems, treating large-scale problems with the exact method becomes complex due to computational problems, a deficiency that the genetic algorithm can overcome. Results obtained from the proposed approach on 150 instances up to 250 stops show that the matheuristic algorithm provides better solutions in reasonable computational times with respect to benchmark algorithms.

Keywords: genetic algorithm, matheuristic, school bus routing problem, vehicle routing problem

Procedia PDF Downloads 63

Authors: Dragana Bubulj

Abstract:

The Former Republic of Yugoslavia was a sort of protective umbrella, a unique concept of gathering different ethnical, cultural, and religious identities, as well as diverse intersections of those. After 43-months long civil war and states disintegration in 1995, which resulted in 5 post-Yugoslav countries, Yugoslav Diaspora experienced radical changes. In Germany, one of the countries with the highest percentage of Yugoslav emigration, segregation on ethno-national grounds was empowered by the outbreak of the conflict: firstly on a socio-cultural level, and followed by changes on the level of institutional organizing. Psycho-emotional and financial involvement of Diaspora into the war is also not to be neglected. People of Serbian origin have been additionally overstrained with the designation of Serbs as war criminals in German media and the public sphere. In this way, the path from 'being a Yugoslav' toward 'becoming a Serb', outside nowadays Serbia, has been qualitatively different in comparison to potential identity shiftings experienced by other members of Former Yugoslav population. This paper is part of an ongoing PhD research and tackles biographical narratives of academics of Serbian origin in one German region. Paper addresses processes of post-Yugoslav identity negotiations in Diaspora settings, nationalistic tendentious among second generation youth, and discusses - based on NS-references founded in collected data - question of historicity of biographies.

Keywords: biography, diaspora, ethnography, former republic of Yugoslavia, identity

Procedia PDF Downloads 286

Authors: Ines Gasmi, Salima Smiti, Makram Soui, Khaled Ghedira

Abstract:

Credit risk is considered as one of the important issues for financial institutions. It provokes great losses for banks. To this objective, numerous methods for credit risk evaluation have been proposed. Many evaluation methods are black box models that cannot adequately reveal information hidden in the data. However, several works have focused on building transparent rules-based models. For credit risk assessment, generated rules must be not only highly accurate, but also highly interpretable. In this paper, we aim to build both, an accurate and transparent credit risk evaluation model which proposes a set of classification rules. In fact, we consider the credit risk evaluation as an optimization problem which uses a genetic programming (GP) algorithm, where the goal is to maximize the accuracy of generated rules. We evaluate our proposed approach on the base of German and Australian credit datasets. We compared our finding with some existing works; the result shows that the proposed GP outperforms the other models.

Keywords: credit risk assessment, rule generation, genetic programming, feature selection

Procedia PDF Downloads 339

Authors: Christian Klettner, Ian Eames, Tristan Robinson

Abstract:

Tsunami is characterised by their very long time periods and can have devastating consequences when these inundate through built-up coastal regions as in the 2004 Indian Ocean and 2011 Tohoku Tsunami. This work aims to investigate the effect of these long waves on the flow through and around a group of buildings, which are abstracted to circular cylinders. The research approach used in this study was using experiments and numerical simulations. Large-scale experiments were carried out at HR Wallingford. The novelty of these experiments is (I) the number of bodies present (up to 64), (II) the long wavelength of the input waves (80 seconds) and (III) the width of the tank (4m) which gives the unique opportunity to investigate three length scales, namely the diameter of the building, the diameter of the array and the width of the tank. To complement the experiments, dam break flow past the same arrays is investigated using three-dimensional numerical simulations in OpenFOAM. Dam break flow was chosen as it is often used as a surrogate for the tsunami in previous research and is used here as there are well defined initial conditions and high quality previous experimental data for the case of a single cylinder is available. The focus of this work is to better understand the effect of the solid void fraction on the force and flow through and around the array. New qualitative and quantitative diagnostics are developed and tested to analyse the complex coupled interaction between the cylinders.

Keywords: computational fluid dynamics, tsunami, forces, complex geometry

Procedia PDF Downloads 185

Authors: Broderick Crawford, Ricardo Soto, Natalia Berrios, Eduardo Olguin

Abstract:

In this paper, we present a binary cat swarm optimization for solving the Set covering problem. The set covering problem is a well-known NP-hard problem with many practical applications, including those involving scheduling, production planning and location problems. Binary cat swarm optimization is a recent swarm metaheuristic technique based on the behavior of discrete cats. Domestic cats show the ability to hunt and are curious about moving objects. The cats have two modes of behavior: seeking mode and tracing mode. We illustrate this approach with 65 instances of the problem from the OR-Library. Moreover, we solve this problem with 40 new binarization techniques and we select the technical with the best results obtained. Finally, we make a comparison between results obtained in previous studies and the new binarization technique, that is, with roulette wheel as transfer function and V3 as discretization technique.

Keywords: binary cat swarm optimization, binarization methods, metaheuristic, set covering problem

Procedia PDF Downloads 388

Authors: Hernández Eva Selene, Reyna Mary Carmen, Rivera Héctor, Barragán Irving

Abstract:

We propose an approach that jointly addresses the layout of a facility and the scheduling of a sequence of jobs. In real production, these two problems are interrelated. However, they are treated separately in the literature. Our approach is an extension of the job shop problem with transportation delay, where the location of the machines is selected among possible sites. The model minimizes the makespan, using the short processing times rule with two algorithms; the first one considers all the permutations for the location of machines, and the second only a heuristic to select some specific permutations that reduces computational time. Some instances are proved and compared with literature.

Keywords: layout problem, job shop scheduling problem, concurrent scheduling and layout problem, metaheuristic

Procedia PDF Downloads 597

Authors: M. Zielinski, M. Debowski, P. Rusanowska, A. Glowacka-Gil, M. Zielinska, A. Cydzik-Kwiatkowska, J. Kazimierowicz

Abstract:

Technologies for the micro-biogas plant with heating and mixing systems are presented as a part of the Research Coordination for a Low-Cost Biomethane Production at Small and Medium Scale Applications (Record Biomap). The main objective of the Record Biomap project is to build a network of operators and scientific institutions interested in cooperation and the development of promising technologies in the sector of small and medium-sized biogas plants. The activities carried out in the project will bridge the gap between research and market and reduce the time of implementation of new, efficient technological and technical solutions. Reactor with simultaneously mixing and heating system is a concrete tank with a rectangular cross-section. In the reactor, heating is integrated with the mixing of substrate and anaerobic sludge. This reactor is solution dedicated for substrates with high solids content, which cannot be introduced to the reactor with pumps, even with positive displacement pumps. Substrates are poured to the reactor and then with a screw pump, they are mixed with anaerobic sludge. The pumped sludge, flowing through the screw pump, is simultaneously heated by a heat exchanger. The level of the fermentation sludge inside the reactor chamber is above the bottom edge of the cover. Cover of the reactor is equipped with the screw pump driver. Inside the reactor, an electric motor is installed that is driving a screw pump. The heated sludge circulates in the digester. The post-fermented sludge is collected using a drain well. The inlet to the drain well is below the level of the sludge in the digester. The biogas is discharged from the reactor by the biogas intake valve located on the cover. The technology is very useful for fermentation of lignocellulosic biomass and substrates with high content of dry mass (organic wastes). The other technology is a reactor for micro-biogas plant with a pressure mixing system. The reactor has a form of plastic or concrete tank with a circular cross-section. The effective mixing of sludge is ensured by profiled at 90° bottom of the tank. Substrates for fermentation are supplied by an inlet well. The inlet well is equipped with a cover that eliminates odour release. The introduction of a new portion of substrates is preceded by pumping of digestate to the disposal well. Optionally, digestate can gravitationally flow to digestate storage tank. The obtained biogas is discharged into the separator. The valve supplies biogas to the blower. The blower presses the biogas from the fermentation chamber in such a way as to facilitate the introduction of a new portion of substrates. Biogas is discharged from the reactor by valve that enables biogas removal but prevents suction from outside the reactor.

Keywords: biogas, digestion, heating system, mixing system

Procedia PDF Downloads 139

Authors: Makoto Hasegawa, Seika Tokumitsu

Abstract:

Spectra of light beams emitted from white-color LED torches are different from those of conventional electric torches. In order to confirm if white-color LED torches can be used as light sources for popular sunset color demonstrations in spite of such differences, spectra of travelled light beams and scattered light beams with each of a white-color LED torch (composed of a blue LED and yellow-color fluorescent material) and a conventional electric torch as a light source were measured and compared with each other in a 50 cm-long water tank for sunset color demonstration experiments. Suspension liquid was prepared from acryl-emulsion and tap-water in the water tank, and light beams from the white-color LED torch or the conventional electric torch were allowed to travel in this suspension liquid. Sunset-like color was actually observed when the white-color LED torch was used as the light source in sunset color demonstrations. However, the observed colors when viewed with naked eye look slightly different from those obtainable with the conventional electric torch. At the same time, with the white-color LED, changes in colors in short to middle wavelength regions were recognized with careful observations. From those results, white-color LED torches are confirmed to be applicable as light sources in sunset color demonstrations, although certain attentions have to be paid. Further advanced classes will be successfully performed with white-color LED torches as light sources.

Keywords: blue sky demonstration, sunset color demonstration, white LED torch, physics education

Procedia PDF Downloads 275

Authors: Monika Florczak-Wator

Abstract:

The model of positive obligations of the state concerning the protection of the rights of an individual was created within the jurisdiction of the German Federal Constitutional Court in the 1970s. That model assumes that the state should protect an individual against infringement of their fundamental rights by another individual. It is based on the idea concerning the modification of the function and duties of the state towards an individual and society. Initially the state was perceived as the main infringer of the fundamental rights of an individual formulating the individual’s obligations of negative nature (obligation of noninterference), however, at present the state is perceived as a guarantor and protector of the fundamental rights of an individual of positive nature (obligation of protection). Examination of the chosen judicial decisions of that court will enable us to determine what the obligation of protection is specifically about, when it is updated and whether it is accompanied by claims of an individual requesting the state to take actions protecting their fundamental rights against infringement by the private entities. The comparative perspective for the German model of positive obligations of the state will be an analogous model present in the jurisdiction of the European Court of Human Rights. It is justified to include it in the research as the Convention, similarly to the constitution, focuses on the protection of an individual against the infringement of their rights by the state and both models have been developed within the jurisdiction for several dozens of years. Analysis of the provisions of the Constitution of the Republic of Poland as well as judgements of the Polish Constitutional Tribunal will allow for the presentation of the application the model of the protective duties of the state in Poland.

Keywords: human rights, horizontal relationships, constitution, state protection

Procedia PDF Downloads 476

Authors: Mira Ezora Zainal Abidin, Siti Fauzuna Othman, Zalina Harun, M. Hafiz M. Pikri

Abstract:

In a fire incident involving a Nitrogen storage tank that over-pressured and exploded, resulting in a fire in one of the units in a refinery, lack of data and evidence hampered the investigation to determine the root cause. Instrumentation and fittings were destroyed in the fire. To make it worst, this incident occurred during the COVID-19 pandemic, making collecting and testing evidence delayed. In addition to that, the storage tank belonged to a third-party company which requires legal agreement prior to the refinery getting approval to test the remains. Despite all that, the investigation had to be carried out with stakeholders demanding answers. The investigation team had to devise alternative means to support whatever little evidence came out as the most probable root cause. International standards, practices, and previous incidents on similar tanks were referred. To narrow down to just one root cause from 8 possible causes, transient simulations were conducted to simulate the overpressure scenarios to prove and eliminate the other causes, leaving one root cause. This paper shares the methodology used and details how transient simulations were applied to help solve this. The experience and lessons learned gained from the event investigation and from numerous case studies via transient analysis in finding the root cause of the accident leads to the formulation of future mitigations and design modifications aiming at preventing such incidents or at least minimize the consequences from the fire incident.

Keywords: fire, transient, simulation, relief

Procedia PDF Downloads 84

Authors: S. Nasri, H. Bouziri

Abstract:

Disasters are quite experienced in our days. They are caused by floods, landslides, and building fires that is the main objective of this study. To cope with these unexpected events, precautions must be taken to protect human lives. The emphasis on disposal work focuses on the resolution of the evacuation problem in case of no-notice disaster. The problem of evacuation is listed as a dynamic network flow problem. Particularly, we model the evacuation problem as an earliest arrival flow problem with load dependent transit time. This problem is classified as NP-Hard. Our challenge here is to propose a metaheuristic solution for solving the evacuation problem. We define our objective as the maximization of evacuees during earliest periods of a time horizon T. The objective provides the evacuation of persons as soon as possible. We performed an experimental study on emergency evacuation from the tunisian children’s hospital. This work prompts us to look for evacuation plans corresponding to several situations where the network dynamically changes.

Keywords: dynamic network flow, load dependent transit time, evacuation strategy, earliest arrival flow problem, tabu search metaheuristic

Procedia PDF Downloads 365

Authors: Divyesh Patel, Tanuja Srivastava

Abstract:

This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results are presented.

Keywords: discrete tomography, exactly-1-4-adjacency, simulated annealing, binary matrices

Procedia PDF Downloads 400

Authors: Chaghoub Soraya, Zhang Xiaoyan

Abstract:

This research presents the first constant approximation algorithm to the p-median network design problem with multiple cable types. This problem was addressed with a single cable type and there is a bifactor approximation algorithm for the problem. To the best of our knowledge, the algorithm proposed in this paper is the first constant approximation algorithm for the p-median network design with multiple cable types. The addressed problem is a combination of two well studied problems which are p-median problem and network design problem. The introduced algorithm is a random sampling approximation algorithm of constant factor which is conceived by using some random sampling techniques form the literature. It is based on a redistribution Lemma from the literature and a steiner tree problem as a subproblem. This algorithm is simple, and it relies on the notions of random sampling and probability. The proposed approach gives an approximation solution with one constant ratio without violating any of the constraints, in contrast to the one proposed in the literature. This paper provides a (21 + 2)-approximation algorithm for the p-median network design problem with multiple cable types using random sampling techniques.

Keywords: approximation algorithms, buy-at-bulk, combinatorial optimization, network design, p-median

Procedia PDF Downloads 190

Authors: Win Ko Ko, A. N. Temnov

Abstract:

The problem of nonlinear oscillations of a two-layer liquid completely filling a limited volume is considered. Using two basic asymmetric harmonics excited in two mutually perpendicular planes, ordinary differential equations of nonlinear oscillations of the interface of a two-layer liquid are investigated. In this paper, hydrodynamic coefficients of linear and nonlinear problems in integral relations were determined. As a result, the instability regions of forced oscillations of a two-layered liquid in a cylindrical tank occurring in the plane of action of the disturbing force are constructed, as well as the dynamic instability regions of the parametric resonance for different ratios of densities of the upper and lower liquids depending on the amplitudes of liquids from the excitations frequencies. Steady-state regimes of fluid motion were found in the regions of dynamic instability of the initial oscillation form. The Bubnov-Galerkin method is used to construct instability regions for approximate solution of nonlinear differential equations.

Keywords: nonlinear oscillations, two-layered liquid, instability region, hydrodynamic coefficients, resonance frequency

Procedia PDF Downloads 208

Authors: Abubakar Sa’adatu Mohammed

Abstract:

This paper reports on a study of problem solving differences between expert and novice Problem solvers for effective physics teaching. Significant differences were found both at the conceptual level and at the level of critical thinking, creative thinking and reasoning. It is suggested for a successful solution of a problem, conceptual knowledge alone may not be sufficient. There is the need of the knowledge of how the conceptual knowledge should be applied (problem solving skills). It is hoped that this research might contribute to efforts of exploring ways for students to acquire a powerful conceptual toolkit based on experts like problem solvers approach for effective teaching delivery.

Keywords: conceptual knowledge, procedural knowledge, critical thinking, creative thinking, reasoning ability

Procedia PDF Downloads 286