• Management Science and Financial Engineering
• /
• 제4권2호
• /
• pp.1-13
• /
• 1998

The Shortest Path Problem in Time-dependent Networks, where the travel time of each link depends on the time interval, is not realistic since the model and its solution violate the Non-passing Property (NPP:often referred to as FIFO) of real phenomena. Furthermore, solving the problem needs much more computational and memory complexity than the general shortest path problem. A new model for Time-dependent Networks where the flow speeds of each link depend on time interval, is suggested. The model is more realistic since its solution maintains the NPP. Solving the problem needs just a little more computational complexity, and the same memory complexity, as the general shortest path problem. A solution algorithm modified from Dijkstra's label setting algorithm is presented. We extend this model to the problem of Minimum Expected Time Path in Time-dependent Stochastic Networks where flow speeds of each link change statistically on each time interval. A solution method using the Kth-shortest Path algorithm is presented.

• 한국경영과학회지
• /
• 제20권1호
• /
• pp.1-10
• /
• 1995

The purpose of this paper is to develop a method of the sensitivity analysis that can be applied to a non-tree solution of the minimum cost flow problem. First, we introduce two types of sensitivity analysis. A sensitivity analysis of Type 1a is the well known method applicable to a tree solution. However this method can not be applied to a non-tree solution. So we propose a sensitivity analysis of Type 2 that keeps solutions of upper bounds at upper bounds, those of lower bounds at lower bounds, and those of intermediate values at intermediate values. For the cost coefficient we present a method that the sensitivity analysis of Type 2 is solved by finding the shortest path. Besides we also show that the results of Type 2 and Type 1 are the same in a spanning tree solution. For the right-hand side constant or the capacity, the sensitivity analysis of Type 2 is solved by a simple calculation using arcs with intermediate values.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.65-68
• /
• 2000

The problem of selecting a portfolio is to find Un investment plan that achieves a desired return while minimizing the risk involved. One stream of algorithms are based upon mixed integer linear programming models and guarantee an integer optimal solution. But these algorithms require too much time to apply to real problems. Another stream of algorithms are fur a near optimal solution and are fast enough. But, these also have a weakness in that the solution generated can't be guaranteed to be integer values. Since it is not a trivial job to tansform the scullion into integer valued one simutaneously maintaining the quality of the solution, they are not easy to apply to real world portfolio selection. To tackle the problem more efficiently, we propose an algorithm which generates a very good integer solution in reasonable amount of time. The algorithm is tested using Korean stock market data to verify its accuracy and efficiency.

• 한국경영과학회지
• /
• 제23권1호
• /
• pp.1-16
• /
• 1998

The zone clustering problem arising from several area such as deciding the optimal location of ambient measuring stations is to devide the 2-dimensional area into several sub areas in which included individual zone shows simimlar properties. In general, the optimal solution of this problem is very hard to obtain. Therefore, instead of finding an optimal solution, the generation of near optimal solution within the limited time is more meaningful. In this study, the combination of a genetic algorithm and the modified k-means method is used to obtain the near optimal solution. To exploit the genetic algorithm effectively, a representation of chromsomes and appropriate genetic operators are proposed. The k-means method which is originally devised to solve the object clustering problem is modified to improve the solutions obtained from the genetic algorithm. The experiment shows that the proposed method generates the near optimal solution efficiently.

• 대한안전경영과학회지
• /
• 제6권4호
• /
• pp.227-238
• /
• 2004

This development has tried to scheme out the convenience for users to use the 3D modeling solution which is developed from the existing programs. The extended 3D modeling solution, to be developed through the use of the API which is provided and Microsoft Access, database is able to reuse the parts, subassemblies of parts, and assemblies. A methodology exhibits the possibility to use a Spinfire Professional Spinfire Reader program. The web evaluation system, which is used to connected with the Internet explorer and to construct a web service, will repeat the evaluations of the company staffs and customers about the new products which the company have designed. The furniture manufacturing company will adopt the 3D modelling solution in modelling the new products and go through the web evaluation system to collect dissatisfied facts of the customers or the company staffs against the new product. Finally, it will contribute to the enormous benefit creation of the enterprise.

