Search

In recent years, emerging technologies have gained popularity and being implemented in different fields. Thus, critical leading-edge technologies such as artificial intelligence and other related technologies (blockchain, simulation, 3d printing, etc.) are transforming the operations and other traditional fields and proving their value in fighting against unprecedented COVID-19 pandemic outbreaks. However, due to this relation's novelty, little is known about the interplay between emerging technologies and COVID-19 and its implications to operations-related fields. In this vein, we mapped the extant literature on this integration by a structured literature review approach and found essential outcomes. In addition to the literature mapping, this paper's main contributions were identifying literature scarcity on this hot topic by operations-related fields; consequently, our paper emphasizes an urgent call to action. Also, we present a novel framework considering the primary emerging technologies and the operations processes concerning this pandemic outbreak. Also, we provided an exciting research agenda and four propositions derived from the framework, which are collated to operations processes angle. Thus, scholars and practitioners have the opportunity to adapt and advance the framework and empirically investigate and validate the propositions for this and other highly disruptive crisis. [ABSTRACT FROM AUTHOR]

The data revolution transforms operations, innovation, and society through artificial intelligence and advanced analytics. Data-driven innovations (DDI) have the most potential to tackle global challenges, including poverty, healthcare, climate actions, disaster management, gender inequality, peace and justice and others. This paper identifies the sources of DDI capabilities to address various global challenges. The findings show three major foundations of DDI capabilities: market orientation, infrastructure orientation, and talent orientation. Theoretically, these findings highlight the role of dynamic DDI capabilities to sense, seize and transform global challenges. Practically, we present guidelines for developing DDI in an agile and efficient manner that is fair and inclusive. [ABSTRACT FROM AUTHOR]

The coronavirus first appeared in China in 2019, and the World Health Organization (WHO) named it COVID-19. Then WHO announced this illness as a worldwide pandemic in March 2020. The number of cases, infections, and fatalities varied considerably worldwide. Because the main characteristic of COVID-19 is its rapid spread, doctors and specialists generally use PCR tests to detect the COVID-19 virus. As an alternative to PCR, X-ray images can help diagnose illness using artificial intelligence (AI). In medicine, AI is commonly employed. Convolutional neural networks (CNN) and deep learning models make it simple to extract information from images. Several options exist when creating a deep CNN. The possibilities include network depth, layer count, layer type, and parameters. In this paper, a novel Xception-based neural network is discovered using the genetic algorithm (GA). GA finds better alternative networks and parameters during iterations. The best network discovered with GA is tested on a COVID-19 X-ray image dataset. The results are compared with other networks and the results of papers in the literature. The novel network of this paper gives more successful results. The accuracy results are 0.996, 0.989, and 0.924 for two-class, three-class, and four-class datasets, respectively. [ABSTRACT FROM AUTHOR]

In this paper, a new responsive-green-cold vaccine supply chain network during the COVID-19 pandemic is developed for the first time. According to the proposed network, a new multi-objective, multi-period, multi-echelon mathematical model for the distribution-allocation-location problem is designed. Another important novelty in this paper is that it considers an Internet-of-Things application in the COVID-19 condition in the suggested model to enhance the accuracy, speed, and justice of vaccine injection with existing priorities. Waste management, environmental effects, coverage demand, and delivery time of COVID-19 vaccine simultaneously are therefore considered for the first time. The LP-metric method and meta-heuristic algorithms called Gray Wolf Optimization (GWO), and Variable Neighborhood Search (VNS) algorithms are then used to solve the developed model. The other significant contribution, based on two presented meta-heuristic algorithms, is a new heuristic method called modified GWO (MGWO), and is developed for the first time to solve the model. Therefore, a set of test problems in different sizes is provided. Hence, to evaluate the proposed algorithms, assessment metrics including (1) percentage of domination, (2) the number of Pareto solutions, (3) data envelopment analysis, and (4) diversification metrics and the performance of the convergence are considered. Moreover, the Taguchi method is used to tune the algorithm's parameters. Accordingly, to illustrate the efficiency of the model developed, a real case study in Iran is suggested. Finally, the results of this research show MGO offers higher quality and better performance than other proposed algorithms based on assessment metrics, computational time, and convergence. [ABSTRACT FROM AUTHOR]

