• 제목/요약/키워드: Benchmark Problem

검색결과 460건 처리시간 0.026초

파이프라인형 데이타패스 합성을 위한 스케쥴링 기법 (A Scheduling Technique for Pipelined Datapath Synthesis)

  • 이근만;임인칠
    • 전자공학회논문지A
    • /
    • 제29A권4호
    • /
    • pp.74-82
    • /
    • 1992
  • This paper deals with the scheduling problems, which are the most important subtask in High-level Synthesis. ILP(integer linear programming) formulations are used as a scheduling problem approach.For practical application to digital system design, we have concentrated our attentions on pipelined datapath scheduling. For experiment results, we choose the 5-th order digital wave filter as a benchmark and do the schedule. Finally, we can obtain better and near-optimal scheduling results.

  • PDF

Efficient Path Delay Test Generation for Custom Designs

  • Kang, Sung-Ho;Underwood, Bill;Law, Wai-On;Konuk, Haluk
    • ETRI Journal
    • /
    • 제23권3호
    • /
    • pp.138-149
    • /
    • 2001
  • Due to the rapidly growing complexity of VLSI circuits, test methodologies based on delay testing become popular. However, most approaches cannot handle custom logic blocks which are described by logic functions rather than by circuit primitive elements. To overcome this problem, a new path delay test generation algorithm is developed for custom designs. The results using benchmark circuits and real designs prove the efficiency of the new algorithm. The new test generation algorithm can be applied to designs employing intellectual property (IP) circuits whose implementation details are either unknown or unavailable.

  • PDF

자기유변유체 댐퍼를 이용한 대형구조물의 반능동제어

  • 윤정방;구자인;김상범;전준보
    • 한국해양공학회:학술대회논문집
    • /
    • 한국해양공학회 2001년도 춘계학술대회 논문집
    • /
    • pp.127-132
    • /
    • 2001
  • 자기유변유체감쇠기를 이용한 반능동 제어 시스템은 최근에 개발되어 승용차의 승차감 향상을 위한 진동제어에 사용되고 있다. 본 연구에서는 바람, 지진, 파랑 등에 대한 대형구조물의 진동제어를 위한 MR 감쇠기의 적용성을 분석하기 위하여, 미국 토목학회에서 제안한 76층 건물의 풍하중에 대한 진동제어에 관한 Benchmark Problem에 대하여 수치모의 해석을 수행하였다. 연구결과로부터, 풍하중에 대한 고층 건물의 진동제어를 위하여 MR 감쇠기를 이용한 반능동 제어의 성능은 능동형 동조질량 감쇠기의 성능과 유사함을 확인할 수 있었다.

  • PDF

Deducing thick plate solutions from classical thin plate solutions

  • Wang, C.M.
    • Structural Engineering and Mechanics
    • /
    • 제11권1호
    • /
    • pp.89-104
    • /
    • 2001
  • This paper reviews the author's work on the development of relationships between solutions of the Kirchhoff (classical thin) plate theory and the Mindlin (first order shear deformation) thick plate theory. The relationships for deflections, stress-resultants, buckling loads and natural frequencies enable one to obtain the Mindlin plate solutions from the well-known Kirchhoff plate solutions for the same problem without much tedious mathematics. Sample thick plate solutions, deduced from the relationships, are presented as benchmark solutions for researchers to use in checking their numerical thick plate solutions.

외판원 문제를 위한 난수 키 표현법 기반 차분 진화 알고리즘 (Differential Evolution Algorithm based on Random Key Representation for Traveling Salesman Problems)

  • 이상욱
    • 한국콘텐츠학회논문지
    • /
    • 제20권11호
    • /
    • pp.636-643
    • /
    • 2020
  • 차분 진화 알고리즘은 연속적인 문제 공간인 실수 최적화 문제를 해결하기 위해 개발된 메타휴리스틱 기법 중에 하나이다. 본 연구에서는 차분 진화 알고리즘을 불연속적인 문제 공간인 외판원 문제 해결에 사용하기 위하여 차분 진화 알고리즘에 난수 키 표현법을 적용하였다. 차분 진화 알고리즘은 실수 공간을 탐색하고 오름 차순으로 정렬된 해의 인덱스의 순서를 도시 방문 순서로 하여 적합도를 구한다. TSPLIB에서 제공하는 표준 외판원 문제에 적용하여 실험한 결과 제안한 난수 키 표현법 기반 차분 진화 알고리즘이 외판원 문제 해결에 가능성을 가지고 있음을 확인하였다.

복수 차량 유형에 대한 차량경로문제의 정수계획 해법 (Integer Programming Approach to the Heterogeneous Fleet Vehicle Routing Problem)

  • 최은정;이태한;박성수
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
    • /
    • pp.179-184
    • /
    • 2002
  • We consider the heterogeneous fleet vehicle routing problem (HVRP), a variant of the classical vehicle routing problem (VRP). The HVRP differs from the classical VRP in that it deals with a heterogeneous fleet of vehicles having various capacities, fixed costs, and variables costs. Therefore the HVRP is to find the fleet composition and a set of routes with minimum total cost. We give an integer programming formulation of the problem and propose an algorithm to solve it. Although the formulation has exponentially many variables, we can efficiently solve the linear programming relaxation of it by using the column generation technique. To generate profitable columns we solve a shortest path problem with capacity constraints using dynamic programming. After solving the linear programming relaxation, we apply a branch-and-bound procedure. We test the proposed algorithm on a set of benchmark instances. Test results show that the algorithm gives best-known solutions to almost all instances.

  • PDF

