• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권4호
• /
• pp.1972-1986
• /
• 2017

With the advent of the knowledge economy, science and technology resources have played an important role in economic competition, and their optimal allocation has been regarded as very important across the world. Thus, allocation optimization research for regional science and technology resources is significant for accelerating the reform of regional science and technology systems. Regional science and technology resource allocation optimization is modeled as a double-layer optimization model: the entire system is characterized by top-layer optimization, whereas the subsystems are characterized by bottom-layer optimization. To efficaciously solve this optimization problem, we propose a mixed search method based on the orthogonal genetic algorithm and sensitivity analysis. This novel method adopts the integrated modeling concept with a combination of the knowledge model and heuristic search model, on the basis of the heuristic search model, and simultaneously highlights the effect of the knowledge model. To compare the performance of different methods, five methods and two channels were used to address an application example. Both the optimized results and simulation time of the proposed method outperformed those of the other methods. The application of the proposed method to solve the problem of entire system optimization is feasible, correct, and effective.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권5호
• /
• pp.1638-1653
• /
• 2014

A sequential optimization algorithm (SOA) for resource allocation in a cyclic-prefixed single-carrier cognitive relay system is proposed in this study. Both subcarrier pairing (SP) and power allocation are performed subject to a primary user interference constraint to minimize the mean squared error of frequency-domain equalization at the secondary destination receiver. Under uniform power allocation at the secondary source and optimal power allocation at the secondary relay, the ordered SP is proven to be asymptotically optimal in maximizing the matched filter bound on the signal-to-interference-plus-noise ratio. SOA implements the ordered SP before power allocation optimization by decoupling the ordered SP from the power allocation. Simulation results show that SOA can optimize resource allocation efficiently by significantly reducing complexity.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.513-524
• /
• 2006

The ammunition allocation problem is a Multi-objective optimization(MOO) problem, maximizing fill-rate of multiple user troops and minimizing transportation time. Recent studies attempted to solve this problem by the prior preference articulation approach such as goal programming. They require that all the preference information of decision makers(DM) should be extracted prior to solving the problem. However, the prior preference information is difficult to implement properly in a rapidly changing state of war. Moreover they have some limitations such as heavy cognitive effort required to DM. This paper proposes a new ammunition allocation model based on more reasonable assumptions and uses an interactive MOO method to the ammunition allocation problem to overcome the limitations mentioned above. In particular, this article uses the GDF procedure, one of the well-known interactive optimization methods in the MOO liter-ature, in solving the ammunition allocation problem.

• Journal of the Korean Data and Information Science Society
• /
• 제24권6호
• /
• pp.1503-1520
• /
• 2013

For multi-line insurance companies, allocating the risk capital to each line is a widely-accepted risk management exercise. In this article we consider several applications of the Euler capital allocation. First, we propose visual tools to present the diversification and the line-wise performance for a given loss portfolio so that the risk managers can understand the interactions among the lines. Secondly, on theoretical side, we prove that the Euler allocation is the directional derivative of the marginal or incremental allocation method, an alternative capital allocation rule in the literature. Lastly, we establish the equivalence between the mean-shortfall optimization and the RORAC optimization when the risk adjusted capital is the expected shortfall, and show how to construct the optimal insurance business mix that maximizes the portfolio RORAC. An actual loss sample of an insurance portfolio is used for numerical illustrations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권10호
• /
• pp.2395-2410
• /
• 2013

Many telecommunication operators around the world have multiple networks. The networks run by each operator are always of different generations, such as 2G and 3G or even 4G systems. Each system has unique characters and specified requirements for optimal operation. It brings about resource allocation problem among these networks for the operator, because the budget of each operator is limited. However, the evaluation of resource allocation among various networks under each operator is missing for long, not to mention resource allocation optimization. The operators are dying for an algorithm to end their blind resource allocation, and the Resource Allocation Optimization Algorithm for Multi-network Operator (RAOAMO) proposed in this paper is what the operators want. RAOAMO evaluates and optimizes resource allocation in the view of overall cost for each operator. It outputs a resource distribution target and corresponding optimization suggestion. Evaluation results show that RAOAMO helps operator save overall cost in various cases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1111-1130
• /
• 2016

