Operations Research, Systems Engineering and Industrial Engineering Commons^™

An Empirical Study Of Off-Line Configuration And On-Line Adaptation In Operator Selection, Zhi Yuan, Stephanus Daniel Handoko, Duc Thien Nguyen, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Automating the process of finding good parameter settings is important in the design of high-performing algorithms. These automatic processes can generally be categorized into off-line and on-line methods. Off-line configuration consists in learning and selecting the best setting in a training phase, and usually fixes it while solving an instance. On-line adaptation methods on the contrary vary the parameter setting adaptively during each algorithm run. In this work, we provide an empirical study of both approaches on the operator selection problem, explore the possibility of varying parameter value by a non-adaptive distribution tuned off-line, and incorporate the off-line with on-line …

Hybrid Metaheuristics For Solving The Quadratic Assignment Problem And The Generalized Quadratic Assignment Problem, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This paper presents a hybrid metaheuristic for solving the Quadratic Assignment Problem (QAP). The proposed algorithm involves using the Greedy Randomized Adaptive Search Procedure (GRASP) to construct an initial solution, and then using a hybrid Simulated Annealing and Tabu Search (SA-TS) algorithm to further improve the solution. Experimental results show that the hybrid metaheuristic is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time. The proposed algorithm is extended to solve the Generalized Quadratic Assignment Problem (GQAP), with an emphasis on modelling and solving a practical problem, namely an examination timetabling problem. We found that …

A Mathematical Model And Metaheuristics For Time Dependent Orienteering Problem, Aldy Gunawan, Zhi Yuan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This paper presents a generalization of the Orienteering Problem, the Time-Dependent Orienteering Problem (TDOP) which is based on the real-life application of providing automatic tour guidance to a large leisure facility such as a theme park. In this problem, the travel time between two nodes depends on the time when the trip starts. We formulate the problem as an integer linear programming (ILP) model. We then develop various heuristics in a step by step fashion: greedy construction, local search and variable neighborhood descent, and two versions of iterated local search. The proposed metaheuristics were tested on modified benchmark instances, randomly …

Diversity-Oriented Bi-Objective Hyper-Heuristics For Patrol Scheduling, Mustafa Misir, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

The patrol scheduling problem is concerned with assigning security teams to different stations for distinct time intervals while respecting a limited number of contractual constraints. The objective is to minimise the total distance travelled while maximising the coverage of the stations with respect to their security requirement levels. This paper introduces a hyper-heuristic strategy focusing on generating diverse solutions for a bi-objective patrol scheduling problem. While a variety of hyper-heuristics have been applied to a large suite of problem domains usually in the form of single-objective optimisation, we suggest an alternative approach for solving the patrol scheduling problem with two …

Decentralized Stochastic Planning With Anonymity In Interactions, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet

Research Collection School Of Computing and Information Systems

In this paper, we solve cooperative decentralized stochastic planning problems, where the interactions between agents (specified using transition and reward functions) are dependent on the number of agents (and not on the identity of the individual agents) involved in the interaction. A collision of robots in a narrow corridor, defender teams coordinating patrol activities to secure a target, etc. are examples of such anonymous interactions. Formally, we consider problems that are a subset of the well known Decentralized MDP (DEC-MDP) model, where the anonymity in interactions is specified within the joint reward and transition functions. In this paper, not only …

Decentralized Multi-Agent Reinforcement Learning In Average-Reward Dynamic Dcops, Duc Thien Nguyen, William Yeoh, Hoong Chuin Lau, Shlomo Zilberstein, Chongjie Zhang

Research Collection School Of Computing and Information Systems

Researchers have introduced the Dynamic Distributed Constraint Optimization Problem (Dynamic DCOP) formulation to model dynamically changing multi-agent coordination problems, where a dynamic DCOP is a sequence of (static canonical) DCOPs, each partially different from the DCOP preceding it. Existing work typically assumes that the problem in each time step is decoupled from the problems in other time steps, which might not hold in some applications. Therefore, in this paper, we make the following contributions: (i) We introduce a new model, called Markovian Dynamic DCOPs (MD-DCOPs), where the DCOP in the next time step is a function of the value assignments …

