• Industrial Engineering and Management Systems
• /
• 제13권4호
• /
• pp.383-397
• /
• 2014

Reverse logistics network design issues have been popularly discussed in recent years. However, few papers in the past literature have been dedicated to incentive effect on return quantity of used products. The purpose of this study is to formulate a dynamic nonlinear programming model of reverse logistics network design with the aim of managing the used products allocation by coordinating the collection centers and recovery facilities to warrant economic efficiency. In the optimization model, a fuzzy approach is applied to interpret the relationship between the rate of return and the suggested incentives. Due to funding constraints in setting up the collection centers, this work considers these centers as multi-capacity levels, which can be opened or closed at different periods. In view of the fact that the problem is known as NP-hard, we propose a heuristic method based on tabu search procedure to solve the presented model. Finally, several dominance properties of optimal solutions are demonstrated in comparison with the results of a state-of-the-art commercial solver.

• 드라이브 ㆍ 컨트롤
• /
• 제14권4호
• /
• pp.45-50
• /
• 2017

The gas spring is a hydropneumatic adjusting element, consisting of a pressure tube, a piston rod, a piston and a connection fitting. The gas spring is filled with compressed nitrogen within the cylinder. The filling pressure acts on both sides of the piston and because of area difference it produces an extension force. Therefore, a gas spring is similar in function compare to mechanical coil spring. Conversely, optimization is a process of finding the best set of parameters to reach a goal while not violating certain constraints. The AMESim software provides NLPQL (Nonlinear Programming by Quadratic Lagrangian) and GA (genetic algorithm) for optimization. The NLPQL method builds a quadratic approximation to the Lagrange function and linear approximations to all output constraints at each iteration, starting with the identity matrix for the Hessian of the Lagrangian, and gradually updating it using the BFGS method. On each iteration, a quadratic programming problem is solved to find an improved design until the final convergence to the optimum design. In this study, we conducted optimization design of the gas spring reaction force with NLPQL.

• 로봇학회논문지
• /
• 제17권4호
• /
• pp.500-507
• /
• 2022

In this study, a motion planning method based on the integer representation of contact status between wheels and the ground is proposed for planning swing motion of a 6×6 wheel-legged robot to cross large obstacles and gaps. Wheel-legged robots can drive on a flat road by wheels and overcome large obstacles by legs. Autonomously crossing large obstacles requires the robot to perform complex motion planning of multi-contacts and wheel-rolling at the same time. The lift-off and touch-down status of wheels and the trajectories of legs should be carefully planned to avoid collision between the robot body and the obstacle. To address this issue, we propose a planning method for swing motion of robot legs. It combines an integer representation of discrete contact status and a trajectory optimization based on the direct collocation method, which results in a mixed-integer nonlinear programming (MINLP) problem. The planned motion is used to control the joint angles of the articulated legs. The proposed method is verified by the MuJoCo simulation and shows that over 95% and 83% success rate when the height of vertical obstacles and the length of gaps are equal to or less than 1.68 times of the wheel radius and 1.44 times of the wheel diameter, respectively.

• 해양환경안전학회지
• /
• 제6권1호
• /
• pp.23-33
• /
• 2000

This paper is concerned with finding the global optimal solutions for the redundancy optimization problems in series-parallel systems related with system safety. This study transforms the difficult problem, which is classified as a nonlinear integer problem, into a 0/1 IP(Integer Programming) by using binary integer variables. And the global optimal solution to this problem can be easily obtained by applying GAMS (General Algebraic Modeling System) to the transformed 0/1 IP. From computational results, we notice that GA(Genetic Algorithm) to this problem, which is, to our knowledge, known as a best algorithm, is poor in many cases.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• pp.131-135
• /
• 2008

In this paper, we deal with a hierarchical location-allocation problem in designing the broadband convergence networks (BcN). The objective is to minimize the total cost of switch and cable while satisfying the quality of service (QoS). We formulate the problem as an integer programming model and develop the Tabu Search (TS) heuristic algorithm to find a good feasible solution within a reasonable time limit. Initial solution is obtained by using the tree structure. Three neighborhood generation mechanisms are used by local search heuristic: insertion, switch up, and switch down. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. We present promising computational results of the proposed solution procedures.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.635-642
• /
• 1989

We formulated the multi-robot trajectory problem into a series of NLP problem, each of which is that of finding the optimal tip positions of the robots for the next time step. The NLP problem is composed of an objective function and three constraints, namely: a) Joint position limits, b) Joint velocity limits, and c) Collision-avoidance constraints. By solving a series of NLP problem, optimally coordinated trajectories can be determined without requiring any prior path information. This is a novel departure from the previous approach in which either all paths or at least one path is assumed to be given. Practical application of the developed method is for optimal synthesis of multiple robot trajectories in off-line. To test the validity and effectiveness of the method, numerical examples are illustrated.

• 산업경영시스템학회지
• /
• 제22권49호
• /
• pp.1-10
• /
• 1999

A cost minimization model for designing AS/RS (Automated Storage/Retrieval Systems) has been developed, whose objective function includes penalty cost caused by the incapability of meeting throughput rate requirements as well as S/R machine cost, storage rack cost, and interface conveyor cost. Since the model is a nonlinear integer programming problem which is very hard to solve with large problem size the problem is divided into four cases according to the ratio of horizontal S/R machine speed to its vertical speed and the existence of the penalty cost. A solution procedure is developed which solves each problem exactly under the different number of S/R machines.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.582-588
• /
• 1993

A scheme of dynamic optimization for batch reactor his been developed and applied to a semi-batch esterification reactor. To obtain optimal operating conditions for the given semi-batch reactor system with complex reaction kinetic and process constraints, a general nonlinear programming solver and finite element techniques have been introduced. The optimization results for the complex reactor system have been compared with those of Kumar et al. [1984] to show better optimization performance. The proposed optimizing scheme has been applied to the free end time problem to obtain the realistic operating condition. The results can supply valuable information for economic operation of the given batch esterification reactor.

• 산업경영시스템학회지
• /
• 제13권22호
• /
• pp.87-98
• /
• 1990

The performance analysis and capacity planning of Service Control Point which is real time response system is studied. The system is modeled by multiclass open queueing network. The analytical method is used to solve the queueing network. The solution of the model has product form solution. The focus of this paper is to investigate the capacity of system under the restriction of response time. To get the reasonable capacities, nonlinear programming problem is formulated and is solved by GINO. And the simulation model using SLAM II is formulated.

• 한국경영과학회지
• /
• 제15권2호
• /
• pp.1-15
• /
• 1990

A mathematical definition of the cluster is suggested. A nonlinear 0-1 integer programming formulation for the multi-dimensional entity clustering problem is developed. A heuristic method named MDEC (Multi-Dimensional Entity Clustering) using centroids and the binary partition is developed and the numerical examples are shown. This method has an advantage of providing bottle-neck entity informations.