• The KIPS Transactions:PartB
• /
• v.11B no.1
• /
• pp.77-82
• /
• 2004

Reinforcement learning takes reward about selecting action when agent chooses some action and did state transition in Present state. this can be the important subject in reinforcement learning as temporal-credit assignment problems. In this paper, by new meta heuristic method to solve hard combinational optimization problem, examine Ant-Q learning method that is proposed to solve Traveling Salesman Problem (TSP) to approach that is based for population that use positive feedback as well as greedy search. And, suggest Ant-TD reinforcement learning method that apply state transition through diversification strategy to this method and TD-error. We can show through experiments that the reinforcement learning method proposed in this Paper can find out an optimal solution faster than other reinforcement learning method like ACS and Ant-Q learning.

• Journal of Fisheries and Marine Sciences Education
• /
• v.26 no.2
• /
• pp.444-454
• /
• 2014

The range of optimization problem in aquaculture is very wide, resulting from the range of species, mode of operation. Quite a few studies focus marine net-cages, but studies on land based culture farm are few or no. This paper considers a allocation problem to meet production planning in land based aquaculture system. A water pool allocation model in land based aquaculture system was developed. The solution finds the value of decision variable to minimize yearly production costs that sums up the water pool usage cost and sorting cost. The model inputs were (1) the fish growth rate (2) critical standing corp (3) number of water pool (4) number of fish. The model outputs were (5) number of water pool in growing phase (6) cost of cultivation (6) optimal facility allocation(number of water pool for each growing phase). To solve the problem, an efficient heuristic algorithm based on a greedy manner is developed. Branch and bound and heuristic is evaluated through numerical examples.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.976-998
• /
• 2011

This paper attempts to maximize the operator's revenue while simultaneously providing a multi-constraint, multi-hop and deterministic QoS provisioning for real time traffic in IEEE 802.16m based 4G networks. The optimal solution to such a problem is NP-complete and therefore not feasible to be solved in a tolerable polynomial time. For this reason, we also provide a simple price based greedy heuristic to be used along with the admission control. Simulation results for different QoS schemes show that the heuristic produces a revenue that is very close to the optimal revenue, and is far more aggressive than the size based and other common algorithms that are computationally feasible to be implemented in IEEE 802.16m.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2311-2319
• /
• 1999

We present two heuristic algorithms for the task allocation problem (NP-complete problem) in parallel computing. The problem is to find an optimal mapping of multiple communicating tasks of a parallel program onto the multiple processing nodes of a distributed-memory multicomputer. The purpose of mapping these tasks into the nodes of the target architecture is the minimization of parallel execution time without sacrificing solution quality. Many heuristic approaches have been employed to obtain satisfactory mapping. Our heuristics are based on genetic algorithms and simulated annealing. We formulate an objective function as a total computational cost for a mapping configuration, and evaluate the performance of our heuristic algorithms. We compare the quality of solutions and times derived by the random, greedy, genetic, and annealing algorithms. Our experimental findings from a simulation study of the allocation algorithms are presented.

• Journal of the Economic Geographical Society of Korea
• /
• v.14 no.2
• /
• pp.116-128
• /
• 2011

Some subway passengers may want to have their fresh vegetables purchased through internet at a service facility within the subway station of the Metropolitan Seoul subway system on the way to home, which raises further questions about which stations are chosen to locate service facilities and how many passengers can use the facilities. This problem is well known as the pickup problem, and it can be solved on a traffic network with traffic flows which should be identified from origin stations to destination stations. Since flows of the subway passengers can be found from the smart card transaction database of the Metropolitan Seoul smart card system, the pickup problem in the Metropolitan Seoul subway system is to select subway stations for the service facilities such that captured passenger flows are maximized. In this paper, we have formulated a model of the pickup problem on the Metropolitan Seoul subway system with subway passenger flows, and have proposed a fast heuristic algorithm to select pickup stations which can capture the most passenger flows in each step from an origin-destination matrix which represents the passenger flows. We have applied the heuristic algorithm to select the pickup stations from a large volume of traffic network, the Metropolitan Seoul subway system, with about 400 subway stations and five millions passenger transactions daily. We have obtained not only the experimental results in fast response time, but also displayed the top 10 pickup stations in a subway guide map. In addition, we have shown that the resulting solution is nearly optimal by a few more supplementary experiments.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.715-726
• /
• 2006

