دانلود مقاله ISI انگلیسی شماره 22260
عنوان فارسی مقاله

خوشه بندی فروشگاه ها با استفاده از روش داده کاوی برای پخش قطعات یدکی خودرو برای کاهش هزینه های حمل و نقل

کد مقاله سال انتشار مقاله انگلیسی ترجمه فارسی تعداد کلمات
22260 2012 9 صفحه PDF سفارش دهید 7010 کلمه
خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.
عنوان انگلیسی
Stores clustering using a data mining approach for distributing automotive spare-parts to reduce transportation costs
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : Expert Systems with Applications, Volume 39, Issue 5, April 2012, Pages 4740–4748

کلمات کلیدی
خوشه بندی فروشگاه - شبکه توزیع - حمل و نقل هزینه ها - داده کاوی - تابع شباهت
پیش نمایش مقاله
پیش نمایش مقاله خوشه بندی فروشگاه ها با استفاده از روش داده کاوی برای پخش قطعات یدکی خودرو برای کاهش هزینه های حمل و نقل

چکیده انگلیسی

Clustering of retail stores in a distribution network with specific geographical limits plays an important and effective role in distribution and transportation costs reduction. In this paper, the relevant data and information for an established automotive spare-parts distribution and after-sales services company (ISACO) for a 3-year period have been analyzed. With respect to the diversity and lot size of the available information such as stores location, order, goods, transportation vehicles and road and traffic information, three effecting factors with specific weights have been defined for the similarity function: 1. Euclidean distance, 2. Lot size 3. Order concurrency. Based on these three factors, the similarity function has been examined through 5 steps using the Association Rules principles, where the clustering of the stores is performed using k-means algorithm and similar stores are allocated to the clusters. These steps include: 1. Similarity function based on the Euclidean distances, 2. Similarity function based on the order concurrency, 3. Similarity function based on the combination of the order concurrency and lot size, 4. Similarity function based on the combination of these three factors and 5. Improved similarity function. The above mentioned clustering operation for each 5 cases addressed in data mining have been carried out using R software and the improved combinational function has been chosen as the optimal clustering function. Then, trend of each retail store have been analyzed using the improved combinational function and along with determining the priority of the depot center establishment for every cluster, the appropriate distribution policies have been formulated for every cluster. The obtained results of this study indicate a significant cost reduction (32%) in automotive spare-parts distribution and transportation costs.

مقدمه انگلیسی

Customer clustering is one of the most prime and principal subjects in the Customer Relationship Management context. Actually, clustering is the process of breaking a great number of customers into several parts in a way that the stores that have been clustered in similar groups possess the same behavior. Clustering gives a holistic and high-level view of all customers databases and provides the business owners with the required authority to formulate different policies for each segment of customers. Ideally, every organization must get to know its customers but since this is not practically possible therefore, clustering makes it possible to categorize the similar customers in one segment. Similarity function differs for various industry and business types. In this case, managing and recognition of these segments is much easier than the case of the individual customers. Clustering is applied in several ways. In some cases, considering the projected share of profit, potential profit and definition of customer profitability a LTV model has been proposed and based on the present value, the potential value and level of customer loyalty have been segmented. Hyunseok, Taesoo, and Euiho (2004) in 2006 determined the individual value of customers considering the importance of store recognition for long-term relations, loyalty acquisition and more profitability for customer and then segmented the values according to the customer values and formulated the appropriate strategies for each segment (Kim, Jung, Suh, & Hwang, 2006). Tsai and Chiu (2004) developed and extended a new market segmentation methodology based on the specific variables such as purchased items and the related income considering the previous transactions and then performed the market segmentation. In some studies in the field of market segmentation methods such as k-means clustering model, FUZZY SOM and k-means have been used for the customer segmentation ( Shina & Sohnb, 2004). Also, in some other researches, customers have been homogenously segmented based on novelty, repetition and monetary value criteria and then the optimal marketing policies have been formulated (Jonkera, Piersmab, & Van den Poelc, 2004). As mentioned earlier, customer segmentation is performed in several ways. At this company, level of the similarity of the customer behavior according to the data types and the available customer-related information depends on their location, customer cluster, customer city and the ordering size and time. Accordingly, in this paper, city, Euclidean distance, ordering time and order size have been used to derive the similarity function. First, two criteria of “customer city” and “order size” have been taken for customer clustering using the k-means algorithm. Then the Euclidean distance function has been used separately in the k-means algorithm for customer clustering. In order to improve the similarity function, the City, Euclidean distance, the required group of products, ordering time and order size have been combined and applied along with k-means algorithm for the customer clustering. When the best cluster is determined based on the clustering density criteria then, the optimum number of the clusters is determined based on the clustering quality assessment criteria. Grouping a great number of customers with different characteristics using different customer clustering algorithms have been conducted by numerous researchers. These methods consider two major objectives of maximizing the intra-cluster similarity and maximizing the inter-cluster differences (Ajith, 2004, Jin et al., 2004a, Jin et al., 2004b, Menczer et al., 2002 and Rich, 1999). The customer clustering problem with the aim of minimizing the distribution costs have been studied by a great number of researchers though various methods (Gordeau et al., 2002, Laporte et al., 2000 and Salhi and Nagy, 1999). Dondo and Gerda address the customer clustering and allocation to sales centers in their paper. They took into account the single depot and multi-depot problem. Distance between customers and distribution centers were considered as the clustering criterion (Dondo & Gerda, 2002). Crainic et al. developed a two-step algorithm for inter-city product distribution with time windows. The first step involves the city and then customer clustering i.e. first, the products are distributed among cities and then among customers. The second step involves the routing problem within each city using the meta-heuristic methods (Feliu, Perboli, Tadei, & Vigo, 2007). Feliu et al. developed a two-step algorithm for routing and spare parts distribution problem. In the first step, the customer clustering and distribution center determination is performed. In the second step, distribution channels are determined (Crainic, Ricciardi, & Storchi, 2007).

نتیجه گیری انگلیسی

Most organizations have focused on issues such as store recognition, loyalty and profitability in order to increase their market share and gaining the store satisfaction due to the increasing importance of the store satisfaction in today’s business environment. Store relationship management is considered as a major competitive advantage for most of the organizations. One of the approaches for store recognition is the clustering of the stores to homogenous groups and taking the appropriate and suitable marketing policies for each segment. In this paper, a store similarity function (OC) has been developed based on the association rules concepts and it’s been applied as the distance measurement function in k-means clustering algorithm which has shown considerable improvement in comparison with the traditional Euclidean distance function. The results of the clustering method have been compared against the density assessment function and the optimal number of the clusters has been determined using the quality assurance function. After the clustering, values for each cluster have been determined using the DOCLS model and the appropriate policies have been developed for each segment. For the future researches it’s suggested to apply the descriptive and demographic data of the stores/regions for the definition and improvement of the DOCLS function. Additionally, the future works may be focused on a certain group of goods and the corresponding results may be analyzed.

خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.