• 한국데이타베이스학회:학술대회논문집
• /
• 한국데이타베이스학회 2001년도 추계 컨퍼런스: 인터넷 비즈니스 환경에서의 디지털 컨텐츠 기술 발전 및 활용을 위한 컨퍼런스
• /
• pp.150-195
• /
• 2001

Only 4% of all customers with problems complain average customer with a problem will: - Tell 7-10 people - Those people will tell another 5-7 - Those people will tell another 3-5 (omitted)

• 산업공학
• /
• 제16권3호
• /
• pp.280-290
• /
• 2003

Many firms are trying to optimize their production and distribution functions separately, but possible savings by this approach may be limited. Nowadays, it is more important to analyze these two functions simultaneously by trading off the costs associated with the whole. In this paper, I treat a production and distribution planning problem for single-period inventory products comprised of a single production facility and multiple customers, with the aim of optimally coordinating important and interrelated decisions of production sequencing and vehicle routing. Then, I propose a hybrid genetic algorithm incorporating several local optimization techniques, HGAP, for integrated production-distribution planning. Computational results on test problems show that HGAP is effective and generates substantial cost savings over Hurter and Buer's decoupled planning approach in which vehicle routing is first developed and a production sequence is consequently derived. Especially, HGAP performs better on the problems where customers are dispersed with multi-item demand than on the problems where customers are divided into several zones based on single-item demand.

• 한국의류학회지
• /
• 제34권7호
• /
• pp.1220-1231
• /
• 2010

This study examined customer misbehaviors in retail settings by identifying behavioral patterns and exploring behavioral backgrounds and consequences from the employee's perspectives. Qualitative data were collected from an individual interview method, and 222 interviews were analyzed. Customer misbehavior was categorized into unethical returns, problem behaviors in service encounters, unreasonable demands, shoplifting/fraud, ill-mannered behaviors, and selfish behaviors. Behavioral backgrounds included dissatisfaction, unreasonable expectations, actively benefiting of service failures, taking advantage of service standards, illegitimate complaints, monetary gains, transferring responsibility, and demanding special treatment. Employees experienced stress facing misbehaving customers with no other choice except to accept misbehaviors and learned misbehaviors as customers themselves. The study further discusses the implications.

• 한국의류학회지
• /
• 제34권7호
• /
• pp.1126-1137
• /
• 2010

Customer misbehavior is a behavior that disrupts generally accepted behavioral norms in consumption situations. This study examined customer misbehavior in retail settings by identifying behavioral patterns and exploring behavioral backgrounds and consequences from a customer viewpoint. Qualitative data were collected from individual in-depth interviews, and 149 interviews were analyzed. Customer misbehavior was categorized into unethical returns, problem behaviors in service encounters, shoplifting/fraud, ill-mannered behaviors, and selfish behaviors. Motivations included monetary gain, adventurism, perceived acceptability of misbehavior, planned unfair complaints, and retaliation. Customers showed a negative image to unkind employees and stores yielding to misbehaviors that were learned and socialized among customers. The study further discusses implications.

• 대한산업공학회지
• /
• 제33권3호
• /
• pp.322-328
• /
• 2007

Highly standardized products are suitable for automated purchasing using electronic commerce technology, where the price becomes the most important factor. Suppliers can change the prices dynamically based on the inventory level and market situation in order to maximize the sales and profit. In the virtual marketplace where multiple customers purchase multiple standardized products from multiple suppliers repetitively, customers can purchase the required amount of each item as a dynamic bidding by allocating purchase orders to the suppliers based on the current price. Customers need a method to quickly determine the optimal allocation of orders to the suppliers using the dynamically changing data to minimize the total cost. We present a LP model which minimizes the sum of the total price plus transportation cost for this problem. Simulation results using random data show meaningful reduction of the total cost.

• 디지털산업정보학회논문지
• /
• 제15권3호
• /
• pp.197-206
• /
• 2019

Telemarketing has been used in finance due to the reduction of offline channels. In order to select telemarketing target customers, various machine learning techniques have emerged to maximize the effect of minimum cost. However, there are problems that the class imbalance, which the number of marketing success customers is smaller than the number of failed customers, and the recall rate is lower than accuracy. In this paper, we propose a method that solve the imbalanced class problem and increase the recall rate to improve the efficiency. The hybrid sampling method is applied to balance the data in the class, and the stacked deep network is applied to improve the recall and precision as well as the accuracy. The proposed method is applied to actual bank telemarketing data. As a result of the comparison experiment, the accuracy, the recall, and the precision is improved higher than that of the conventional methods.

• Asia pacific journal of information systems
• /
• 제27권2호
• /
• pp.126-138
• /
• 2017

