• Title/Summary/Keyword: optimization problems

Search Result 2,418, Processing Time 0.028 seconds

Improvement of Energy Efficiency of Plants Factory by Arranging Air Circulation Fan and Air Flow Control Based on CFD (CFD 기반의 순환 팬 배치 및 유속조절에 의한 식물공장의 에너지 효율 향상)

  • Moon, Seung-Mi;Kwon, Sook-Youn;Lim, Jae-Hyun
    • Journal of Internet Computing and Services
    • /
    • v.16 no.1
    • /
    • pp.57-65
    • /
    • 2015
  • As information technology fusion is accelerated, the researches to improve the quality and productivity of crops inside a plant factory actively progress. Advanced growth environment management technology that can provide thermal environment and air flow suited to the growth of crops and considering the characteristics inside a facility is necessary to maximize productivity inside a plant factory. Currently running plant factories are designed to rely on experience or personal judgment; hence, design and operation technology specific to plant factories are not established, inherently producing problems such as uneven crop production due to the deviation of temperature and air flow and additional increases in energy consumption after prolonged cultivation. The optimization process has to be set up in advance for the arrangement of air flow devices and operation technology using computational fluid dynamics (CFD) during the design stage of a facility for plant factories to resolve the problems. In this study, the optimum arrangement and air flow of air circulation fans were investigated to save energy while minimizing temperature deviation at each point inside a plant factory using CFD. The condition for simulation was categorized into a total of 12 types according to installation location, quantity, and air flow changes in air circulation fans. Also, the variables of boundary conditions for simulation were set in the same level. The analysis results for each case showed that an average temperature of 296.33K matching with a set temperature and average air flow velocity of 0.51m/s suiting plant growth were well-maintained under Case 4 condition wherein two sets of air circulation fans were installed at the upper part of plant cultivation beds. Further, control of air circulation fan set under Case D yielded the most excellent results from Case D-3 conditions wherein air velocity at the outlet was adjusted to 2.9m/s.

An Efficient Heuristic for Storage Location Assignment and Reallocation for Products of Different Brands at Internet Shopping Malls for Clothing (의류 인터넷 쇼핑몰에서 브랜드를 고려한 상품 입고 및 재배치 방법 연구)

  • Song, Yong-Uk;Ahn, Byung-Hyuk
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.2
    • /
    • pp.129-141
    • /
    • 2010
  • An Internet shopping mall for clothing operates a warehouse for packing and shipping products to fulfill its orders. All the products in the warehouse are put into the boxes of same brands and the boxes are stored in a row on shelves equiped in the warehouse. To make picking and managing easy, boxes of the same brands are located side by side on the shelves. When new products arrive to the warehouse for storage, the products of a brand are put into boxes and those boxes are located adjacent to the boxes of the same brand. If there is not enough space for the new coming boxes, however, some boxes of other brands should be moved away and then the new coming boxes are located adjacent in the resultant vacant spaces. We want to minimize the movement of the existing boxes of other brands to another places on the shelves during the warehousing of new coming boxes, while all the boxes of the same brand are kept side by side on the shelves. Firstly, we define the adjacency of boxes by looking the shelves as an one dimensional series of spaces to store boxes, i.e. cells, tagging the series of cells by a series of numbers starting from one, and considering any two boxes stored in the cells to be adjacent to each other if their cell numbers are continuous from one number to the other number. After that, we tried to formulate the problem into an integer programming model to obtain an optimal solution. An integer programming formulation and Branch-and-Bound technique for this problem may not be tractable because it would take too long time to solve the problem considering the number of the cells or boxes in the warehouse and the computing power of the Internet shopping mall. As an alternative approach, we designed a fast heuristic method for this reallocation problem by focusing on just the unused spaces-empty cells-on the shelves, which results in an assignment problem model. In this approach, the new coming boxes are assigned to each empty cells and then those boxes are reorganized so that the boxes of a brand are adjacent to each other. The objective of this new approach is to minimize the movement of the boxes during the reorganization process while keeping the boxes of a brand adjacent to each other. The approach, however, does not ensure the optimality of the solution in terms of the original problem, that is, the problem to minimize the movement of existing boxes while keeping boxes of the same brands adjacent to each other. Even though this heuristic method may produce a suboptimal solution, we could obtain a satisfactory solution within a satisfactory time, which are acceptable by real world experts. In order to justify the quality of the solution by the heuristic approach, we generate 100 problems randomly, in which the number of cells spans from 2,000 to 4,000, solve the problems by both of our heuristic approach and the original integer programming approach using a commercial optimization software package, and then compare the heuristic solutions with their corresponding optimal solutions in terms of solution time and the number of movement of boxes. We also implement our heuristic approach into a storage location assignment system for the Internet shopping mall.