The integration between blockchain and artificial intelligence (AI) has gained a lot of attention in recent years, especially since such integration can improve security, efficiency, and productivity of applications in business environments characterised by volatility, uncertainty, complexity, and ambiguity. In particular, supply chain is one of the areas that have been shown to benefit tremendously from blockchain and AI, by enhancing information and process resilience, enabling faster and more cost-efficient delivery of products, and augmenting products' traceability, among others. This paper performs a state-of-the-art review of blockchain and AI in the field of supply chains. More specifically, we sought to answer the following three principal questions: Q1—What are the current studies on the integration of blockchain and AI in supply chain?, Q2—What are the current blockchain and AI use cases in supply chain?, and Q3—What are the potential research directions for future studies involving the integration of blockchain and AI? The analysis performed in this paper has identified relevant research studies that have contributed both conceptually and empirically to the expansion and accumulation of intellectual wealth in the supply chain discipline through the integration of blockchain and AI. [ABSTRACT FROM AUTHOR]

Businesses nowadays often feel impelled to rush and implement Big Data and Artificial Intelligence initiatives in their organizations without clarity on their business problems, nor the appropriate methodologies for extracting actionable insights from the data. In contrast, this paper presents a process that starts with an articulated business problem instead of a "data rush". The presented process, dubbed the Business-Driven Data-Supported (BDDS) process, is rigorously anchored in concepts from Theory of Constraints and Information Theory. BDDS guides businesses in solving their problems by stating observed performance gaps, uncovering their underlying root cause, formulating the "right question", utilizing only the "right data", and choosing the "right methodology" to extract the "right information" from the data, leading to the "right actionable insights." Also provided is a prescriptive framework, dubbed the Data-to-Information-Extraction-Methodology (DIEM), for selecting the "right methodology", based on the understanding level of relevant system dependencies and the availability of relevant data. The BDDS process is illustrated by an example from the healthcare industry, and the efficacy and applicability of the DIEM framework are supported by eleven case studies from a broad range of industries. [ABSTRACT FROM AUTHOR]

This article discusses recent advances in mathematical methods for finance. It highlights the impact of developments in financial markets, technology, and societal challenges on the field of Mathematical Finance. The article also mentions the emergence of new financial products, regulatory frameworks, and trading infrastructures, as well as the revolutionary changes brought about by artificial intelligence and machine learning techniques in numerical methods for finance. Additionally, it acknowledges the growing importance of new types of risks, such as climate-related and cyber-risks, in the financial industry. The article introduces a special issue on Recent Advances in Mathematical Methods for Finance, which provides a comprehensive overview of the latest developments in the field. The special issue includes 44 papers that underwent a rigorous peer review process, covering both theoretical and applied research in mathematical finance. The authors express their gratitude to the editor and staff for the opportunity to edit the special issue and to the referees and authors for their contributions. They hope that this collection of papers will stimulate further research in the field. [Extracted from the article]

Artificial Intelligence (AI) and Big Data Analytics (BDA) have the potential to significantly improve resilience of supply chains and to facilitate more effective management of supply chain resources. Despite such potential benefits and the increase in popularity of AI and BDA in the context of supply chains, research to date is dispersed into research streams that is largely based on the publication outlet. We curate and synthesise this dispersed knowledge by conducting a systematic literature review of AI and BDA research in supply chain resilience that have been published in the Chartered Association of Business School (CABS) ranked journals between 2011 and 2021. The search strategy resulted in 522 studies, of which 23 were identified as primary papers relevant to this research. The findings advance knowledge by (i) assessing the current state of AI and BDA in supply chain literature, (ii) identifying the phases of supply chain resilience (readiness, response, recovery, adaptability) that AI and BDA have been reported to improve, and (iii) synthesising the reported benefits of AI and BDA in the context of supply chain resilience. [ABSTRACT FROM AUTHOR]

