• Journal of Information Technology Applications and Management
• /
• 제12권4호
• /
• pp.1-12
• /
• 2005

In general, other conventional researches propose the fuzzy Petri net-based fuzzy reasoning algorithms based on the exhaustive search algorithms. If it can allow the certainty factors representing in the fuzzy production rules to use as the heuristic information, then it can allow the reasoning of rule-based systems to perform fuzzy reasoning in more effective manner. This paper presents a fuzzy Petri net(FPN) model to represent the fuzzy production rules of a rule-based system. Based on the fuzzy Petri net model, a weighted fuzzy reasoning algorithm is proposed to Perform the fuzzy reasoning automatically, This algorithm is more effective and more intelligent reasoning than other reasoning methods because it can perform fuzzy reasoning using the certainty factors which are provided by domain experts as heuristic information

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.59-71
• /
• 2005

In this paper we address a design problem for hub and spoke transportation networks and then consider a capacitated hub locations problem with direct shipment (CHLPwD). We determine the location of hubs, the allocation of nodes to hubs, and direct shipment paths in the network, with the objective of minimizing the total cost in the network. An evolutionary algorithm is developed here to solve the CHLPwD. To do this, we propose the representation and the genetic operators suitable for the problem and adopt a heuristic method for the allocation of nodes to hubs. To enhance the search capability, problem-specific information is used in our evolutionary algorithm. The proposed algorithm is compared with the heuristic method in terms of solution quality and computation time. The experimental results show that our algorithm can provide better solutions than the heuristic.

• 경영과학
• /
• 제17권1호
• /
• pp.41-54
• /
• 2000

in the real world situations that some jobs need be processed only on certain limited machines frequently occur due to the capacity restrictions of machines such as tools fixtures or material handling equipment. In this paper we consider n-job non-preemptive and m parallel machines scheduling problem having two machines group. The objective function is to minimize the sum of earliness and tardiness with different release times and due dates. The problem is formulated as a mixed integer programming problem. The problem is proved to be Np-complete. Thus a heuristic is developed to solve this problem. To illustrate its suitability and efficiency a proposed heuristic is compared with a genetic algorithm and tabu search for a large number of randomly generated test problems in ship engine assembly shop. Through the experimental results it is showed that the proposed algorithm yields good solutions efficiently.

• 경영과학
• /
• 제23권2호
• /
• pp.161-174
• /
• 2006

In this paper, we consider a network optimization problem arising from the deployment of BcN access network. BcN convergence services requires that access networks satisfy QoS meausres. BcN services have two types of traffics : stream traffic and elastic traffic. Stream traffic uses blocking probability as a QoS measure, while elastic traffic uses delay factor as a QoS measure. Incorporating the QoS requirements, we formulate the problem as a nonlinear mixed-integer Programming model. The Proposed model seeks to find a minimum cost dimensioning solution, while satisfying the QoS requirement. We propose two local search heuristic algorithms for solving the problem, and develop a network design system that implements the developed heuristic algorithms. We demonstrate the computational efficacy of the proposed algorithm by solving a realistic network design problem.

• 한국CDE학회논문집
• /
• 제4권3호
• /
• pp.259-268
• /
• 1999

In order to reduce the cost of product and save the processing time, optimal nesting of two-dimensional part is an important application in number of industries like shipbuilding and garment making. There have been many studies on finding the optimal solution of two-dimensional nesting. The problem of two-dimensional nesting has a non-deterministic characteristic and there have been various attempts to solve the problem by reducing the size of problem rather than solving the problem as a whole. Heuristic method and linearlization are often used to find an optimal solution of the problem. In this paper, theoretical and practical nesting algorithm for rectangular, circular and irregular shape of two-dimensional parts is proposed. Both No-Fit-Polygon and Minkowski-Sum are used for solving the overlapping problem of two parts and the dynamic programming technique is used for reducing the number search spae in order to find an optimal solution. Also, nesting designer's expertise is complied into the proposed algorithm to supplement the heuristic method.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 제39회 하계학술대회
• /
• pp.303-304
• /
• 2008