Optimal Operation of Gas Engine for Biogas Plant in Sewage Treatment Plant (하수처리장 바이오가스 플랜트의 가스엔진 최적 운영 방안)

  • Kim, Gill Jung;Kim, Lae Hyun
    • Journal of Energy Engineering
    • /
    • v.28 no.2
    • /
    • pp.18-35
    • /
    • 2019
  • The Korea District Heating Corporation operates a gas engine generator with a capacity of $4500m^3 /day$ of biogas generated from the sewage treatment plant of the Nanji Water Recycling Center and 1,500 kW. However, the actual operation experience of the biogas power plant is insufficient, and due to lack of accumulated technology and know-how, frequent breakdown and stoppage of the gas engine causes a lot of economic loss. Therefore, it is necessary to prepare technical fundamental measures for stable operation of the power plant In this study, a series of process problems of the gas engine plant using the biogas generated in the sewage treatment plant of the Nanji Water Recovery Center were identified and the optimization of the actual operation was made by minimizing the problems in each step. In order to purify the gas, which is the main cause of the failure stop, the conditions for establishing the quality standard of the adsorption capacity of the activated carbon were established through the analysis of the components and the adsorption test for the active carbon being used at present. In addition, the system was applied to actual operation by applying standards for replacement cycle of activated carbon to minimize impurities, strengthening measurement period of hydrogen sulfide, localization of activated carbon, and strengthening and improving the operation standards of the plant. As a result, the operating performance of gas engine # 1 was increased by 530% and the operation of the second engine was increased by 250%. In addition, improvement of vent line equipment has reduced work process and increased normal operation time and operation rate. In terms of economic efficiency, it also showed a sales increase of KRW 77,000 / year. By applying the strengthening and improvement measures of operating standards, it is possible to reduce the stoppage of the biogas plant, increase the utilization rate, It is judged to be an operational plan.

A Comparative Analysis of Social Commerce and Open Market Using User Reviews in Korean Mobile Commerce (사용자 리뷰를 통한 소셜커머스와 오픈마켓의 이용경험 비교분석)

  • Chae, Seung Hoon;Lim, Jay Ick;Kang, Juyoung
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.4
    • /
    • pp.53-77
    • /
    • 2015
  • Mobile commerce provides a convenient shopping experience in which users can buy products without the constraints of time and space. Mobile commerce has already set off a mega trend in Korea. The market size is estimated at approximately 15 trillion won (KRW) for 2015, thus far. In the Korean market, social commerce and open market are key components. Social commerce has an overwhelming open market in terms of the number of users in the Korean mobile commerce market. From the point of view of the industry, quick market entry, and content curation are considered to be the major success factors, reflecting the rapid growth of social commerce in the market. However, academics' empirical research and analysis to prove the success rate of social commerce is still insufficient. Henceforward, it is to be expected that social commerce and the open market in the Korean mobile commerce will compete intensively. So it is important to conduct an empirical analysis to prove the differences in user experience between social commerce and open market. This paper is an exploratory study that shows a comparative analysis of social commerce and the open market regarding user experience, which is based on the mobile users' reviews. Firstly, this study includes a collection of approximately 10,000 user reviews of social commerce and open market listed Google play. A collection of mobile user reviews were classified into topics, such as perceived usefulness and perceived ease of use through LDA topic modeling. Then, a sentimental analysis and co-occurrence analysis on the topics of perceived usefulness and perceived ease of use was conducted. The study's results demonstrated that social commerce users have a more positive experience in terms of service usefulness and convenience versus open market in the mobile commerce market. Social commerce has provided positive user experiences to mobile users in terms of service areas, like 'delivery,' 'coupon,' and 'discount,' while open market has been faced with user complaints in terms of technical problems and inconveniences like 'login error,' 'view details,' and 'stoppage.' This result has shown that social commerce has a good performance in terms of user service experience, since the aggressive marketing campaign conducted and there have been investments in building logistics infrastructure. However, the open market still has mobile optimization problems, since the open market in mobile commerce still has not resolved user complaints and inconveniences from technical problems. This study presents an exploratory research method used to analyze user experience by utilizing an empirical approach to user reviews. In contrast to previous studies, which conducted surveys to analyze user experience, this study was conducted by using empirical analysis that incorporates user reviews for reflecting users' vivid and actual experiences. Specifically, by using an LDA topic model and TAM this study presents its methodology, which shows an analysis of user reviews that are effective due to the method of dividing user reviews into service areas and technical areas from a new perspective. The methodology of this study has not only proven the differences in user experience between social commerce and open market, but also has provided a deep understanding of user experience in Korean mobile commerce. In addition, the results of this study have important implications on social commerce and open market by proving that user insights can be utilized in establishing competitive and groundbreaking strategies in the market. The limitations and research direction for follow-up studies are as follows. In a follow-up study, it will be required to design a more elaborate technique of the text analysis. This study could not clearly refine the user reviews, even though the ones online have inherent typos and mistakes. This study has proven that the user reviews are an invaluable source to analyze user experience. The methodology of this study can be expected to further expand comparative research of services using user reviews. Even at this moment, users around the world are posting their reviews about service experiences after using the mobile game, commerce, and messenger applications.

