• Journal of the military operations research society of Korea
• /
• v.25 no.2
• /
• pp.73-83
• /
• 1999

In this paper, we consider the shortest path network problem with fixed charges. A turn penalty algorithm for the shortest path problem with fixed charges or turn penalties is presented, which is using the next node comparison method. The algorithm described here is designed to determine the shortest route in the shortest path network problem including turn penalties. Additionally, the way to simplify the computation for the shortest path problem with turn penalties was pursued.

• Journal of the military operations research society of Korea
• /
• v.30 no.1
• /
• pp.30-47
• /
• 2004

This research considers a Network Diversion Problem (NDP) in the directed graph, which is to identify a minimum cost set of links to cut so that any communication paths from a designated source node to a destination node must include at least one link from a specified set of arcs which is called the diversion arcs. We identify a redundant constraint from an earlier formulation. The problem is known to be NP-hard, however a detailed proof has not been given. We provide the proof of the NP-hardness of this problem. We develop a tabu search algorithm that includes a preprocessing procedure with two steps for removing diversion arcs as well as reducing the problem size. Computational results of the algorithm on instances of general graphs and grid graphs are reported.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.1
• /
• pp.111-124
• /
• 2010

In the last decade, traveling purchaser problem (TPP) has received some attention of the researchers in the operational research area. TPP is a generalization of the well-known traveling salesman problem (TSP), which has many real-world applications such as purchasing the required raw materials for the manufacturing factories and the scheduling of a set of jobs over some machines, and many others. In this paper we suggest heterogeneous multiple traveling purchaser problem with budget constraint (HMTPP-B) which looks for several cycles starting at and ending to the depot and visiting a subset at a minimum traveling cost and such that the demand for each product is satisfied and the cost spent for purchasing the products does not exceed a given budget threshold. All the past studies of TPP are restricted on a single purchaser. Therefore we randomly generated some instances. CPLEX is used for getting optimal solutions in these experiments.

• IE interfaces
• /
• v.24 no.1
• /
• pp.51-57
• /
• 2011

The traveling purchaser problem (TPP) is a generalization of the well-known traveling salesman problem (TSP), which has many real-world applications such as purchasing the required raw materials for the manufacturing factories and the scheduling of a set of jobs over some machines, and many others. In the last decade, TPP has received some attention of the researchers in the operational research area. However, all of the past researches for TPP are restricted on a single purchaser (vehicle). It could be the limitation to solve the real world problem. The purpose of this paper is to suggest the capacitated multiple TPP (CMTPP). It could be used in inbound logistics optimization in supply chain management area and many others. Since TPP is known as NP-hard, we also developed the heuristic algorithm to solve the CMTPP.

• Nonlinear Functional Analysis and Applications
• /
• v.29 no.1
• /
• pp.83-98
• /
• 2024

In this paper, we investigate the existence and uniqueness of solutions to a new class of integro-differential equation boundary value problems (BVPs) with ㄒ-Hilfer operator. Our problem is converted into an equivalent fixed-point problem by introducing an operator whose fixed points coincide with the solutions to the given problem. Using Banach's and Schauder's fixed point techniques, the uniqueness and existence result for the given problem are demonstrated. The stability results for solutions of the given problem are also discussed. In the end. One example is provided to demonstrate the obtained results

• Journal of the Korean Society for Library and Information Science
• /
• v.28
• /
• pp.247-266
• /
• 1995

The purpose of information retrieval is to help users solve their problems. To fulfill the purpose the user's problem needs to be focused on. The purpose of this study is to identify components and the structure of the user's problem in an academic research environment. From this study it was found that the scientific problem dealt within an academic environment is complicate and the problem is composed of 8 topical and 4 non-topical components. And they could be organized into a stucture. This study has three implications for user-oriented information retrieval. (1) The components and the structure of the problem need to be the framework for the effective information retrieval process and for the evaluation of information retrieval. (2) The research methodology used in this study can be applied to other information service situations and this will result in greater practical implication of a study for more effective information retrieval. And (3) for more effective user-oriented information retrieval, the user needs to be observed and studied in the actual' situation. This study showed that the complicate problem of the actual user can be studied in a systematic way and this resulted in important implications for information retrieval.