The Optimal Multivariate Mixture Problem (OMMP) consists of finding an optimal mixture which, starting from a set of elements (items) described by a set of variables (features), is as close as possible to an ideal solution. This problem has numerous applications spanning various fields, including food science, agriculture, chemistry, materials science, medicine, and pharmaceuticals. The OMMP is a class of optimization problems that can be addressed using traditional Operations Research (OR) approaches. However, it can also be effectively tackled using meta-heuristic techniques within Artificial Intelligence (AI). This paper aims to present an Artificial Intelligence perspective. It proposes a Genetic Algorithm (GA) for Optimal Multivariate Mixture (GA-OMM), a novel improved version of a GA whose modified genetic operators prove to improve the exploration efficiency. Here, the algorithm is described in its general framework, and a test case 8-items 5-features is conducted to evaluate efficiency by exploring various combinations of hyperparameters. Test cases are also set up for the previous version, as well as a linear programming (LP) approach. The data experiments indicate that the proposed GA is efficient, converges towards the global optimum, consistently outperforms its predecessor, and delivers highly competitive results. In particular, GA-OMM shows an average fitness of GA-OMMP/LP and standard deviation with an order of magnitude ranging between 10-8\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$10^{-8}$$\end{document} to 10-4\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$10^{-4}$$\end{document}. Moreover, it consistently outperforms its predecessor, which exhibits similar values around 10-3\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$10^{-3}$$\end{document} [ABSTRACT FROM AUTHOR]

Artificial Intelligence (AI) is critical for data-driven decision making to increase resource utilization, operational performance, and service quality in various industry domains, particularly in healthcare. Using AI in healthcare operations can significantly improve treatment outcomes and enhance patient satisfaction while reducing costs. In this paper, we propose a multi-stage framework to build an AI-based decision support tool that can predict the 5-year survivability of lung cancer patients. We evaluate the proposed framework using the Surveillance, Epidemiology, and End Results dataset pertaining to the 1973–2015 period obtained from the National Institutes of Health. The first stage entails data preprocessing and target creation. The second stage applies six AI algorithms with feature selection through Particle Swarm Optimization and hyperparameter tuning with Cross-Validation. These Algorithms include Logistic Regression, Decision Trees, Random Forests (RF), Adaptive Boosting (AdaBoost), Artificial Neural Network, and Naïve Bayes. The results show that RF and AdaBoost models yield an AUC rate of 0.94 and outperform the other models. Stage 3 utilizes permutation importance to interpret the RF and AdaBoost models and applies Tree-based Augmented Naïve Bayes to gain insights regarding the interrelations among important features. The results of Stage 3 delineate that the number of lymph nodes containing metastases), the number of tumors that patients have had in their lifetime, the patient's age, and the microscopic composition of cells rank among the topmost important features and can significantly impact patient survivability. We think this study has significant practical implications in helping physicians predict prognosis and develop treatment plans for lung cancer patients. [ABSTRACT FROM AUTHOR]

This paper reviews real estate price estimation in France, a market that has received little attention. We compare seven popular machine learning techniques by proposing a different approach that quantifies the relevance of location features in real estate price estimation with high and fine levels of granularity. We take advantage of a newly available open dataset provided by the French government that contains 5 years of historical data of real estate transactions. At a high level of granularity, we obtain important differences regarding the models' prediction powers between cities with medium and high standards of living (precision differences beyond 70% in some cases). At a low level of granularity, we use geocoding to add precise geographical location features to the machine learning algorithm inputs. We obtain important improvements regarding the models' forecasting powers relative to models trained without these features (improvements beyond 50% for some forecasting error measures). Our results also reveal that neural networks and random forest techniques particularly outperform other methods when geocoding features are not accounted for, while random forest, adaboost and gradient boosting perform well when geocoding features are considered. For identifying opportunities in the real estate market through real estate price prediction, our results can be of particular interest. They can also serve as a basis for price assessment in revenue management for durable and non-replenishable products such as real estate. [ABSTRACT FROM AUTHOR]

This paper is motivated by the widespread availability of AI tools, whose adoption and consequent benefits are still not well understood. As a first step, some critical issues that relate to AI tools in general, humans in the context of AI tools, and AI tools in the context of operations management are identified. A discussion of how these issues could hinder employee adoption and use of AI tools is presented. Building on this discussion, the unified theory of acceptance and use of technology is used as a theoretical basis to propose individual characteristics, technology characteristics, environmental characteristics and interventions as viable research directions that could not only contribute to the adoption literature, particularly as it relates to AI tools, but also, if pursued, such research could help organizations positively influence the adoption of AI tools. [ABSTRACT FROM AUTHOR]

