• Title/Summary/Keyword: Research problem

Search Result 15,739, Processing Time 0.036 seconds

A study on Location-Allocation Problem with the Cost of Land (입지선정비를 고려한 입지-배정 문제에 관한 연구)

  • 양병학
    • Journal of the military operations research society of Korea
    • /
    • v.25 no.2
    • /
    • pp.117-129
    • /
    • 1999
  • We consider a Location-Allocation Problem with the Cost of Land(LAPCL). LAPCL has extremely huge size of problem and complex characteristic of location and allocation problem. Heuristics and decomposition approaches on simple Location-Allocation Problem were well developed in last three decades. Currently, genetic algorithm(GA) is used widely at combinatorics and NLP fields. A lot of research show that GA has efficiency for finding good solution. Our main motive of this research is developing of a GA in LAPCL. We found that LAPCL could be reduced to trivial problem, if locations were given. In this case, we can calculate fitness function by simple technique. We propose fourth alternative genetic algorithm. Computational experiments are carried out to find a best algorithm.

  • PDF

A Survey on Recycling for the U. S. Army (미국 군에서의 재활용 실태에 관한 조사 연구)

  • 황영헌;강석호;이상복
    • Journal of the military operations research society of Korea
    • /
    • v.22 no.1
    • /
    • pp.18-29
    • /
    • 1996
  • Nowadays, flooding wast is serious problem to mankind and the endeavour for solving waste problem is performed in connection with environmental problem and natural resource problem. In Korea, there are a lot of movements related to reduction of waste, too. As the solution of these problems, recycling is recommanded and many kinds of recycling technique are devised. In America, military has been playing an important role in recycling area for a long time. This paper is the survey of several articles and working papers about America military's recycling research. We investigated the recycling of water, construction and demolition wastes etc. These research results are very important in real field of military. It is considered our military has to prepare this recycling problem and now it's the right time. All of these can be adapted to our military, commercial companies and civilians through some modification. We suggest that our military should cope with recycling problem more deliberately.

  • PDF

The Relationship between Posing and Solving Arithmetic Word Problems among Chinese Elementary School Children

  • Chen, Limin;Van Dooren, Wim;Chen, Qi;Verschaffel, Lieven
    • Research in Mathematical Education
    • /
    • v.11 no.1
    • /
    • pp.1-31
    • /
    • 2007
  • Recent research has documented that there is a close relationship between problem posing and problem solving in arithmetic. However, most studies investigated the relationship between problem posing and problem solving only by means of standard problem situations. In order to overcome that shortcoming, a pilot study with Chinese fourth-graders was done to investigate this relationship using a non-standard, realistic problem situation. The results revealed a significant positive relationship between students' problem posing and solving abilities. Based on that pilot study, a more extensive and systematic ascertaining study was carried out to confirm the observed relationship between problem posing and problem solving among Chinese elementary school children. Results confirmed that there was indeed a close relationship between both skills.

  • PDF

A Broadband Local Access Network Design with Double-star Topology under Uncertain Demands (불확실한 수요 하에서 이중성형 구조의 광댁역 접속망 설계에 관한 연구)

  • 윤문길
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.2
    • /
    • pp.87-100
    • /
    • 2000
  • As a result of rapid advances in communication technology, fiber optics have begun to be adopted in most telecommunication systems 3s an economic choice Due to the trend of evolution toward broadband communication network with fiber optics and electronic devices. the network design problem for broadband communication has been received a great deal of research attention recently. In this paper, we address a topological design problem for broadband local access network with uncertain demands, which has received surprisingly little attention so far. in our problem, we select a set of hubs and links for constructing network expected penalty cost for the amount of undersupplied In addition to the usual cost terms of the fixed demand problem Our problem can be approximated as a mixed 0-1 integer programming problem by using Szwarc’s linear approximation technique. Then the problem is transformed successfully into a version of classical network design model. Some computational experiments for the model and concluding remarks are described.

  • PDF

The Effect of Using Digital Science Textbook on the Scientific Problem Solving of Elementary School Students (초등과학 디지털 교과서 활용이 학생들의 과학적 문제 해결력에 미치는 영향)

  • Choi, Sun-Young;Seo, Jeong-Hee
    • Journal of Korean Elementary Science Education
    • /
    • v.28 no.2
    • /
    • pp.132-141
    • /
    • 2009
  • The purpose of this research was to investigate the effect of using digital science textbook on the scientific problem solving of elementary school students. For this research, an instrument to measure student's problem-solving skills was developed. The pretest and posttest scores of one hundred and six 5th grade students' problem-solving skills were analyzed and also the responses of three students who were selected by their levels in the problem-solving science digital textbook class were qualitatively analyzed. The results of this study were as follows; the scores of problem solving skills of science digital textbook groups were higher than that of traditional paper textbook group(p<.05). In the qualitative analysis of the students' reponses in a digital textbook class according to their achievement level, low-achievers' problem-solving skills were much more improved than high- and mid-achievers' skills. In conclusion, science digital textbook has a potential to improve students' scientific problem solving skills, and this possibility will be much higher when science digital textbook is used with teachers' intended instructional goals and strategies like problem-solving lessons.

  • PDF