Ensemble Learning with Support Vector Machines for Bond Rating (회사채 신용등급 예측을 위한 SVM 앙상블학습)

  • Kim, Myoung-Jong
    • Journal of Intelligence and Information Systems
    • /
    • v.18 no.2
    • /
    • pp.29-45
    • /
    • 2012
  • Bond rating is regarded as an important event for measuring financial risk of companies and for determining the investment returns of investors. As a result, it has been a popular research topic for researchers to predict companies' credit ratings by applying statistical and machine learning techniques. The statistical techniques, including multiple regression, multiple discriminant analysis (MDA), logistic models (LOGIT), and probit analysis, have been traditionally used in bond rating. However, one major drawback is that it should be based on strict assumptions. Such strict assumptions include linearity, normality, independence among predictor variables and pre-existing functional forms relating the criterion variablesand the predictor variables. Those strict assumptions of traditional statistics have limited their application to the real world. Machine learning techniques also used in bond rating prediction models include decision trees (DT), neural networks (NN), and Support Vector Machine (SVM). Especially, SVM is recognized as a new and promising classification and regression analysis method. SVM learns a separating hyperplane that can maximize the margin between two categories. SVM is simple enough to be analyzed mathematical, and leads to high performance in practical applications. SVM implements the structuralrisk minimization principle and searches to minimize an upper bound of the generalization error. In addition, the solution of SVM may be a global optimum and thus, overfitting is unlikely to occur with SVM. In addition, SVM does not require too many data sample for training since it builds prediction models by only using some representative sample near the boundaries called support vectors. A number of experimental researches have indicated that SVM has been successfully applied in a variety of pattern recognition fields. However, there are three major drawbacks that can be potential causes for degrading SVM's performance. First, SVM is originally proposed for solving binary-class classification problems. Methods for combining SVMs for multi-class classification such as One-Against-One, One-Against-All have been proposed, but they do not improve the performance in multi-class classification problem as much as SVM for binary-class classification. Second, approximation algorithms (e.g. decomposition methods, sequential minimal optimization algorithm) could be used for effective multi-class computation to reduce computation time, but it could deteriorate classification performance. Third, the difficulty in multi-class prediction problems is in data imbalance problem that can occur when the number of instances in one class greatly outnumbers the number of instances in the other class. Such data sets often cause a default classifier to be built due to skewed boundary and thus the reduction in the classification accuracy of such a classifier. SVM ensemble learning is one of machine learning methods to cope with the above drawbacks. Ensemble learning is a method for improving the performance of classification and prediction algorithms. AdaBoost is one of the widely used ensemble learning techniques. It constructs a composite classifier by sequentially training classifiers while increasing weight on the misclassified observations through iterations. The observations that are incorrectly predicted by previous classifiers are chosen more often than examples that are correctly predicted. Thus Boosting attempts to produce new classifiers that are better able to predict examples for which the current ensemble's performance is poor. In this way, it can reinforce the training of the misclassified observations of the minority class. This paper proposes a multiclass Geometric Mean-based Boosting (MGM-Boost) to resolve multiclass prediction problem. Since MGM-Boost introduces the notion of geometric mean into AdaBoost, it can perform learning process considering the geometric mean-based accuracy and errors of multiclass. This study applies MGM-Boost to the real-world bond rating case for Korean companies to examine the feasibility of MGM-Boost. 10-fold cross validations for threetimes with different random seeds are performed in order to ensure that the comparison among three different classifiers does not happen by chance. For each of 10-fold cross validation, the entire data set is first partitioned into tenequal-sized sets, and then each set is in turn used as the test set while the classifier trains on the other nine sets. That is, cross-validated folds have been tested independently of each algorithm. Through these steps, we have obtained the results for classifiers on each of the 30 experiments. In the comparison of arithmetic mean-based prediction accuracy between individual classifiers, MGM-Boost (52.95%) shows higher prediction accuracy than both AdaBoost (51.69%) and SVM (49.47%). MGM-Boost (28.12%) also shows the higher prediction accuracy than AdaBoost (24.65%) and SVM (15.42%)in terms of geometric mean-based prediction accuracy. T-test is used to examine whether the performance of each classifiers for 30 folds is significantly different. The results indicate that performance of MGM-Boost is significantly different from AdaBoost and SVM classifiers at 1% level. These results mean that MGM-Boost can provide robust and stable solutions to multi-classproblems such as bond rating.

