• 대한토목학회논문집
• /
• 제28권6D호
• /
• pp.859-869
• /
• 2008

현재 전 세계적으로 이미 대부분 산업에서의 생산라인은 자동화되었으며 이는 생산성 및 경제성의 향상, 산업 재해에 대한 안전성 확보, 품질 향상 및 경쟁력 향상 등 많은 이익을 가져왔다. 그러나 건설 산업에서 자동화는 일반적인 산업생산라인과 달리 끊임없는 불확정적인 사건의 발생과 이에 따른 지능적 판단 및 처리 능력의 필요성으로 인한 해결해야 할 많은 어려움이 따르기 때문에 여전히 건설 기계장비 사용을 통한 노동력 투입에 의존하고 있다. 이러한 문제를 해결하기위하여 유럽, 미국, 일본 등 선진국에서 건설 자동화를 위한 끊임없는 연구가 진행 중이며 도로 포장, 다짐 및 작업프로세스가 비교적 단순한 반복형 작업에 대하여 자동화가 많이 이루어 졌지만 건설 현장에서 가장 비중을 많이 차지하는 토공 작업에 대하여 아직 자동화 연구가 미흡하다. 토공 작업의 자동화를 위해서는 획득된 지형정보를 분석하여 효율적인 작업 계획의 수립이 수행되어야 하며, 이를 위해 숙련된 작업자의 휴리스틱스(heuristics)를 활용하면 보다 시행착오가 적고 안전하며 효율적인 작업계획을 수립할 수 있을 것이다. 따라서 본 연구에서는 지능형 굴삭 시스템의 효율적인 작업계획의 수립을 위한 시스템인 지능형 Task Planning System의 구성 체계 및 각 단계마다 적용된 휴리스틱스(heuristics)에 대하여 소개하여 본다.

• Industrial Engineering and Management Systems
• /
• 제12권1호
• /
• pp.51-62
• /
• 2013

This paper considers a single machine rescheduling problem whose original (efficiency related) objective is minimizing makespan. We assume that disruptions such as order cancelations and newly arrived orders occur after the initial scheduling, and we reschedule this disrupted schedule with the objective of minimizing a disruption related objective while preserving the original objective. The disruption related objective measures the impact of the disruptions as difference of completion times in the remaining (uncanceled) jobs before and after the disruptions. The artificial due dates for the remaining jobs are set to completion times in the original schedule while newly arrived jobs do not have due dates. Then, the objective of the rescheduling is minimizing the maximum earliness without tardiness. In order to preserve the optimality of the original objective, we assume that no-idle time and no tardiness are allowed while rescheduling. We first define this new problem and prove that the general version of the problem is unary NP-complete. Then, we develop three simple but intuitive heuristics. For each of the three heuristics, we find a tight bound on the measure called modified z-approximation ratio. The best theoretical bound is found to be 0.5 - ${\varepsilon}$ for some ${\varepsilon}$ > 0, and it implies that the solution value of the best heuristic is at most around a half of the worst possible solution value. Finally, we empirically evaluate the heuristics and demonstrate that the two best heuristics perform much better than the other one.

• Advances in Computational Design
• /
• 제1권4호
• /
• pp.315-327
• /
• 2016

Damage detection and localisation in structures is essential since it can be a means for preventive maintenance of those structures under service conditions. The use of structural modal data for detecting the damage is one of the most efficient methods. This paper presents comparative performance of various state-of-the-art meta-heuristics for use in structural damage detection based on changes in modal data. The metaheuristics include differential evolution (DE), artificial bee colony algorithm (ABC), real-code ant colony optimisation (ACOR), charged system search (ChSS), league championship algorithm (LCA), simulated annealing (SA), particle swarm optimisation (PSO), evolution strategies (ES), teaching-learning-based optimisation (TLBO), adaptive differential evolution (JADE), evolution strategy with covariance matrix adaptation (CMAES), success-history based adaptive differential evolution (SHADE) and SHADE with linear population size reduction (L-SHADE). Three truss structures are used to pose several test problems for structural damage detection. The meta-heuristics are then used to solve the test problems treated as optimisation problems. Comparative performance is carried out where the statistically best algorithms are identified.

• Journal of information and communication convergence engineering
• /
• 제12권2호
• /
• pp.116-121
• /
• 2014

This paper discusses computer-generated heuristics for motion planning. Planning with many degrees of freedom is a challenging task, because the complexity of most planning algorithms grows exponentially with the number of dimensions of the problem. A well-designed heuristic may greatly improve the performance of a planning algorithm in terms of the computation time. However, in recent years, with increasingly challenging high-dimensional planning problems, the design of good heuristics has itself become a complicated task. In this paper, we present an approach to algorithmically develop a heuristic for motion planning, which increases the efficiency of a planner in similar environments. To implement the idea, we generalize modern motion planning algorithms to an extent, where a heuristic is represented as a set of random variables. Distributions of the variables are then analyzed with computer learning methods. The analysis results are then utilized to generate a heuristic. During the experiments, the proposed approach is applied to several planning tasks with different algorithms and is shown to improve performance.

• 정보관리학회지
• /
• 제28권3호
• /
• pp.355-376
• /
• 2011