Streets: Game-Theoretic Traffic Patrolling With Exploration And Exploitation, Matthew Brown, Sandhya Saisubramanian, Pradeep Varakantham, Milind Tambe

Research Collection School Of Computing and Information Systems

To dissuade reckless driving and mitigate accidents, cities deploy resources to patrol roads. In this paper, we present STREETS, an application developed for the city of Singapore, which models the problem of computing randomized traffic patrol strategies as a defenderattacker Stackelberg game. Previous work on Stackelberg security games has focused extensively on counterterrorism settings. STREETS moves beyond counterterrorism and represents the first use of Stackelberg games for traffic patrolling, in the process providing a novel algorithm for solving such games that addresses three major challenges in modeling and scale-up. First, there exists a high degree of unpredictability in travel times …

Reinforcement Learning For Adaptive Operator Selection In Memetic Search Applied To Quadratic Assignment Problem, Stephanus Daniel Handoko, Duc Thien Nguyen, Zhi Yuan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Memetic search is well known as one of the state-of-the-art metaheuristics for finding high-quality solutions to NP-hard problems. Its performance is often attributable to appropriate design, including the choice of its operators. In this paper, we propose a Markov Decision Process model for the selection of crossover operators in the course of the evolutionary search. We solve the proposed model by a Q-learning method. We experimentally verify the efficacy of our proposed approach on the benchmark instances of Quadratic Assignment Problem.

Toward Automating Web Protocol Configuration For A Programmable Logic Controller Emulator, Deanna R. Fink

Theses and Dissertations

Industrial Control Systems (ICS) remain vulnerable through attack vectors that exist within programmable logic controllers (PLC). PLC emulators used as honeypots can provide insight into these vulnerabilities. Honeypots can sometimes deter attackers from real devices and log activity. A variety of PLC emulators exist, but require manual figuration to change their PLC pro le. This limits their flexibility for deployment. An automated process for configuring PLC emulators can open the door for emulation of many types of PLCs. This study investigates the feasibility of creating such a process. The research creates an automated process for figuring the web protocols of …

Revisiting Risk-Sensitive Mdps: New Algorithms And Results, Ping Hou, William Yeoh, Pradeep Reddy Varakantham

Research Collection School Of Computing and Information Systems

While Markov Decision Processes (MDPs) have been shown to be effective models for planning under uncertainty, theobjective to minimize the expected cumulative cost is inappropriate for high-stake planning problems. As such, Yu, Lin, and Yan (1998) introduced the Risk-Sensitive MDP (RSMDP) model, where the objective is to find a policy that maximizes the probability that the cumulative cost is within some user-defined cost threshold. In this paper, we revisit this problem and introduce new algorithms that are based on classical techniques, such as depth-first search and dynamic programming, and a recently introduced technique called Topological Value Iteration (TVI). We demonstrate …

Design Of A Custom Software Application To Monitor And Communicate Cnc Machining Process Information To Aid In Chatter Identification, Valerie Pezzullo

All Theses

In any manufacturing environment, it is important to be able to monitor the Computer Numerical Control (CNC) machining process so that high quality parts can be produced in the least amount of time in order to be profitable. This involves acquiring the proper parameters needed from the machine's controller, which can prove to be difficult with proprietary machine tools that tend to limit access to the internal data collected by the controller. This closed approach to controller design also means that many technological advances that have recently become prevalent in society are not being adopted in the manufacturing industry, preventing …

Improved Mixed-Integer Models Of A Two-Dimensional Cutting Stock Problem, William Lassiter

All Theses

This paper is concerned with a family of two-dimensional cutting stock problems that seeks to cut rectangular regions from a finite collection of sheets in such a manner that the minimum number of sheets is used. A fixed number of rectangles are to be cut, with each rectangle having a known length and width. All sheets are rectangular, and have the same dimension. We review two known mixed-integer mathematical formulations, and then provide new representations that both economize on the number of discrete variables and tighten the continuous relaxations. A key consideration that arises repeatedly in all models is the …

Poisson Distributed Individuals Control Charts With Optimal Limits, Negin Enayaty Ahangar

Graduate Theses and Dissertations