Reconstruction of Stereo MR Angiography Optimized to View Position and Distance using MIP (최대강도투사를 이용한 관찰 위치와 거리에 최적화 된 입체 자기공명 뇌 혈관영상 재구성)

  • Shin, Seok-Hyun;Hwang, Do-Sik
    • Investigative Magnetic Resonance Imaging
    • /
    • v.16 no.1
    • /
    • pp.67-75
    • /
    • 2012
  • Purpose : We studied enhanced method to view the vessels in the brain using Magnetic Resonance Angiography (MRA). Noticing that Maximum Intensity Projection (MIP) image is often used to evaluate the arteries of the neck and brain, we propose a new method for view brain vessels to stereo image in 3D space with more superior and more correct compared with conventional method. Materials and Methods: We use 3T Siemens Tim Trio MRI scanner with 4 channel head coil and get a 3D MRA brain data by fixing volunteers head and radiating Phase Contrast pulse sequence. MRA brain data is 3D rotated according to the view angle of each eyes. Optimal view angle (projection angle) is determined by the distance between eye and center of the data. Newly acquired MRA data are projected along with the projection line and display only the highest values. Each left and right view MIP image is integrated through anaglyph imaging method and optimal stereoscopic MIP image is acquired. Results: Result image shows that proposed method let enable to view MIP image at any direction of MRA data that is impossible to the conventional method. Moreover, considering disparity and distance from viewer to center of MRA data at spherical coordinates, we can get more realistic stereo image. In conclusion, we can get optimal stereoscopic images according to the position that viewers want to see and distance between viewer and MRA data. Conclusion: Proposed method overcome problems of conventional method that shows only specific projected image (z-axis projection) and give optimal depth information by converting mono MIP image to stereoscopic image considering viewers position. And can display any view of MRA data at spherical coordinates. If the optimization algorithm and parallel processing is applied, it may give useful medical information for diagnosis and treatment planning in real-time.

Dose Verification Using Pelvic Phantom in High Dose Rate (HDR) Brachytherapy (자궁경부암용 팬톰을 이용한 HDR (High dose rate) 근접치료의 선량 평가)

  • 장지나;허순녕;김회남;윤세철;최보영;이형구;서태석
    • Progress in Medical Physics
    • /
    • v.14 no.1
    • /
    • pp.15-19
    • /
    • 2003
  • High dose rate (HDR) brachytherapy for treating a cervix carcinoma has become popular, because it eliminates many of the problems associated with conventional brachytherapy. In order to improve the clinical effectiveness with HDR brachytherapy, a dose calculation algorithm, optimization procedures, and image registrations need to be verified by comparing the dose distributions from a planning computer and those from a phantom. In this study, the phantom was fabricated in order to verify the absolute doses and the relative dose distributions. The measured doses from the phantom were then compared with the treatment planning system for the dose verification. The phantom needs to be designed such that the dose distributions can be quantitatively evaluated by utilizing the dosimeters with a high spatial resolution. Therefore, the small size of the thermoluminescent dosimeter (TLD) chips with a dimension of <1/8"and film dosimetry with a spatial resolution of <1mm used to measure the radiation dosages in the phantom. The phantom called a pelvic phantom was made from water and the tissue-equivalent acrylic plates. In order to firmly hold the HDR applicators in the water phantom, the applicators were inserted into the grooves of the applicator holder. The dose distributions around the applicators, such as Point A and B, were measured by placing a series of TLD chips (TLD-to-TLD distance: 5mm) in the three TLD holders, and placing three verification films in the orthogonal planes. This study used a Nucletron Plato treatment planning system and a Microselectron Ir-192 source unit. The results showed good agreement between the treatment plan and measurement. The comparisons of the absolute dose showed agreement within $\pm$4.0 % of the dose at point A and B, and the bladder and rectum point. In addition, the relative dose distributions by film dosimetry and those calculated by the planning computer show good agreement. This pelvic phantom could be a useful to verify the dose calculation algorithm and the accuracy of the image localization algorithm in the high dose rate (HDR) planning computer. The dose verification with film dosimetry and TLD as quality assurance (QA) tools are currently being undertaken in the Catholic University, Seoul, Korea.

  • PDF

