• Title/Summary/Keyword: heuristic evaluation

Search Result 227, Processing Time 0.03 seconds

The Corrective Heuristic Algorithm Analysis of the N$\times$3 Flow-shop Problem and Comparative Study with Multi-model (N$\times$3 Flow-shop 문제에 대한 수정된 발견적기법 분석과 기존기법과의 비교연구)

  • 강석호;궁광호
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.6 no.2
    • /
    • pp.13-19
    • /
    • 1981
  • This paper developed 3 flow-shop sequencing heuristic methods: modified RA method, modified RACS method and modified RAES method. These methods modified RA method, RACS method and RAES method developed by D. G. Dannenbring. These methods can easily determine desirable sequence of orders and can improve nx3 flow-shop's productivity and efficiency. The maximum flow-time criterion is selected as the evaluation criterion of flow-shop's efficiency, We evaluated these 6 heuristic methods’ performance. By the evaluation of the result, we can see that the modified methods produce a shorter maximum flow-time than the original methods.

  • PDF

Two Phase Heuristic for Test Set Generation Using Simulated Annealing in Cyber Testbank System (사이버 문제은행에서 시뮬레이티드 어닐링을 이용한 2단계 문제세트 생성 휴리스틱)

  • 황인수
    • Korean Management Science Review
    • /
    • v.18 no.1
    • /
    • pp.155-164
    • /
    • 2001
  • The widespread diffusion of Internet has enables every college and education institute to develope cyber education systems to meet the multiple needs of students, but it is not true that the effectiveness of cyber education is fruitful in terms of evaluation systems. Most of the early developed web-based evaluation systems for cyber education require that all the students should solve uniformed test set which are included in the predetermined static HTML pages. Therefore, it is impossible to dynamically provide a test set with consistency and reliability. This paper purpose to describe the employment of simulated annealing in cyber testbank system for test set generation that satisfy all constraints. The constraints include number of items for each skill, method, domain, topic, and so on. This research developed two phase heuristic combining sequential test set generation algorithm with simulated annealing. As a result of computer simulations, it was found that the two phase heuristic outperforms the other algorithms.

  • PDF

The Usability Evaluation Indicators for Services Design Platform (서비스디자인 플랫폼을 위한 사용성 평가지표 연구)

  • Jung, Hoe Jun;Kim, Kwang Myung;Jo, Sun;Ko, Young Jun
    • Korea Science and Art Forum
    • /
    • v.20
    • /
    • pp.409-419
    • /
    • 2015
  • Service Design Platform which has been developing under the sponsorship of the Ministry of Knowledge Economy is aimed at facilitating service design consultancy to carry out service design projects smoothly online. In the development process in order to verify and improve the usability of the platform, heuristic evaluations by usability experts along with usability test done by user participation are required. This study was conducted for the purpose of deriving appropriate evaluation areas and detailed evaluation indices prior to carrying out the heuristic evaluation. For the study, first, the concept of the service design platform was identified and the features of its component were analyzed. Second, based on literature study of standards which are related to usability evaluation indices, usability evaluation areas and indices were analyzed. Third, in order to establish and verify evaluation areas and indices which are appropriate for the evaluation, Delphi survey was conducted and its validity was verified. Through this study, evaluation indices with 4 evaluation areas and 45 detailed items were derived. Derived evaluation indices was made in the form of checklist and will be utilized for heuristic evaluation by usability experts.

Developing and Applying Usability Testing Instrument to Improve the VR-based Mobile Application for Maker Education (VR 기반 메이커 교육용 모바일 앱 개선을 위한 사용성 평가 도구 개발 및 적용)

  • Park, Taejung;Cha, Hyunjin
    • Journal of Information Technology Services
    • /
    • v.21 no.2
    • /
    • pp.127-143
    • /
    • 2022
  • In this study, a usability evaluation tool was developed for "ICANDUINO", a VR-based mobile application for maker education, and usability evaluation was conducted with a heuristic survey method for experts. The usability evaluation tool was derived through literature review and validated by two experts. It consisted of seven domains (effectiveness, efficiency, satisfaction, learnability, memorability, error, and cognitive load) and twenty-five sub-items. As a result of the usability evaluation conducted for six experts, it received the highest score in the domain of efficiency and the lowest score in the domain of error. The improvements of ICANDUINO were derived by analyzing the qualitative opinions of experts in each of the four stages (training, coding, tinkering, and testing) of making. the results of this study can be used as a guideline when evaluating the usability of a mobile app for education.

A Scheduling Heuristic Alogorithm for Flexible Manufacturing Systems (자동생산체제(自動生産体制)(FMS)에서의 생산일정계획(生産日程計劃))

  • No, In-Gyu;Choe, Jeong-Sang
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.14 no.1
    • /
    • pp.73-82
    • /
    • 1988
  • This research is concerned with production scheduling for FMS (Flexible Manufacturing System) which consists of machine centers served by cycle conveyor. The objective of the research is to develop and evaluate scheduling procedures to minimize the mean flow time. An optimal algorithm called SCTF (Shortest Circle Time First) is proposed when the conveyor runs at minimum possible speed (CS=1) and a heuristic algorithm called SCTJMF (Shortest Cycle Time and Job Matching Algorithm) is suggested when the conveyor runs at double speed (CS=2). The evaluation of the heuristic algorithm was implemented by comparison with the optimal algorithm for 112 experimentations for CS=1 and random schedule. The results showed that the proposed heuristic algorithm provides better solution that can be regarded noticeable when compared with SCTF algorithm and random scheduling.

  • PDF

