바로가기메뉴

본문 바로가기 주메뉴 바로가기

ACOMS+ 및 학술지 리포지터리 설명회

  • 한국과학기술정보연구원(KISTI) 서울분원 대회의실(별관 3층)
  • 2024년 07월 03일(수) 13:30
사전등록 바로가기
 

logo

  • P-ISSN1738-3110
  • E-ISSN2093-7717
  • SCOPUS, ESCI

ISSN : 1738-3110

논문 상세

이전 다음
선공개 논문 논문 투고

Vol.15 No.7

Citation Share

Complexity and Algorithms for Optimal Bundle Search Problem with Pairwise Discount

Complexity and Algorithms for Optimal Bundle Search Problem with Pairwise Discount

The Journal of Distribution Science(JDS) / The Journal of Distribution Science, (P)1738-3110; (E)2093-7717
2017, v.15 no.7, pp.35-41
https://doi.org/https://doi.org/10.15722/jds.15.7.201707.35
Chung, Jibok (Department of Retail Management, Kongju National University)
Choi, Byungcheon (School of Business, Chungnam National University)
Chung, Jibok, & Choi, Byungcheon. (2017). Complexity and Algorithms for Optimal Bundle Search Problem with Pairwise Discount. The Journal of Distribution Science(JDS), 15(7), 35-41, https://doi.org/https://doi.org/10.15722/jds.15.7.201707.35

Abstract

Purpose - A product bundling is a marketing approach where multiple products or components are packaged together into one bundle solution. This paper aims to introduce an optimal bundle search problem (hereinafter called "OBSP") which may be embedded with online recommendation system to provide an optimized service considering pairwise discount and delivery cost. Research design, data, and methodology - Online retailers have their own discount policy and it is time consuming for online shoppers to find an optimal bundle. Unlike an online system recommending one item for each search, the OBSP considers multiple items for each search. We propose a mathematical formulation with numerical example for the OBSP and analyzed the complexity of the problem. Results - We provide two results from the complexity analysis. In general case, the OBSP belongs to strongly NP-Hard which means the difficulty of the problem while the special case of OBSP can be solved within polynomial time by transforming the OBSP into the minimum weighted perfect matching problem. Conclusions - In this paper, we propose the OBSP to provide a customized service considering bundling price and delivery cost. The results of research will be embedded with an online recommendation system to help customers for easy and smart online shopping.

keywords
Internet Shopping Optimization Problem, Bundle Search Problem, Perfect Matching Problem, Online Shopping Recommendation.

참고문헌

1.

Beladev, M., Rokach, L., & Shapira, B. (2016). Recommender Systems for Product Bundling. Knowledge Based Systems, 111, 193-206.

2.

Blazewicz, J., Kovalyov, M., Musial, J., Urbanski, A., & Wojciechowski, A. (2010). Internet Shopping Optimization Problem. International Journal of Applied Mathematics and Computer Science, 20(2), 385–390.

3.

Ernst, R., & Kouvelis, P. (1999). The Effects of Selling Packaged Goods on Inventory Decisions. Management Science, 45(8), 1142-1155.

4.

Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Sanfrancisco: Freeman & Co.

5.

Garfinkel, R., Gopal, R., Tripathi, A., & Yin, F. (2006). Design of a Shopbot and Recommender System for Bundle Purchases. Decision Support Systems, 42(3), 1974-1986.

6.

He, L., & Ioerger, T. R. (2004). Combining Bundle Search with Buyer Coalition Formation in Electronic Markets. International Joint Conference on Autonomous Agents and Multiagent Systems, 1438–1439.

7.

Jedidi, K., Jagpal, S., & Manchanda, P. (2003). Measuring Heterogeneous Reservation Prices for Product Bundles. Marketing Science, 22(1), 107-130.

8.

Jeong, D. Y. (2003). An Object-Oriented Case-Base Design and Similarity Measures for Bundle Products Recommendation Systems. Journal of intelligent information systems, 9(1), 23-51.

9.

Jiang, Y., Shang, J., Kemerer, C. F., & Liu, Y. (2011). Optimizing E-tailer Profits and Customer Savings:Pricing Multistage Customized Online Bundles. Marketing Science, 30(4), 737–752.

10.

Kim, E. H. (2016). Differences in Perceived Financial Risk according to Price Discounts and Product Types of Consumers in Korea and Thailand. International Journal of Industrial Distribution & Business, 7(2), 25-32.

11.

Kim, Y. M., Kireyeva, A. A., & Youn, M. K. (2014). Effects of SNS Characteristics upon Consumers’Awareness, Purchase Intention, and Recommendation. International Journal of Industrial Distribution & Business, 5(1), 27-37.

12.

McCardle, K. F., Rajaram, K., & Tang, C. S. (2007). Bundling Retail products: Models and analysis. European Journal of Operational Research, 177, 1197–1217.

13.

MohanKumar, R., & Saravanan, D. (2013). Design of Quality-based Recommender System for Bundle Purchases. Data Mining and Knowledge Engineering, 1-8.

14.

Pathak, B. K. (2012). Comparison Shopping Agents and Online Price Dispersion: A Search Cost Based Explanation. Journal of Theoretical and Applied Electronic Commerce Research, 7(1), 64-76.

15.

Pu, P., Chen, L., & Hu, R. (2012). Evaluating Recommender Systems from the User’s Perspective: Survey of the State of the Art. User Modeling and User-Adapted Interaction, 22(4), 317–355.

16.

Singh, D. P. (2014). Online Shopping Motivations, Information Search, and Shopping Intentions in an Emerging Economy. East Asian Journal of Business Management, 4(3), 5-12.

17.

Stigler, G. (1963). A Note on Block Booking. U.S. Supreme Court Review, 1963, 152-175.

18.

Stremersch, S., & Tellis, G. J. (2002). Strategic Bundling of Products and Prices: A New Synthesis for Marketing. Journal of Marketing, 66(1), 55–72.

19.

Yang, T. C., & Lai, H. (2006). Comparison of Product Bundling Strategies on Different Online Shopping Behaviors. Electronic Commerce Research and Applications, 5, 295–304.

The Journal of Distribution Science(JDS)

선공개 논문 논문 투고 OA 정책