• International Journal of CAD/CAM
• /
• 제12권1호
• /
• pp.9-19
• /
• 2012

Generation of optimum planar B-spline curve in terms of minimum deviation and required fairness to approximate a target shape defined by a strip-shaped unorganized 2D point cloud is studied. It is proposed to use the location of control points as variables within the geometric optimization framework of point distance minimization. An adaptive simulated annealing heuristic optimization algorithm is developed to iteratively update an initial approximate curve towards the target shape. The new implementation comprises an adaptive cooling procedure in which the temperature change is adaptively dependent on the objective function evolution. It is shown that the proposed method results in an improved convergence speed when compared to the standard simulated annealing method. A couple of examples are included to show the applicability of the proposed method in the surface model reconstruction directly from point cloud data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권5호
• /
• pp.1069-1084
• /
• 2011

This paper considers an optimal base station clustering problem for designing a mobile (wireless) communication network. For a given network with a set of nodes (base stations), the problem is to optimally partition the set of nodes into subsets (each called a cluster) such that the associated inter-cluster traffic is minimized under certain topological constraints and cluster capacity constraints. In the problem analysis, the problem is formulated as an integer programming problem. The integer programming problem is then transformed into a binary integer programming problem, for which the associated linear programming relaxation is solved in a column generation approach assisted by a branch-and-bound procedure. For the column generation, both a heuristic algorithm and a valid inequality approach are exploited. Various numerical examples are solved to evaluate the effectiveness of the LP (Linear Programming) based branch-and-bound algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.670-673
• /
• 1987

The structure of chemical process has become increasingly complex, due to better management of energy and raw materials. As a consequence, the design of control systems for complete plants now constitutes the focal point of engineering interest, rather than controller designs for single processing units. Instead of traditional methods based on complex mathematical model, chemical processes are represented by structural array and cause-and-effect graph to apply non-numerical problem-solving techniques. A systematic logical procedure to synthesize alternatives of control system structure and some heuristic rules to select a feasible solution from the vast number of alternatives that are possible are considered in this study.

• 산업공학
• /
• 제18권3호
• /
• pp.297-307
• /
• 2005

PCB assembly is a complicated and difficult process to optimize due to the necessity of simultaneous consideration of component’s rack assignment and board mounting sequencing. An efficient PCB assembly method is developed by using neighboring positioned identical components information as well as quantity and size of the components. It is found that same type of components are located closely each other by checking real PCBs and interviewing with PCB designers in practice. Better performance of the developed procedure is obtained along with more number of total components and more number of neighboring positioned identical components cases. Simulation models are developed using Visual C++ for performance evaluation purposes of the suggested heuristic.

• Structural Engineering and Mechanics
• /
• 제51권3호
• /
• pp.361-375
• /
• 2014

The main aim of this paper is to investigate the relationship between thickness and height of the axially symmetric cylindrical reinforced concrete (RC) walls by the help of a meta-heuristic optimization procedure. The material cost of the wall which includes concrete, reinforcement and formwork, was chosen as objective function of the optimization problem. The wall thickness, compressive strength of concrete and diameter of reinforcement bars were defined as design variables and tank volume, radius and height of the wall, loading condition and unit cost of material were defined as design constants. Numerical analyses of the wall were conducted by using superposition method (SPM) considering ACI 318-Building code requirements for structural concrete. The optimum wall thickness-height relationship was investigated under three main cases related with compressive strength of concrete and density of the stored liquid. According to the results, the proposed method is effective on finding the optimum design with minimum cost.

• Management Science and Financial Engineering
• /
• 제17권2호
• /
• pp.1-21
• /
• 2011

This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands. The problem is to determine order planning at the warehouse, and also vehicle schedules and delivery quantities for the retailers with the objective of minimizing the sum of ordering cost at the warehouse, inventory holding cost at both the warehouse and retailers, and transportation cost. For the problem, we give a Mixed Integer Programming formulation and develop a Lagrangean heuristic procedure for computing lower and upper bounds on the optimal solution value. The Lagrangean dual problem of finding the best Lagrangrean lower bound is solved by subgradient optimization. Computational experiments on randomly generated test problems showed that the suggested algorithm gives relatively good solutions in a reasonable amount of computation time.

• Management Science and Financial Engineering
• /
• 제11권1호
• /
• pp.49-61
• /
• 2005

We consider the graph disconnection problem, which is to find a set of edges such that the total cost of destroying the edges is no more than a given budget and the weight of nodes disconnected from a designated source by destroying the edges is maximized. The problem is known to be NP-hard. We present an integer programming formulation for the problem and develop an algorithm that includes a preprocessing procedure for reducing the problem size, a heuristic for providing a lower bound, and a cutting plane algorithm for obtaining an upper bound. Computational results for evaluating the performance of the proposed algorithm are also presented.

• Management Science and Financial Engineering
• /
• 제17권1호
• /
• pp.95-116
• /
• 2011

This paper considers a flowshop scheduling problem where a customer orders multiple products (jobs) from a production facility. The objectives are to minimize makespan and to minimize the sum of order (batch) completion times. The order cannot be shipped unless all the products in the order are manufactured. This problem was motivated by numerous real world problems encountered by a variety of manufacturers. For the makespan objective, we develop an optimal solution procedure which runs in polynomial time. For the sum of order completion time objective, we establish the complexity of the problem including several special cases. Then, we introduce a simple heuristic and find an asymptotically tight worst case bound on relative error. Finally, we conclude the paper with some implications.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.525-528
• /
• 1988

In this paper, a new multi-output logic minimization algorithm is presented. A base minterm is selected in the given function and the prime implicant is obtained by expanding it in the order of the expansion set that is decided by heuristic method. Input-oriented expansion procedure is used to reduce fan-in and fan-out number. To show the effectiveness of this algorithm, comparative run time with other minimization algorithm is given.

• 산업경영시스템학회지
• /
• 제22권51호
• /
• pp.41-52
• /
• 1999

In this paper, a load balancing problem among operators is considered, when one or more machines can be assigned to an operator. The machines are grouped into two types and there are more than one machines in each group. The type of machine in which a job can be processed, is determined. However, an operator can handle both types of machine. The elementary operations of a job are classified into three classes : machine-controlled elements, operator-controlled elements and machine/operator- controlled elements. The objective is to balance the workloads among operators under the constraints of available machine-time and operator-time. A heuristic solution procedure is suggested for allocating jobs to machines and allocating machines to operators. The performance of the algorithm is evaluated with various data set.