• 제목/요약/키워드: Internet Shopping Optimization Problem

검색결과 6건 처리시간 0.022초

Internet Shopping Optimization Problem With Delivery Constraints

  • Chung, Ji-Bok
    • 유통과학연구
    • /
    • 제15권2호
    • /
    • pp.15-20
    • /
    • 2017
  • 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.

의미망 제약식언어를 기반으로 한 인터넷 쇼핑 의사결정 틀 (A Framework of Internet Shopping Decision Making Based on Semantic Web Constraint Language)

  • 이명진;김학진;김우주
    • 한국경영과학회지
    • /
    • 제33권3호
    • /
    • pp.29-42
    • /
    • 2008
  • Semantic Web society initially focused only on data but has gradually moved toward knowledge. Recently rule beyond ontology has emerged as a key element of the Semantic Web. All of these activities are obviously aiming at making data and knowledge on the Web sharable and reusable between various entities around the world. If one of ultimate visions of the Semantic Web is to increase human's decision making quality assisted by machines, there is a missing but important part to be shared and reused. It is knowledge about constraints on data and concepts represented by ontology which should be emphasized more. In this paper, we propose Semantic Web Constraint Language (SWCL) based on OWL and show how effective SWCL can be in representing and solving an internet shopper's decision making problem by an implementation of a shopping agent in the Semantic Web environment.

Complexity and Algorithms for Optimal Bundle Search Problem with Pairwise Discount

  • Chung, Jibok;Choi, Byungcheon
    • 유통과학연구
    • /
    • 제15권7호
    • /
    • pp.35-41
    • /
    • 2017
  • 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.

의류 인터넷 쇼핑몰에서 브랜드를 고려한 상품 입고 및 재배치 방법 연구 (An Efficient Heuristic for Storage Location Assignment and Reallocation for Products of Different Brands at Internet Shopping Malls for Clothing)

  • 송용욱;안병혁
    • 지능정보연구
    • /
    • 제16권2호
    • /
    • pp.129-141
    • /
    • 2010
  • 의류 인터넷 쇼핑몰들은 판매 상품의 포장과 배송을 위한 상품 창고를 운영하고 있다. 상품들은 동일 브랜드끼리 상자에 담긴 후 선반에 일렬로 보관된다. 상품의 반출 및 상품 관리의 편의상, 상자들은 동일 브랜드끼리 묶여져 선반에 진열되어 있어야 한다. 따라서, 새로운 상품들이 입고될 경우 상품들은 동일 브랜드끼리 상자에 담긴 후 선반 위에 있는 기존 상자들 중에서 동일 브랜드의 상자 옆에 배치되어야 한다. 그런데, 선반 위의 빈 곳이 새로 입고되는 상자를 넣을 수 있을 만큼 충분하지 않다면, 옆의 다른 브랜드의 상자들을 옆으로 밀어서 공간을 확보한 후 새로운 상자를 배치함으로써 동일 브랜드 상자끼리 붙어있도록 해야 한다. 우리의 문제는 이와 같이 새로운 상품을 입고할 때 동일 브랜드의 상자들끼리 붙어 있도록 하면서 다른 브랜드의 상자를 옆으로 옮길 경우, 그 횟수를 최소화하는 것이다. 이 문제의 최적해를 구하기 위해서 우리는 이 문제를 우선 정수계획법으로 모형화하였다. 그런데, 정수계획법 문제는 분기한정법(Branch and Bound) 기법으로 해결하여야 하나, 그 경우 문제해결 시간이 너무 오래 걸리는 문제가 발생한다. 따라서, 본 연구에서는 위 재배치 문제를 할당 문제(Assignment Problem)로 완화하여 모형화함으로써 만족할만한 준최적해를 구하는 방법론을 제시하고, 실험에 의하여 그 타당성을 검토하였다. 또한, 이 방법론 하에서 실제 의류 인터넷 쇼핑몰의 컴퓨팅 환경을 고려할 때 해결 가능한 문제의 최대 크기를 도출하고, 그 크기 이내에서 입고 계획을 생성하는 시스템을 구현하였다.

시맨틱 웹 환경에서의 부분선형 제약지식표현을 위한 SWCL의 확장 (SWCL Extension for Knowledge Representation of Piecewise linear Constraints on the Semantic Web)

  • 이명진;김우주;김학진
    • 한국경영과학회지
    • /
    • 제37권4호
    • /
    • pp.19-35
    • /
    • 2012
  • The Semantic Web technology, purporting to share, to reuse and to process by machines data stored in the Web environment, incessantly evolves to help human decision making; in particular, decision making based on data, or quantitative decision making. This trend drives researchers to fill the gap with strenuous efforts between the current state of the technology and the terminus of this evolution. The Semantic Web Constraint Language (SWCL) together with SWRL is one of these endeavors to achieve the goal. This paper focuses particularly on how to express the piecewise linear form in the context of SWCL. The importance of this ingredient can be fortified by the fact that any nonlinear expression can be approximated in the piecewise linear form. This paper will also provide the information of how it will work in the decision making process through an example of the Internet shopping mall problem.

IEEE 802.11 ax optimization design study in XR (eXtended Reality) training room

  • Chae, Yeon Keun;Chae, Myungsin
    • International Journal of Advanced Culture Technology
    • /
    • 제10권1호
    • /
    • pp.253-264
    • /
    • 2022
  • In the era of the pandemic, the importance of a wireless LAN environment has become increasingly important, especially as the era of smart working and non-face-to-face education has become a universal and daily routine. Smartphones, tablets, laptops, PCs, smart watches, and wearable devices, collective referred to as wireless terminals, can be accessed anytime and anywhere through the internet, allowing for consistent and constant access to offices, factories, warehouses, shopping malls, railways, hotels, hospitals, schools, logistics centers, airports, exhibition halls, etc. This sort of access is currently being used in roads, parks, traditional markets, and ports. Since the release of the IEEE 802.11 Legacy Standard in 1997, Wi-Fi technology has been continuously supplemented and revised, and the standard has been continuously developed. In the era of smart working, the importance of efficient wireless deployment and scientific design has become more important. The importance of wireless in the smart factory, in the metaverse era, in the era of pursuing work and life that transcend time and space by using AR, VR, MR, and XR, it is more urgent to solve the shadow area of Wi-Fi. Through this study, we intend to verify the wireless failure problem of the xr training center and suggest improvement measures.