Web service technologies provide a standard means for interoperation and integration of heterogeneous applications distributed over the Internet. For efficient execution of hierarchically interacting composite web services, this paper proposes an approach to distribute web service invocations over peer systems effectively, exploiting intensional XML data embedding external service calls as a result of well services. A cost-based optimization problem on the execution of web services using intensional results was formalized, and a heuristic search method to find an optimal solution and a greedy algorithm to generate an efficient invocation plan quickly were suggested in this paper. Experimental evaluation shows that the proposed greedy algorithm provides near-optimal solutions in an acceptable time even for a large number of Web services.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.4
• /
• pp.165-170
• /
• 2023

This paper proposes an algorithm that can obtain a solution with linear time for a set cover problem(SCP) in which there is no polynomial time algorithm as an NP-complete problem so far. Until now, only heuristic greed algorithms are known to select sets that can be covered to the maximum. On the other hand, the proposed algorithm is a competitive algorithm that applies an inclusion-exclusion principle rule to N nodes up to 2nd or 3rd in the maximum number of elements to obtain a set covering all k nodes, and selects the minimum cover set among them. The proposed algorithm compensated for the disadvantage that the greedy algorithm does not obtain the optimal solution. As a result of applying the proposed algorithm to various application cases, an optimal solution was obtained with a polynomial time of O(kn²).

• Journal of Information Technology Applications and Management
• /
• v.12 no.1
• /
• pp.49-68
• /
• 2005

It is one of the crucial components of electronic logistics systems to manage logistics information of cargos and transportation companies and to mediate appropriate brokerage between them. Due to the advance of e-Commerce technologies many kinds of logistics transactions can be handled by means of EDI or XML/EDI applications. but the brokering processing relies mostly on the traditional processes and the research in this field is still at the initial stage. In this paper we study a logistics brokering system for ships and cargos and describe the design and implementation of the system. We analyze the brokering constraints for logistics of cargos and ships and construct an optimization model for their brokering. We also suggest a brokering procedure and a simple heuristic algorithm with respect to the proposed matching criteria. The experimental result shows that the proposed greedy-based heuristic algorithm performs very well. In its response time the proposed algorithm executed within a couple of seconds independently of the number of cargos and the container capacities of ships. The output of the algorithm is very close to that of the optimal solution. showing higher than 95% of approximation. The proposed system is implemented for the Web environment using JSP and PL/SQL.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.47 no.12
• /
• pp.856-864
• /
• 2019

The weapon-target assignment (WTA) problem is a matter of effectively allocating weapons to a number of threats. The WTA in a rapidly changing dynamic environment of engagement must take into account both of properties of the threat and the weapon and the effect of the previous decision. We propose a method of applying the Greedy Randomized Adaptive Search Procedure (GRASP) algorithm, a kind of meta-heuristic method, to derive optimal solution for a dynamic WTA problem. Firstly, we define a dynamic WTA problem and formulate a mathematical model for applying the algorithm. For the purpose of the assignment strategy, the objective function is defined and time-varying constraints are considered. The dynamic WTA problem is then solved by applying the GRASP algorithm. The optimal solution characteristics of the formalized dynamic WTA problem are analyzed through the simulation, and the algorithm performance is verified via the Monte-Carlo simulation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.4
• /
• pp.51-60
• /
• 2007

In this study, we consider the minimum ADM problem which is the fundamental problem for the cost-effective design of SONET ADM embedded in WDM ring networks. To minimize the number of SONET ADMs, efficient algorithms for the routing and wavelength assignment are needed. We propose a mathematical model based on the graph theory for the problem and propose a branch-and-price approach to solve the suggested model effectively within reasonable time. By exploiting the mathematical structure of ring networks, we developed polynomial time algorithms for column generation subroutine at branch-and-bound tree. In a computer simulation study, the suggested approach can find the optimal solution for sufficient size networks and shows better performance than the greedy heuristic method.