• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집C
• /
• pp.554-558
• /
• 2001

In this study, a hybrid method is used to search the pseudo-optimal solution for the I-dimentional nesting problem. This method is composed of the genetic algorithm for the global search and a simple heuristic one for the local search near the pseudo optimal solution. Several simulation results show that the hybrid method gives very satisfactory results.

• 경영과학
• /
• 제13권1호
• /
• pp.13-27
• /
• 1996

This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2008년도 추계학술대회
• /
• pp.35-39
• /
• 2008

This paper considers the sequencing of products in mixed model assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time, the number of utility workers, and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

• 한국통신학회논문지
• /
• 제34권8C호
• /
• pp.830-839
• /
• 2009

이 논문에서는 여러 입력 여러 출력 시스템에 알맞은 준최적 복호 방법을 하나 다룬다. 제안한 방법은 길이 먼저 살펴보기로 바탕으로 둔 바, 슈노르-오히너 늘어놓기와 가지 길이 문턱값을 써서 신호를 복호하는 데 드는 계산량을 줄인다. 제안한 방법의 비트오류율 성능은 최적 성능에 매우 가까우면서 계산량은 다른 준최적 복호기들보다 적다는 것을 모의실험으로 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권1호
• /
• pp.5-25
• /
• 2009

In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

• 한국품질경영학회:학술대회논문집
• /
• 한국품질경영학회 2009년도 추계학술대회
• /
• pp.131-135
• /
• 2009

This paper considers the sequencing of products in car assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. The performance of proposed technique is compared with existing heuristic methods in terms of solution quality and computation time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

• 산업경영시스템학회지
• /
• 제33권2호
• /
• pp.81-88
• /
• 2010

This paper presents an application of heuristic approach to problem of designing reliable network expansion. The problem essentially consists in finding the network topology that satisfies given set of reliability constraints. To efficiently solve the problem, a scatter search approach is proposed. The results of the two experiments show that scatter search is a more suitable approach for finding a good solution or near optimal solution in comparison with genetic algorithm.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제50권11호
• /
• pp.532-540
• /
• 2001

In this paper, we propose a probabilistic tabu search strategy for function optimization. It is composed of two procedures, one is Basic search procedure that plays a role in local search, and the other is Restarting procedure that enables to diversify search region. In basic search procedure, we use Belief space and Near region to create neighbors. Belief space is made of high-rank neighbors to effectively restrict searching space, so it can improve searching time and local or global searching capability. When a solution is converged in a local area, Restarting procedure works to search other regions. In this time, we use Probabilistic Tabu Strategy(PTS) to adjust parameters such as a reducing rate, initial searching region etc., which makes enhance the performance of searching ability in various problems. In order to show the usefulness of the proposed method, the PTS is applied to the minimization problems such as De Jong functions, Ackley function, and Griewank functions etc., the results are compared with those of GA or EP.

• Structural Engineering and Mechanics
• /
• 제23권4호
• /
• pp.325-337
• /
• 2006

A hybrid structural design and optimization methodology that combines the strengths of genetic algorithms, local search techniques, and parallel computing is developed to evolve optimal truss systems in this research effort. The primary objective that is met in evolving near-optimal or optimal structural systems using this approach is the capability of satisfying user-defined design criteria while minimizing the computational time required. The application of genetic algorithms to the design and optimization of truss systems supports conceptual design by facilitating the exploration of new design alternatives. In addition, final shape optimization of the evolved designs is supported through the refinement of member sizes using local search techniques for further improvement. The use of the hybrid approach, therefore, enhances the overall process of structural design. Parallel computing is implemented to reduce the total computation time required to obtain near-optimal designs. The support of human-computer interaction during layout optimization and local optimization is also discussed since it assists in evolving optimal truss systems that better satisfy a user's design requirements and design preferences.

• 대한산업공학회지
• /
• 제33권1호
• /
• pp.86-98
• /
• 2007

This paper presents a heuristic algorithm for the traveling salesman problem with time windows (TSPTW). Aniterative insertion algorithm as a constructive search heuristic and a hybrid meta heuristic combining simulatedannealing and tabu search with the randomized selection of 2-interchange and a simple move operator as animproving search heuristic are proposed, Computational tests performed on 400 benchmark problem instancesshow that the proposed algorithm generates optimal or near-optimal solutions in most cases. New best knownheuristic values for many benchmark problem sets were obtained using the proposed approach.