• 산업경영시스템학회지
• /
• 제28권2호
• /
• pp.8-17
• /
• 2005

This paper dealt with a kind of heterogeneous vehicle routing problem with known demand and time deadline of customers. The customers are supposed to have one of tight deadline and loose deadline. The demand of customers with tight deadline must be fulfilled in the deadline. However, the late delivery is allowed to customers with loose deadline. That is, the paper suggests a model to minimize total acquisition cost, total travel distance and total violation time for a fleet size and mix vehicle routing problem with time deadline, and proposes a heuristic algorithm for the model. The proposed algorithm consists of two phases, i.e. generation of an initial solution and improvement of the current solution. An initial solution is generated based on a modified insertion heuristic and iterative Improvement procedure is accomplished using neighborhood generation methods such as swap and reallocation. The proposed algorithm is evaluated using a well known numerical example.

• 한국전산응용수학회:학술대회논문집
• /
• 한국전산응용수학회 2003년도 KSCAM 학술발표회 프로그램 및 초록집
• /
• pp.15-15
• /
• 2003

We provide some recent results of approximation algorithms for solving Markov Games and discuss their applications to problems that arise in Computer Science. We consider a receding horizon approach as an approximate solution to two-person zero-sum Markov games with an infinite horizon discounted cost criterion. We present error bounds from the optimal equilibrium value of the game when both players take “correlated” receding horizon policies that are based on exact or approximate solutions of receding finite horizon subgames. Motivated by the worst-case optimal control of queueing systems by Altman, we then analyze error bounds when the minimizer plays the (approximate) receding horizon control and the maximizer plays the worst case policy. We give two heuristic examples of the approximate receding horizon control. We extend “parallel rollout” and “hindsight optimization” into the Markov game setting within the framework of the approximate receding horizon approach and analyze their performances. From the parallel rollout approach, the minimizing player seeks to combine dynamically multiple heuristic policies in a set to improve the performances of all of the heuristic policies simultaneously under the guess that the maximizing player has chosen a fixed worst-case policy. Given $\varepsilon$>0, we give the value of the receding horizon which guarantees that the parallel rollout policy with the horizon played by the minimizer “dominates” any heuristic policy in the set by $\varepsilon$, From the hindsight optimization approach, the minimizing player makes a decision based on his expected optimal hindsight performance over a finite horizon. We finally discuss practical implementations of the receding horizon approaches via simulation and applications.

• 디자인학연구
• /
• 제17권2호
• /
• pp.23-32
• /
• 2004

본 연구는 사용자의 시지각 프로세스에 대한 분석을 통해 시선추적 과정을 이해하고, 인간의 정보처리 모델을 기반으로 휴리스틱 가이드라인을 도출하여, 실무에서 적용할 수 있는 인터페이스 디자인의 일반적인 원리를 발견하는 것에 목적이 있다. 이를 위해 인간의 시각 특성을 이용한 시선추적 시스템을 실험에 적용하여, 상향처리와 하향처리의 시지각 프로세스를 파악하고 인간의 정보처리 모델을 근거로 디자인을 위한 적용점을 분석하였다. 사례 연구로 인터랙티브 미디어를 실험하여 시선의 동선 및 고정점을 통해 사용자의 관심을 확인하고, 사용자의 인지과정을 이해하기 위한 단서를 효과적으로 얻을 수 있었다 그리고, 인간 행위의 각 단계와 정보처리 모델을 기반으로 다섯 가지의 휴리스틱 가이드라인을 도출하였으며, 이를 통하여 디자인 실무에서 직접 적용할 수 있는 인터페이스 디자인의 일반적인 원칙을 발견할 수 있었다.

• 품질경영학회지
• /
• 제46권3호
• /
• pp.717-738
• /
• 2018

Purpose: This study aims to analyze why surveys of a single set of customer requirement result in different Kano analyses depending on the survey questionnaire designs. Methods: This study singled out 14 common features from four different questionnaires of two studies of Smart Car features and analyzed them using the Kano model. Several methods and devices were used: Group Comparison and Timko Index were applied; Kano Distribution Index, Timko Dispersion and Kano Conformity were newly introduced for the quantitative analysis; Correlations between Timko indices from different Kano questionnaires were conducted; Heuristic Splitting technic for reinforcing attribute categorization is introduced. Results: Correlation Coefficient proved strong positive relations among the three questionnaires, whose agreement degree of the resulting Kano attributes showed less than 10% when Indifferent was ignored. Heuristic Splitting on Timko charts enhanced the degree of the resulting Kano attributes up to 80%. Conclusion: Among the questionnaires the representation of customer requirements tends to move by parallel shifts on the Timko chart maintaining their relative locations. Heuristic Splitting suggests a rational solution to the interpretation of those inexplicable attribute categories resulting from traditional Kano methods.

• 대한산업공학회지
• /
• 제37권1호
• /
• pp.19-29
• /
• 2011

Cellular network is comprised of several base stations which serve cellular shaped service area and each base station (BS) is connected to the mobile switching center (MSC). In this paper, the configuration modeling and algorithm of a cellular mobile network with the aim of minimizing the overall cost of operation (handover) and network installation cost (cabling cost and installing cost of mobile switching center) are considered. Handover and cabling cost is one of the key considerations in designing cellular telecommunication networks. For real-world applications, this configuration study covers in an integrated framework for two major decisions: locating MSC and assigning BS to MSC. The problem is expressed in an integer programming model and a heuristic algorithm based on Lagrangian relaxation is proposed to resolve the problem. Searching for the optimum solution through exact algorithm to this problem appears to be unrealistic considering the large scale nature and NP-Completeness of the problem. The suggested algorithm computes both the bound for the objective value of the problem and the feasible solution for the problem. A Lagrangian heuristics is developed to find the feasible solution. Numerical tests are performed for the effectiveness and efficiency of the proposed heuristic algorithm. Computational experiments show that the performance of the proposed heuristics is satisfactory in the quality of the generated solution.

