• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.1-23
• /
• 2005

The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.

• 대한산업공학회지
• /
• 제8권1호
• /
• pp.61-67
• /
• 1982

This paper is concerned with the optimal control of dynamic expansion and operation of a single capacity under deterministic demand. Three cases of financing mode are considered : unlimited borrowing, debt aversion, and self financing. Using the net revenue as the objective function, the optimal paths of production and investment are analytically derived.

• Journal of Communications and Networks
• /
• 제11권6호
• /
• pp.564-573
• /
• 2009

In this paper, we consider a wireless multiple path network in which a transmitting node would like to send a message to the receiving node with a certain probability of success. These two nodes are separated by N erasure paths, and we devise two algorithms to determine minimum redundancy and optimal symbol allocation for this setup. We discuss the case with N = 3 and then extend the case to an arbitrary number of paths. One of the algorithms minimum redundancy algorithm in exponential time is shown to be optimal in several cases, but has exponential running time. The other algorithm, minimum redundancy algorithm in polynomial time, is sub-optimal but has polynomial worstcase running time. These algorithms are based off the theory of maximum-distance separable codes. We apply the MRAET algorithm on maximum-distance separable, Luby transform, and Raptor codes and compare their performance.

• Journal of Electrical Engineering and Technology
• /
• 제5권3호
• /
• pp.389-399
• /
• 2010

Available transfer capability (ATC) is a measure of the transfer capability remaining in a transmission system. Application of unified power flow controllers (UPFCs) could have positive impacts on the ATC of some paths while it might have a negative impact on the ATC of other paths. This paper presents an approach to evaluate the impacts of UPFCs on the ATC from a cost/worth point of view. The UPFC application worth is considered as the maximum cost saving in enhancing the ATC of the paths due to the UPFC implementation. The cost saving is considered as the cost of optimal application of other system reinforcement alternatives (except for UPFC) to reach the same ATC level obtained by UPFC application. UPFC application costs include the maximum cost of alleviating the probable negative impact on the ATC of some paths caused by implementing UPFCs. Optimal system reinforcement is used for systems with UPFCs to determine the aforementioned cost. The proposed method is applied to the IEEERTS and the results are evaluated through a sensitivity analysis. The cost/worth of UPFC application is also used to develop an index for optimal UPFC location and the results are compared with those of other indices. A comparison is finally made with the results obtained using an existing ATC allocation profit-based approach to determine UPFC application worth.

• 대한교통학회지
• /
• 제14권1호
• /
• pp.51-67
• /
• 1996

The optimal path-finding problem becomes complicated when multiple variables are simultaneously considered such as physical route length, degree of congestion, traffic capacity of intersections, number of intersections and lanes, and existence of free ways. Therefore, many researchers in various fields (management science, computer science, applied mathematics, production planning, satellite launching) attempted to solve the problem by ignoring many variables for problem simplification, by developing intelligent algorithms, or by developing high-speed hardware. In this research, an integration of expert system technique and case-based reasoning in high level with a conventional algorithms in lower level was attempted to develop an optimal path-finding system. Early application of experienced driver's knowledge and case data accumulated in case base drastically reduces number of possible combinations of optimal paths by generating promising alternatives and by eliminating non-profitable alternatives. Then, employment of a conventional optimization algorithm provides faster search mechanisms than other methods such as bidirectional algorithm and $A^*$ algorithm. The conclusion obtained from repeated laboratory experiments with real traffic data in Seoul metropolitan area shows that the integrated approach to finding optimal paths with consideration of various real world constraints provides reasonable solution in a faster way than others.

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

In this paper, methods for computing the time-optimal motion of a robotic manipulator are presented that considers the nonlinear manipulator dynamics, actuator constraints, joint limits, and obstacles. The optimization problem can be reduced to a search for the time-optimal path in the n-dimensional position space. These paths are further optimized with a local path optimization to yield a global optimal solution. Time-optimal motion of a robot with an articulated arm is presented as an example.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 추계학술대회 논문집 학회본부
• /
• pp.569-571
• /
• 1995

This paper compares the simulated annealing and the Hopfield neural network method for an optimal routing in a multistage interconnection network(MIN). The MIN provides a multiple number of paths for ATM cells to avoid cell conflict. Exhaustive search always finds the optimal path, but with heavy computation. Although greedy method sets up a path quickly, the path found need not be optimal. The simulated annealing can find an sub optimal path in time comparable with the greedy method.

• 한국공작기계학회논문집
• /
• 제12권3호
• /
• pp.75-81
• /
• 2003

Pocket machining is metal removal operation commonly used for creating depressions in machined parts. Numerically controlled milling is the primary means for machining complex die surface. These complex surfaces are generated by a milling cutter which removes material as it traces out pre-specified tool paths. To machine, a component on a CNC machine, part programs which define the cutting tool path are needed. This tool path is usually planned from CAD, and converted to a CAM machine input format. In this paper I proposed a new method for generating NC tool paths. This method generates automatically NC tool paths with dynamic elimination of machining errors in 2$\frac{1}{2}$ arbitrary shaped pockets. This paper generates a spiral-like tool path by dynamic computing optimal pocket of the pocket boundary contour based on the type and size of the milling cutter, the geometry of the pocket contour and surface finish tolerance requirements. This part programming system is PC based and simultaneously generates a G-code file.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제2권3호
• /
• pp.194-197
• /
• 2002

This paper considers the problem of routing connections in a optical multi tree networks using WDM (Wavelength Division Multiplexing), where each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, so that connections whose paths share a common link in the network are assigned different wavelengths. The problem of optimal coloring of the paths on the optical multi-networks is NP-hard[1], but if that is the coloring of all paths, then there exists efficient polynomial time algorithm. In this paper, using a "divide & conquer" method, we give efficient algorithm to assign wavelengths to all the paths of a tree network based on the theory of [7]. Here, our time complexity is 0(n4log n).

• 스마트미디어저널
• /
• 제7권2호
• /
• pp.9-14
• /
• 2018

The k-ary n-cube $Q^k_n$ is widely used in the design and implementation of parallel and distributed processing architectures. It consists of $k^n$ identical nodes, each node having degree 2n is connected through bidirectional, point-to-point communication channels to different neighbors. On $Q^k_n$ we would like to transmit packets from a source node to 2n destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $0{\leq}i{\leq}2n-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(n^3)$ routing algorithm on $Q^k_n$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.