바로가기메뉴

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

logo

Internet Shopping Optimization Problem With Delivery Constraints

The Journal of Distribution Science / The Journal of Distribution Science, (P)1738-3110; (E)2093-7717
2017, v.15 no.2, pp.15-20
https://doi.org/https://doi.org/10.15722/jds.15.2.201702.15
Chung, Ji-Bok
  • Downloaded
  • Viewed

Abstract

Purpose - This paper aims to suggest a delivery constrained internet shopping optimization problem (DISOP) which must be solved for online recommendation system to provide a customized service considering cost and delivery conditions at the same time. Research design, data, and methodology - To solve a (DISOP), we propose a multi-objective formulation and a solution approach. By using a commercial optimization software (LINDO), a (DISOP) can be solved iteratively and a pareto optimal set can be calculated for real-sized problem. Results - We propose a new research problem which is different with internet shopping optimization problem since our problem considers not only the purchasing cost but also delivery conditions at the same time. Furthermore, we suggest a multi-objective mathematical formulation for our research problem and provide a solution approach to get a pareto optimal set by using numerical example. Conclusions - This paper proposes a multi-objective optimization problem to solve internet shopping optimization problem with delivery constraint and a solution approach to get a pareto optimal set. The results of research will contribute to develop a customized comparison and recommendation system to help more easy and smart online shopping service.

keywords
Internet Shopping Optimization Problem, Multi-objective Optimization, Pareto Optimal Set, Online Shopping Recommendation

Reference

1.

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.

2.

Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. New York: John Wiley &Sons.

3.

Kim, K. J., & Ahn, H. C. (2008). A Recommender System Using GA K-means Clustering in an Online Shopping Market. Expert Systems with Applications, 34(2), 1200-1209.

4.

Lee, K. K., Ahn, S. H., Kim, H. D., & Youn, M. K. (2014). Effects of the Flow of an Internet Shopping Mall upon Revisit Intention and Purchase Intention. The East Asian Journal of Business Management, 4(4), 27-38.

5.

Lee, K. K., Jang, S. N., & Kim, P. J. (2012). Research on Purchase Decision Factors to TV Home Shopping Product: Digital Home Appliance. The East Asian Journal of Business Management, 2(2), 13-21.

6.

Lee, S. C., Kim, S. W., & Park, S. J. (2013). A Recommendation Method Based on Analysis of Item Groups in Price-Comparison Services. KIISE Transactions on Computing Practices, 19(11), 541-546.

7.

Li, F. (2016). Inventory-Transportation Optimization in Online Shopping Supply Chain Based on Retailer's Decision-Making Power on Pricing. International Journal of Simulation - Systems, Science &Technology, 17(14), 1-6.

8.

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.

9.

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

10.

Ulukan, Z., & Demircioglu, E. (2015). A Survey of Discrete Facility Location Problems. International Journal of Social, Behavioral, Educational, Economic, Business and Industrial Engineering, 9(7), 2487-2492.

11.

Wojciechowski, A., & Musial, J. (2009). A Customer Assistance System: Optimizing Basket Cost. Foundations of Computing and Decision Sciences, 34(1), 59–69.

The Journal of Distribution Science