For the state estimation problem, the weighted least squares (WLS) method and the fast decoupled method are widely used at present. However, these algorithms can converge to local optimal solutions. Recently, modern heuristic optimization methods such as Particle Swarm Optimization (PSO) have been introduced to overcome the disadvantage of the classical optimization problem. However, heuristic optimization methods based on populations require a lengthy computing time to find an optimal solution. In this paper, we used PSO to search for the optimal solution of state estimation in power systems. To overcome the shortcoming of heuristic optimization methods, we proposed parallel processing of the PSO algorithm based on the PC cluster system. the proposed approach was tested with the IEEE-118 bus systems. From the simulation results, we found that the parallel PSO based on the PC cluster system can be applicable for power system state estimation.

• 융합신호처리학회논문지
• /
• 제3권2호
• /
• pp.89-95
• /
• 2002

글로벌 라우팅(global routing)은 VLSI 설계 과정중의 하나로, 네트리스트의 모든 네트들을 연결하기 위하여 각 네트들을 라우팅 영역(routing area)에 할당시키는 문제이며, 글로벌 라우팅에서 최적의 해를 얻기 위해 maze routing 알고리즘, line-probe 알고리즘, shortest path 기반 알고리즘, Steiner tree 기반 알고리즘등이 이용된다. 본 논문에서는 라우팅 그래프에서 최단 경로 Steiner tree 탐색방법인 weighted network heuristic(WNH)과 이를 기반으로 하는 글로벌 라우팅 유전자 알고리즘(genetic algorithm; GA)을 제안하였으며, 제안한 방식을 시뮬레이티드 어닐링(SA) 방식과 비교, 분석하였다.

• 대한전자공학회논문지
• /
• 제21권5호
• /
• pp.1-6
• /
• 1984

본 논문에서는 여러 경우의 발견적함수가 논의되었다. 경로 찾기 알고리즘에 있어서는 목표까지 거리의 정확한 평가자를 구하는 것이 중요하다. 정확한 평가자가 존재하는 한 어느 공간이든 문제가 풀리는 영역이지만, 부정확한 평가자들로서도 가능한 영역에 흥미가 있으며 따라서 이 논문은 발견적정보의 효과적인 사용의 필요성을 느끼게 하여주는 경우들을 다루었으며, 이것은 최단경로 문제에 있어서 계산적인 접근에 사용하면 좋다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2000년도 추계학술발표논문집 (하)
• /
• pp.1441-1444
• /
• 2000

실시간 정보가 알려지지 않은 해저환경에서 자율수중 운동체(AUV, Autonomous Underwater Vehicle)가 성공적인 임무 수행을 완료하기 위해서는 주어진 목표지점까지의 안전하고 효율적인 경로설정이 선행되어야 한다. 이를 위해 평가함수(evaluation function)에 기반한 휴리스틱 탐색(heuristic search)이 사용되는데 대부분의 평가함수는 목표점까지의 거리, 소모되는 연료로 구성된다[1]. 본 논문에서는 영역전문가가 보유한 장애물회피 관련 경험적 정보(heuristic information)를 반영하여 보다 효율적인 평가함수를 고안하며 후보노드들간의 관계성을 고려한 퍼지관계곱(Fuzzy Relational Products) 기반 휴리스틱 탐색기법을 제안한다. 제안한 탐색기법의 성능을 검증하기 위해 수행시간(cpu time), 경로의 최적화(optimization)정도, 사용 메모리 관점에서 시뮬레이션을 통해 $A^*$ 탐색기법과 비교한다.

• 한국IT서비스학회지
• /
• 제10권1호
• /
• pp.117-133
• /
• 2011

In this paper, we present a frequency reassignment problem (FRP) arising from the reconfiguration of radio networks such as adding new base stations (BSs) and changing the number of frequencies assigned to BSs. For this problem, we develop an integer programming (IP) model that minimizes the sum of frequency reassignment cost and the cost for unsatisfied frequency demands, while avoiding interference among frequencies. To obtain tight lower bounds, we develop some valid inequalities and devise an objective function relaxation scheme. Also, we develop a simple but efficient heuristic procedure to solve large size problems. Computational results show that the developed valid inequalities are effective for improving lower bounds. Also, the proposed tabu search heuristic finds tight upper bounds with average optimality gap of 2.3%.