• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1997.11a
• /
• pp.535-552
• /
• 1997

The facility layout problem has the goal of locating the different facilities in a floor to achieve the greatest efficiency in producing a product or service. This problem is usually formulated as the quadratic assignment problem(QAP). However, the problem of finding optimal layout is hard and traditional approaches are not computationally feasible. In this paper, a genetic algorithm is presented for obtaining efficient layouts. To test the effectiveness of the algorithm, a set of examples is solved and the results are compared to those from other Known algorithms. The comparison indicates that the proposed method performs well for the classical test problems.

• IE interfaces
• /
• v.15 no.4
• /
• pp.474-482
• /
• 2002

In this paper, we propose a parametric optimization approach to simultaneously determining trip distribution, mode choice, and user-equilibrium assignment. In our model, mode choice decisions are based on a binomial logit model and passenger and cargo demands are divided into appropriate mode according to the user equilibrium minimum travel time. Underlying network consists of road and rail networks combined and mode choice available is auto, bus, truck, passenger rail, and cargo rail. We provide an equivalent convex optimization problem formulation and efficient algorithm for solving this problem. The proposed algorithm was applied to a large scale network examples derived from the National Intermodal Transportation Plan (2000-2019).

• International Journal of Control, Automation, and Systems
• /
• v.5 no.2
• /
• pp.111-116
• /
• 2007

The design problem of partial pole assignment (PPA) in two classes of frequency-domain MIMO models by constant gain feedback is investigated in this paper. Its aim is to design a constant gain feedback which changes only a subset of the open-loop eigenvalues, while the rest of them are kept unchanged in the closed-loop system. A near general parametric expression for the feedback gain matrix in term of a set of design parameter vectors and the set of the closed-loop poles, and a simple parametric approach for solving the proposed problem are presented. The set of poles do not need to be previously prescribed, and can be set undetermined and treated together with the set of parametric vectors as degrees of design freedom provided by the approach. An illustrative example shows that the proposed parametric method is simple and effective.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.11 no.17
• /
• pp.39-46
• /
• 1988

This Paper is concerned with a man-multi machine assignment problem to minimize idle time. Assuming different types of semi-automatic machines with deterministic service-processing time, the problem approaches by sequential dependent one operator can handle several machines, where determine optimal range the cost of idle labor and machine time is to be minimized in preparing a work schedule. The Procedure, to establish man-machine assignment model, and it's results are: (1) Objective function to minimize opportunity loss cost, which is happened by idle time, is verified recursive process through heuristic method. (2) The algorithm, is programmed by BASIC language for personal computer, and a numerical example is given to illustrate the heuristic algorithm. This study will be helpful to enhance productivity of Shopflooras a result of increasing the efficiencies of both operator and machine.

• Journal of the Korea Safety Management & Science
• /
• v.4 no.4
• /
• pp.129-136
• /
• 2002

Utilization rate for the restrictive gate and required time and walking distance to board are to be a measure for the gate management and passenger's convenience estimation. So, the main purpose of the gate management are maximization of utilization rate and increment of airport terminal user's convenience through the efficient gate management. This study intends to maximize the utilization rate on usable gates and minimize the passenger's working distance in terminal by concerning about layout, terminal configuration, local passenger of the airport and formulate the gate assignment problem with integer linear programming problem. Then we obtained solution using optimization software LINGO and analyzed that maximize the number of assignment flights and minimize the passenger's walking distance.

• IE interfaces
• /
• v.19 no.4
• /
• pp.300-305
• /
• 2006

The problem of assigning customers to satellite channels is considered in this paper. Finding an optimal allocation of customers to satellite channels is a difficult combinatorial optimization problem and is shown to be NP-complete in an earlier study. We propose a genetic algorithm (GA) approach to search for the best/optimal assignment of customers to satellite channels. Various issues related to genetic algorithms such as solution representation, selection methods, genetic operators and repair of invalid solutions are presented. A comparison of GA with CPLEX8.1 is presented to show the advantages of this approach in terms of computation time and solution quality.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.11
• /
• pp.830-835
• /
• 2006

Because of its exponential growth of data and voice transmissions through wireless communications, efficient resource management became more important factor when we design wireless networks. One of those limited resources in the wireless communications is frequency bandwidth. As a solution of increasing reusability of resources, the efficient frequency assignment problems on wireless networks have been widely studied. One suitable approach to solve these frequency assignment problems is transforming the problem into traditional graph coloring problems in graph theory. However, most of frequency assignments on arbitrary network topology are NP-Complete problems. In this paper, we consider the Chromatic Bandwidth Problem on the cellular topology wireless networks. It is known that the lower bound of the necessary number of frequencies for this problem is $O(k^2)$. We prove that the lower bound of the necessary number of frequencies for the Chromatic Bandwidth Problem is $O(k^3)$ which is tighter lower bound than the previous known result.

• Journal of the Korean Institute of Navigation
• /
• v.13 no.1
• /
• pp.55-61
• /
• 1989

Nowadays much efforts for evaluating the productivity of port physical distribution system to meet the rapid change of the port and shipping circumstances has been made continuously all over the world. The major part of these efforts is the improvement of the productivity of cargo handling system. The cargo equipment system as infrastructure in the cargo handling system is organized well in some degrees, but the management system of manpower as upper structure is still remained in an insufficient degree. There is little study, so far, on a systematic research for the management of port labor gang, and even those were mainly depended on rule of thumb. The object of this study is to introduce the method of optimal allocation and assignment for the labor gang in single ship, which was suggested as a first stage in dealing with them generally. The problem of optimal allocation and assignment of the labor gang can be (I) formalized with multi-stage allocation and assignment of the labor gang can be. (II) dealt with two stages in form of hierarchic structure and moreover, (III) The optimal size of labor gang was obtained through dynamic programming from the point of minimizing the summation of labor gang in every stage, (IV) For the problem of optimal assignment, the optimal policy was determined at the point of minimizing the summation of movement between hatches.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1151-1161
• /
• 1998

In this paper, we are considering a heterogeneous processor system in which each processor may have different performance and reliability characteristics. In other to fully utilize this diversity of processing power it is advantageous to assign the program modules of a distributed program to the processors in such a way that the execution time of the entire program is minimized. This assignment of tasks to processors to maximize performance is commonly called load balancing, since the overloaded processors can perform their own processing with the performance degradation. For the task assignment problem, we propose a new objective function which formulates this imbalancing cost. Thus the task assignment problem is to be carried out so that each module is assigned to a processor whose capabilities are most appropriate for the module, and the total cost is minimized that sum of inter-processor communication cost and execution cost and imbalance cost of the assignment. To find optimal assignment is known to be NP-hard, and thus we proposed an efficient heuristic algorithm with time complexity $O(n^2m)$ in case of m task modules and n processors.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.124-127
• /
• 2001

We consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it based on column generation technique and variable fixing. We devise a branch-and-price algorithm to solve the column generation problem. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.