• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.53
• /
• pp.37-44
• /
• 1999

The problem to be studied here is the minimization of the total travel distance and the number of vehicles used for delivering goods to customers. Vehicle routes must also satisfy a variety of constraints such as fixed vehicle capacity, allowed operating time. Genetic algorithm to solve the VRPTW with heterogeneous fleet is presented. The chromosome of the proposed GA in this study has the 3-dimension. We propose GA that has the cubic-chromosome for VRPTW with heterogeneous fleet. The newly suggested ‘Cubic-GA (or 3-D GA)’ in this paper means the 2-D GA with GLS(Genetic Local Search) algorithms and is quite flexible. To evaluate the performance of the algorithm, we apply it to the Solomon's VRPTW instances. It produces a set of good routes and the reasonable number of vehicles.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.161-169
• /
• 2012

In general, Euclidean minimum spanning tree is a tree connecting input nodes with minimum connecting cost. But the tree may not be optimal when applied to real world problems of three dimension. In this paper, three dimension Euclidean minimum spanning tree is proposed, connecting all input nodes of 3-dimensional space with minimum cost. In experiments for 30,000 input nodes with 100% space ratio, the tree produced by the proposed method can reduce 90.0% connection cost tree, compared with the tree by two dimension Prim's minimum spanning tree. In two dimension plane, the proposed tree increases 251.2% connecting cost, which is pointless in 3-dimensional real world. Therefore, the proposed method can work well for many connecting problems in real world space of three dimensions.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2000.11a
• /
• pp.207-217
• /
• 2000

In this paper, we describe an image processing algorithm which is able to recognize the road lane. This algorithm performs to recognize the interrelation between AGV and the other vehicle. We experimented on AGV driving test with color CCD camera which is setup on the top of vehicle and acquires the digital signal. This paper is composed of two parts. One is image preprocessing part to measure the condition of the lane and vehicle. This finds the information of lines using RGB ratio cutting algorithm, the edge detection and Hough transform. The other obtains the situation of other vehicles using the image processing and viewport. At first, 2 dimension image information derived from vision sensor is interpreted to the 3 dimension information by the angle and position of the CCD camera. Through these processes, if vehicle knows the driving conditions which are angle, distance error and real position of other vehicles, we should calculate the reference steering angle.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.55-62
• /
• 2007

This paper proposes method to get exquisite third dimension data removing included noise by error that occur in third dimension reconstruction through camera auto-calibration. Though reconstructing third dimension data by previous noise removing method, mesh that area is wide is happened problem by noise. Because mesh's area is important, the proposed algorithm need preprocessing that remove unnecessary triangle meshes of acquired third dimension data. The research analyzes the characteristics of noise using the area information of 3-dimensional meshes, separates a peek noise and a Gauss noise by its characteristics and removes the noise effectively. We give a quantitative evaluation of the proposed preprocessing filter and compare with the mesh smoothing procedures. We demonstrate that our effective preprocessing filter outperform the mesh smoothing procedures in terms of accuracy and resistance to over-smoothing.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.5
• /
• pp.537-542
• /
• 2011

A mirror neuron is a neuron fires both when an animal acts and when the animal observes the same action performed by another. We propose a method of 3D reconstruction for occluded object motion tracking like Mirror Neuron System to fire in hidden condition. For modeling system that intention recognition through fire effect like Mirror Neuron System, we calculate depth information using stereo image from a stereo camera and reconstruct three dimension data. Movement direction of object is estimated by optical flow with three-dimensional image data created by three dimension reconstruction. For three dimension reconstruction that enables tracing occluded part, first, picture data was get by stereo camera. Result of optical flow is made be robust to noise by the kalman filter estimation algorithm. Image data is saved as history from reconstructed three dimension image through motion tracking of object. When whole or some part of object is disappeared form stereo camera by other objects, it is restored to bring image date form history of saved past image and track motion of object.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.59 no.3
• /
• pp.245-252
• /
• 2010

This paper proposes a constrained multi-area dispatch scheduling algorithm applicable to interconnected power system operations. The dispatch scheduling formulated as an MIP problem can be efficiently computed by GBD algorithm. GBD guarantees adequate computation speed and solution convergence by reducing the dimension of the dispatch scheduling problem. In addition, the regional decomposition technique based on ADM is introduced to obtain efficient inter-temporal OPF solution. It can find the most economic dispatch schedule incorporating power transactions without each regional utility's private information open.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.3
• /
• pp.151-157
• /
• 2017

Management optimization is very important in tourism, especially when it is related to productivity. One of the problems in management optimization is tour guide assignment. Well-arranged tour guide assignment will increase productivity while maintaining service quality. A cellular genetic algorithm is one of the methods that can be used to solve this problem. Furthermore, previous study has shown that a cellular dimension increase can lead to promising benefits for certain problems. The objective of this research is to give a clear understanding of the advantages of increasing cellular dimensionality on the tour guide assignment problem by using a cellular genetic algorithm.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.145-155
• /
• 2015

In this paper, we study the bounds of the coefficients of the characteristic polynomial of the Frobenius endomorphism of the Jacobian of dimension three over a finite field. We provide explicitly computable bounds for the coefficients of the characteristic polynomial. In addition, we present the counting points algorithm for computing a group of the Jacobian of genus 3 hyperelliptic curves over a finite field with large characteristic. Based on these bounds, we found an efficient search space that was used in the counting points algorithm on genus 3 curves. The algorithm was explained and verified through simple examples.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.2
• /
• pp.27-32
• /
• 2001

In this paper, the three dimension scanner system employing the parallel camera model is discussed. The camera calibration process and the three dimension scanning algorithm are developed. The laser strip line is utilized for assisting stereo matching. An object being scanned rotates on the plate which is activated by a stepping motor, The world coordinate which is. the measured distance from the camera to the object is converted into the model coordinate. The facets created from the point. cloud of the model coordinate is used for rendering the scanned model by using the graphic library such as OpenGL. The unmatched points having no validate matching points are interpolated from the validate matching points of the vicinity epipolar lines.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.97-103
• /
• 2010

There are many algorithms for 2D to 3D graphic conversion technology which have the high complexity and large scale of iterative computation. So in this paper propose parallel algorithm and high speed graphics accelerator architecture using Park's MAMS(Multiple Access Memory System) for Phong Shading, one of many 3D algorithms. The Proposed SIMD processor architecture is simulated by HDL and simulated and got 30 times faster result. It means any kinds of 3D algorithm can make parallel algorithm and accelerated by SIMD processor with Park's MAMS for real time processing.