The proliferation of items increased the difficulty of customers in finding the specific items they want to purchase. To solve this problem, companies adopted recommender systems, such as collaborative filtering systems, to provide personalization services. However, companies use only meaningful and essential data given the explosive growth of data. Some customers are concerned that their private information may be exposed because CF systems necessarily deal with personal information. Based on these concerns, we analyze the effects of the amount of information on recommendation performance. We assume that a customer could choose to provide overall information or partial information. Experimental results indicate that customers who provided overall information generally demonstrated high performance, but differences exist according to the characteristics of products. Our study can provide companies with insights concerning the efficient utilization of data.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.904-913
• /
• 2005

This paper deals with an integrated problem of inventory control and dynamic pricing strategies for a commodity with price and sales-period dependent demand pattern, where a seller and customers have complete information of each other. The problem consists of two parts; one is each buyer's benefit problem which makes the best decision on price and time for buyer to purchase items, and the other one is a seller's profit problem which decides an optimal sales strategy concerned with inventory control and discount schedule. The seller's profit function consists of sales revenue and inventory holding cost functions. The two parts are closely related into each other with some related variables, so that any existing general solution methods can not be applied. Therefore, a simplified model with single seller and two customers in considered first, where demand for multiple units is allowed to each customer within a time limit. Therewith, the model is generalized for a n-customer-classes problem. To solve the proposed n-customer-set problem, a dynamic programming algorithm is derived. In the proposed dynamic programming algorithm, an intermediate profit function is used, which is computed in case of a fixed initial inventory level and then adjusted in searching for an optimal inventory level. This leads to an optimal sales strategy for a seller, which can derive an optimal decision on both an initial inventory level and a discount schedule, in $O(n^2)$ time. This result can be used for some extended problems with a small customer set and a short selling period, including sales strategy for department stores, Dutch auction for items with heavy holding cost, open tender of materials, quantity-limited sales, and cooperative buying in the on/off markets.

• 지능정보연구
• /
• 제21권1호
• /
• pp.29-45
• /
• 2015

고객반응 예측모형은 마케팅 프로모션을 제공할 목표고객을 효과적으로 선정할 수 있도록 하여 프로모션의 효과를 극대화 할 수 있도록 해준다. 오늘날과 같은 빅데이터 환경에서는 데이터 마이닝 기법을 적용하여 고객반응 예측모형을 구축하고 있으며 본 연구에서는 사례기반추론 기반의 고객반응 예측모형을 제시하였다. 일반적으로 사례기반추론 기반의 예측모형은 타 인공지능기법에 비해 성과가 낮다고 알려져 있으나 입력변수의 중요도에 따라 가중치를 상이하게 적용함으로써 예측성과를 향상시킬 수 있다. 본 연구에서는 프로모션에 대한 고객의 반응여부에 영향을 미치는 중요도에 따라 입력변수의 가중치를 산출하여 적용하였으며 동일한 가중치를 적용한 예측모형과의 성과를 비교하였다. 목욕세제 판매데이터를 사용하여 고객반응 예측모형을 개발하고 로짓모형의 계수를 적용하여 입력변수의 중요도에 따라 가중치를 산출하였다. 실증분석 결과 각 변수의 중요도에 기반하여 가중치를 적용한 예측모형이 동일한 가중치를 적용한 예측모형보다 높은 예측성과를 보여주었다. 또한 고객 반응예측 모형과 같이 실생활의 분류문제에서는 두 범주에 속하는 데이터의 수가 현격한 차이를 보이는 불균형 데이터가 대부분이다. 이러한 데이터의 불균형 문제는 기계학습 알고리즘의 성능을 저하시키는 요인으로 작용하며 본 연구에서 제안한 Weighted CBR이 불균형 환경에서도 안정적으로 적용할 수 있는지 검증하였다. 전체데이터에서 100개의 데이터를 무작위로 추출한 불균형 환경에서 100번 반복하여 예측성과를 비교해 본 결과 본 연구에서 제안한 Weighted CBR은 불균형 환경에서도 일관된 우수한 성과를 보여주었다.

• 한국항해항만학회지
• /
• 제44권5호
• /
• pp.391-399
• /
• 2020

Every port is competing for attracting loyal customers from other ports to achieve more profits stably. This paper proposes a data-mining scheme to facilitate this process. For resolving the problem, the OD (Origination-Destination) data are gathered from the AIS (Automatic Identification System) data. The OD data are clustered according to the arrival dates and ports. The FP-growth algorithm is applied to mine the frequent patterns of ships arriving at ports. Maintaining a loyal customer list for port updates and accuracy is critical in establishing its usefulness. These lists are critical as they can be used to provide suggestions for new products and services to loyal customers. Finally, based on the frequent patterns of the ships and the mode of arrival times, a formula proposed in this paper to derive shipping companies' loyalty to ports was applied. The case of Kaohsiung port was shown as an example of our algorithm, and the OD data of ships in 2017-2018 were processed. Using the results of our algorithm, other rival ports, such as Shanghai or Busan, may attract customers no longer loyal to Kaohsiung ports in the last two years and attract them as new loyal customers.