• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
• /
• pp.36-45
• /
• 1993

This paper presents a model and a heuristic procedure to design production planning and transportation scheduling systems of critical items, components and products on the basis of material requirement planning concept and transportation planning model. These systems are stemmed from a multi-site multi-product production company in a international economic zone. An example is provided to validate the heuristic procedure developed.

• Management Science and Financial Engineering
• /
• 제3권1호
• /
• pp.75-88
• /
• 1997

Tabu search (TS) has been successfully applied for solving many complex combinatorial optimization problems in the areas of operations research and production control. However, TS is for single-objective problems in its present form. In this article, a TS-based heuristic is developed to determine Pareto-efficient solutions to a multi-objective combinatorial optimization problem. The developed algorithm is then applied to the discrete optimal design problem in statistics to demonstrate its usefulness.

• 한국경영과학회지
• /
• 제18권1호
• /
• pp.29-43
• /
• 1993

This paper condisers a problem of determining arc capacities for a communication network with fixed-charged linear arc-cost functions, which is known to be NP-hard. For the problem, an efficient heuristic solution procedure is derived. The procedure is further shown working well for designing arc capacities of a network in a situation where the network needs to be extended by connecting its nodes to some new nodes or where the network needs to be extended by expanding its arc capacities.

• 산업경영시스템학회지
• /
• 제24권67호
• /
• pp.19-26
• /
• 2001

A design issue for a flexible manufacturing system is to find the number of each resource type which assures a given production ratio with a minimal cost. The FMS is modeled as a closed queueing network with a local buffer of limited capacity. An efficient method to determine this optical configuration is presented. The proposed method consists of three steps : 1) determine a lower configuration, 2) derive a heuristic solution, 3) find the optimal solution. The derived heuristic solutions are close to the optical solution.

• 한국정밀공학회지
• /
• 제12권6호
• /
• pp.27-36
• /
• 1995

This paper covers algorithms to determine a machine assignment strategy to locations on a single straight track by minimizing the total backtrack distance. Three different algorithms ar presented: an efficient heuristic procedure, the branch-and-bound algorithm, and the nerual network approach. Simulation results show that the proposed algorithms have potential power to design an on-line optimizer.

• 유통과학연구
• /
• 제17권10호
• /
• pp.73-81
• /
• 2019

Purpose - The purpose of this study was to examine the effect of the heuristic type of consumers affecting purchase decision making and the intention of shopping value in their relationship to derive mobile social commerce purchase promotion plans. Research design, data, and methodology - A research model was constructed to relate the mediating effect of shopping value between heuristic types and purchase intentions. A total of 233 valid questionnaires were used for analysis for users using mobile social commerce. The statistical program used SPSS 24.0 and AMOS 24.0, and correlation analysis, regression analysis, and 3-step parametric regression analysis were used for the analysis. Results - The results of the analysis showed that representativeness heuristics, availability heuristics, adjustment heuristics, and affect heuristics had a statistically significant effect on the utilitarian value and the hedonic value. On the other hand, affect heuristics among the heuristic types were found to have the greatest influence not only on the utilitarian value but also on the hedonic value. The two types of shopping value were found to be partially mediated between representativeness heuristics and purchase intentions, between adjustment heuristics and purchase intentions, and fully mediated between availability heuristics and purchase intentions, affect heuristics and purchase intentions. Conclusions - These findings suggest that mobile social commerce companies should check in advance how consumer heuristic types affect purchase intentions. In particular, affect heuristics are caused by consumers' emotional mood such as mood or external stimulus being more important to decision making than rational decision making. Therefore, the result of this study suggests that it can be an important factor to secure the competitiveness that the potential customers who access to use mobile social commerce can feel enough fun and enjoyment in the platform provided by the company. It is also worth paying attention to the utilitarian and hedonic values perceived by consumers. This is because the judgment regarding the economic, convenience and important information provided by the mobile social commerce users affects the purchase intention through the trust of the information, past use, and shopping experience displayed on the mobile social commerce platform.

