• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권4호
• /
• pp.711-725
• /
• 2013

A heuristic with multi-byte suffix matching plays an important role in real pattern matching algorithms. By skipping many characters at a time in the process of comparing a given pattern with the text, the pattern matching algorithm based on a heuristic with multi-byte suffix matching shows a faster average search time than algorithms based on deterministic finite automata. Based on various experimental results and simulations, the previous works show that the pattern matching algorithms with multi-byte suffix matching performs well. However, there have been limited studies on the mathematical model for analyzing the performance in a standard manner. In this paper, we propose a new probabilistic model, which evaluates the performance of a heuristic with multi-byte suffix matching in an average-case search. When the theoretical analysis results and experimental results were compared, the proposed probabilistic model was found to be sufficient for evaluating the performance of a heuristic with suffix matching in the real pattern matching algorithms.

• 대한산업공학회지
• /
• 제23권1호
• /
• pp.55-76
• /
• 1997

This paper presents a heuristic solution for the three dimensional container loading problem with boxes which are different in size. The container loading problem is formulated as a zero-one mixed integer programming model whose objective is to maximize the container utilization. Due to its problem complexity, we propose a heuristic based on layered loading technique. Also, presented is a way to achieve the weighting balance of the stacked boxes. A micro-computer based program is developed which generates container loading pattern provided by the proposed heuristic. The results are displayed by computer-graphic. To evaluate the performance of the proposed heuristic, computational experiments are performed. The results indicate that in most of the cases the proposed heuristic performs better than an existing heuristic in terms of the container utilization.

• 유통과학연구
• /
• 제16권2호
• /
• pp.19-24
• /
• 2018

Purpose - Drone delivery is expected to revolutionize the supply chain industry. This paper aims to introduce a collaborative parcel delivery problem by truck and drone (hereinafter called "TDRP") and propose a novel heuristic method to solve the problem. Research design, data, and methodology - To show the effectiveness of collaborative delivery by truck and drone, we generate a toy problem composed of 9 customers and the speed of drone is assumed to be two times faster than truck. We compared the delivery completion times by 'truck only' case and 'truck and drone' case by solving the optimization problem respectively. Results - We provide literature reviews for truck and drone routing problem for collaborative delivery and propose a novel and original heuristic method to solve the problem with numerical example. By numerical example, collaborative delivery is expected to reduce delivery completion time by 12~33% than 'truck only' case. Conclusions - In this paper, we introduce the TDRP in order for collaborative delivery to be effective and propose a novel and original heuristic method to solve the problem. The results of research will be help to develop effective heuristic solution and optimize the parcel delivery by using drone.

• 대한안전경영과학회지
• /
• 제11권3호
• /
• pp.157-166
• /
• 2009

In this study, we developed a heuristic algorithm to get better efficiency of clustering than conventional algorithms. Conventional clustering algorithm had lower efficiency of clustering as there were no solid method for selecting initial center of cluster and as they had difficulty in search solution for clustering. EMC(Expanded Moving Center) heuristic algorithm was suggested to clear the problem of low efficiency in clustering. We developed algorithm to select initial center of cluster and search solution systematically in clustering. Experiments of clustering are performed to evaluate performance of EMC heuristic algorithm. Squared-error of EMC heuristic algorithm showed better performance for real case study and improved greatly with increase of cluster number than the other ones.

• 대한산업공학회지
• /
• 제22권3호
• /
• pp.325-336
• /
• 1996

This study is concerned with developing a heuristic for the vehicle routing problem(VRP) which determines each vehicle route in order to minimize the transportation costs, subject to meeting the demands of all delivery points. VRP is known 10 be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristic are more frequently developed than optimal algorithms. This study aims to develop a heuristic which can give a good solution in comparatively brief time. Finally, the computational tests were performed using the benchmark problems and the proposed heuristic is compared with the other existing algorithms. The result of computational tests shows that the proposed heuristic gives good solutions, in much shorter time, which are not 1% more expensive than the best known solutions, which are same as the best known solutions in the previous researches.

• 산업경영시스템학회지
• /
• 제5권6호
• /
• pp.41-48
• /
• 1982

This paper analyzed md developed flow - shop sequencing heuristic method. The essence of the heuristic approach is in the application of selective routine that reduce the size of a problem. The advantages of this approach are consistency. Speed, endurance and the ability to cope with more data and larger systems than is humanly possible, In recent years many heuristic procedures have been suggested for the flow - shop sequencing problem. Although limited comparisons of these procedures have been made, a full scale test and evaluation have not been reported previously. The maximum flow - time criterion is selected as the evaluation criterion is selected as the evaluation criterion of flow - shop's efficiency. The author evaluated these 3 heuristic method's performance. By the evaluation of the result, we can see that the modified methods produce a shorter maximum flow - time than the original methods.

• 한국디자인학회:학술대회논문집
• /
• 한국디자인학회 2002년도 봄 학술발표회 논문집
• /
• pp.234-235
• /
• 2002

• 대한지구과학교육학회지
• /
• 제7권1호
• /
• pp.54-63
• /
• 2014

This study explored the effect of using the inquiry-based science writing heuristic approach in class on metacognition and scientific creativity to enhance the ability of solving problems in science classrooms of elementary students. The results of this study were as follows. First, the science writing heuristic had a positive influence on the usage of metacognition necessary for learners to solve the problem with science. Second, the science writing heuristic contributed to the improvement of scientific creativity. In the process of inquiry-based approach, learners used scientific knowledge to come up with ideas and produce outcomes, therefore they could seek sanswers to scientific problems for themselves. Third, the science writing heuristic produced a positive awareness of science process skill because learners had more opportunities to think on their own than an existing passive class. In conclusion, this study found that the inquiry-based science writing heuristic approach encouraged learners to do inquiring activities in school classrooms, therefore contributing to the application of metacognition and the improvement of scientific creativity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권7호
• /
• pp.2383-2399
• /
• 2014

Due to the low conversion rate of social commerce, its sustainability is questioned. To solve this problem, this study aims to verify the different antecedents between visit intention and purchase intention. For a visit intention, this study employs the concept of the scarcity heuristic and its momentary characteristic. The scarcity heuristic is created by a scarcity of time and quantity, and provisional coupons. In previous studies, the scarcity heuristic has often been treated as a major factor in which to influence purchase intention. However, this study examines the scarcity heuristic only as an antecedent of the visit intention, not of the purchase intention, because of its momentary characteristic. Contrary to previous studies, as this study expected, the attributes of the scarcity heuristic had a significant relationship only with the visit intention in social commerce. Additionally, the results suggest that there are two distinct intentions in social commerce: visit intention and purchase intention. This study verified that the antecedents of the two distinct intentions are different from one another. This study helps to understand why people visit social commerce sites regularly but do not buy.

• Management Science and Financial Engineering
• /
• 제12권1호
• /
• pp.127-142
• /
• 2006

In this paper, we present a frequency reassignment problem (FRP) that arises when we add new base stations to resolve hot-spots or to expand the coverage of a code division multiple access (CDMA) network. For this problem, we develop an integer programming (IP) model along with some valid inequalities and preprocessing rules. Also, we develop an effective heuristic procedure that solves two sub-problems induced from the original problem in repetition. Computational results show that the proposed heuristic procedure finds a feasible solution of good quality within reasonable computation time. Also, the lower bound by-produced from the heuristic procedure is quite strong.