• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.2
• /
• pp.83-95
• /
• 2014

In this paper, we develop a portfolio selection model that can be used to invest in markets with margin requirements such as the foreign exchange market. An investment algorithm to implement the proposed portfolio selection model based on objective historical data is also presented. We further conduct empirical analysis on the performance of a hypothetical investment in the foreign exchange market, using the proposed portfolio selection model and investment algorithm. Using 7 currency pairs that recorded the highest trading volume in the foreign exchange market during the most recent 10 years, we compare the performance of 1) the Dollar Index, 2) a 1/N Portfolio which equally allocates capital to all N assets considered for investment, and 3) a hypothetical investment portfolio selected and managed according to the portfolio selection model and investment algorithm proposed in this paper. Performance is compared in terms of accumulated returns and Sharpe ratios for the 10-year period from January 2003 to December 2012. The results show that the hypothetical investment portfolio outperforms both benchmarks, with superior performance especially during the period following financial crisis. Overall, this paper suggests that a mathematical approach for selecting and managing an optimal investment portfolio based on objective data can achieve outstanding performance in the foreign exchange market.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.359-369
• /
• 2003

We present efficient generalized algorithms for all-to-all personalized communication operations in a 2D torus. All-to-all personalized communication, or complete exchange, is at the heart of numerous applications, such as matrix transposition, Fast Fourier Transform(FFT), and distributed table lookup. Some algorithms have been Presented when the number of nodes is power-of-2 or multiple-of-four form, but there has been no result for general cases yet. We first present complete exchange algorithm called multiple-Hop-2D when the number of nodes is in the form of multiple-of-two. Then by extending this algorithm, we present two algorithms for an arbitrary number of nodes. Split-and-Merge algorithm first splits the whole network into zones. After each zone performs complete exchange, merge is applied to finish the desired complete exchange. By handling extra steps in Double-Hop-2D algorithm, Modified Double-Hop-2D algorithm performs complete exchange operation for general cases. Finally, we compare the required start-up time for these algorithms.

• Journal of Navigation and Port Research
• /
• v.47 no.6
• /
• pp.401-409
• /
• 2023

This study compared and analyzed the performance of a distributed area search algorithm and a distributed probability search algorithm based on information exchange between ships. The distributed algorithm is a method that can search for an optimal avoidance route based on information exchange between ships. In the distributed area search algorithm, only a ship with the maximum cost reduction among neighboring ships has priority, so the next expected location can be changed. The distributed stochastic search algorithm allows a non-optimal value to be searched with a certain probability so that a new value can be searched. A circular-based ship collision avoidance model was used for the ship-to-ship collision avoidance experiment. The experimental method simulated the distributed area search algorithm and the distributed stochastic search algorithm while increasing the number of ships from 2 to 50 that were the same distance from the center of the circle. The calculation time required for each algorithm, sailing distance, and number of message exchanges were compared and analyzed. As a result of the experiment, the DSSA(Distributed Stochastic Search Algorithm) recorded a 25%calculation time, 88% navigation distance, and 84% of number of message exchange rate compared to DLSA.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.179-186
• /
• 2005

This paper describes a genetic algorithm and compares three crossover operators for Rural Postman Problem with Time Windows (RPPTW). The RPPTW which is a multiobjective optimization problem, is an extension of Rural Postman Problem(RPP) in which some service places (located at edge) require service time windows that consist of earliest time and latest time. Hence, RPM is a m띤tieect optimization Problem that has minimal routing cost being serviced within the given time at each service Place. To solve the RPPTW which is a multiobjective optimization problem, we obtain a Pareto-optimal set that the superiority of each objective can not be compared. This Paper performs experiments using three crossovers for 12 randomly generated test problems and compares the results. The crossovers using in this Paper are Partially Matched Exchange(PMX) Order Exchange(OX), and Modified Order Exchange(MOX) which is proposed in this paper. For each test problem, the results show the efficacy of MOX method for RPPTW.

• IE interfaces
• /
• v.21 no.1
• /
• pp.120-130
• /
• 2008

In this paper, we develop a transportation planning system for the mail transportation network, which consists of 25 mail centers and one mail exchange center. The main functions of the system are adjustment of transportation plan, creation of new transportation plan, and calculation of expected exchange mail volume which are transported through mail exchange center. We develop an adjusting algorithm which gives a new transportation plan by deleting, adding or changing the current routes. The algorithm based on the transportation results of current transportation plan and mail volume data. We design and implement a planning system by installing the algorithm as the planning engine. For the practical use, the system is connected to the information system of Korea Post, PostNet.

