Internet Shopping Optimization Problem With Delivery Constraints

• 영문명: Internet Shopping Optimization Problem With Delivery Constraints
• 발행기관: 한국유통과학회
• 저자명: Ji-Bok Chung
• 간행물 정보: 『유통과학연구(JDS)』제15권 제2호, 15~20쪽, 전체 6쪽
• 주제분류: 경제경영 > 경제학
• 파일형태: PDF
• 발행일자: 2017.02.28

영문 초록

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.

목차

1. Introduction

2. Description of Problem

3. Mathematical Formulations

4. Solution Approach to Get a Pareto Optimal Set

5. Discussion and Conclusion

키워드

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