The conventional method used in attribute control charts is the Shewhart three sigma limits. The implicit assumption of the Normal distribution in this approach is not appropriate for skewed distributions such as Poisson, Geometric and Negative Binomial. Normal approximations perform poorly in the tail area of the these distributions. In this research, a type of attribute control chart is introduced to monitor the processes that provide count data. The economic objective of this chart is to minimize the cost of its errors which is determined by the designer. This objective is a linear function of type I and II errors. …

A Quantitative Analysis Of Decision Process In Social Groups Using Human Trajectories, Truc Viet Le, Siyuan Liu, Hoong Chuin Lau, Ramayya Krishnan

Research Collection School Of Computing and Information Systems

A group's collective action is an outcome of the group's decision-making process, which may be reached by either averaging of the individual preferences or following the choices of certain members in the group. Our problem here is to decide which decision process the group has adopted given the data of the collective actions. We propose a generic statistical framework to infer the group's decision process from the spatio-temporal data of group trajectories, where each "trajectory" is a sequence of group actions. This is achieved by systematically comparing each agent type's influence on the group actions based on an array of …

Decentralized Multi-Agent Reinforcement Learning In Average-Reward Dynamic Dcops, Duc Thien Nguyen, William Yeoh, Hoong Chuin Lau, Shlomo Zilberstein

Research Collection School Of Computing and Information Systems

Researchers have introduced the Dynamic Distributed Constraint Optimization Problem (Dynamic DCOP) formulation to model dynamically changing multi-agent coordination problems, where a dynamic DCOP is a sequence of (static canonical) DCOPs, each partially different from the DCOP preceding it. Existing work typically assumes that the problem in each time step is decoupled from the problems in other time steps, which might not hold in some applications. Therefore, in this paper, we make the following contributions: (i) We introduce a new model, called Markovian Dynamic DCOPs (MD-DCOPs), where the DCOP in the next time step is a function of the value assignments …

On Understanding Diffusion Dynamics Of Patrons At A Theme Park, Jiali Du, Akshat Kumar, Pradeep Reddy Varakantham

Research Collection School Of Computing and Information Systems

In this work, we focus on the novel application of learning the diffusion dynamics of visitors among attractions at a large theme park using only aggregate information about waiting times at attractions. Main contributions include formulating optimisation models to compute diffusion dynamics. We also developed algorithm capable of dealing with noise in the data to populate parameters in the optimization model. We validated our approach using cross validation on a real theme park data set. Our approach provides an accuracy of about 80$% for popular attractions, providing solid empirical support for our diffusion models.

The Green Manufacturing Industrial Consortium’S (Gmic) Approach To Zero-Waste-To-Landfill (Zwtl), Nathan J. Christensen, Marylin Glass-Angeles

Research and Creative Activities Poster Day

Introduction: As organizations continually seek to reduce various forms of waste, some may seek to reduce their landfill impact and improve recycling and material disposal practices. Many organizations interested in reducing their landfill waste have embarked on a zero-waste-to-landfill (ZWTL) journey. This journey involves thoroughly exploring the landfill waste of an organization, reverse tracking the waste to its source, and establishing new practices and procedures for eliminating the source of waste from the landfill stream. The purpose of this poster is to describe the methodology used by the Green Manufacturing Initiative to assist companies on their ZWTL journey.

Predictive Analytics For Outpatient Appointments, Nang Laik Ma, Khataniar Seemanta, Dan Wu, Serene Seng Ying Ng

Research Collection School Of Computing and Information Systems

Healthcare is a very important industry where analytics has been applied successfully to generate insights about patients, identify bottleneck and to improve the business efficiency. In this paper, we aim to look at the patient appointment process as the hospital is experiencing high volume of ?no shows. ?No shows have a high impact on longer appointment lead time for patients, poor patient satisfaction and loss of revenue for hospital. We use data analytics to identify pattern of ?no shows, develop a statistical model to predict the probability of ?no shows and finally operationalizing the model to embed the analytics solution …

Assessing The Impact Of Electronic Health Record Systems Implementation On Hospital Patient Perceptions Of Care, Katherine Sofia Palacio Salgar

Engineering Management & Systems Engineering Theses & Dissertations