이 연구는 연구정보시스템의 이용성을 높이기 위해 필요한 이용자 인터페이스 설계 원칙이 무엇인지 확인하고, 연구정보시스템의 개발 및 유지, 보수에 지속적으로 이용할 수 있는 휴리스틱의 개발을 목적으로 수행되었다. 이를 위하여 문헌조사와 이용자 인터페이스 분야의 전문가와 연구정보시스템의 이용자를 대상으로 심층인터뷰와 참여 관찰을 실시하여, 연구정보시스템의 이용자 인터페이스 설계 원칙과 그러한 원칙을 시스템에 적용하기 위해 필요한 인터페이스 요소가 무엇인지 분석하였다. 분석 결과를 토대로 연구정보시스템의 설계 및 평가에 활용될 수 있는 7차원의 86가지 항목으로 구성된 휴리스틱을 제시하였다.

• 정보관리학회지
• /
• 제39권2호
• /
• pp.1-33
• /
• 2022

음성을 통해 상품을 구매하는 음성쇼핑 서비스는 미래에 본격적으로 상용화될 것으로 예상된다. 본 연구에서는 음성쇼핑이 세계적으로 일상이 될 미래를 대비하여 디스플레이 탑재형 음성 인터페이스를 활용한 음성쇼핑 서비스 휴리스틱을 개발하였다. 첫째, 이론적 접근으로 '시각 인터페이스', '음성 인터페이스', '쇼핑 서비스'의 설계 원칙을 주제로 한 논문 50건을 읽고 문헌조사를 실시하여 총 29개의 설계 원칙 초안을 제작하였다. 둘째, 실증적 접근으로 소비자 의사결정과정에 따른 쇼핑 경험 및 쇼핑 맥락에서의 정보추구행위에 관한 포커스 그룹 인터뷰를 진행하여 문헌 연구에서 미흡했던 분야인 이용자 경험 측면을 보완한 휴리스틱 초안을 작성하였다. 셋째, 델파이 조사를 통해 위의 두 단계를 거쳐 개발된 휴리스틱 초안에 대하여 20명의 UX, 서비스기획, 인공지능 개발, 쇼핑 분야 전문가들에게 전문가 평가를 해줄 것을 요청하였다. 3회에 걸친 델파이 조사를 통해 최종 휴리스틱을 제안하였다.

• Industrial Engineering and Management Systems
• /
• 제11권2호
• /
• pp.202-214
• /
• 2012

This paper discusses the problem of determining locations for public health-care facilities and allocating patients to the public facilities with the objective of minimizing the total construction cost. The public health-care facilities have two types of facilities: public hospitals and health centers. The public hospital provides both hospital services and homecare services, while the health center provides only homecare service. We present an integer programming formulation for the problem, and develop two types of heuristics, based on priority rules and approximate mathematical formulation. Results of a series of computational experiments on a number of problem instances show that the algorithms give good solutions in a reasonable computation time.

• Industrial Engineering and Management Systems
• /
• 제14권1호
• /
• pp.22-31
• /
• 2015

In this paper, a two-stage hybrid flow shop problem is considered. Specifically, there exist identical parallel machines at stage 1 and two dedicated machines at stage 2, and the objective of the problem is to minimize makespan. After being processed by any machine at stage 1, a job must be processed by a specific machine at stage 2 depending on the job type, and one type of jobs can have different processing times on each machine. First, we introduce the problem and establish complexity of several variations of the problem. For some special cases, we develop optimal polynomial time solution procedures. Then, we establish some simple lower bounds for the problem. In order to solve this NP-hard problem, three heuristics based on simple rules such as the Johnson's rule and the LPT (Longest Processing Time first) rule are developed. For each of the heuristics, we provide some theoretical analysis and find some worst case bound on relative error. Finally, we empirically evaluate the heuristics.

• 한국유통학회:학술대회논문집
• /
• 한국유통학회 2003년도 춘계학술대회 발표논문집
• /
• pp.55-70
• /
• 2003

The most transport companies are placing increasing emphasis on powerful new techniques for planning their vehicle operations. They have tried to improve their vehicle control and customer service capability by adopting tile advanced information technology, such as GPS(Global Position System) and Using Digital Map. But researches on the VRSP(vehicle routing St schedule problem) in this situation were very few. The purpose of this research is to develop vehicle scheduling heuristics for making a real-time dynamic VRSP under the situation that GPS and using Digital Map are equipped to the transport company. Modified savings techniques are suggested for the heuristic method and an insertion technique is suggested for the dynamic VRSP. The urgent vehicle schedule is based on the regular vehicle schedule. This study suggest on VRSP system using GPS and Digital Map and the performance of the suggested heuristics is illustrated through an real case example.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
• /
• pp.1124-1132
• /
• 2006

This paper considers a flow shop scheduling problem where a different WIP (work-in-process) state has different weight on the duration time. The objective is to minimize the sum of the weighted WIP. For the two machine flow shop case, the recognition version is unary NP-Complete. The three simple and intuitive heuristics H0, H1, and H2 are presented for the problem. For each heuristic, we find an upper bound on relative error which is tight in limit. For heuristic H2, we show that H2 dominates the other two heuristics.