KOREAN MARS MISSION DESIGN USING KSLV-III (KSLV-III를 이용한 한국형 화성 탐사 임무의 설계)

  • Song, Young-Joo;Yoo, Sung-Moon;Park, Eun-Seo;Park, Sang-Young;Choi, Kyu-Hong;Yoon, Jae-Cheol;Yim, Jo-Ryeong;Choi, Joon-Min;Kim, Byung-Kyo
    • Journal of Astronomy and Space Sciences
    • /
    • v.23 no.4
    • /
    • pp.355-372
    • /
    • 2006
  • Mission opportunities and trajectory characteristics for the future Korean Mars mission have designed and analyzed using KSIV-III(Korea Space Launch Vehicle-III). Korea's first space center, 'NARO space center' is selected as a launch site. For launch opportunities, year 2033 is investigated under considering the date of space center's completion with KSLV series development status. Optimal magnitude of various maneuvers, Trans Mars Injection (TMI) maneuver, Trajectory Correction Maneuver (TCM), Mars Orbit Insertion (MOI) maneuver and Orbit Trim Maneuver(OTM), which are required during the every Mars mission phases are computed with the formulation of nonlinear optimization problems using NPSOL software. Finally, mass budgets for upper stage (launcher for KSIV-III and spacecraft are derived using various optimized maneuver magnitudes. For results, daily launch window from NARO space center for successful Korean Mars mission is avaliable for next 27 minutes starting from Apr. 16. 2033. 12:17:26 (UTC). Maximum spacecraft gross mass which can delivered to Mars is about 206kg, with propellant mass of 109kg and structure mass of 97kg, when on board spacecraft thruster's Isp is assumed to have 290 sec. For upper stage, having structure ratio of 0.15 and Isp value of 280 sec, gross mass is about 1293kg with propellant mass of 1099kg and structure mass of 194kg. However, including 10% margins to computed optimal maneuver values, spacecraft gross mass is reduced to about 148kg with upper stage's mass of 1352kg. This work will give various insights, requiring performances to developing of KSIV-III and spacecraft design for future Korean Mars missions.

Bankruptcy prediction using an improved bagging ensemble (개선된 배깅 앙상블을 활용한 기업부도예측)

  • Min, Sung-Hwan
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.4
    • /
    • pp.121-139
    • /
    • 2014
  • Predicting corporate failure has been an important topic in accounting and finance. The costs associated with bankruptcy are high, so the accuracy of bankruptcy prediction is greatly important for financial institutions. Lots of researchers have dealt with the topic associated with bankruptcy prediction in the past three decades. The current research attempts to use ensemble models for improving the performance of bankruptcy prediction. Ensemble classification is to combine individually trained classifiers in order to gain more accurate prediction than individual models. Ensemble techniques are shown to be very useful for improving the generalization ability of the classifier. Bagging is the most commonly used methods for constructing ensemble classifiers. In bagging, the different training data subsets are randomly drawn with replacement from the original training dataset. Base classifiers are trained on the different bootstrap samples. Instance selection is to select critical instances while deleting and removing irrelevant and harmful instances from the original set. Instance selection and bagging are quite well known in data mining. However, few studies have dealt with the integration of instance selection and bagging. This study proposes an improved bagging ensemble based on instance selection using genetic algorithms (GA) for improving the performance of SVM. GA is an efficient optimization procedure based on the theory of natural selection and evolution. GA uses the idea of survival of the fittest by progressively accepting better solutions to the problems. GA searches by maintaining a population of solutions from which better solutions are created rather than making incremental changes to a single solution to the problem. The initial solution population is generated randomly and evolves into the next generation by genetic operators such as selection, crossover and mutation. The solutions coded by strings are evaluated by the fitness function. The proposed model consists of two phases: GA based Instance Selection and Instance based Bagging. In the first phase, GA is used to select optimal instance subset that is used as input data of bagging model. In this study, the chromosome is encoded as a form of binary string for the instance subset. In this phase, the population size was set to 100 while maximum number of generations was set to 150. We set the crossover rate and mutation rate to 0.7 and 0.1 respectively. We used the prediction accuracy of model as the fitness function of GA. SVM model is trained on training data set using the selected instance subset. The prediction accuracy of SVM model over test data set is used as fitness value in order to avoid overfitting. In the second phase, we used the optimal instance subset selected in the first phase as input data of bagging model. We used SVM model as base classifier for bagging ensemble. The majority voting scheme was used as a combining method in this study. This study applies the proposed model to the bankruptcy prediction problem using a real data set from Korean companies. The research data used in this study contains 1832 externally non-audited firms which filed for bankruptcy (916 cases) and non-bankruptcy (916 cases). Financial ratios categorized as stability, profitability, growth, activity and cash flow were investigated through literature review and basic statistical methods and we selected 8 financial ratios as the final input variables. We separated the whole data into three subsets as training, test and validation data set. In this study, we compared the proposed model with several comparative models including the simple individual SVM model, the simple bagging model and the instance selection based SVM model. The McNemar tests were used to examine whether the proposed model significantly outperforms the other models. The experimental results show that the proposed model outperforms the other models.

Production of $[^{18}F]F_2$ Gas for Electrophilic Substitution Reaction (친전자성 치환반응을 위한 $[^{18}F]F_2$ Gas의 생산 연구)

  • Moon, Byung-Seok;Kim, Jae-Hong;Lee, Kyo-Chul;An, Gwang-Il;Cheon, Gi-Jeong;Chun, Kwon-Soo
    • Nuclear Medicine and Molecular Imaging
    • /
    • v.40 no.4
    • /
    • pp.228-232
    • /
    • 2006
  • Purpose: electrophilic $^{18}F(T_{1/2}=110\;min)$ radionuclide in the form of $[^{18}F]F_2$ gas is of great significance for labeling radiopharmaceuticals for positron omission tomography (PET). However, its production In high yield and with high specific radioactivity is still a challenge to overcome several problems on targetry. The aim of the present study was to develop a method suitable for the routine production of $[^{18}F]F_2$ for the electrophilic substitution reaction. Materials and Methods: The target was designed water-cooled aluminum target chamber system with a conical bore shape. Production of the elemental fluorine was carried out via the $^{18}O(p,n)^{18}F$ reaction using a two-step irradiation protocol. In the first irradiation, the target filled with highly enriched $^{18}O_2$ was irradiated with protons for $^{18}F$ production, which were adsorbed on the inner surface of target body. In the second irradiation, the mixed gas ($1%[^{19}F]F_2/Ar$) was leaded into the target chamber, fellowing a short irradiation of proton for isotopic exchange between the carrier-fluorine and the radiofluorine absorbed in the target chamber. Optimization of production was performed as the function of irradiation time, the beam current and $^{18}O_2$ loading pressure. Results: Production runs was performed under the following optimum conditions: The 1st irradiation for the nuclear reaction (15.0 bar of 97% enriched $^{18}O_2$, 13.2 MeV protons, 30 ${\mu}A$, 60-90 min irradiation), the recovery of enriched oxygen via cryogenic pumping; The 2nd irradiation for the recovery of absorbed radiofluorine (12.0 bar of 1% $[^{19}F]fluorine/argon$ gas, 13.2 MeV protons, 30 ${\mu}A$, 20-30 min irradiation) the recovery of $[^{18}F]fluorine$ for synthesis. The yield of $[^{18}F]fluorine$ at EOB (end of bombardment) was achieved around $34{\pm}6.0$ GBq (n>10). Conclusion: The production of $^{18}F$ electrophilic agent via $^{18}O(p,n)^{18}F$ reaction was much under investigation. Especially, an aluminum gas target was very advantageous for routine production of $[^{18}F]fluorine$. These results suggest the possibility to use $[^{18}F]F_2$ gas as a electrophilic substitution agent.