The delivery of health care services has been impacted by advances in Knowledge Management Information Systems (KMIS) and Information Technology (IT). The literature reveals that Electronic Health Records Systems (EHRs) are a comprehensive KMIS. There is a wide recognition in the body of knowledge that demonstrates the potential of EHRs to transform all aspects of health care services and, in consequence, the performance of Health Care Delivery Organizations (HCDO). Authors of published research also agree that there is a need for more empirical contributions that demonstrate the impact of EHRs upon HCDO. It is argued that in most cases, studies …

Assessing Organizational Effectiveness Through The Competing Values Framework A Data Envelopment Approach, Raghavender Macherla

Engineering Management & Systems Engineering Theses & Dissertations

This study proposes a model to diagnose organizations using the mathematical principles of data envelopment analysis (DEA) to the variables generated using competing values framework (CVF) in order to evaluate overall organizational effectiveness. The notion of organizational effectiveness is abstract and difficult to measure due to its complexity and multi-functional nature. Over the years, measurement of organizational effectiveness has remained a challenge due to the lack of agreement on the factors that should be assessed to determine effectiveness. This research is aimed at shedding some light into this topic by using data envelopment analysis as a tool to measure relative …

Sampled Fictitious Play For Multi-Action Stochastic Dynamic Programs, Archis Ghate, Shih-Fen Cheng, Stephen Baumert, Daniel Reaume, Dushyant Sharma, Robert L. Smith

Research Collection School Of Computing and Information Systems

We introduce a class of finite-horizon dynamic optimization problems that we call multi-action stochastic dynamic programs (DPs). Their distinguishing feature is that the decision in each state is a multi-dimensional vector. These problems can in principle be solved using Bellman's backward recursion. However, complexity of this procedure grows exponentially in the dimension of the decision vectors. This is called the curse of action-space dimensionality. To overcome this computational challenge, we propose an approximation algorithm rooted in the game theoretic paradigm of Sampled Fictitious Play (SFP). SFP solves a sequence of DPs with a one-dimensional action-space, which are exponentially smaller than …

Scheduling And Resource Allocation In Wireless Sensor Networks, Yosef Alayev

Dissertations, Theses, and Capstone Projects

In computer science and telecommunications, wireless sensor networks are an active research area. Each sensor in a wireless sensor network has some pre-defined or on demand tasks such as collecting or disseminating data. Network resources, such as broadcast channels, number of sensors, power, battery life, etc., are limited. Hence, a schedule is required to optimally allocate network resources so as to maximize some profit or minimize some cost. This thesis focuses on scheduling problems in the wireless sensor networks environment. In particular, we study three scheduling problems in the wireless sensor networks: broadcast scheduling, sensor scheduling for area monitoring, and …

Building Thinc: User Incentivization And Meeting Rescheduling For Energy Savings, Jun Young Kwak, Debarun Kar, William Haskell, Pradeep Reddy Varakantham, Milind Tambe

Research Collection School Of Computing and Information Systems

This paper presents THINC, an agent developed for saving energy in real-world commercial buildings. While previous work has presented techniques for computing energy-efficient schedules, it fails to address two issues, centered on human users, that are essential in real-world agent deployments: (i) incentivizing users for their energy saving activities and (ii) interacting with users to reschedule key “energy-consuming” meetings in a timely fashion, while handling the uncertainty in such interactions. THINC addresses these shortcomings by providing four new major contributions. First, THINC computes fair division of credits from energy savings. For this fair division, THINC provides novel algorithmic advances for …

Characterizing Forced Communication In Networks, Samuel C. Gutekunst

HMC Senior Theses

This thesis studies a problem that has been proposed as a novel way to disrupt communication networks: the load maximization problem. The load on a member of a network represents the amount of communication that the member is forced to be involved in. By maximizing the load on an important member of the network, we hope to increase that member's visibility and susceptibility to capture. In this thesis we characterize load as a combinatorial property of graphs and expose possible connections between load and spectral graph theory. We specifically describe the load and how it changes in several canonical classes …

Data Mining Based Hybridization Of Meta-Raps, Fatemah Al-Duoli, Ghaith Rabadi

Engineering Management & Systems Engineering Faculty Publications