Operations research (OR) has been at the core of decision making since World War II, and today, business interactions on different platforms have changed business dynamics, introducing a high degree of uncertainty. To have a sustainable vision of their business, firms need to have a suitable decision-making process at each stage, including minute details. Our study reviews and investigates the existing research in the field of decision support systems (DSSs) and how artificial intelligence (AI) capabilities have been integrated into OR. The findings of our review show how AI has contributed to decision making in the operations research field. This review presents synergies, differences, and overlaps in AI, DSSs, and OR. Furthermore, a clarification of the literature based on the approaches adopted to develop the DSS is presented along with the underlying theories. The classification has been primarily divided into two categories, i.e. theory building and application-based approaches, along with taxonomies based on the AI, DSS, and OR areas. In this review, past studies were calibrated according to prognostic capability, exploitation of large data sets, number of factors considered, development of learning capability, and validation in the decision-making framework. This paper presents gaps and future research opportunities concerning prediction and learning, decision making and optimization in view of intelligent decision making in today's era of uncertainty. The theoretical and managerial implications are set forth in the discussion section justifying the research questions. [ABSTRACT FROM AUTHOR]

Artificial intelligence by principle is developed to assist but also support decision making processes. In our study, we explore how information retrieved from social media can assist decision-making processes for new product development (NPD). We focus on consumers' emotions that are expressed through social media and analyse the variations of their sentiments in all the stages of NPD. We collect data from Twitter that reveal consumers' appreciation of aspects of the design of a newly launched model of an innovative automotive company. We adopt the sensemaking approach coupled with the use of fuzzy logic for text mining. This combinatory methodological approach enables us to retrieve consensus from the data and to explore the variations of sentiments of the customers about the product and define the polarity of these emotions for each of the NPD stages. The analysis identifies sensemaking patterns in Twitter data and explains the NPD process and the associated steps where the social interactions from customers can have an iterative role. We conclude the paper by outlining an agenda for future research in the NPD process and the role of the customer opinion through sensemaking mechanisms. [ABSTRACT FROM AUTHOR]

The quay crane scheduling problem is one of the major problems of quayside operational planning in container terminals. The operational efficiency of quay cranes is a large determinant of the overall container terminal efficiency; thus, in an effort to maximize throughput, more and more emphasis is placed on systematically addressing and improving quay crane operations. However, the resulting formulations are highly complex and thus not solvable using commercial software. In the first part of the present paper, we develop a formulation that overcomes this challenge. This allows for solving the model using CPLEX, even for large size instances, which other notable work from the literature fails to solve. The second part of this paper addresses a crucial point which has rarely been accounted for, which is ship stability. A heuristic is developed to solve the extended problem, as it is no longer solvable in CPLEX. The remaining objective of this work is to extend this problem to the multi-ship case. However, once again the problem is insolvable for large instances using CPLEX, even without accounting for stability constraints. We develop a Lagrangian relaxation based algorithm that decomposes the problem by ship, which is solved efficiently as a single ship case. The Lagrangian multipliers are updated using the cutting plane method and the solution of the Lagrangian master problem provides an upper bound on the optimal value of the Lagrangian lower bound. Upper bounds on the optimal value of the original problem are obtained using a constructive heuristic, and through computational experiments we demonstrate the performance of the Lagrangian relaxation-based procedures. [ABSTRACT FROM AUTHOR]

This paper addresses a generalization of the coupled-operations scheduling problem in the context of a flow shop environment. We consider the two-machine scheduling problem with the objective of minimizing the makespan. Each job consists of a coupled-operation to be processed first on the first machine and a single operation to be then processed on the second machine. A coupled-operation contains two operations separated by an exact time delay. The single operation can start on the second machine only when the coupled-operation on the first machine is completed. We prove the NP-completeness of two restricted versions of the general problem, whereas we also exhibit several other well solvable cases. [ABSTRACT FROM AUTHOR]

Personnel scheduling problems have attracted research interests for several decades. They have been considerably changed over time, accommodating a variety of constraints related to legal and organisation requirements, part-time staff, flexible hours of staff, staff preferences, etc. This led to a myriad of approaches developed for solving personnel scheduling problems including optimisation, meta-heuristics, artificial intelligence, decision-support, and also hybrids of these approaches. However, this still does not imply that this research has a large impact on practice and that state-of-the art models and algorithms are widely in use in organisations. One can find a reasonably large number of software packages that aim to assist in personnel scheduling. A classification of this software based on its purpose will be proposed, accompanied with a discussion about the level of support that this software offers to schedulers. A general conclusion is that the available software, with some exceptions, does not benefit from the wealth of developed models and methods. The remaining of the paper will provide insights into some characteristics of real-world scheduling problems that, in the author's opinion, have not been given a due attention in the personnel scheduling research community yet and which could contribute to the enhancement of the implementation of research results in practice. Concluding remarks are that in order to bridge the gap that still exists between research into personnel scheduling and practice, we need to engage more with schedulers in practice and also with software developers; one may say we need to get wet if we want to learn how to swim. [ABSTRACT FROM AUTHOR]

