• Industrial Engineering and Management Systems
• /
• 제6권2호
• /
• pp.119-124
• /
• 2007

The most difficult and time-intensive issue in the successful implementation of genetic algorithms is to find good parameter setting, one of the most popular subjects of current research in genetic algorithms. In this study, we present a new efficient experimental design method for parameter optimization in a genetic algorithm for general job shop scheduling problem using the Taguchi method. Four genetic parameters including the population size, the crossover rate, the mutation rate, and the stopping condition are treated as design factors. For the performance characteristic, makespan is adopted. The number of jobs, the number of operations required to be processed in each job, and the number of machines are considered as noise factors in generating various job shop environments. A robust design experiment with inner and outer orthogonal arrays is conducted by computer simulation, and the optimal parameter setting is presented which consists of a combination of the level of each design factor. The validity of the optimal parameter setting is investigated by comparing its SN ratios with those obtained by an experiment with full factorial designs.

• Industrial Engineering and Management Systems
• /
• 제6권1호
• /
• pp.22-27
• /
• 2007

This paper describes the optimization of maintenance workforce scheduling at Afam power station in Nigeria. The objective is to determine the optimum schedule to satisfy growing maintenance labour requirements with minimum cost and highest efficiency. Three alternative maintenance workforce schedules are compared. The first alternative is to continue with the traditional five-day workweek schedule currently being practiced by Afam power station maintenance line. The second alternative is to switch to a seven-day workweek schedule for the morning shift only. The third alternative is to use a seven-day workweek schedule for all three work shifts. The third alternative is chosen, as it is expected to save 11% of the maintenance labour cost.

• 한국멀티미디어학회논문지
• /
• 제10권6호
• /
• pp.745-753
• /
• 2007

The wireless medium is known to be time-varying which could affect and result to a poor network's performance. As a solution, an opportunistic scheduling and power control algorithm based on IEEE 802.11 MAC protocol is proposed in this paper. The algorithm opportunistically exploits the channel condition for better network performance. Convex optimization problems were also formulated i.e. the overall transmission power of the system is minimized and the "net-utility" of he system is maximized. We have proven that an optimal transmission power vector may exist, satisfying the maximum power and SINR constraints at all receivers, thereby minimizing overall transmission power and maximizing net-utility of the system.

• ETRI Journal
• /
• 제39권1호
• /
• pp.13-20
• /
• 2017

A method is proposed for scheduling sensor accesses to the shared network in a networked control system. The proposed method determines the access order in which the sensors are granted medium access through minimization of the state estimation error covariance. Solving the problem by evaluating the error covariance for each possible ordered set of sensors is not practical for large systems. Therefore, a convex optimization problem is proposed, which yields approximate yet acceptable results. A state estimator is designed for the augmented system resulting from the incorporation of the optimally chosen communication sequence in the plant dynamics. A car suspension system simulation is conducted to test the proposed method. The results show promising improvement in the state estimation performance by reducing the estimation error norm compared to round-robin scheduling.

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

Maintenance scheduling of generating units (MSU) has strategic dimension in an oligopolistic market. Strategic MSU of gencos can affect a market power through capacity withdrawal which is related to bidding strategy in an generation wholesale market. This paper presents a combined framework that models the interrelation between competitive bidding and strategic MSU. The combined game model is represented as some sub-optimization problems of a market operator (MO) and gencos, that should be solved through bi-level optimization scheme. The gradient method with dual variables is also adopted to calculate a Nash Equilibrium (NE) by an iterative update technique in this paper. Illustrative numerical example shows that NE of a supply function equilibrium is obtained properly by using proposed solution technique. The MSU made by MO is compared with that by each genco and that under perfect competition market.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 하계학술대회 논문집 D
• /
• pp.781-783
• /
• 1997

Genetic Algorithm is a kind of an evolution programming based on natural evolution principle. It applied to probabilistic searching, machine learning and optimization, and many good results were reported. Generator maintenance scheduling is an optimization Problem with constraints. This paper applied a genetic algorithm to generator maintenance scheduling problem and tested on sample systems. The results are compared with heuristic method and branch-and-bound method.

• KEPCO Journal on Electric Power and Energy
• /
• 제6권3호
• /
• pp.315-319
• /
• 2020

