Online Advertising Assignment Problems Considering Realistic Constraints

학위논문 (박사) -- 서울대학교 대학원 : 공과대학 산업공학과, 2020. 8. 문일경.With a drastic increase in online communities, many companies have been paying attention to online advertising. The main advantages of online advertising are traceability, cost-effectiveness, reachability, and interactivity. The benefits facilitate the continuous popularity of online advertising. For Internet-based companies, a well-constructed online advertisement assignment increases their revenue. Hence, the managers need to develop their decision-making processes for assigning online advertisements on their website so that their revenue is maximized. In this dissertation, we consider online advertising assignment problems considering realistic constraints. There are three types of online advertising assignment problems: (i) Display ads problem in adversarial order, (ii) Display ads problem in probabilistic order, and (iii) Online banner advertisement scheduling for advertising effectiveness. Unlike previous assignment problems, the problems are pragmatic approaches that reflect realistic constraints and advertising effectiveness. Moreover, the algorithms the dissertation designs offer important insights into the online advertisement assignment problem. We give a brief explanation of the fundamental methodologies to solve the online advertising assignment problems in Chapter 1. At the end of this chapter, the contributions and outline of the dissertation are also presented. In Chapter 2, we propose the display ads problem in adversarial order. Deterministic algorithms with worst-case guarantees are designed, and the competitive ratios of them are presented. Upper bounds for the problem are also proved. We investigate the display ads problem in probabilistic order in Chapter 3. This chapter presents stochastic online algorithms with scenario-based stochastic programming and Benders decomposition for two probabilistic order models. In Chapter 4, an online banner advertisement scheduling model for advertising effectiveness is designed. We also present the solution methodologies used to obtain valid lower and upper bounds of the model efficiently. Chapter 5 offers conclusions and suggestion for future studies. The approaches to solving the problems are meaningful in both academic and industrial areas. We validate these approaches can solve the problems efficiently and effectively by conducting computational experiments. The models and solution methodologies are expected to be convenient and beneficial when managers at Internet-based companies place online advertisements on their websites.온라인 커뮤니티의 급격한 성장에 따라, 많은 회사들이 온라인 광고에 관심을 기울이고 있다. 온라인 광고의 장점으로는 추적 가능성, 비용 효과성, 도달 가능성, 상호작용성 등이 있다. 온라인에 기반을 두는 회사들은 잘 짜여진 온라인 광고 할당결정에 관심을 두고 있고, 이는 광고 수익과 연관될 수 있다. 따라서 온라인 광고 관리자는 수익을 극대화 할 수 있는 온라인 광고 할당 의사 결정 프로세스를 개발하여야 한다. 본 논문에서는 현실적인 제약을 고려한 온라인 광고 할당 문제들을 제안한다. 본 논문에서 다루는 문제는 (1) adversarial 순서로 진행하는 디스플레이 애드문제, (2) probabilistic 순서로 진행하는 디스플레이 애드문제 그리고 (3) 광고효과를 위한 온라인 배너 광고 일정계획이다. 이전에 제안되었던 광고 할당 문제들과 달리, 본 논문에서 제안한 문제들은 현실적인 제약과 광고효과를 반영하는 실용적인 접근 방식이다. 또한 제안하는 알고리즘은 온라인 광고 할당 문제의 운영관리에 대한 통찰력을 제공한다. 1장에서는 온라인 광고 할당 문제에 대한 문제해결 방법론에 대해 간단히 소개한다. 더불어 연구의 기여와 개요도 제공된다. 2장에서는 adversarial 순서로 진행하는 디스플레이 애드문제를 제안한다. worst-case를 보장하는 결정론적 알고리즘을 설계하고, 이들의 competitive ratio를 증명한다. 더불어 문제의 상한도 입증된다. 3장에서는 probabilistic 순서로 진행하는 디스플레이 애드문제를 제안한다. 시나리오 기반의 확률론적 온라인 알고리즘과 Benders 분해방법을 혼합한 추계 온라인 알고리즘을 제시한다. 4장에서는 광고효과를 위한 온라인 배너 광고 일정계획을 설계한다. 또한, 모델의 유효한 상한과 하한을 효율적으로 얻는 데 사용되는 문제해결 방법론을 제안한다. 5장에서는 본 논문의 결론과 향후 연구를 위한 방향을 제공한다. 본 논문에서 제안하는 문제해결 방법론은 학술 및 산업 분야 모두 의미가 있다. 수치 실험을 통해 문제해결 접근 방식이 문제를 효율적이고 효과적으로 해결할 수 있음을 보인다. 이는 온라인 광고 관리자가 본 논문에서 제안하는 문제와 문제해결 방법론을 통해 온라인 광고 할당관련 의사결정을 진행하는 데 있어 도움이 될 것으로 기대한다.Chapter 1 Introduction 1 1.1 Display Ads Problem 3 1.1.1 Online Algorithm 4 1.2 Online Banner Advertisement Scheduling Problem 5 1.3 Research Motivations and Contributions 6 1.4 Outline of the Dissertation 9 Chapter 2 Online Advertising Assignment Problem in Adversarial Order 12 2.1 Problem Description and Literature Review 12 2.2 Display Ads Problem in Adversarial Order 15 2.3 Deterministic Algorithms for Adversarial Order 17 2.4 Upper Bounds of Deterministic Algorithms for Adversarial Order 22 2.5 Summary 28 Chapter 3 Online Advertising Assignment Problem in Probabilistic Order 30 3.1 Problem Description and Literature Review 30 3.2 Display Ads Problem in Probabilistic Order 33 3.3 Stochastic Online Algorithms for Probabilistic Order 34 3.3.1 Two-Stage Stochastic Programming 35 3.3.2 Known IID model 37 3.3.3 Random permutation model 41 3.3.4 Stochastic approach using primal-dual algorithm 45 3.4 Computational Experiments 48 3.4.1 Results for known IID model 55 3.4.2 Results for random permutation model 57 3.4.3 Managerial insights for Algorithm 3.1 59 3.5 Summary 60 Chapter 4 Online Banner Advertisement Scheduling for Advertising Effectiveness 61 4.1 Problem Description and Literature Review 61 4.2 Mathematical Model 68 4.2.1 Objective function 68 4.2.2 Notations and formulation 72 4.3 Solution Methodologies 74 4.3.1 Heuristic approach to finding valid lower and upper bounds 75 4.3.2 Hybrid tabu search 79 4.4 Computational Experiments 80 4.4.1 Results for problems with small data sets 82 4.4.2 Results for problems with large data sets 84 4.4.3 Results for problems with standard data 86 4.4.4 Managerial insights for the results 90 4.5 Summary 92 Chapter 5 Conclusions and Future Research 93 Appendices 97 A Initial Sequence of the Hybrid Tabu Search 98 B Procedure of the Hybrid Tabu Search 99 C Small Example of the Hybrid Tabu Search 101 D Linearization Technique of Bilinear Form in R2 104 Bibliography 106Docto

