• Title/Summary/Keyword: heuristic evaluation

Search Result 227, Processing Time 0.03 seconds

A Study on Usability Evaluation for Improving Quality of User Services in CNU Digital Library Website (이용자 서비스의 품질 향상을 위한 웹사이트 사용성 평가에 관한 연구)

  • Lee, Eung-Bong
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.36 no.4
    • /
    • pp.311-329
    • /
    • 2002
  • This study aims to evaluate the usability of XML-based Chungnam National University Digital Library Website. Usability testing are used three method, that is Log File Analysis, Online Questionnaire and Heuristic Evaluation. Log files are analyzed in using WiseLog Enterprise and Hit Analyzer for Enterprise jx 1.5 Beta Version and total 21 items are analyzed and evaluated in using online questionnaire method and heuristic evaluation is inquired by experts of web and information retrieval fields. Finally this paper was suggested some problems and improvements to advance quality of user services in university digital library website in korea.

Development of Web-based Logistics Information System Using Usability Evaluation (Usability 평가기법을 활용한 웹 기반 물류정보시스템 개발)

  • Jang, Kyoung-Yeol;Byun, Sang-Kyu;Yoo, Woo-Sik
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.29 no.4
    • /
    • pp.8-17
    • /
    • 2006
  • Presented in this paper was to evaluate and improve the usability of a web-based logistics information system. The system was developed for the domestic company to track and monitor its own transportation vehicles and for the customers to check the current location of their packages by using Global Positioning System (GPS) and Short Massage Service (SMS). Since the initial system was developed under a tight schedule set by the company, the system designers and programmers did not focus on the usability of the system but on the functionality. Consequently, some usability problems of the system were discovered during the heuristic usability evaluation. This study was required to solve these usability issues. Usability problems of the initial system were identified and analyzed, and the user's requirements for the system were re-evaluated to meet the company's expectation. Several alternative designs were developed by fitted guidelines and then a updated system was developed. The updated system had an empirical usability test to find how much the initial system was improved from the heuristic evaluation. Two kinds of data were gathered during the tests: objective (completion time and number of errors) and subjects' preference. Data showed the updated system is better than the initial system in terms of usability. Presented in this paper includes introduction of the Usability evaluation, usability engineering process applied in this research, alternative design of GUI, usability test and results.

Hybrid Heuristic Applied by the Opportunity Time to Solve the Vehicle Routing and Scheduling Problem with Time Window (시간 제약을 가지는 차량 경로 스케줄링 문제 해결을 위한 기회시간 반영 하이브리드 휴리스틱)

  • Yu, Young-Hoon;Cha, Sang-Jin;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.15 no.3
    • /
    • pp.137-150
    • /
    • 2009
  • This paper proposes the hybrid heuristic method to apply the opportunity time to solve the vehicle routing and scheduling problem with time constraints(VRSPTW). The opportunity time indicates the idle time which remains after the vehicle performs the unloading service required by each customer's node. In this proposed heuristic, we add the constraints to VRSPTW model for the opportunity time. We also obtain the initial solution by applying the cost evaluation function to the insertion strategy considering the opportunity time. In addition, we improve the former result by applying the opportunity time to the tabu search strategy by swapping the customer's node. Finally, we suggest the construction strategies of initial routing which can efficiently acquire the nearest optimal solution from various types of data in terms of geographical condition, scheduling horizon and vehicle capacity. Our experiment show that our heuristic can get the nearest optimal solution more efficiently than the Solomon's I1 heuristic.

  • PDF

Optimum redundancy design for maximum system reliability: A genetic algorithm approach (최대 시스템 신뢰도를 위한 최적 중복 설계: 유전알고리즘에 의한 접근)

  • Kim Jae Yun;Shin Kyoung Seok
    • Journal of Korean Society for Quality Management
    • /
    • v.32 no.4
    • /
    • pp.125-139
    • /
    • 2004
  • Generally, parallel redundancy is used to improve reliability in many systems. However, redundancy increases system cost, weight, volume, power, etc. Due to limited availability of these resources, the system designer has to maximize reliability subject to various constraints or minimize resources while satisfying the minimum requirement of system reliability. This paper presents GAs (Genetic Algorithms) to solve redundancy allocation in series-parallel systems. To apply the GAs to this problem, we propose a genetic representation, the method for initial population construction, evaluation and genetic operators. Especially, to improve the performance of GAs, we develop heuristic operators (heuristic crossover, heuristic mutation) using the reliability-resource information of the chromosome. Experiments are carried out to evaluate the performance of the proposed algorithm. The performance comparison between the proposed algorithm and a pervious method shows that our approach is more efficient.