The modern transportation and mobility sector is expected to encounter high penetration of Electric Vehicles (EVs) because EVs contribute to reducing the harmful emissions from fossil fuel-powered vehicles. With the prospective growth of EVs, sufficient and convenient facilities for fast charging are crucial toward satisfying the EVs' quick charging demand during their trip. Therefore, the Fast Electric Vehicle Charging Stations (FECS) will be a similar role to gas stations. In this paper, we study a charging scheduling problem for the FECS with solar photovoltaic (PV) and an Energy Storage System (ESS). We formulate an optimization problem that minimizes the operational costs of FECS. There are two cost and one revenue terms that are buying cost from main grid power, ESS degradation cost, and revenue from the charging fee of the EVs. Simulation results show that the proposed scheduling algorithm reduces the daily operational cost by effectively using solar PV and ESS.

• 국제학술발표논문집
• /
• The 1th International Conference on Construction Engineering and Project Management
• /
• pp.881-885
• /
• 2005

Scheduling repetitive projects under limitations on the amounts of available resources (labor and equipment) has been an active subject because of its practical relevance. Traditionally, the limitation is specified as a deterministic (fixed) number, such as 1000 labor-hours. The limitation, however, is often exposed to uncertainty and variability, especially when the project is lengthy. This paper presents a stochastic optimization model to treat the situations where the limitations of resources are expressed as probability functions in lieu of deterministic numbers. The proposed model transfers each deterministic resource constraint into a corresponding stochastic one and then solves the problem by the use of a chance-constrained programming technique. The solution is validated by comparison with simulation results to show that it can satisfy the resource constraints with a probability beyond the desired confidence level.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권10호
• /
• pp.4864-4882
• /
• 2016

In this work, we consider the optimization problem of minimizing energy consumption for real-time multicast over wireless multi-hop networks. Previously, a distributed primal-dual subgradient algorithm was used for finding a solution to the optimization problem. However, the traditional subgradient algorithms have drawbacks in terms of i) sensitivity to iteration parameters; ii) need for saving previous iteration results for computing the optimization results at the current iteration. To overcome these drawbacks, using a joint network coding and scheduling optimization framework, we propose a novel distributed primal-dual Random Deflected Subgradient (RDS) algorithm for solving the optimization problem. Furthermore, we derive the corresponding recursive formulas for the proposed RDS algorithm, which are useful for practical applications. In comparison with the traditional subgradient algorithms, the illustrated performance results show that the proposed RDS algorithm can achieve an improved optimal solution. Moreover, the proposed algorithm is stable and robust against the choice of parameter values used in the algorithm.

• Korean Chemical Engineering Research
• /
• 제58권2호
• /
• pp.209-223
• /
• 2020

석유화학 제품, 컴파운드(Compound), 전지, IT 소재, 첨단소재, 제약 등 다양한 제품 군의 사업을 보유하고 있는 화학 회사에서 각 사업 부분에 있어 수요 예측, 물류, 생산, 재고, 원재료 공급의 SCM (Supply Chain Management)은 사업의 손익과 직접적으로 연결되기 때문에 그와 관련된 최적화와 시스템 역량 수준은 매우 중요하다. 본 연구는 다양한 사업 군에서 각각의 SCM이나 비효율적 영역을 개선하는 등의 역량을 고도화하기 위해 원재료를 공급하고, 제품을 생산하기 위한 공급/생산 계획 등에 있어서 수학적 최적화 방법을 적용한 사례에 관하여 다룰 것이다. 그리고 학술적인 연구에 그치는 것이 아니라 계획 수립 담당자가 실제로 자신의 일부 업무에 활용하는 것이 중요하므로 이를 위해 추가적으로 필요한 사항들을 서술하였고 각각의 적용 성과를 표현하였다. 소개가 될 사례의 첫 번째에서는 편광판 생산에 있어서 원재료 로스(Loss)를 최소화하는 것을 기반으로 하는 공급계획 최적화, 최적 손익 사업 운영계획, 편광판 연신 생산 공정의 스케줄(Schedule) 최적화를 다룰 것이다. 두 번째 사례로는 PO (Poly Olefin) 공정의 생산성 극대화를 위한 생산/포장계획 최적화에 관하여 다룰 것이고, 세 번째 사례로는 전지 생산에 있어서 전극 모델 교환을 최소화 시키는 생산계획 최적화에 대해 다룰 것이다. 네 번째로는 석유화학 특성상 선박으로 대부분의 원료 입하 및 제품 출하를 하기 때문에 한정된 부두에 여러 가지 원료 입고와 제품 출하를 위한 선박이 접안 하는 일정을 최적화 한 사례를 다룰 것이며, 마지막으로 ABS (Acrylonitrile Butadiene Styrene) 반제품 생산에 있어서 제품 Change를 최소화 하는 생산계획 최적화를 다룰 것이다.