Nesting Expert System using Heuristic Search (휴리스틱 탐색 기법을 이용한 네스팅 전문가 시스템)

  • Sheen, Dong-Mok
    • Journal of Ocean Engineering and Technology
    • /
    • v.26 no.4
    • /
    • pp.8-14
    • /
    • 2012
  • Two dimensional nesting is a common problem in industries such as the shipbuilding, automotive, clothing, shoe-making, and furniture industries, in which various parts are cut off from stock or packed in a flat space while minimizing waste or unoccupied space. Nesting is known as an NP-complete problem, which has a solution time proportional to the superpolynomial of the input size. It becomes practically impossible to find an optimal solution using algorithmic methods as the number of shapes to nest increases. Therefore, heuristic methods are commonly used to solve nesting problems. This paper presents an expert system that uses a heuristic search method based on an evaluation function for nesting problems, in which parts and stock are represented by pixels. The system is developed in CLIPS, an expert system shell, and is applied to four different kinds of example problems to verify its applicability in practical problems.

Multi-Stage Group Scheduling with Dependent Setup Time (종속적(從屬的)인 준비시간을 갖는 다단계공정(多段階工程)에서의 그룹스케듈링 해법(解法))

  • Song, Yeong-U;No, In-Gyu;Kim, Man-Sik
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.11 no.2
    • /
    • pp.75-85
    • /
    • 1985
  • The application of GT results in the mass production effect to multi-product, small lot-sized production. Group scheduling, which is operations scheduling based on the GT concept, is analyzed in a multistage manufacturing system. But the research has been limited in independent setup time models. A heuristic algorithm has been developed to minimize the mean flow time when setup times are dependent to sequence of group in multistage. For evaluation of the heuristic algorithm, the solution of heuristic algorithm is compared with that of random scheduling. The result of comparison indicates that the proposed heuristic algorithm provides good solutions with relatively fewer computational effort.

  • PDF

A Development of Heuristic Algorithms for the Multi-stage Manufacturing Systems with Sequence Dependent Setup Times (준비시간이 종속적인 n/M 스케쥴링 문제의 휴리스틱 알고리듬(I))

  • Choe, Seong-Un;No, In-Gyu
    • Journal of Korean Society for Quality Management
    • /
    • v.17 no.1
    • /
    • pp.35-47
    • /
    • 1989
  • This paper is concerned with a development and evaluation of heuristic algorithms for the n-job, M-stage flowshop with sequence dependent setup times. Three heuristic algorithms, CAIDAN, DANNEN and PETROV, are proposed. The makespan is taken as a performance measure for the algorithms. The experiment for each algorithm is designed for a $4{\times}3{\times}3$ factorial design with 360 observations. The experimental factors are PS (ratio of processing times to setup times), M (number of machines), and N (number of jobs). The makespan of the proposed heuristic algorithms is compared with the optimal makespan obtained by the complete enumeration method. The result of comparision of performance measure is called a relative error. The mean relative errors of CAIDAN, DANNEN and PETROV algorithms are 4.488%. 6.712% and 7.282%, respectively. The computational results are analysed using SPSS. The experimental results show that the three factors are statistically signiticant at 5% level.

  • PDF

Evaluating the Effectiveness of Nielsen's Usability Heuristics for Computer Engineers and Designers without Human Computer Interaction Background (비 HCI 전공자들을 대상으로 한 Nielsen의 Usability Heuristics에 대한 이해 정도 평가)

  • Jeong, YoungJoo;Sim, InSook;Jeong, GooCheol
    • The Journal of Korean Institute for Practical Engineering Education
    • /
    • v.2 no.2
    • /
    • pp.165-171
    • /
    • 2010
  • Usability heuristics("heuristics") are general principles for usability evaluation during user interface design. Our ultimate goal is to extend the practice of usability evaluation methods to a wider audience(e.g. user interface designers and engineers) than Human Computer Interaction(HCI) professionals. To this end, we explored the degree to which Jakob Nielsen's ten usability heuristics are understood by professors and students in design and computer engineering. None of the subjects received formal training in HCI, though some may have had an awareness of some HCI principles. The study identified easy-to-understand heuristics, examined the reasons for the ambiguities in others, and discovered differences between the responses of professors and students to the heuristics. In the course of the study, the subjects showed an increased tendency to think in terms of user-centric design. Furthermore, the findings in this study offer suggestions for improving these heuristics to resolve ambiguities and to extend their practice for user interface designers and engineers.

  • PDF

High-level Autonomous Navigation Technique of AUV using Fuzzy Relational Products (퍼지관계곱을 이용한 수중운동체의 고수준 자율항행기법)

  • Lee, Young-Il;Kim, Yong-Gi
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.1_2
    • /
    • pp.91-97
    • /
    • 2002
  • This paper describes a heuristic search technique carrying out collision avoidance for Autonomous Underwater Vehicles(AUVs). Fuzzy relational products are used as the mathematical implement for the analysis and synthesis of relations between obstacles that are met in the navigation environment and available candidate nodes. In this paper, we propose a more effective evaluation function that reflects the heuristic information of domain experts on obstacle clearance, and an advanced heuristic search method performing collision avoidance for AUVs. The search technique adopts fuzzy relational products to conduct path-planning of intelligent navigation system. In order to verify the performance of proposed heuristic search, it is compared with $A^*$ search method through simulation in view of the CPU time, the optimization of path and the amount of memory usage.