Global supply chain design: A literature review and critique

In this paper, we review decision support models for the design of global supply chains, and assess the fit between the research literature in this area and the practical issues of global supply chain design. The classification scheme for this review is based on ongoing and emerging issues in global supply chain management and includes review dimensions for (1) decisions addressed in the model, (2) performance metrics, (3) the degree to which the model supports integrated decision processes, and (4) globalization considerations. We conclude that although most models resolve a difficult feature associated with globalization, few models address the practical global supply chain design problem in its entirety. We close the paper with recommendations for future research in global supply chain modeling that is both forward-looking and practically oriented

Three-Dimensional Capacitated Vehicle Routing Problems with Loading Constraints

City logistics planning involves organizing the movement of goods in urban areas carried out by logistics operators. The loading and routing of goods are critical components of these operations. Efficient utilization of vehicle space and limiting number of empty vehicle movements can strongly impact the nuisances created by goods delivery vehicles in urban areas. We consider an integrated problem of routing and loading known as the three-dimensional loading capacitated vehicle routing problem (3L-CVRP). 3L-CVRP consists of finding feasible routes with the minimum total travel cost while satisfying customers’ demands expressed in terms of cuboid and weighted items. Practical constraints related to connectivity, stability, fragility, and LIFO are considered as parts of the problem. We address the problem in two stages. Firstly, we address the three-dimensional (3D) loading problem followed by 3L-CVRP. The main objective of a 3D loading problem without routing aspect is finding the best way of packing 3D items into vehicles or containers to increase the loading factor with the purpose of minimizing empty vehicle movements. We present the general linear programming model to the pure three-dimensional vehicle loading problem and solve it by CPLEX. To deal with large-sized instances, Column Generation (CG) technique is applied. The designed method in this work outperforms the best existing techniques in the literature.   The 3DVLP with allocation and capacity constraints, called 3DVLP-AC, is also considered. For the 3DVLP-AC, CPLEX could handle moderate-sized instances with up to 40 customers. To deal with large-sized instances, a Tabu Search (TS) heuristic algorithm is developed. There are no solution methods or lower bounds (LBs) for the 3DVLP-AC existent in the literature by which to evaluate the TS results. Therefore, we evaluate our TS with the CPLEX results for small instances. 3L-CVRP is addressed by using CG technique. To generate new columns, the pricing problem that is part of CG is solved by using two approaches: 1-by means of shortest path problem with resource constraints (ESPPRC) and loading problem, and 2-a heuristic pricing method (HP). CG using HP with a simple scheme can attain solutions competitive with the efficient TS algorithms described in the literature

Planificación de la logística en redes de salud: análisis y resolución