• 한국의류산업학회지
• /
• 제18권2호
• /
• pp.225-234
• /
• 2016

An online suit-customizing system for the special accessibility needs of wheelchair users should be developed because the demand for business suits by wheelchair users involved in economic activities has increased. This study develops a user interface an online customizing system for men's suits specialized for wheelchair users. This study used a five-step approach: (1) search for online men's suits customizing system in web porter sites, (2) select three sites based on three terms, (3) heuristic testing with five web specialists, (4) development of a system user interface based on suggestions for improvement from the heuristic test, (5) usability testing of the user interface prototype by 10 disabled men in wheelchairs. The interface of Company S had high ratings on interactivity, accessibility, informativeness, and consistency in the heuristic test results; subsequently, a user interface was developed based on suggestions for improvement from the heuristic test. This online user interface for customizing men's suits provides better usability to wheelchair users than existing online interfaces aimed at the non-disabled and disabled; consequently, this study contributes to the commercialization of an online customizing system for men's suits specializing in serving wheelchair users.

• 대한산업공학회지
• /
• 제31권4호
• /
• pp.303-315
• /
• 2005

In this paper we address a design problem for hub-and-spoke networks and then consider a capacitated hub locations problem with direct shipment (CHLPwD). We determine the location of hubs, the allocation of nodes to hubs, and direct shipment paths in the network, with the objective of minimizing the total cost in the network. In this paper, CHLPwD is formulated as 0-1 integer programming. We develop an evolutionary algorithm here to solve the large sized CHLPwD. To do this, we present the representation and the genetic operators suitable for the problem and propose a heuristic method for the allocation of nodes to hubs. To enhance the search capability, problem-specific information is used in our evolutionary algorithm. The proposed algorithm is compared with the heuristic method in terms of solution quality and computation time. The experimental results show that our algorithm can provide better solutions than the heuristic.

• 한국게임학회 논문지
• /
• 제19권6호
• /
• pp.83-90
• /
• 2019

휴리스틱 기반의 유전 알고리즘 경로 탐색(H-GAP)은 노드, 에지 정보를 필요로 하지 않기 때문에 기존 경로 탐색 알고리즘의 단점을 보완하고 빠른 속도로 경로 탐색을 수행할 수 있다. 하지만 H-GAP를 이용해 탐색한 경로는 비 노드 기반이기 때문에 불필요한 경로 정보가 포함되어 탐색된 경로가 최적의 경로가 아닐 때도 있다. 본 논문에서는 H-GAP를 이용해 탐색한 경로를 최적화하는 알고리즘을 제안한다. 제안하는 알고리즘은 H-GAP의 경로 탐색이 완료된 후 광선 추적 알고리즘을 이용해 불필요한 경로 정보를 제거하여 경로를 최적화한다.

• Advances in Computational Design
• /
• 제7권4호
• /
• pp.297-319
• /
• 2022

Due to their natural and social revelation, also their ease and flexibility, human collective behavior and teamwork sports are inspired to introduce optimization algorithms to solve various engineering and scientific problems. Nowadays, meta-heuristic algorithms are becoming some striking methods for solving complex real-world problems. In that respect in the present study, the authors propose a novel meta-innovative algorithm based on soccer teamwork sport, suitable for optimization problems. The method may be referred to as the Soccer League Optimization-based Championship Algorithm, inspired by the Soccer league. This method consists of two main steps, including: 1. Qualifying competitions and 2. Main competitions. To evaluate the robustness of the proposed method, six different benchmark mathematical functions, and two engineering design problem was performed for optimization to assess its efficiency in achieving optimal solutions to various problems. The results show that the proposed algorithm may well explore better performance than some well-known algorithms in various aspects such as consistency through runs and a fast and steep convergence in all problems towards the global optimal fitness value.