• 한국농공학회지
• /
• 제39권2호
• /
• pp.9-18
• /
• 1997

Abstract This paper presents a heuristic method for optimal design of water distribution system with multiple sources and potential links. In multiple source pipe network, supply rate at each source node affects the total cost of the system because supply rates are not uniquely determined. The Linear Minimum Cost Flow (LMCF) model may be used to a large scale pipe network with multiple sources to determine supply rate at each source node. In this study the heuristic method based on the LMCF is suggested to determine supply rate at each source node and then to optimize the given layout. The heuristic method in turn perturbs links in the longest path of the network to obtain the supply rates which make the optimal design of the pipe network. Once the best tree network is obtained, the frequency count of reconnecting links by considering link failure is in turn applied to form loop to enhance the reliability of the best tree network. A sample pipe network is employed to test the proposed method. The results show that the proposed method can yield a lower cost design than the LMCF alone and that the proposed method can be efficiently used to design irrigation systems or rural water distribution systems.

• 인터넷정보학회논문지
• /
• 제6권3호
• /
• pp.121-128
• /
• 2005

최근, 차별 서비스 망에서는 다양한 차세대 인터넷 서비스들을 지원하기 위해 효율적인 자원 관리를 위한 연구로서 동적 프로비저닝 (Dynamic Provisioning) 기법들을 이용한 수락 제어 메커니즘 연구가 활발히 진행되고 있다. 하지만, 수락 제어 메커니즘이 망에 적용되더라도 서로 다른 대역폭을 요구하는 서비스들에 대한 호 설정 요구가 들어오며 불공평한 호 블로킹 확률이 존재한다. 본 논문에서는 큰 대역폭을 요구하는 서비스와 작은 대역폭을 요구하는 서비스들 사이에 공평한 호 블로킹 확률을 제공하는 새로운 수락 제어 정책 Heuristic 알고리즘을 제안한다. 특히 제안된 알고리즘은 모의 실험 결과를 통하여 호 블로킹 확률의 공평성 및 높은 대역폭의 사용율을 제공할 수 있음을 보여 주었다.

• 인지과학
• /
• 제11권1호
• /
• pp.33-45
• /
• 2000

본 연구는 정보 시스템으로서의 웹(WWW)의 인지심리학적 특성들을 고려하여 웹사이트의 사용성에 관련된 디자인 특성들을 밝히고자 하였다. 구체적으로 다양한 목적의 웹사이트를 선정하고 다양한 비실험적 방법들을 이용하여 그 사이트의 홈페이지 디자인에 관한 사용성 평가를 실시하였다. 이를 위해 연구 1에서는 설문조사법을 통한 웹사이트의 사용성을 조사하였다. 그 결과, 몇 가지 중요한 사용성과 관련된 디자인의 특성들 및 요인들이 추출되었다. 연구 2에서는 연구 1에서 쉽게 발견되지 않은 특정 웹사이트의 세부적 사용성 문제들을 검출하기 위해 발견적 평가를 실시하였다. 연구 2의 결과, 발견적 평가가 연구 1 의 설문조사에 비해 디자인의 세부적인 문제점들을 더 잘 드러내는 것으로 나타났다.

• 한국콘텐츠학회논문지
• /
• 제10권9호
• /
• pp.107-116
• /
• 2010

시설물 입지 선정 문제(FLP)는 전통적인 최적화 문제중에 하나이다. FLP에 공급제약과 하나의 고객은 하나의 시설물에서만 제품을 공급받을 수 있다는 제약을 추가하면 단일 시설물 공급제약을 가지는 시설물 위치 설정 문제(SSFLP)가 된다. SSFLP는 NP-hard 문제로 알려져 있으며 진화 알고리즘과 같은 휴리스틱 알고리즘을 사용하여 해결하는 것이 일반적이다. 본 논문에서는 SSFLP를 위한 효율적인 진화 알고리즘을 제안한다. 제안하는 알고리즘은 적응형 링크 조절 진화 알고리즘과 3가지 휴리스틱 해 개선 방법을 조합하여 고안되었다. 제안하는 알고리즘을 벤치마크 문제에 적용하여 다른 알고리즘과 성능을 비교분석해 본 결과, 제안하는 알고리즘은 중간 크기의 문제에서 대부분 최적해를 찾았으며 큰 문제에서도 안정된 결과를 보여주었다.

• 한국경영과학회지
• /
• 제26권4호
• /
• pp.133-141
• /
• 2001

Rapid development in computer and network technology these days has created in environment in which decisions for manufacturing companies can be made in a much broader perspective. Especially, better decisions on production and distribution planning(PDP) problems can be made laking advantage of real time information from all the parties concerned. However, since the PDP problem-a core part of the supply chain management- is known to be the so-called NP-hard problem, so heuristic methods are dominantly used to find out solutions in a reasonable time. As one of those heuristic techniques, many previous studios considered genetic a1gorithms. A standard genetic a1gorithm applies rules of reproduction, gene crossover, and mutation to the pseudo-organisms so the organisms can pass along beneficial and survival-enhancing trails to a new generation. When it comes to representing a chromosome on the problem, it is hard to guarantee an evolution of solutions through classic a1gorithm operations alone, for there exists a strong epitasis among genes. To resolve this problem, we propose a hybrid genetic a1gorithm based on Silver-Meal heuristic. Using IMS-TB(Intelligent Manufacturing System Test-bed) problem sets. the good performance of the proposed a1gorithm is demonstrated.