• Journal of Information Technology Applications and Management
• /
• v.9 no.4
• /
• pp.13-34
• /
• 2002

This paper considers a postal transportation planning problem in the transportation network of the form of hub and spoke Given mail sorting centers and an exchange center, available vehicles and amount of mails to be transported between mail sorting centers, postal transportation planning is to make a transportation plan without violating various restrictions. The objective is to minimize the total transportation cost. To solve the problem, a tabu search algorithm is proposed. The algorithm is composed of a route construction procedure and a route improvement procedure to improve a solution obtained by the route construction procedure using a tabu search. The tabu search uses the best-admissible strategy, BA, and the first-best-admissible strategy, FBA. The algorithm was tested on problems consisting of 11, 16 and 21 mail sorting centers including one exchange center. Solutions of the problems consisting of 11 mail sorting centers including one exchange center were compared with optimal solutions On average, solutions using BA strategy were within 0.287% of the optimum and solutions using FBA strategy were within 0.508% of the optimum. Computational results show that the proposed algorithm can solve practically sized problems within a reasonable time and the quality of the solution is very good.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.3
• /
• pp.451-456
• /
• 2007

This paper presents a problem that reconfigure distribution power system using branch exchange method. Optimal reconfiguration problem calculates line loss, voltage condition about system states of all situations that become different according to line On/off status, and search for optimum composition of these. However, result is difficult to be calculated fast. Because radiated operation condition of system is satisfied using many connection and sectionalize switches in the distribution power system. Therefore, in this paper, optimization method for reducing system total loss and satisfying operating condition of radial and constraints condition of voltage is proposed using the fastest branch exchange. And optimal solution at branch exchange algorithm can be wrong estimated to local optimal solution according to initial operating state. Considering this particular, an initial operating point algorithm is added and this paper showed that optimal solution arrives at global optimal solution.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.2
• /
• pp.355-361
• /
• 1987

The shuffle-exchange graph is known as a structure to perform the parallel algorithms like Discrete Fourier Transform(DFT), matrix multiplication and sorting. In this paper, the layout for the shuffle-exchange graph is described and this layout places emphasis on the placement of nodes that has the capability to have as small area as possible, have as a small number of crossings as possible, and have as short wires as possible. The algorithm corrdsponding these conditions is proposed and each evaluation factor and the placement of the N-node shuffle-exchange graph is performed with FORTRAN and BASIC program, and these results are calcualted.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.5
• /
• pp.464-474
• /
• 2000

All-to-all personalized communication, or complete exchange, is at the heart of numerous applications, such as matrix transposition, fast Fourier Transform(FFT), and distributed table lookup.We present an efficient all-to-all personalized communication algorithm for a 2D torus inwormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approach toreduce the number of start-up latency significantly, which is a good metric for network performancein wormhole networks. First, we divide the whole network into 2x2 basic cells, After speciallydesignated nodes called master nodes have collected messages to transmit to the rest of the basic cell,only master nodes perform complete exchange with reduced network size, N/2 x N/2. When finishedwith this complete exchange in master nodes, these nodes distribute messages to the rest of the masternode, which results in the desired complete exchange communication. After we present our algorithms,we analyze time complexities and compare our algorithms with several previous algorithms. And weshow that our algorithm is efficient by a factor of 2 in the required start-up time which means thatour algorithm is suitable for wormhole-routed networks.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.229-240
• /
• 1997

셀 생산방식에서 생산시스템은 생산셀로 나누어 지기 때문에 셀 스케줄링 문제의 범위는 일반적인 스케줄링 문제에서 작은 셀들의 스케줄링 문제로 줄어든다. 각각의 생산셀의 경우에서는 부품과 머신들의 수가 일반적인 경우보다 훨씬 줄어든다. 본 논문은 생산셀에서의 작업순서를 결정하기 위해 exchange-heuristic 알고리즘을 사용한다. 셀 스케줄링 문제에 exchange-heuristic 알고리즘의 전과정들이 적용된다. 셀 exchange-heuristic에서의 성능은 두가지 경우, 즉, 두 기계 머신인 경우와 다 머신인 경우에 대하여 분석된다. 이때, 셀 exchange-heuristic 문제는 일괄처리 작업방식으로 하며, 성능지표는 생산기간의 단축으로 한다.