Healthcare networks bring together a wide range of public and private entities (hospitals, specific service units, healthcare professionals, …) at local or regional level that seek for management effectiveness, decisional efficacy and coordination. This thesis analyzes the problem statement: "How can those organizations integrate their internal logistic network?" Theories, concepts and integration guidelines from supply chain management theory have been applied to investigate this problem. On healthcare networks already in place, the application of centralized planning procedures is the more appropriate management strategy to rationalize and pilot the change processes. Hence, a general tactical level model is stated as a mixed integer linear programming (MILP) model supporting decisions on the global view of network layout and the coordinating policy among facilities in such networks. Apart from the adoption of optimization tools to provide a framework for costefficient operations, we have identified that information sharing and service level agreements are the key aspects in the effective accomplishment of logistics integration. We have conducted a case study at the Andalusian Regional Network of Clinical Laboratories (ANCL), a large healthcare network with geographically dispersed hospitals, clinics, and testing laboratories, that initiated an organizational strategy to enhance accessibility to services, quality of care and cost savings. Different solution strategies have been addressed in the MILP model that arises, in order to embed this model into a graphical, interactive and responsive Decision Support System (DSS) tool to support ANCL planners’ analysis of What-If scenarios. Drawing on the ANCL case study, it appears that the integration of the Information Tecnologies (IT) Systems at the different facilities and locations within the network and the centralization of the logistic planning procedure can be of invaluable help for aligning operational models and organizational behavior around demand, capacity and network configuration. This suggests that although such integration projects are difficult, costly and complex, they seem worth undertaking.Las Redes de Salud se basan en el trabajo en común de una variedad de entidades públicas y privadas (hospitales, unidades de servicios específicos, profesionales sanitarios,...) a nivel local o regional, en busca de una gestión efectiva, con toma de decisiones y coordinación eficientes. Esta tesis analiza la siguiente pregunta de investigación: "¿Cómo pueden las organizaciones integrar su red logística interna" Las teorías, conceptos y directrices de integración de la Cadena de Suministro se han aplicado para investigar este problema. En redes de salud ya funcionando, la aplicación de procedimientos de planificación centralizada se identifica como la estrategia de gestión más adecuada para racionalizar y pilotar los procesos de cambio. Por ello, planteamos abordar el objeto de la tesis mediante un modelo de programación lineal entera mixta (MILP) de nivel táctico, del que emanarán las decisiones sobre la visión global del diseño de la red y la política de coordinación entre los miembros de la red. Además de la adopción de herramientas de optimización para proporcionar un marco para operaciones eficientes en costes, hemos identificado como aspectos clave en la consecución efectiva de la integración logística en este tipo de redes el intercambio de información y el cumplimiento de acuerdos de nivel de servicio. Como caso práctico, hemos realizado esta integración en la Red Andaluza Regional de Laboratorios Clínicos (ANCL), una red sanitaria extensa con hospitales, clínicas y laboratorios clínicos dispersos geográficamente, que inició una estrategia de cambio organizacional para mejorar la accesibilidad al servicio de pruebas clínicas, la calidad del servicio y propiciar ahorro de costes. Sobre el MILP que resulta al abordar este caso de estudio, hemos aplicado diferentes estrategias de solución. Puesto que este modelo de optimización ha de usarse como el corazón de un Sistema de Soporte a la Decisión (DSS) a disposición de los planificadores ANCL para realizar análisis de escenarios, la agilidad en la generación de soluciones es un requisito primordial. Basándonos en nuestra experiencia con la ANCL, parece que tanto la integración de los sistemas de Tecnologías de Información de los diferentes miembros en la red como la centralización del procedimiento de planificación logística (a través del cual se fijan las directrices de coordinación anual) son de inestimable ayuda para la alineación del modelo operativo y el comportamiento organizacional en torno a demanda, capacidad y configuración de red. Esto sugiere que aunque tales proyectos de integración sean difíciles, costosos y complejos, el esfuerzo parece valer la pena

Generation Expansion Planning with Large Amounts of Wind Power via Decision-Dependent Stochastic Programming

Power generation expansion planning needs to deal with future uncertainties carefully, given that the invested generation assets will be in operation for a long time. Many stochastic programming models have been proposed to tackle this challenge. However, most previous works assume predetermined future uncertainties (i.e., fixed random outcomes with given probabilities). In several recent studies of generation assets\u27 planning (e.g., thermal versus renewable), new findings show that the investment decisions could affect the future uncertainties as well. To this end, this paper proposes a multistage decision-dependent stochastic optimization model for long-term large-scale generation expansion planning, where large amounts of wind power are involved. In the decision-dependent model, the future uncertainties are not only affecting but also affected by the current decisions. In particular, the probability distribution function is determined by not only input parameters but also decision variables. To deal with the nonlinear constraints in our model, a quasi-exact solution approach is then introduced to reformulate the multistage stochastic investment model to a mixed-integer linear programming model. The wind penetration, investment decisions, and the optimality of the decision-dependent model are evaluated in a series of multistage case studies. The results show that the proposed decision-dependent model provides effective optimization solutions for long-term generation expansion planning

Combinatorial Optimization

This report summarizes the meeting on Combinatorial Optimization where new and promising developments in the field were discussed. Th