• Communications for Statistical Applications and Methods
• /
• 제18권2호
• /
• pp.257-266
• /
• 2011

The rapid development of airlines, has made airports busier and more complicated. The assignment of scheduled to available gates is a major issue for daily airline operations. We consider the over-constrained airport gate assignment problem(AGAP) where the number of flights exceeds the number of available gates, and where the objectives are to minimize the number of ungated flights and the total walking distance or connection times. The procedures used in this project are to create a mathematical model formulation to identify decision variables to identify, constraints and objective functions. In addition, we will consider in the AGAP the size of each gate in the terminal and also the towing process for the aircraft. We will use a greedy algorithm to solve the problem. The greedy algorithm minimizes ungated flights while providing initial feasible solutions that allow flexibility in seeking good solutions, especially in case when flight schedules are dense in time. Experiments conducts give good results.

• 한국군사과학기술학회지
• /
• 제13권6호
• /
• pp.1091-1098
• /
• 2010

Victory and defeat of the war depends on follow-on logistics support. The spending time of follow-on logistics support at combat area is greatly influenced by the degree of combat intensity. The main purpose of this study is to compose a optimal supply route for operational sustainability of combat unit at combat area using transport vehicles. This study suggests a composition of optimal supply route for follow-on logistics support which considers the degree of combat intensity. A mathematical programming model and a genetic algorithm suggest to minimize the total spending time of follow-on logistics support. The suggested mathematical programming model is verified by using CPLEX 11.1. This study computes supply route, total spending time, total travel distance, and the number of transport vehicle.

• 산업공학
• /
• 제22권4호
• /
• pp.359-367
• /
• 2009

The vehicle travel time between the demand points in downtown area is greatly influenced by complex road condition and traffic situation that change real time to various external environments. Most of research in the vehicle routing problems compose vehicle routes only considering travel distance and average vehicle speed between the demand points, however did not consider dynamic external environments such as traffic situation by service time zones. A realistic vehicle routing problem which considers traffic situation of smooth, delaying, and stagnating by three service time zones such as going to work, afternoon, and going home was suggested in this study. A mathematical programming model was suggested and it gives an optimal solution when using ILOG CPLEX. A hybrid genetic algorithm was also suggested to chooses a vehicle route considering traffic situation to minimize the total travel time. By comparing the result considering the traffic situation, the suggested algorithm gives better solution than existing algorithms.

• 대한산업공학회지
• /
• 제22권4호
• /
• pp.589-605
• /
• 1996

Recycling of used products and components has been considered as one of promising strategies for resolving environmental problems. In this respect, most manufacturing companies begin to consider possible recycling (e.q., reuse or re-production) of the components contained in their products. The primary objective of this research is to develop a multiple criteria decision making model for systematic management of recycle-oriented manufacturing components. The production planning problem of recycle-oriented manufacturing components is first formulated as a multiobjective mixed 0-1 integer programming model with three conflicting objectives. An interactive multiple criteria decision making method is then developed for solving the mathematical model. Also, an Input/Output analysis software is developed to help practitioners apply the model to real problems without much knowledge on computers and mathematical programming. A numerical example is used in examining the validity of the proposed model and to investigate the impact of the input variables on recycling production strategy.

• 대한전기학회논문지:전력기술부문A
• /
• 제55권11호
• /
• pp.492-497
• /
• 2006

Nash Equilibrium (NE) is essential to investigate a participant's bidding strategy in a competitive electricity market. The transmission line constraints make it difficult to compute the NE due to causing a mixed strategy NE instead of a pure strategy NE. Computing a mixed strategy is more complicated in a multi-player game. The competition among multi-participants is modeled by a two-level hierarchical optimization problem. A mathematical programming approach is widely used in finding this equilibrium. However, there are difficulties to solving a mixed strategy NE. This paper presents two propositions to add heuristics to the mathematical programming method. The propositions are based on empirical studies on mixed strategies in numerous sample systems. Based on the propositions a new formulation is provided with a set of linear and nonlinear equations, and an algorithm is suggested for using the prepositions and the newly-formulated equations.

• Journal of Electrical Engineering and Technology
• /
• 제8권4호
• /
• pp.675-685
• /
• 2013

Generation capacities and transmission line constraints in a competitive electricity market make it troublesome to compute Nash Equilibrium (NE) for analyzing participants' strategic generation quantities. The NE can cause a mixed strategy NE rather than a pure strategy NE resulting in a more complicated computation of NE, especially in a multiplayer game. A two-level hierarchical optimization problem is used to model competition among multiple participants. There are difficulties in using a mathematical programming approach to solve a mixed strategy NE. This paper presents heuristics applied to the mathematical programming method for dealing with the constraints on generation capacities and transmission line flows. A new formulation based on the heuristics is provided with a set of linear and nonlinear equations, and an algorithm is suggested for using the heuristics and the newly-formulated equations.

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권2호
• /
• pp.120-126
• /
• 2021

The importance of mathematics is emerging to create new values and secure competitiveness in an intelligent information society based on the Fourth Industrial Revolution. This study was conducted with the aim of improving the academic performance and increasing interest of electronics majors in mathematics subjects. In order to develop learners' mathematical capabilities in major fields that utilize mathematics that electronics majors do not prefer, we have proposed a new teaching method to promote employment in mathematics-based electronics fields. In addition, to enhance learners' self-directed learning, we developed teaching methods for efficient mathematics subjects with programming languages as tools in electronics engineering and applied them to real-world teaching sites to effectively cultivate academic performance improvement of majors. Finally, we conducted a survey and statistically analyze the effectiveness of the developed teaching methods to present effective operational measures for mathematics education, an essential tool in intelligent information technology.

• East Asian mathematical journal
• /
• 제25권1호
• /
• pp.11-26
• /
• 2009

In this paper, the concepts of compatible mappings of types (A) and (P) are introduced in an induced metric space, two common xed point theorems for two pairs of compatible mappings of types (A) and (P) in an induced complete metric space are established. As their applications, the existence and uniqueness results of common solution for a system of functional equations arising in dynamic programming are discussed.

• 한국경영과학회지
• /
• 제3권2호
• /
• pp.95-108
• /
• 1978

This paper discusses an application of mathematical programming techniques in the paper industry in determining optimal parent roll widths. Parent rolls are made from the reels produced at wide paper machines by slitting them to more manageable widths. The problem is finding a set of the slitting patterns that will minimize the trim loss involved in the sheeting operation. Two programming models, one linear and one mixed integer linear, are presented in this paper. Also presented are the computational experience, the model sensitivity, and the comparison of the optimal solutions with the simulated operational data.

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

The past three decades have witnessed a tremendous growth is the literature on location proble. A mathematical formulation of uncapacitated plant location problem and the k-median as an integer program has proven very fruitful in the derivation of solution methods. Most of the successful algorithms for the problem are based on so-called "strong" linear programming relaxation. This is due to the fact that the strong linear programming relaxation provides a tight lower bound. In this paper we investigate the phenomenon with a structural analysis of the problem.e problem.