Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 9 of 9

Full-Text Articles in Physical Sciences and Mathematics

A Study Of The Impact Of Data Intelligence On Software Delivery Performance, Yongdong Dong Mar 2023

A Study Of The Impact Of Data Intelligence On Software Delivery Performance, Yongdong Dong

Dissertations and Theses Collection (Open Access)

With the rise of big data and artificial intelligence, data intelligence has gradually become the focus of academia and industry. Data intelligence has two obvious characteristics: big data drive and application scene drive. More and more enterprises extract valuable patterns contained in data with prediction and decision analysis methods and technologies such as large-scale data mining, machine learning and deep learning and use them to improve the management and decision in complex practice, so as to promote changes of new business modes, organizational structures and even business strategies, and improve the operational efficiency of organizations. However, there are few studies …


London Heathrow Airport Uses Real-Time Analytics For Improving Operations, Xiaojia Guo, Yael Grushka-Cockayne, Bert De Reyck Sep 2020

London Heathrow Airport Uses Real-Time Analytics For Improving Operations, Xiaojia Guo, Yael Grushka-Cockayne, Bert De Reyck

Research Collection Lee Kong Chian School Of Business

Improving airport collaborative decision making is at the heart of airport operations centers (APOCs) recently established in several major European airports. In this paper, we describe a project commissioned by Eurocontrol, the organization in charge of the safety and seamless flow of European air traffic. The project’s goal was to examine the opportunities offered by the colocation and real-time data sharing in the APOC at London’s Heathrow airport, arguably the most advanced of its type in Europe. We developed and implemented a pilot study of a real-time data-sharing and collaborative decision-making process, selected to improve the efficiency of Heathrow’s operations. …


Vungle Inc. Improves Monetization Using Big-Data Analytics, Bert De Reyck, Ioannis Fragkos, Yael Gruksha-Cockayne, Casey Lichtendahl, Hammond Guerin, Andre Kritzer Oct 2017

Vungle Inc. Improves Monetization Using Big-Data Analytics, Bert De Reyck, Ioannis Fragkos, Yael Gruksha-Cockayne, Casey Lichtendahl, Hammond Guerin, Andre Kritzer

Research Collection Lee Kong Chian School Of Business

The advent of big data has created opportunities for firms to customize their products and services to unprecedented levels of granularity. Using big data to personalize an offering in real time, however, remains a major challenge. In the mobile advertising industry, once a customer enters the network, an ad-serving decision must be made in a matter of milliseconds. In this work, we describe the design and implementation of an ad-serving algorithm that incorporates machine-learning methods to make personalized ad-serving decisions within milliseconds. We developed this algorithm for Vungle Inc., one of the largest global mobile ad networks. Our approach also …


A Horizon Decomposition Approach For The Capacitated Lot-Sizing Problem With Setup Times, Ioannis Fragkos, Zeger Degraeve, Bert De Reyck May 2016

A Horizon Decomposition Approach For The Capacitated Lot-Sizing Problem With Setup Times, Ioannis Fragkos, Zeger Degraeve, Bert De Reyck

Research Collection Lee Kong Chian School Of Business

We introduce horizon decomposition in the context of Dantzig-Wolfe decomposition, and apply it to the capacitated lot-sizing problem with setup times. We partition the problem horizon in contiguous overlapping intervals and create subproblems identical to the original problem, but of smaller size. The user has the flexibility to regulate the size of the master problem and the subproblem via two scalar parameters. We investigate empirically which parameter configurations are efficient, and assess their robustness at different problem classes. Our branch-and-price algorithm outperforms state-of-the-art branch-and-cut solvers when tested to a new data set of challenging instances that we generated. Our methodology …


New Product Development Flexibility In A Competitive Environment, Janne Kettunen, Yael Gruksha-Cockayne, Zeger Degraeve, Bert De Reyck Aug 2015

New Product Development Flexibility In A Competitive Environment, Janne Kettunen, Yael Gruksha-Cockayne, Zeger Degraeve, Bert De Reyck