Cooperative communications can significantly improve the wireless transmission performance with the help of relay nodes. In cooperative communication networks, relay selection and power allocation are two key issues. In this paper, we propose a relay selection and power allocation scheme RS-PA-PSACO (Relay Selection-Power Allocation-Particle Swarm Ant Colony Optimization) based on PSACO (Particle Swarm Ant Colony Optimization) algorithm. This scheme can effectively reduce the computational complexity and select the optimal relay nodes. As one of the swarm intelligence algorithms, PSACO which combined both PSO (Particle Swarm Optimization) and ACO (Ant Colony Optimization) algorithms is effective to solve non-linear optimization problems through a fast global search at a low cost. The proposed RS-PA-PSACO algorithm can simultaneously obtain the optimal solutions of relay selection and power allocation to minimize the SER (Symbol Error Rate) with a fixed total power constraint both in AF (Amplify and Forward) and DF (Decode and Forward) modes. Simulation results show that the proposed scheme improves the system performance significantly both in reliability and power efficiency at a low complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권1호
• /
• pp.216-239
• /
• 2021

The present work addresses the challenging problem of coordinating power allocation with interference management in multi-robot networks by applying the promising expansion capabilities of multiple-input multiple-output (MIMO) and full duplex systems, which achieves it for maximizing the throughput of networks under the impacts of Doppler frequency shifts and external jamming. The proposed power allocation with interference coordination formulation accounts for three types of the interference, including cross-tier, co-tier, and mixed-tier interference signals with cluster head nodes operating in different full-duplex modes, and their signal-to-noise-ratios are respectively derived under the impacts of Doppler frequency shifts and external jamming. In addition, various optimization algorithms, including two centralized iterative optimization algorithms and three decentralized optimization algorithms, are applied for solving the complex and non-convex combinatorial optimization problem associated with the power allocation and interference coordination. Simulation results demonstrate that the overall network throughput increases gradually to some degree with increasing numbers of MIMO antennas. In addition, increasing the number of clusters to a certain extent increases the overall network throughput, although internal interference becomes a severe problem for further increases in the number of clusters. Accordingly, applications of multi-robot networks require that a balance should be preserved between robot deployment density and communication capacity.

• 대한산업공학회지
• /
• 제43권2호
• /
• pp.135-146
• /
• 2017

This paper considers redundancy optimization problems of multi-level systems and reviews existing papers which proposed various optimization models and used different algorithms in this research area. Three different mathematical models are studied: Multi-level redundancy allocation (MRAP), multiple multi-level redundancy allocation, and availability-based MRAP models. Many meta-heuristics are applied to find optimal solutions in the several optimization problems. We summarized key idea of meta-heuristics applied to the existing MARP problems. Two extended models (MRAP with interval reliability of units and an integrated optimization problem of MRAP and preventive maintenance) are studied and further research ideas are discussed.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2017년도 학술발표회
• /
• pp.184-184
• /
• 2017

A nation-wide water-energy-food (WEF) nexus simulation model has been developed by the authors and successfully applied to South Korea to predict the sustainability of those three resources in the next 30 years. The model was also capable of simulating future scenarios of resources allocation based on priority rules aiming to maximize resources sustainability. However, the process was still relying on several assumptions and trial-and-error approach, which sometimes resulted in non-optimal solutions of resources allocation. In this study, an optimization module was introduced to enhance the model in generating optimal resources management rules. The objective of the optimization was to maximize the reliability index of resources by determining the resources' allocation and/or priority rules for each demand type that accordingly reflect the resources management policies. Implementation of the optimization module would result in balanced allocation and management of limited resources and assist the stakeholders in deciding resources' management plans, either by fulfilling the domestic production or by global trading.

• 대한조선학회논문집
• /
• 제57권1호
• /
• pp.45-51
• /
• 2020

In this study, we developed an allocation optimization system for supply chain management in the shipbuilding and offshore construction industry. Supply chain operation is a way of operating manufacturing company responsible for the procurement of outfitting parts. The method about how to allocate the manufacturing volume to each partner company includes important decisions. According to the allocation method, the stability of the material supplied to the final installation process is guaranteed. We improved the allocation method that was previously decided by the person in charge. Based on the optimization engine, a system is developed that can automatically allocate the production volume. For optimization model configuration, factors affecting the volume allocation were analyzed and modeled as constraint factors. A target function is defined to minimize the difference in the load variance of each partner company. In order to use the same type of volume allocation engine for various outfitting products, the amount of work done by the partner company was standardized. We developed an engine that can allocate the same production load of each production partner. Using this engine, the operating system was developed and applied to the actual offshore project. It has been confirmed that the work load variance of suppliers can be maintained uniformly using the optimization engine rather than manual method. By this system, we stabilize the manufacturing process of partner suppliers.