Though metaheuristics have been frequently employed to improve the performance of data mining algorithms, the opposite is not true. This paper discusses the process of employing a data mining algorithm to improve the performance of a metaheuristic algorithm. The targeted algorithms to be hybridized are the Meta-heuristic for Randomized Priority Search (Meta-RaPS) and an algorithm used to create an Inductive Decision Tree. This hybridization focuses on using a decision tree to perform on-line tuning of the parameters in Meta-RaPS. The process makes use of the information collected during the iterative construction and improvement phases Meta-RaPS performs. The data mining algorithm …

A Decision Modeling For Phasor Measurement Unit Location Selection In Smart Grid Systems, Seung Yup Lee

Wayne State University Theses

As a key technology for enhancing the smart grid system, Phasor Measurement Unit (PMU) provides synchronized phasor measurements of voltages and currents of wide-area electric power grid. With various benefits from its application, one of the critical issues in utilizing PMUs is the optimal site selection of units.

The main aim of this research is to develop a decision support system, which can be used in resource allocation task for smart grid system analysis. As an effort to suggest a robust decision model and standardize the decision modeling process, a harmonized modeling framework, which considers operational circumstances of component, is …

Generic Instance-Specific Automated Parameter Tuning Framework, Linda Lindawati

Dissertations and Theses Collection (Open Access)

Meta-heuristic algorithms play an important role in solving combinatorial optimization problems (COP) in many practical applications. The caveat is that the performance of these meta-heuristic algorithms is highly dependent on their parameter configuration which controls the algorithm behaviour. Selecting the best parameter configuration is often a difficult, tedious and unsatisfying task. This thesis studies the problem of automating the selection of good parameter configurations. Existing approaches to address the challenges of parameter configuration can be classified into one-size-fits-all and instance-specific approaches. One-size-fits-all approaches focus on finding a single best parameter configuration for a set of problem instances, while instance-specific approaches …

Strategic Decision Support System Using Heuristic Algorithm For Practical Outlet Zones Allocation To Dealers In A Beer Supply Distribution Network, Michelle Lee Fong Cheong

Research Collection School Of Computing and Information Systems

We consider a two-echelon beer supply distribution network with the brewer replenishing the dealers and the dealers serving the outlet zones directly, for multiple product types. The allocation of the outlet zones to the dealers will determine the quantity of products the brewer replenishes each dealer, which will in turn impact the total warehousing and transportation costs. The non-linear optimization model formulated is difficult to solve to optimality, and the model itself does not include practical business considerations in the distribution business. A heuristics algorithm is designed and easily implemented using spreadsheets with Visual Basic programming to effectively and efficiently …

Risk Minimization Of Disjunctive Temporal Problem With Uncertainty, Hoong Chuin Lau, Tuan Anh Hoang

Research Collection School Of Computing and Information Systems

The Disjunctive Temporal Problem with Uncertainty (DTPU) is a fundamental problem that expresses temporal reasoning with both disjunctive constraints and contingency. A recent work (Peintner et al, 2007) develops a complete algorithm for determining Strong Controlla- bility of a DTPU. Such a notion that guarantees 100% confidence of execution may be too conservative in practice. In this paper, following the idea of (Tsamardinos 2002), we are interested to find a schedule that minimizes the risk (i.e. probability of failure) of executing a DTPU. We present a problem decomposition scheme that enables us to compute the probability of failure efficiently, followed …

Thermolysis And Kinetics Of Scrap Tyre And Bagasse For Energy Utilization, Petro Ndalila

Tanzania Journal of Engineering and Technology (TJET)

The increase of energy demand has brought concern to find alternative fuel that will at least sustain the requirement. Bagasse and scrap tyre are waste generated in our industrial activities, which can be used in energy production to subsidize the demand. This paper, aim to study the decomposition behaviour and kinetics of biomass (bagasse) and scrap tyre as preliminary stage of fuel sample analysis to be considered for energy production in gasification/combustion or pyrolysis facilities. The behaviour demonstrated with thermogravimetric analyzer (TGA), shows that all samples have high volatile amount release, 84.21% for bagasse and 85.08% for scrap tyre, which …