Research Collection Lee Kong Chian School Of Business

Managerial flexibility can have a significant impact on the value of new product development projects. We investigate how the market environment in which a firm operates influences the value and use of development flexibility. We characterize the market environment according to two dimensions, namely (i) its intensity, and (ii) its degree of innovation. We show that these two market characteristics can have a different effect on the value of flexibility. In particular, we show that more intense or innovative environments may increase or decrease the value of flexibility. For instance, we demonstrate that the option to defer a product launch …


Period Decompositions For The Capacitated Lot Size Problem With Setup Times, Silvio Alexandre De Araujo, Bert De Reyck, Zeger Degraeve, Ioannis Fragkos, Raf Jans Jun 2015

Period Decompositions For The Capacitated Lot Size Problem With Setup Times, Silvio Alexandre De Araujo, Bert De Reyck, Zeger Degraeve, Ioannis Fragkos, Raf Jans

Research Collection Lee Kong Chian School Of Business

We study the multi-item capacitated lot sizing problem with setup times. Based on two strong reformulations of the problem, we present a transformed reformulation and valid inequalities that speed up column generation and Lagrange relaxation. We demonstrate computationally how both ideas enhance the performance of our algorithm and show theoretically how they are related to dual space reduction techniques. We compare several solution methods and propose a new efficient hybrid scheme that combines column generation and Lagrange relaxation in a novel way. Computational experiments show that the proposed solution method for finding lower bounds is competitive with textbook approaches and …


A Hybrid Scatter Search For The Discrete Time/Resource Trade-Off Problem In Project Scheduling, Mohammad Ranbar, Bert De Reyck, Fereydoon Kianfar Feb 2009

A Hybrid Scatter Search For The Discrete Time/Resource Trade-Off Problem In Project Scheduling, Mohammad Ranbar, Bert De Reyck, Fereydoon Kianfar

Research Collection Lee Kong Chian School Of Business

We develop a heuristic procedure for solving the discrete time/resource trade-off problem in the field of project scheduling. In this problem, a project contains activities interrelated by finish-start-type precedence constraints with a time lag of zero, which require one or more constrained renewable resources. Each activity has a specified work content and can be performed in different modes, i.e. with different durations and resource requirements, as long as the required work content is met. The objective is to schedule each activity in one of its modes in order to minimize the project makespan. We use a scatter search algorithm to …


A Hybrid Scatter Search/Electromagnetism Meta-Heuristic For Project Scheduling, Dieter Debels, Bert De Reyck, Roel Leus, Mario Vanhoucke Mar 2006

A Hybrid Scatter Search/Electromagnetism Meta-Heuristic For Project Scheduling, Dieter Debels, Bert De Reyck, Roel Leus, Mario Vanhoucke

Research Collection Lee Kong Chian School Of Business

In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively small instances. In this paper, we present a new meta-heuristic for this problem, able to provide near-optimal heuristic solutions for relatively large instances. The procedure combines elements from scatter search, a generic population-based evolutionary search method, and from a recently introduced heuristic method for the optimisation of unconstrained continuous functions based on an analogy with electromagnetism theory. We present computational …


On The Use Of The Complexity Index As A Measure Of Complexity In Activity Networks, Bert De Reyck, Willy Herroelen Jun 1996

On The Use Of The Complexity Index As A Measure Of Complexity In Activity Networks, Bert De Reyck, Willy Herroelen

Research Collection Lee Kong Chian School Of Business

A large number of optimal and suboptimal procedures have been developed for solving combinatorial problems modeled as activity networks. The need to differentiate between easy and hard problem instances and the interest in isolating the fundamental factors that determine the computing effort required by these procedures, inspired a number of researchers to develop various complexity measures. In this paper we investigate the relation between the hardness of a problem instance and the topological structure of its underlying network, as measured by the complexity index. We demonstrate through a series of experiments that the complexity index, defined as the minimum number …