Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Adaptive large neighborhood search (2)
- Metaheuristics (2)
- Simulation (2)
- Sustainability (2)
- 17-4PH stainless steel (1)
-
- AQWA (1)
- Additive manufacturing (1)
- Adsorption (1)
- Adsorption isotherms (1)
- Agent-based modeling (1)
- Alarm management (1)
- Algorithms (1)
- Ant Colony Optimization (1)
- Artificial neural networks (1)
- Attitudes (1)
- Automation (1)
- Bayesian Network (1)
- Behavior (1)
- Biosorption (1)
- Blockchains (1)
- Boundary element (1)
- Call center (1)
- Causality analysis (1)
- Classification (1)
- Collaboration (1)
- Competition (1)
- Compliance (1)
- Compliance research (1)
- Computer security (1)
- Computerized simulations (1)
Articles 1 - 30 of 36
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Recall Distortion In Neural Network Pruning And The Undecayed Pruning Algorithm, Aidan Good, Jiaqi Lin, Hannah Sieg, Mikey Ferguson, Xin Yu, Shandian Zhe, Jerzy Wieczorek, Thiago Serra
Recall Distortion In Neural Network Pruning And The Undecayed Pruning Algorithm, Aidan Good, Jiaqi Lin, Hannah Sieg, Mikey Ferguson, Xin Yu, Shandian Zhe, Jerzy Wieczorek, Thiago Serra
Faculty Conference Papers and Presentations
Pruning techniques have been successfully used in neural networks to trade accuracy for sparsity. However, the impact of network pruning is not uniform: prior work has shown that the recall for underrepresented classes in a dataset may be more negatively affected. In this work, we study such relative distortions in recall by hypothesizing an intensification effect that is inherent to the model. Namely, that pruning makes recall relatively worse for a class with recall below accuracy and, conversely, that it makes recall relatively better for a class with recall above accuracy. In addition, we propose a new pruning algorithm aimed …
Efficient Navigation For Constrained Shortest Path With Adaptive Expansion Control, Wenwen Xia, Yuchen Li, Wentian Guo, Shenghong Li
Efficient Navigation For Constrained Shortest Path With Adaptive Expansion Control, Wenwen Xia, Yuchen Li, Wentian Guo, Shenghong Li
Research Collection School Of Computing and Information Systems
In many route planning applications, finding constrained shortest paths (CSP) is an important and fundamental problem. CSP aims to find the shortest path between two nodes on a graph while satisfying a path constraint. Solving CSPs requires a large search space and is prohibitively slow on large graphs, even with the state-of-the-art parallel solution on GPUs. The reason lies in the lack of effective navigational information and pruning strategies in the search procedure. In this paper, we propose SPEC, a Shortest Path Enhanced approach for solving the exact CSP problem. Our design rationales of SPEC rely on the observation that …
Two-Phase Matheuristic For The Vehicle Routing Problem With Reverse Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Two-Phase Matheuristic For The Vehicle Routing Problem With Reverse Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Research Collection School Of Computing and Information Systems
Cross-dockingis a useful concept used by many companies to control the product flow. It enables the transshipment process of products from suppliers to customers. This research thus extends the benefit of cross-docking with reverse logistics, since return process management has become an important field in various businesses. The vehicle routing problem in a distribution network is considered to be an integrated model, namely the vehicle routing problem with reverse cross-docking (VRP-RCD). This study develops a mathematical model to minimize the costs of moving products in a four-level supply chain network that involves suppliers, cross-dock, customers, and outlets. A matheuristic based …
A Carbon-Aware Planning Framework For Production Scheduling In Mining, Nurual Asyikeen Azhar, Aldy Gunawan, Shih-Fen Cheng, Erwin Leonardi
A Carbon-Aware Planning Framework For Production Scheduling In Mining, Nurual Asyikeen Azhar, Aldy Gunawan, Shih-Fen Cheng, Erwin Leonardi
Research Collection School Of Computing and Information Systems
Managing the flow of excavated materials from a mine pit and the subsequent processing steps is the logistical challenge in mining. Mine planning needs to consider various geometric and resource constraints while maximizing the net present value (NPV) of profits over a long horizon. This mine planning problem has been modelled and solved as a precedence constrained production scheduling problem (PCPSP) using heuristics, due to its NP-hardness. However, the recent push for sustainable and carbon-aware mining practices calls for new planning approaches. In this paper, we propose an efficient temporally decomposed greedy Lagrangian relaxation (TDGLR) approach to maximize profits while …
Artificial Neural Networks And Gradient Boosted Machines Used For Regression To Evaluate Gasification Processes: A Review, Owen Sedej, Eric Mbonimpa, Trevor Sleight, Jeremy M. Slagley
Artificial Neural Networks And Gradient Boosted Machines Used For Regression To Evaluate Gasification Processes: A Review, Owen Sedej, Eric Mbonimpa, Trevor Sleight, Jeremy M. Slagley
Faculty Publications
Waste-to-Energy technologies have the potential to dramatically improve both the natural and human environment. One type of waste-to-energy technology that has been successful is gasification. There are numerous types of gasification processes and in order to drive understanding and the optimization of these systems, traditional approaches like computational fluid dynamics software have been utilized to model these systems. The modern advent of machine learning models has allowed for accurate and computationally efficient predictions for gasification systems that are informed by numerous experimental and numerical solutions. Two types of machine learning models that have been widely used to solve for quantitative …
Smart Manufacturing—Theories, Methods, And Applications, Zhuming Bi, Lida Xu, Puren Ouyang
Smart Manufacturing—Theories, Methods, And Applications, Zhuming Bi, Lida Xu, Puren Ouyang
Information Technology & Decision Sciences Faculty Publications
(First paragraph) Smart manufacturing (SM) distinguishes itself from other system paradigms by introducing ‘smartness’ as a measure to a manufacturing system; however, researchers in different domains have different expectations of system smartness from their own perspectives. In this Special Issue (SI), SM refers to a system paradigm where digital technologies are deployed to enhance system smartness by (1) empowering physical resources in production, (2) utilizing virtual and dynamic assets over the internet to expand system capabilities, (3) supporting data-driven decision making at all domains and levels of businesses, or (4) reconfiguring systems to adapt changes and uncertainties in dynamic environments. …
Submodularity And Local Search Approaches For Maximum Capture Problems Under Generalized Extreme Value Models, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Submodularity And Local Search Approaches For Maximum Capture Problems Under Generalized Extreme Value Models, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Research Collection School Of Computing and Information Systems
We study the maximum capture problem in facility location under random utility models, i.e., the problem of seeking to locate new facilities in a competitive market such that the captured user demand is maximized, assuming that each customer chooses among all available facilities according to a random utility maximization model. We employ the generalized extreme value (GEV) family of discrete choice models and show that the objective function in this context is monotonic and submodular. This finding implies that a simple greedy heuristic can always guarantee a (1−1/e) approximation solution. We further develop a new algorithm combining a greedy heuristic, …
Interpreting Trajectories From Multiple Views: A Hierarchical Self-Attention Network For Estimating The Time Of Arrival, Zebin Chen, Xiaolin Xiao, Yue-Jiao Gong, Jun Fang, Nan Ma, Hua Chai, Zhiguang Cao
Interpreting Trajectories From Multiple Views: A Hierarchical Self-Attention Network For Estimating The Time Of Arrival, Zebin Chen, Xiaolin Xiao, Yue-Jiao Gong, Jun Fang, Nan Ma, Hua Chai, Zhiguang Cao
Research Collection School Of Computing and Information Systems
Estimating the time of arrival is a crucial task in intelligent transportation systems. Although considerable efforts have been made to solve this problem, most of them decompose a trajectory into several segments and then compute the travel time by integrating the attributes from all segments. The segment view, though being able to depict the local traffic conditions straightforwardly, is insufficient to embody the intrinsic structure of trajectories on the road network. To overcome the limitation, this study proposes multi-view trajectory representation that comprehensively interprets a trajectory from the segment-, link-, and intersection-views. To fulfill the purpose, we design a hierarchical …
Joint Chance-Constrained Staffing Optimization In Multi-Skill Call Centers, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Joint Chance-Constrained Staffing Optimization In Multi-Skill Call Centers, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Research Collection School Of Computing and Information Systems
This paper concerns the staffing optimization problem in multi-skill call centers. The objective is to find a minimal cost staffing solution while meeting a target level for the quality of service (QoS) to customers. We consider a staffing problem in which joint chance constraints are imposed on the QoS of the day. Our joint chance-constrained formulation is more rational capturing the correlation between different call types, as compared to separate chance-constrained versions considered in previous studies. We show that, in general, the probability functions in the joint-chance constraints display S-shaped curves, and the optimal solutions should belong to the concave …
Fed-Ltd: Towards Cross-Platform Ride Hailing Via Federated Learning To Dispatch, Yansheng Wang, Yongxin Tong, Zimu Zhou, Ziyao Ren, Yi Xu, Guobin Wu, Weifeng Lv
Fed-Ltd: Towards Cross-Platform Ride Hailing Via Federated Learning To Dispatch, Yansheng Wang, Yongxin Tong, Zimu Zhou, Ziyao Ren, Yi Xu, Guobin Wu, Weifeng Lv
Research Collection School Of Computing and Information Systems
Learning based order dispatching has witnessed tremendous success in ride hailing. However, the success halts within individual ride hailing platforms because sharing raw order dispatching data across platforms may leak user privacy and business secrets. Such data isolation not only impairs user experience but also decreases the potential revenues of the platforms. In this paper, we advocate federated order dispatching for cross-platform ride hailing, where multiple platforms collaboratively make dispatching decisions without sharing their local data. Realizing this concept calls for new federated learning strategies that tackle the unique challenges on effectiveness, privacy and efficiency in the context of order …
Multi-Objective Evolutionary Algorithm Based On Rbf Network For Solving The Stochastic Vehicle Routing Problem, Yunyun Niu, Jie Shao, Jianhua Xiao, Wen Song, Zhiguang Cao
Multi-Objective Evolutionary Algorithm Based On Rbf Network For Solving The Stochastic Vehicle Routing Problem, Yunyun Niu, Jie Shao, Jianhua Xiao, Wen Song, Zhiguang Cao
Research Collection School Of Computing and Information Systems
Solving the multi-objective vehicle routing problem with stochastic demand (MO-VRPSD) is challenging due to its non-deterministic property and conflicting objectives. Most multi -objective evolutionary algorithm dealing with this problem update current population without any guidance from previous searching experience. In this paper, a multi -objective evolutionary algorithm based on artificial neural networks is proposed to tackle the MO-VRPSD. Particularly, during the evolutionary process, a radial basis function net-work (RBFN) is exploited to learn the potential knowledge of individuals, generate hypoth-esis and instantiate hypothesis. The RBFN evaluates individuals with different scores and generates new individuals with higher quality while taking into …
Multi-Agent Reinforcement Learning For Traffic Signal Control Through Universal Communication Method, Qize Jiang, Minhao Qin, Shengmin Shi, Weiwei Sun Sun, Baihua Zheng
Multi-Agent Reinforcement Learning For Traffic Signal Control Through Universal Communication Method, Qize Jiang, Minhao Qin, Shengmin Shi, Weiwei Sun Sun, Baihua Zheng
Research Collection School Of Computing and Information Systems
How to coordinate the communication among intersections effectively in real complex traffic scenarios with multi-intersection is challenging. Existing approaches only enable the communication in a heuristic manner without considering the content/importance of information to be shared. In this paper, we propose a universal communication form UniComm between intersections. UniComm embeds massive observations collected at one agent into crucial predictions of their impact on its neighbors, which improves the communication efficiency and is universal across existing methods. We also propose a concise network UniLight to make full use of communications enabled by UniComm. Experimental results on real datasets demonstrate that UniComm …
Time Dependent Orienteering Problem With Time Windows And Service Time Dependent Profits, M. Khodadadian, A. Divsalar, C. Verbeeck, Aldy Gunawan, P. Vansteenwegen
Time Dependent Orienteering Problem With Time Windows And Service Time Dependent Profits, M. Khodadadian, A. Divsalar, C. Verbeeck, Aldy Gunawan, P. Vansteenwegen
Research Collection School Of Computing and Information Systems
This paper addresses the time dependent orienteering problem with time windows and service time dependent profits (TDOPTW-STP). In the TDOPTW-STP, each vertex is assigned a minimum and a maximum service time and the profit collected at each vertex increases linearly with the service time. The goal is to maximize the total collected profit by determining a subset of vertices to be visited and assigning appropriate service time to each vertex, considering a given time budget and time windows. Moreover, travel times are dependent of the departure times. To solve this problem, a mixed integer linear model is formulated and a …
Officers: Operational Framework For Intelligent Crime-And-Emergency Response Scheduling, Jonathan David Chase, Siong Thye Goh, Tran Phong, Hoong Chuin Lau
Officers: Operational Framework For Intelligent Crime-And-Emergency Response Scheduling, Jonathan David Chase, Siong Thye Goh, Tran Phong, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In the quest to achieve better response times in dense urban environments, law enforcement agencies are seeking AI-driven planning systems to inform their patrol strategies. In this paper, we present a framework, OFFICERS, for deployment planning that learns from historical data to generate deployment schedules on a daily basis. We accurately predict incidents using ST-ResNet, a deep learning technique that captures wide-ranging spatio-temporal dependencies, and solve a large-scale optimization problem to schedule deployment, significantly improving its scalability through a simulated annealing solver. Methodologically, our approach outperforms our previous works where prediction was done using Generative Adversarial Networks, and optimization was …
Training Thinner And Deeper Neural Networks: Jumpstart Regularization, Carles Riera, Camilo Rey, Thiago Serra, Eloi Puertas, Oriol Pujol
Training Thinner And Deeper Neural Networks: Jumpstart Regularization, Carles Riera, Camilo Rey, Thiago Serra, Eloi Puertas, Oriol Pujol
Faculty Conference Papers and Presentations
Neural networks are more expressive when they have multiple layers. In turn, conventional training methods are only successful if the depth does not lead to numerical issues such as exploding or vanishing gradients, which occur less frequently when the layers are sufficiently wide. However, increasing width to attain greater depth entails the use of heavier computational resources and leads to overparameterized models. These subsequent issues have been partially addressed by model compression methods such as quantization and pruning, some of which relying on normalization-based regularization of the loss function to make the effect of most parameters negligible. In this work, …
A Unified View Of A Human Digital Twin, Michael Miller, Emily Spatz
A Unified View Of A Human Digital Twin, Michael Miller, Emily Spatz
Faculty Publications
The term human digital twin has recently been applied in many domains, including medical and manufacturing. This term extends the digital twin concept, which has been illustrated to provide enhanced system performance as it combines system models and analyses with real-time measurements for an individual system to improve system maintenance. Human digital twins have the potential to change the practice of human system integration as these systems employ real-time sensing and feedback to tightly couple measurements of human performance, behavior, and environmental influences throughout a product’s life cycle to human models to improve system design and performance. However, as this …
Consensus Formation On Heterogeneous Networks, Edoardo Fadda, Junda He, Claudia J. Tessone, Paolo Barucca
Consensus Formation On Heterogeneous Networks, Edoardo Fadda, Junda He, Claudia J. Tessone, Paolo Barucca
Research Collection School Of Computing and Information Systems
Reaching consensus-a macroscopic state where the system constituents display the same microscopic state-is a necessity in multiple complex socio-technical and techno-economic systems: their correct functioning ultimately depends on it. In many distributed systems-of which blockchain-based applications are a paradigmatic example-the process of consensus formation is crucial not only for the emergence of a leading majority but for the very functioning of the system. We build a minimalistic network model of consensus formation on blockchain systems for quantifying how central nodes-with respect to their average distance to others-can leverage on their position to obtain competitive advantage in the consensus process. We …
Competition And Third-Party Platform-Integration In Ride-Sourcing Markets, Yaqian Zhou, Hai Yang, Jintao Ke, Hai Wang, Xinwei Li
Competition And Third-Party Platform-Integration In Ride-Sourcing Markets, Yaqian Zhou, Hai Yang, Jintao Ke, Hai Wang, Xinwei Li
Research Collection School Of Computing and Information Systems
Recently, some third-party integrators attempt to integrate the ride services offered by multiple independent ride-sourcing platforms. Accordingly, passengers can request ride through the integrators and receive ride service from any one of the ride-sourcing platforms. This novel business model, termed as third-party platform-integration in this work, has potentials to alleviate market fragmentation cost resulting from demand splitting among multiple platforms. Although most existing studies focus on operation strategies for one single monopolist platform, much less is known about the competition and platform-integration and their implications on operation strategy and system efficiency. In this work, we propose mathematical models to describe …
Hierarchical Value Decomposition For Effective On-Demand Ride Pooling, Hao Jiang, Pradeep Varakantham
Hierarchical Value Decomposition For Effective On-Demand Ride Pooling, Hao Jiang, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
On-demand ride-pooling (e.g., UberPool, GrabShare) services focus on serving multiple different customer requests using each vehicle, i.e., an empty or partially filled vehicle can be assigned requests from different passengers with different origins and destinations. On the other hand, in Taxi on Demand (ToD) services (e.g., UberX), one vehicle is assigned to only one request at a time. On-demand ride pooling is not only beneficial to customers (lower cost), drivers (higher revenue per trip) and aggregation companies (higher revenue), but is also of crucial importance to the environment as it reduces the number of vehicles required on the roads. Since …
The Traveling Salesman Problem: An Analysis And Comparison Of Metaheuristics And Algorithms, Mason Helmick
The Traveling Salesman Problem: An Analysis And Comparison Of Metaheuristics And Algorithms, Mason Helmick
Senior Honors Theses
One of the most investigated topics in operations research is the Traveling Salesman Problem (TSP) and the algorithms that can be used to solve it. Despite its relatively simple formulation, its computational difficulty keeps it and potential solution methods at the forefront of current research. This paper defines and analyzes numerous proposed solutions to the TSP in order to facilitate understanding of the problem. Additionally, the efficiencies of different heuristics are studied and compared to the aforementioned algorithms’ accuracy, as a quick algorithm is often formulated at the expense of an exact solution.
Simulation, Optimization, And Economic Assessment Of Pelamis Wave Energy Converter, Hana Ghaneei, Mohammadreza Mahmoudi
Simulation, Optimization, And Economic Assessment Of Pelamis Wave Energy Converter, Hana Ghaneei, Mohammadreza Mahmoudi
Faculty Peer-Reviewed Publications
Wave energy and power is accessible on almost any body of water. One of the most widely known floating structures to generate renewable energy from the seas and the ocean is wave energy converter Pelamis. In this study, an attempt was made to simulate the dynamic behaviour of Pelamis P2 in the software AQWA under the influence of a nonlinear second-order Stokes wave. Pelamis P2 was simulated in different marine conditions including different water depths, wave heights, periods, and angles to assess its optimal operation. With the results in mind, it can be argued that with an increase in water …
Coordinated Delivery To Shopping Malls With Limited Docking Capacity, Ruidian Song, Hoong Chuin Lau, Xue Luo, Lei Zhao
Coordinated Delivery To Shopping Malls With Limited Docking Capacity, Ruidian Song, Hoong Chuin Lau, Xue Luo, Lei Zhao
Research Collection School Of Computing and Information Systems
Shopping malls are densely located in major cities such as Singapore and Hong Kong. Tenants in these shopping malls generate a large number of freight orders to their contracted logistics service providers, who independently plan their own delivery schedules. These uncoordinated deliveries and limited docking capacity jointly cause congestion at the shopping malls. A delivery coordination platform centrally plans the vehicle routes for the logistics service providers and simultaneously schedules the dock time slots at the shopping malls for the delivery orders. Vehicle routing and dock scheduling decisions need to be made jointly against the backdrop of travel time and …
The Impact Of Ride-Hail Surge Factors On Taxi Bookings, Sumit Agarwal, Ben Charoenwong, Shih-Fen Cheng, Jussi Keppo
The Impact Of Ride-Hail Surge Factors On Taxi Bookings, Sumit Agarwal, Ben Charoenwong, Shih-Fen Cheng, Jussi Keppo
Research Collection School Of Computing and Information Systems
We study the role of ride-hailing surge factors on the allocative efficiency of taxis by combining a reduced-form estimation with structural analyses using machine-learning-based demand predictions. Where other research study the effect of entry on incumbent taxis, we use higher frequency granular data to study how location-time-specific surge factors affect taxi bookings to bound the effect of customer decisions while accounting for various confounding variables. We find that even in a unique market like Singapore, where incumbent taxi companies have app-based booking systems similar to those from ride-hailing companies like Uber, the estimated upper bound on the cross-platform substitution between …
Hybrid Tabu Search Algorithm For Unrelated Parallel Machine Scheduling In Semiconductor Fabs With Setup Times, Job Release, And Expired Times, Changyu Chen, Madhi Fathi, Marzieh Khakifirooz, Kan Wu
Hybrid Tabu Search Algorithm For Unrelated Parallel Machine Scheduling In Semiconductor Fabs With Setup Times, Job Release, And Expired Times, Changyu Chen, Madhi Fathi, Marzieh Khakifirooz, Kan Wu
Research Collection School Of Computing and Information Systems
This research is motivated by a scheduling problem arising in the ion implantation process of wafer fabrication. The ion implementation scheduling problem is modeled as an unrelated parallel machine scheduling (UPMS) problem with sequence-dependent setup times that are subject to job release time and expiration time of allowing a job to be processed on a specific machine, defined as: R|rj,eij,STsd|Cmax. The objective is first to maximize the number of processed jobs, then minimize the maximum completion time (makespan), and finally minimize the maximum completion times of the non-bottleneck machines. A mixed-integer programming (MIP) model is proposed as a solution approach …
Advancing Ubiquitous Collaboration For Telehealth - A Framework To Evaluate Technology-Mediated Collaborative Workflow For Telehealth, Hypertension Exam Workflow Study, Christopher Bondy Ph.D., Linlin Chen Ph.D, Pamela Grover Md, Pengcheng Shi Ph.D
Advancing Ubiquitous Collaboration For Telehealth - A Framework To Evaluate Technology-Mediated Collaborative Workflow For Telehealth, Hypertension Exam Workflow Study, Christopher Bondy Ph.D., Linlin Chen Ph.D, Pamela Grover Md, Pengcheng Shi Ph.D
Articles
Healthcare systems are under siege globally regarding technology adoption; the recent pandemic has only magnified the issues. Providers and patients alike look to new enabling technologies to establish real-time connectivity and capability for a growing range of remote telehealth solutions. The migration to new technology is not as seamless as clinicians and patients would like since the new workflows pose new responsibilities and barriers to adoption across the telehealth ecosystem. Technology-mediated workflows (integrated software and personal medical devices) are increasingly important in patient-centered healthcare; software-intense systems will become integral in prescribed treatment plans [1]. My research explored the path to …
Strengthening A Linear Reformulation Of The 0-1 Cubic Knapsack Problem Via Variable Reordering, Richard Forrester, Lucas Waddell
Strengthening A Linear Reformulation Of The 0-1 Cubic Knapsack Problem Via Variable Reordering, Richard Forrester, Lucas Waddell
Faculty Journal Articles
The 0-1 cubic knapsack problem (CKP), a generalization of the classical 0-1 quadratic knapsack problem, is an extremely challenging NP-hard combinatorial optimization problem. An effective exact solution strategy for the CKP is to reformulate the nonlinear problem into an equivalent linear form that can then be solved using a standard mixed-integer programming solver. We consider a classical linearization method and propose a variant of a more recent technique for linearizing 0-1 cubic programs applied to the CKP. Using a variable reordering strategy, we show how to improve the strength of the linear programming relaxation of our proposed reformulation, which ultimately …
Data Driven Bayesian Network To Predict Critical Alarm, Joseph Mietkiewicz, Anders Madsen
Data Driven Bayesian Network To Predict Critical Alarm, Joseph Mietkiewicz, Anders Madsen
Articles
Modern industrial plants rely on alarm systems to ensure their safe and effective functioning. Alarms give the operator knowledge about the current state of the industrial plants. Trip alarms indicating a trip event indicate the shutdown of systems. Trip events in power plants can be costly and critical for the running of the operation.This paper demonstrates how trips events based on an alarm log from an offshore gas production can be reliably predicted using a Bayesian network. If a trip event is reliably predicted and the main cause of it is identified, it will allow the operator to prevent it. …
Combining Green Metrics And Digital Twins For Sustainability Planning And Governance Of Smart Buildings And Cities, Casey R. Corrado, Suzanne M. Delong, Emily G. Holt, Edward Y. Hua, Andreas Tolk
Combining Green Metrics And Digital Twins For Sustainability Planning And Governance Of Smart Buildings And Cities, Casey R. Corrado, Suzanne M. Delong, Emily G. Holt, Edward Y. Hua, Andreas Tolk
VMASC Publications
Creating a more sustainable world will require a coordinated effort to address the rise of social, economic, and environmental concerns resulting from the continuous growth of cities. Supporting planners with tools to address them is pivotal, and sustainability is one of the main objectives. Modeling and simulation augmenting digital twins can play an important role to implement these tools. Although various green best practices have been utilized over time and there are related attempts at measuring green success, works in the published literature tend to focus on addressing a single problem (e.g., energy efficiency), and a comprehensive approach that takes …
Human Ergonomic Simulation To Support The Design Of An Exoskeleton For Lashing/De-Lashing Operations Of Containers Cargo, Francesco Longo, Antonio Padovano, Vittorio Solina, Virginia D' Augusta, Stefan Venzl, Roberto Calbi, Michele Bartuni, Ornella Anastasi, Rafael Diaz
Human Ergonomic Simulation To Support The Design Of An Exoskeleton For Lashing/De-Lashing Operations Of Containers Cargo, Francesco Longo, Antonio Padovano, Vittorio Solina, Virginia D' Augusta, Stefan Venzl, Roberto Calbi, Michele Bartuni, Ornella Anastasi, Rafael Diaz
VMASC Publications
Lashing and de-lashing operations of containers cargo on board containerships are considered as quite strenuous activities in which operators are required to work continuously over a 6 or 8 hours shift with very limited break. This is mostly because containerships need to leave the port as soon as possible and containers loading and unloading operations must be executed with very high productivity (stay moored in a port is a totally unproductive time for a ship and a loss-making business for a shipping company). Operators performing lashing and de-lashing operations are subjected to intense ergonomic stress and uncomfortable working postures. To …
Towards An Instant Structure-Property Prediction Quality Control Tool For Additive Manufactured Steel Using A Crystal Plasticity Trained Deep Learning Surrogate, Yuhui Tu, Zhongzhou Liu, Luiz Carneiro, Caitriona M. Ryan, Andrew C. Parnell, Sean B. Leen
Towards An Instant Structure-Property Prediction Quality Control Tool For Additive Manufactured Steel Using A Crystal Plasticity Trained Deep Learning Surrogate, Yuhui Tu, Zhongzhou Liu, Luiz Carneiro, Caitriona M. Ryan, Andrew C. Parnell, Sean B. Leen
Research Collection School Of Computing and Information Systems
The ability to conduct in-situ real-time process-structure-property checks has the potential to overcome process and material uncertainties, which are key obstacles to improved uptake of metal powder bed fusion in industry. Efforts are underway for live process monitoring such as thermal and image-based data gathering for every layer printed. Current crystal plasticity finite element (CPFE) modelling is capable of predicting the associated strength based on a microstructural image and material data but is computationally expensive. This work utilizes a large database of input–output samples from CPFE modelling to develop a trained deep neural network (DNN) model which instantly estimates the …