• Industrial Engineering and Management Systems
• /
• v.6 no.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.

• Journal of the military operations research society of Korea
• /
• v.26 no.2
• /
• pp.143-158
• /
• 2000

This paper deals with the problem of redundancy allocation for the mixed reliability system in an optimal way. Two kinds of the reliability system are considered for optimal allocation of parallel redundancy. The problem is approached as the optimization problems using th standard method of dynamic programming(DP). The algorithm for solving the optimal redundancy allocation is proposed and then the DP algorithm is applied to two numerical examples such as maximization of reliability subject to an allowable cost-constraint and minimization of the total cost subject to the specified minimum reliability-constraint. A consequence of this study is that the developed computer program package can be applied to the optimal redundancy allocation for the mixed reliability system.

• International journal of advanced smart convergence
• /
• v.11 no.1
• /
• pp.1-10
• /
• 2022

Single-view reconstruction (SVR) is a fundamental method in computer vision. Often used for reconstructing human-made environments, the Manhattan world assumption presumes that planes in the real world exist in mutually orthogonal directions. Accordingly, this paper addresses an automatic SVR algorithm for Manhattan worlds. A method for estimating the directions of planes using graph-cut optimization is proposed. After segmenting an image from extracted line segments, the data cost function and smoothness cost function for graph-cut optimization are defined by considering the directions of the line segments and neighborhood segments. Furthermore, segments with the same depths are grouped during a depth-estimation step using a minimum spanning tree algorithm with the proposed weights. Experimental results demonstrate that, unlike previous methods, the proposed method can identify complex Manhattan structures of indoor and outdoor scenes and provide the exact boundaries and intersections of planes.

• Structural Engineering and Mechanics
• /
• v.58 no.3
• /
• pp.533-553
• /
• 2016

In this paper, the recently developed meta-heuristic algorithm called tug of war optimization is applied to optimal design of castellated beams. Two common types of laterally supported castellated beams are considered as design problems: beams with hexagonal openings and beams with circular openings. Here, castellated beams have been studied for two cases: beams without filled holes and beams with end-filled holes. Also, tug of war optimization algorithm is utilized for obtaining the solution of these design problems. For this purpose, the minimum cost is taken as the objective function, and some benchmark problems are solved from literature.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.1022-1027
• /
• 2004

In this study, the shape of plate-fin type heat sink is numerically optimized to acquire the minimum pressure drop under the required temperature rise. To do this, a new sequential approximate optimization (SAO) is proposed and it is integrated with the computational fluid dynamics (CFD). In thermal/fluid systems for constrained nonlinear optimization problems, three fundamental difficulties such as high cost for function evaluations (i.e., pressure drop and thermal resistance), the absence of design sensitivity information, and the occurrence of numerical noise are confronted. To overcome these problems, the progressive quadratic response surface method (PQRSM), which is one of the sequential approximate optimization algorithms, is proposed and the heat sink is optimize by means of the PQRSM.

• Structural Engineering and Mechanics
• /
• v.57 no.4
• /
• pp.763-783
• /
• 2016

A methodology based on Teaching Learning-Based Optimization (TLBO) algorithm is proposed for optimum design of reinforced concrete retaining walls. The objective function is to minimize total material cost including concrete and steel per unit length of the retaining walls. The requirements of the American Concrete Institute (ACI 318-05-Building code requirements for structural concrete) are considered for reinforced concrete (RC) design. During the optimization process, totally twenty-nine design constraints composed from stability, flexural moment capacity, shear strength capacity and RC design requirements such as minimum and maximum reinforcement ratio, development length of reinforcement are checked. Comparing to other nature-inspired algorithm, TLBO is a simple algorithm without parameters entered by users and self-adjusting ranges without intervention of users. In numerical examples, a retaining wall taken from the documented researches is optimized and the several effects (backfill slope angle, internal friction angle of retaining soil and surcharge load) on the optimum results are also investigated in the study. As a conclusion, TLBO based methods are feasible.

• IE interfaces
• /
• v.21 no.3
• /
• pp.254-261
• /
• 2008

Connected-(r,s)-out of-(m,n) : F system is an important topic in redundancy design of the complex system reliability and it's maintenance policy. Previous studies applied Monte Carlo simulation and genetic, simulated annealing algorithms to tackle the difficulty of maintenance policy problem. These algorithms suggested most suitable maintenance cycle to optimize maintenance pattern of connected-(r,s)-out of-(m,n) : F system. However, genetic algorithm is required long execution time relatively and simulated annealing has improved computational time but rather poor solutions. In this paper, we propose the ant colony optimization approach for connected-(r,s)-out of-(m,n) : F system that determines maintenance cycle and minimum unit cost. Computational results prove that ant colony optimization algorithm is superior to genetic algorithm, simulated annealing and tabu search in both execution time and quality of solution.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.623-625
• /
• 1998

This paper focuses on the fast convergence in nonlinear parameter optimization which is necessary for the fitting of nonlinear models to data. The simulated annealing(SA) and genetic algorithm(GA), which are widely used for combinatorial optimization problems, are stochastic strategy for search of the ground state and a powerful tool for optimization. However, their main disadvantage is the long convergence time by unnecessary extra works. It is also recognised that gradient-based nonlinear programing techniques would typically fail to find global minimum. Therefore, this paper develops a modified SA which is the SDS(Stochastic deterministic stochastic) algorithm can minimize cost function of optimal problem.

• Journal of Information Technology Services
• /
• v.9 no.2
• /
• pp.163-177
• /
• 2010

In this paper, we consider a channel ordering problem that seeks to maximize the service quality in mobile radio communication systems. If a base station receives a connection request from a mobile user, one of the empty channels belonging to the base station is assigned to the mobile user. In case multiple empty channels are available, we can choose one that incurs least interference with other channels assigned to adjacent base stations. However, note that a pair of channels that are not separated enough generates interference only if both channels are assigned to mobile users. That is, interference between channels may vary depending on the channel assignment sequence for each base station and on the distribution of mobile users. To find a channel assignment sequence that seems to generate minimum interference, we develop an optimization model considering various scenarios of mobile user distribution. Simulation results show that channel assignment sequence determined by the scenario based optimization model significantly reduces the interference provided that scenarios and interference cost are properly generated.

• Computers and Concrete
• /
• v.6 no.3
• /
• pp.253-268
• /
• 2009

This study aims to develop a cost-based high-performance concrete (HPC) mix optimization system based on an integrated approach using artificial neural networks (ANNs) and genetic algorithms (GA). ANNs are used to predict the three main properties of HPC, namely workability, strength and durability, which are used to evaluate fitness and constraint violations in the GA process. Multilayer back-propagation neural networks are trained using the results obtained from experiments and previous research. The correlation between concrete components and its properties is established. GA is employed to arrive at an optimal mix proportion of HPC by minimizing its total cost. A system prototype, called High Performance Concrete Mix-Design System using Genetic Algorithm and Neural Networks (HPCGANN), was developed in MATLAB. The architecture of the proposed system consists of three main parts: 1) User interface; 2) ANNs prediction models software; and 3) GA engine software. The validation of the proposed system is carried out by comparing the results obtained from the system with the trial batches. The results indicate that the proposed system can be used to enable the design of HPC mix which corresponds to its required performance. Furthermore, the proposed system takes into account the influence of the fluctuating unit price of materials in order to achieve the lowest cost of concrete, which cannot be easily obtained by traditional methods or trial-and-error techniques.