The multiobjective set covering problem (MOSCP), a challenging combinatorial optimization problem, has received limited attention in the literature. This paper presents a heuristic algorithm to approximate the Pareto set of the MOSCP. The proposed algorithm applies a local branching approach on a tree structure and is enhanced with a node exploration strategy specially developed for the MOSCP. The main idea is to partition the search region into smaller subregions based on the neighbors of a reference solution and then to explore each subregion for the Pareto points of the MOSCP. Numerical experiments for instances with two, three and four objectives set covering problems are reported. Results on a performance comparison with benchmark algorithms from the literature are also included and show that the new algorithm is competitive and performs best on some instances. [ABSTRACT FROM AUTHOR]

The Quadratic Assignment Problem (QAP) is known as one of the most difficult problems within combinatorial optimization. It is used to model many practical problems including different layout problems. The main topic of this paper is to provide methods to check whether a particular instance of the QAP is a layout problem. An instance is a layout problem if the distances of the objects can be reconstructed on the plane and/or in the 3-dimensional space. A new mixed integer programming model is suggested for the case if the distances of the objects are supposed to be rectilinear distances. If the distances are Euclidean distances then the use of the well-known Multi-Dimensional Scaling (MDS) method of statistics is suggested for reconstruction purposes. The well-known difficulty of QAP makes it a popular and suitable experimental field for many algorithmic ideas including artificial intelligence methods. These types of results are published sometimes as layout problems. The methods of reconstruction can be used to decide whether the topic of a paper is layout or only general QAP. The issue what the OR community should expect from AI based algorithms, is also addressed. [ABSTRACT FROM AUTHOR]

Learning is a general concept, playing an important role in many Artificial intelligence domains. In this paper, we address the learning paradigm used to explain failures or conflicts encountered during search. This explanation, derived by conflict analysis, and generally expressed as a new constraint, is usually used to dynamically avoid future occurrences of similar situations. Before focusing on clause learning in Boolean satisfiability (SAT), we first overview some important works on this powerful reasoning tool in other domains such as constraint satisfaction and truth maintenance systems. Then, we present a comprehensive survey of the most important works having led to what is called today-conflict driven clause learning-which is one of the key components of modern SAT solvers. We also overview some of the original extensions or variants of clauses learning. In theory, current SAT solvers with clause learning are as powerful as general resolution proof systems. In practice, real-world SAT instances with millions of variables and clauses are now in the scope of this solving paradigm. [ABSTRACT FROM AUTHOR]

Despite decades of research into automated methods for nurse rostering and some academic successes, one may notice that there is no consistency in the knowledge that has been built up over the years and that many healthcare institutions still resort to manual practices. One of the possible reasons for this gap between the nurse rostering theory and practice is that often the academic community focuses on the development of new techniques rather than developing systems for healthcare institutions. In addition, methods suitable for one problem are usually not easily transferable to other problems. In real-world healthcare environments, a personnel manager cannot afford to model a problem and construct a roster using available approaches in order to quantitatively determine which one suits best. There is a lack of criteria for the comparison of approaches to provide a clear picture about their advantages and disadvantages and therefore their suitability to a problem in hand. This paper introduces seven criteria: expressive power, flexibility, algorithmic power, learning capabilities, maintenance, rescheduling capabilities, and parameter tuning, that may offer guidance to researchers and developers of systems for nurse rostering. Two approaches to nurse rostering, which are of very different nature, are evaluated and compared against the introduced criteria. One approach is based on meta-heuristics, while the other employs case-based reasoning. [ABSTRACT FROM AUTHOR]

In agriculture Markov decision processes (MDPs) with finite state and action space are often used to model sequential decision making over time. For instance, states in the process represent possible levels of traits of the animal and transition probabilities are based on biological models estimated from data collected from the animal or herd. State space models (SSMs) are a general tool for modeling repeated measurements over time where the model parameters can evolve dynamically. In this paper we consider methods for embedding an SSM into an MDP with finite state and action space. Different ways of discretizing an SSM are discussed and methods for reducing the state space of the MDP are presented. An example from dairy production is given. [ABSTRACT FROM AUTHOR]