다양성유지를 기반으로 한 Job-shop Scheduling Problem의 진화적 해법 (Genetic Algorithms based on Maintaining a diversity of the population for Job-shop Scheduling Problem)

  • 권창근;오갑석
    • 한국지능시스템학회논문지
    • /
    • 제11권3호
    • /
    • pp.191-199
    • /
    • 2001
  • 유전자알고리듬(Genetic Algorithm)은 확률적인 집단 탐색법이고 적응도함수의 형태에 관계없는 직접 탐색법이기 때문에 최근 최적화 방법으로 주목을 받고 있다. 본 논문에서는 Job-shop Schedule Problem에 대하여 교배방법으로 JOX를 사용하며, 효율적인 탐색을 위하여 탐색범위를 축소시키는 강제조작을 형질유전을 고려한 형질유전GT법을 제안하고, 세대교체에 있어 모집단의 다양성을 유지하기 위하여 집단 내에 동일한 개체를 배제하는 방법을 제안한다. 제안 알고리듬을 Fisher & Thompson의 FT10$\times$10 및 FT20$\times$5 문제에 적용하여 유효성을 실험적으로 검증한다.

  • PDF

A Heuristic Polynomial Time Algorithm for Crew Scheduling Problem

  • Lee, Sang-Un
    • 한국컴퓨터정보학회논문지
    • /
    • 제20권11호
    • /
    • pp.69-75
    • /
    • 2015
  • This paper suggests heuristic polynomial time algorithm for crew scheduling problem that is a kind of optimization problems. This problem has been solved by linear programming, set cover problem, set partition problem, column generation, etc. But the optimal solution has not been obtained by these methods. This paper sorts transit costs $c_{ij}$ to ascending order, and the task i and j crew paths are merged in case of the sum of operation time ${\Sigma}o$ is less than day working time T. As a result, we can be obtain the minimum number of crews $_{min}K$ and minimum transit cost $z=_{min}c_{ij}$. For the transit cost of specific number of crews $K(K>_{min}K)$, we delete the maximum $c_{ij}$ as much as the number of $K-_{min}K$, and to partition a crew path. For the 5 benchmark data, this algorithm can be gets less transit cost than state-of-the-art algorithms, and gets the minimum number of crews.

Multiple Pounding Tuned Mass Damper (MPTMD) control on benchmark tower subjected to earthquake excitations

  • Lin, Wei;Lin, Yinglu;Song, Gangbing;Li, Jun
    • Earthquakes and Structures
    • /
    • 제11권6호
    • /
    • pp.1123-1141
    • /
    • 2016
  • To explore the application of traditional tuned mass dampers (TMDs) to the earthquake induced vibration control problem, a pounding tuned mass damper (PTMD) is proposed by adding a viscoelastic limitation to the traditional TMD. In the proposed PTMD, the vibration energy can be further dissipated through the impact between the attached mass and the viscoelastic layer. More energy dissipation modes can guarantee better control effectiveness under a suite of excitations. To further reduce mass ratio and enhance the implementation of the PTMD control, multiple PTMDs (MPTMD) control is then presented. After the experimental validation of the proposed improved Hertz based pounding model, the basic equations of the MPTMD controlled system are obtained. Numerical simulation is conducted on the benchmark model of the Canton Tower. The control effectiveness of the PTMD and the MPTMD is analyzed and compared under different earthquake inputs. The sensitivity and the optimization of the design parameters are also investigated. It is demonstrated that PTMDs have better control efficiency over the traditional TMDs, especially under more severe excitation. The control performance can be further improved with MPTMD control. The robustness can be enhanced while the attached mass for each PTMD can be greatly reduced. It is also demonstrated through the simulation that a non-uniformly distributed MPTMD has better control performance than the uniformly distributed one. Parameter study is carried out for both the PTMD and the MPTMD systems. Finally, the optimization of the design parameters, including mass ratio, initial gap value, and number of PTMD in the MPTMD system, is performed for control improvement.

System identification of a super high-rise building via a stochastic subspace approach

  • Faravelli, Lucia;Ubertini, Filippo;Fuggini, Clemente
    • Smart Structures and Systems
    • /
    • 제7권2호
    • /
    • pp.133-152
    • /
    • 2011
  • System identification is a fundamental step towards the application of structural health monitoring and damage detection techniques. On this respect, the development of evolved identification strategies is a priority for obtaining reliable and repeatable baseline modal parameters of an undamaged structure to be adopted as references for future structural health assessments. The paper presents the identification of the modal parameters of the Guangzhou New Television Tower, China, using a data-driven stochastic subspace identification (SSI-data) approach complemented with an appropriate automatic mode selection strategy which proved to be successful in previous literature studies. This well-known approach is based on a clustering technique which is adopted to discriminate structural modes from spurious noise ones. The method is applied to the acceleration measurements made available within the task I of the ANCRiSST benchmark problem, which cover 24 hours of continuous monitoring of the structural response under ambient excitation. These records are then subdivided into a convenient number of data sets and the variability of modal parameter estimates with ambient temperature and mean wind velocity are pointed out. Both 10 minutes and 1 hour long records are considered for this purpose. A comparison with finite element model predictions is finally carried out, using the structural matrices provided within the benchmark, in order to check that all the structural modes contained in the considered frequency interval are effectively identified via SSI-data.