• Journal of applied mathematics & informatics
• /
• 제9권1호
• /
• pp.197-211
• /
• 2002

In this paper, we propose a multi-Criteria decision making approach to address the problem of finding the best possible solution in credit unions. Sensitivity analysis on the priority structure of the goals has been performed to obtain all possible solutions. The study uses the Euclidean distance method to measure distances of all possible solutions from the identified ideal solution. The possible optimum solution is determined from the minimum distance between the ideal solution and other possible solutions of the Problem.

• 전기학회논문지
• /
• 제58권9호
• /
• pp.1651-1657
• /
• 2009

In this paper, restoration solution algorithm to improve reliability better than restoration system of DAS(Distribution Automation System) is proposed in IDMS(Intelligent Distribution Management System). A strategy of IDMS restoration system to improve reliability and efficiency is proposed by analysis restoration system in DAS. Restoration sequence algorithm, distributed restoration solution algorithm considering a characteristic and a suitable restoration solution algorithm in IDMS are proposed. In the case study, algorithms have testified with example distribution network by C language

• 품질경영학회지
• /
• 제50권2호
• /
• pp.265-286
• /
• 2022

Purpose: The time and cost of a project activity exists in a selected mode and there is a quality level for the selected mode, and the time and cost of the current activity is determined by the quality level of the preceding activity. When an activity is a predecessor activity of an activity, it is characterized as a trade-off problem in which the time and cost of the activity are determined according to the quality level of the activity. Methods: A neighbor search heuristic algorithm obtains a solution by (1) randomly determining the mode, quality level, and assignment order for each activity. (2) get a solution by improving the solution by changing the possible modes and quality levels; (3) to find a solution by improving the solution from the point where it is feasible to advance the start time. Here, Case[1] is a method to find the optimal solution value after repeating (1). Case [2] is a method for finding a solution including (1) and (2). Case [3] refers to a method for finding solutions including (1), (2), and (3). Results: It can be seen that the value of the objective function presented by the algorithm changes depending on how the model of the heuristic algorithm is designed and applied. In other words, it suggests the importance of algorithm design and proves the importance of the quality problem of activities in the project schedule. Conclusion: A study significance of the optimization algorithm and the heuristic algorithm was applied to the effect of the quality of the preceding activity on the duration and cost of itself and the succeeding activity, which was not addressed in the project schedule problem.

• 유통과학연구
• /
• 제15권7호
• /
• pp.19-24
• /
• 2017

Purpose - There are several problems that organizations face to make a better team-based system such as free-rider issue, assigned difficult jobs unfairly and bickering between high performers and average performers. The purpose of this study is to provide solutions for practitioners through past academic studies on how organizations can resolve several issues in team management. Ultimately, it would lead to employees as better performers for organization's profitability and customers' satisfaction. Research design, data, and methodology - Solution 1 - put employees who have a similar performance ability together into a same team and apply 'growth' approach for low performance team. Solution 2 - make a new evaluation system which is balanced between individual's performance and team's performance. Solution 3 - monitor thoroughly to diffuse difficult works equally among teams and develop management practice system that may prevent or resolve difficult work-loads for a team or an individual performer. Result - Investigation suggests that organizations may resolve three conflicts which come from team base system. Moreover, the implications of results show that the most important criteria in team management depend on whether performers have a similar ability in the same team and management handles issue of justice and the performance of each employee is evaluated by total team performance evaluation simultaneously. Conclusions - All in all, our recommendation concludes that if three issues are resolved, the lack of trust in team-based system among team members will be missed.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2008년도 춘계학술대회
• /
• pp.345-360
• /
• 2008

The analytic hierarchy process is known as a useful tool for the group decision making methods. This tool has been area such as investment, R&D management, manufacturing, production and marketing. Typically, transportation problems have addressed by mathematical programming. In this paper, an optimal solution of transportation problem was determined by the analytic hierarchy process.