• Journal of The Korean Association For Science Education
• /
• v.11 no.2
• /
• pp.67-77
• /
• 1991

In this paper, current research papers on Physics Problem Solving were analyzed according to the types of research purpose, method, subject and content of Physics, by using 3 Proceedings and 4 kinds of Journal, that is, the International Workshop(1983, Paris, France) and Conference (1983, Utrecht, The Netherlands) and Seminar(1987, Cornell University, U. S. A.) on Physics Education, and Journal of Research in Science Teaching (1984-1990) and Science Education (1986-1990). and Inter national Journal of Science Education(l987-1988) and Cognitive Science(1989-1990). There were 98 research papers on Problem Solving and among them 37 papers on Physics Problem Solving were selected for analyzing. The results of analysis are as follows; 1) The studies on Model of Novice Student were 22(59%), And those on Model of Desired Preformance, on Model of learning and on Model of Teaching were all much the same. 2) The theoretical studies were 10(27%), and the experimental ones 27(73%). Among the experimental studies, there were 16(59%) by using the written test, and 7(26%) by using the thinking aloud method. 3) The studies about university students as subjects were 20(54%). Probably, it seems the reason that most of researchers on Physics Problem Solving were professors of university or graduate students. 4) Among the various fields of Physics, the studies on Mechanics were 24(63%) and those on E1ectromagnetics 6(16%). or graduate students.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.2
• /
• pp.199-206
• /
• 2008

The introduction of competition in electricity markets emphasizes the importance of sufficient transmission capacities to guarantee effective power transactions. Therefore, for the economic and stable electric power system operation, transmission security constrains should be incorporated into the dispatch scheduling problem. With the intent to solve this problem, we decompose a dispatch scheduling problem into a master problem(MP) and several subproblems(SPs) using Benders decomposition. The MP solves a general optimal power flow(OPF) problem while the SPs inspect the feasibility of OPF solution under respective transmission line contingencies. If a dispatch scheduling solution given by the MP violates transmission security constraints, then additional constraints corresponding to the violations are imposed to the MP. Through this iterative process between the MP and SPs, we derive an optimal dispatch schedule incorporating the post-contingency corrective rescheduling. In addition, we consider interruptible loads as active control variables since the interruptible loads can participate as generators in competitive electricity markets. Numerical examples demonstrate the efficiency of the proposed algorithm.

• Journal of Korea Multimedia Society
• /
• v.22 no.4
• /
• pp.502-514
• /
• 2019

Existing user research methods are subject to a variety of research conditions such as the amount and variety of data collected and the expertise of the facilitator of a group research session. In this study, we propose a new user research methodology using an 'Issue-Network' system, which is developed based on the theory and methods of social network analysis. The Issue-Network is designed to define problem spaces from the issues raised by users in a group research session in a form of an interactive network graph. The system helps to break out of ordinary perspectives of looking into problem spaces by enabling an alternative and more creative way to connect issues in the network. In this study, we took a case study of generating the Issue-Network on behalf of the problems raised by users in various driving-related situations. We were able to draw three navigation usage scenarios that cover relatively important problem spaces: safety and being ready for the unexpected, smart navigation and notifications, making use of the spare time. In the future, the Issue-Network system is expected to be used as a tool to identify problems and derive solutions in group research sessions involving a large number of users.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.159-170
• /
• 1992

The size of time constaints is the critical bottleneck of the Crew Scheduling Problem (CSP). This paper deals with a method to extract the minimum required time constraints by k-shortest path algorithm. These time constraints are added as the "insurance constraints" to avoid the unnecessary tree search, which are very time-consuming procedures, for the integer solutions. The computational results show that the problem size in LP formulation could be reduced by our method.