The Maximal Profiting Location Problem with Multi-Product (다수제품의 수익성 최대화를 위한 설비입지선정 문제)

  • Lee, Sang-Heon;Baek, Doo-Hyeon
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.4
    • /
    • pp.139-155
    • /
    • 2006
  • The facility location problem of this paper is distinguished from the maximal covering location problem and the flxed-charge facility location problem. We propose the maximal profiting location problem (MPLP) that is the facility location problem maximizing profit with multi-product. We apply to the simulated annealing algorithm, the stochastic evolution algorithm and the accelerated simulated annealing algorithm to solve this problem. Through a scale-down and extension experiment, the MPLP was validated and all the three algorithm enable the near optimal solution to produce. As the computational complexity is increased, it is shown that the simulated annealing algorithm' is able to find the best solution than the other two algorithms in a relatively short computational time.

On the Separation of the Rank-1 Chvatal-Gomory Inequalities for the Fixed-Charge 0-1 Knapsack Problem (고정비용 0-1 배낭문제에 대한 크바탈-고모리 부등식의 분리문제에 관한 연구)

  • Park, Kyung-Chul;Lee, Kyung-Sik
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.36 no.2
    • /
    • pp.43-50
    • /
    • 2011
  • We consider the separation problem of the rank-1 Chvatal-Gomory (C-G) inequalities for the 0-1 knapsack problem with the knapsack capacity defined by an additional binary variable, which we call the fixed-charge 0-1 knapsack problem. We analyze the structural properties of the optimal solutions to the separation problem and show that the separation problem can be solved in pseudo-polynomial time. By using the result, we also show that the existence of a pseudo-polynomial time algorithm for the separation problem of the rank-1 C-G inequalities of the ordinary 0-1 knapsack problem.

Feedback Order and Problem-Solving Experience in Competitive Problem-Solving : An Empirical Analysis of Online Innovation Contests (경쟁적 문제 해결 과정에서 피드백 순서와 문제 해결 경험 : 온라인 혁신 경진 대회의 실증 분석)

  • Mun, Hee Jin;Chung, Yerim;Park, Kyung Min
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.38 no.1
    • /
    • pp.29-44
    • /
    • 2013
  • This study suggests that as receiving feedback is moved back, the effectiveness of problem-solving increases. Utilizing data from innovation contests in which a number of problem solvers compete with each other, we answer questions such as whether the order of receiving first feedback affects problem-solving effectiveness and how problem-solving experience moderates the relationship between the first feedback order and problem-solving effectiveness. Empirical results based on data collected from Kaggle, an online platform for innovation contests, showed that the order that contest participants receive the first feedback increases problem-solving effectiveness. Furthermore, the more prior experience of contest participants accentuates the suggested relationship between the order of receiving the first feedback and problem-solving effectiveness.

Development of a Decision Support System Shell for Problem Structuring (문제구조화를 위한 의사결정지원시스템츠 쉘의 개발)

  • 이재식;박동진
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.3
    • /
    • pp.15-40
    • /
    • 1994
  • We designed a knowledge-based decision support system for structuring semi-or unstructured problems. Problem structuring involves extraction of the relevant factors from the identified problem, and model construction that represents the relationships among those factors. In this research, we employed a directed graph called Influence Deiagram as a tool for problem structuring. In particular, our proposed system is designed as a shell. Therefore, a decision maker can change the content of the knowledge base to suit his/her own interested domain.

  • PDF

Improvment of Branch and Bound Algorithm for the Integer Generalized Nntwork Problem (정수 일반네트워크문제를 위한 분지한계법의 개선)

  • 김기석;김기석
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.2
    • /
    • pp.1-19
    • /
    • 1994
  • A generalized network problem is a special class of linear programming problem whose coefficient matrix contains at most two nonzero elements per column. A generalized network problem with 0-1 flow restrictions is called an integer generalized network(IGN) problem. In this paper, we presented a branch and bound algorithm for the IGN that uses network relaxation. To improve the procedure, we develop various strategies, each of which employs different node selection criterion and/or branching variable selection criterion. We test these solution strategies and compare their efficiencies with LINDO on 70 randomly generated problems.

  • PDF