Research on the collision avoidance of manipulators based on the global subgoals and a heuristic graph search

  • Inoue, Y.;Yoshimura, T.;Kitamura, S.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1989.10a
    • /
    • pp.609-614
    • /
    • 1989
  • A collision avoidance algorithm based on a heuristic graph search and subgoals is presented. The joint angle space is quantized into cells. The evaluation function for a heuristic search is defined by the sum of the distance between the links of a manipulator and middle planes among the obstables and the distance between the end-effector and the subgoals on desired trajectory. These subgoals reduce the combinatorial explosion in the search space. This method enables us to avoid a dead-lock in searching. Its effectiveness has been verified by simulation studies.

  • PDF

A Study on efficient PCB assembly (PCB의 효율적 조립 방법에 관한 연구)

  • Mun Gi Ju;Jeong Hyeon Cheol;Heo Ji Hui
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.741-743
    • /
    • 2003
  • A surface mount machine operation policy to assemble printed circuit boards is being developed in this research. The policy includes how to assign electronic components to slots on a component rack, and how to determine placement sequences on printed circuit board. The suggested heuristic uses information about component types and closeness relationships in each component on the board to assemble. First, the size of components and closeness ratings are used to divide them into two different size groups. Then rack assignment and placement routes are developed using component type and quantity information for a small size group, and followed by a large size group. Simulation models are developed using Visual C++ for performance evaluation of the heuristic. Necessary statistical analyses are provided to show the effectiveness of the suggested heuristic.

  • PDF

A heuristic technique for autonomous control of AUV. (수중운동체의 자율항행 제어를 위한 휴리스틱 기법)

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

  • PDF

A GA-based Heuristic for the Interrelated Container Selection Loading Problems

  • Techanitisawad, Anulark;Tangwiwatwong, Paisitt
    • Industrial Engineering and Management Systems
    • /
    • v.3 no.1
    • /
    • pp.22-37
    • /
    • 2004
  • An integrated heuristic approach based on genetic algorithms (GAs) is proposed for solving the container selection and loading problems. The GA for container selection solves a two-dimensional knapsack problem, determining a set of containers to minimize the transportation or shipment cost. The GA for container loading solves for the weighted coefficients in the evaluation functions that are applied in selecting loading positions and boxes to be loaded, so that the volume utilization is maximized. Several loading constraints such as box orientation, stack priority, stack stability, and container stability are also incorporated into the algorithm. In general, our computational results based on randomly generated data and problems from the literature suggest that the proposed heuristic provides a good solution in a reasonable amount of computational time.

Scheduling for a Two-Machine, M-Parallel Flow Shop to Minimize Makesan

  • Lee, Dong Hoon;Lee, Byung Gun;Joo, Cheol Min;Lee, Woon Sik
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.23 no.56
    • /
    • pp.9-18
    • /
    • 2000
  • This paper considers the problem of two-machine, M-parallel flow shop scheduling to minimize makespan, and proposes a series of heuristic algorithms and a branch and bound algorithm. Two processing times of each job at two machines on each line are identical on any line. Since each flow-shop line consists of two machines, Johnson's sequence is optimal for each flow-shop line. Heuristic algorithms are developed in this paper by combining a "list scheduling" method and a "local search with global evaluation" method. Numerical experiments show that the proposed heuristics can efficiently give optimal or near-optimal schedules with high accuracy. with high accuracy.

  • PDF

Implementation and Evaluation of Path-Finding Algorithm using Abstract Graphs (추상 그래프를 활용한 경로 탐색 알고리즘의 구현 및 성능 평가)

  • Kim, Ji-Soo;Lee, Ji-wan;Cho, Dae-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.245-248
    • /
    • 2009
  • Recently, Many studies have been progressing to path-finding with dynamic information on the Terminal Based Navigation System(TBNS). However, the most of existing algorithms are based on $A{\ast}$ algorithm. Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost in case of that there is no way determined by heuristic function or there are 2 way more which have almost same cost. In this paper, two abstract graph(AG) that are different method of construction, Homogeneous Node merging($AG^H$) and Connected Node Merging($AG^C$), are implemented. The abstract graph is a simple graph of real road network. The method of using the abstract graph is proposed for reducing dependency of heuristic and exploring cost. In result of evaluation of performance, $AG^C$ has better performance than $AG^H$ at construction cost but $AG^C$ has worse performance than $AG^H$ exploring cost.

  • PDF