Search results

This study examined how people assess health information from AI and improve their diagnostic ability to identify health misinformation. The proposed model was designed to test a cognitive heuristic theory in misinformation discernment.

We proposed the heuristic-systematic model to assess health misinformation processing in the algorithmic context. Using the Analysis of Moment Structure (AMOS) 26 software, we tested fairness/transparency/accountability (FAccT) as constructs that influence the heuristic evaluation and systematic discernment of misinformation by users. To test moderating and mediating effects, PROCESS Macro Model 4 was used.

The effect of AI-generated misinformation on people’s perceptions of the veracity of health information may differ according to whether they process misinformation heuristically or systematically. Heuristic processing is significantly associated with the diagnosticity of misinformation. There is a greater chance that misinformation will be correctly diagnosed and checked, if misinformation aligns with users’ heuristics or is validated by the diagnosticity they perceive.

When exposed to misinformation through algorithmic recommendations, users’ perceived diagnosticity of misinformation can be predicted accurately from their understanding of normative values. This perceived diagnosticity would then positively influence the accuracy and credibility of the misinformation.

Perceived diagnosticity exerts a key role in fostering misinformation literacy, implying that improving people’s perceptions of misinformation and AI features is an efficient way to change their misinformation behavior.

Although there is broad agreement on the need to control and combat health misinformation, the magnitude of this problem remains unknown. It is essential to understand both users’ cognitive processes when it comes to identifying health misinformation and the diffusion mechanism from which such misinformation is framed and subsequently spread.

The mechanisms through which users process and spread misinformation have remained open-ended questions. This study provides theoretical insights and relevant recommendations that can make users and firms/institutions alike more resilient in protecting themselves from the detrimental impact of misinformation.

The peer review history for this article is available at: https://publons.com/publon/10.1108/OIR-04-2023-0167

This study aims to propose and evaluate the progress in the basic-pixel (a strategy to generate continuous trajectories that fill out the entire surface) algorithm towards performance gain. The objective is also to investigate the operational efficiency and effectiveness of an enhanced version compared with conventional strategies.

For the first objective, the proposed methodology is to apply the improvements proposed in the basic-pixel strategy, test it on three demonstrative parts and statistically evaluate the performance using the distance trajectory criterion. For the second objective, the enhanced-pixel strategy is compared with conventional strategies in terms of trajectory distance, build time and the number of arcs starts and stops (operational efficiency) and targeting the nominal geometry of a part (operational effectiveness).

The results showed that the improvements proposed to the basic-pixel strategy could generate continuous trajectories with shorter distances and comparable building times (operational efficiency). Regarding operational effectiveness, the parts built by the enhanced-pixel strategy presented lower dimensional deviation than the other strategies studied. Therefore, the enhanced-pixel strategy appears to be a good candidate for building more complex printable parts and delivering operational efficiency and effectiveness.

This paper presents an evolution of the basic-pixel strategy (a space-filling strategy) with the introduction of new elements in the algorithm and proves the improvement of the strategy’s performance with this. An interesting comparison is also presented in terms of operational efficiency and effectiveness between the enhanced-pixel strategy and conventional strategies.

This work aims to provide a rapid robust optimization design solution for parallel robots or mechanisms, thereby circumventing inefficiencies and wastage caused by empirical design, as well as numerous physical verifications, which can be employed for creating high-quality prototypes of parallel robots in a variety of applications.

A novel subregional meta-heuristic iteration (SMI) method is proposed for the optimization of parallel robots. Multiple subregional optimization objectives are established and optimization is achieved through the utilisation of an enhanced meta-heuristic optimization algorithm, which roughly employs chaotic mapping in the initialization strategy to augment the diversity of the initial solution. The non-dominated sorting method is utilised for updating strategies, thereby achieving multi-objective optimization.

The actuator error under the same trajectory is visibly reduced after SMI, with a maximum reduction of 6.81% and an average reduction of 1.46%. Meanwhile, the response speed, maximum bearing capacity and stiffness of the mechanism are enhanced by 63.83, 43.98 and 97.51%, respectively. The optimized mechanism is more robust and the optimization process is efficient.

The proposed robustness multi-objective optimization via SMI is more effective in improving the performance and precision of the parallel mechanisms in various applications. Furthermore, it provides a solution for the rapid and high-quality optimization design of parallel robots.

This research introduces an innovation strategy aimed at bolstering the reliability of a renewable energy resource, which is hybrid energy systems, through the application of a metaheuristic algorithm. The growing need for sustainable energy solutions underscores the importance of integrating various energy sources effectively. Concentrating on the intermittent characteristics of renewable sources, this study seeks to create a highly reliable hybrid energy system by combining photovoltaic (PV) and wind power.

To obtain efficient renewable energy resources, system designers aim to enhance the system’s reliability. Generally, for this purpose, the reliability redundancy allocation problem (RRAP) method is utilized. The authors have also introduced a new methodology, named Reliability Redundancy Allocation Problem with Component Mixing (RRAP-CM), for optimizing systems’ reliability. This method incorporates heterogeneous components to create a nonlinear mixed-integer mathematical model, classified as NP-hard problems. We employ specially crafted metaheuristic algorithms as optimization strategies to address these challenges and boost the overall system performance.

The study introduces six newly designed metaheuristic algorithms. Solve the optimization problem. When comparing results between the traditional RRAP method and the innovative RRAP-CM method, enhanced reliability is achieved through the blending of diverse components. The use of metaheuristic algorithms proves advantageous in identifying optimal configurations, ensuring resource efficiency and maximizing energy output in a hybrid energy system.

The study’s findings have significant social implications because they contribute to the renewable energy field. The proposed methodologies offer a flexible and reliable mechanism for enhancing the efficiency of hybrid energy systems. By addressing the intermittent nature of renewable sources, this research promotes the design of highly reliable sustainable energy solutions, potentially influencing global efforts towards a more environmentally friendly and reliable energy landscape.

The research provides practical insights by delivering a comprehensive analysis of a hybrid energy system incorporating both PV and wind components. Also, the use of metaheuristic algorithms aids in identifying optimal configurations, promoting resource efficiency and maximizing reliability. These practical insights contribute to advancing sustainable energy solutions and designing efficient, reliable hybrid energy systems.

This work is original as it combines the RRAP-CM methodology with six new robust metaheuristics, involving the integration of diverse components to enhance system reliability. The formulation of a nonlinear mixed-integer mathematical model adds complexity, categorizing it as an NP-hard problem. We have developed six new metaheuristic algorithms. Designed specifically for optimization in hybrid energy systems, this further highlights the uniqueness of this approach to research.

As laser scanning technology becomes readily available and affordable, there is an increasing demand of using point cloud data collected from a laser scanner to create as-built building information modeling (BIM) models for quality assessment, schedule control and energy performance within construction projects. To enhance the as-built modeling efficiency, this study explores an integrated system, called Auto-Scan-To-BIM (ASTB), with an aim to automatically generate a complete Industry Foundation Classes (IFC) model consisted of the 3D building elements for the given building based on its point cloud without requiring additional modeling tools.

ASTB has been developed with three function modules. Taking the scanned point data as input, Module 1 is built on the basis of the widely used region segmentation methodology and expanded with enhanced plane boundary line detection methods and corner recalibration algorithms. Then, Module 2 is developed with a domain knowledge-based heuristic method to analyze the features of the recognized planes, to associate them with corresponding building elements and to create BIM models. Based on the spatial relationships between these building elements, Module 3 generates a complete IFC model for the entire project compatible with any BIM software.

A case study validated the ASTB with an application with five common types of building elements (e.g. wall, floor, ceiling, window and door).

First, an integrated system, ASTB, is developed to generate a BIM model from scanned point cloud data without using additional modeling tools. Second, an enhanced plane boundary line detection method and a corner recalibration algorithm are developed in ASTB with high accuracy in obtaining the true surface planes. At last, the research contributes to develop a module, which can automatically convert the identified building elements into an IFC format based on the geometry and spatial relationships of each plan.

The purpose of this study is to formulate a new class of vehicle routing problem with an objective to minimise the total cost of raw material collection and derive a new approach to solve optimization problems. This study can help to select the optimum number of suppliers based on cost.

To model the raw material vehicle routing problem, a mixed integer linear programming (MILP) problem is formulated. An interesting phenomenon added to the proposed problem is that there is no compulsion to visit all suppliers. To guarantee the demand of semiconductor industry, all visited suppliers should reach a given raw material capacity requirement. To solve the proposed model, the authors developed a novel hybrid approach that is a combination of block and edge recombination approaches. To avoid bias, the authors compare the results of the proposed methodology with other known approaches, such as genetic algorithms (GAs) and ant colony optimisation (ACO).

The findings indicate that the proposed model can be useful in industries, where multiple suppliers are used. The proposed hybrid approach provides a better sequence of suppliers compared to other heuristic techniques.

The data used in the proposed model is generated based on previous literature. The problem derives from the assumption that semiconductor industries use a variety of raw materials.

This study provides a new model and approach that can help practitioners and policymakers select suppliers based on their logistics costs.

This study provides two important contributions in the context of the supply chain. First, it provides a new variant of the vehicle routing problem in consideration of raw material collection; and second, it provides a new approach to solving optimisation problems.

This work conducts a comprehensive analysis of how to incorporate resilience and sustainability into capacity expansion strategies for business-to-business (B2B) chemical supply chains. This study aims to guide both researchers and managers on ensuring profitability in B2B chemical supply chains while minimizing environmental impacts, complying with regulations and mitigating disruptions and risks.

A systematic literature review is conducted to analyze the interplay between sustainability and resilience in chemical B2B supply chains, specify the quantitative and qualitative methods used to tackle this challenge and identify the drivers and barriers concerning capacity expansion. In addition, a comprehensive conceptual framework is suggested to outline a compelling research agenda.

The findings emphasize the increasing importance of modeling and resolving decision-making challenges related to sustainable and resilient supply chains, particularly in capital-intensive chemical industries. Yet, there is no standardized strategy for addressing these challenges. The predominant solution methods are heuristic and metaheuristic, and the selection of performance metrics tends to be empirical and tailored to specific cases. The main barriers to achieving sustainability and resilience arise from resource limitations within the supply chain. Conversely, the key drivers of performance focus on enhancing efficiency, competitiveness, cost effectiveness and risk management.

This work offers practitioners a conceptual framework that synthesizes the knowledge and tackles the challenges of designing sustainable and resilient supply chains as well as managing their operations in the context of B2B chemical supply chains. Results provide a practical guide for navigating the complex interplay of sustainability, resilience and chemical supply chain expansion.

The key concepts and dimensions associated with capacity expansion planning for a resilient and sustainable chemical supply chain are identified through structured and comprehensive analyses of existing literature. A conceptual framework is proposed for delineating the intersections among sustainability, resilience and chemical supply chain expansions. This mapping endeavor aims to facilitate a future characterized by the deployment of a nexus of resilience and sustainability in chemical supply chains. To this end, a promising future research agenda is accordingly outlined.

The purpose of this research is to address the complex multiobjective unrelated parallel machine scheduling problem with real-world constraints, including sequence-dependent setup times and periodic machine maintenance. The primary goal is to minimize total tardiness, earliness and total completion times simultaneously. This study aims to provide effective solution methods, including a Mixed-Integer Programming (MIP) model, an Epsilon-constraint method and the Nondominated Sorting Genetic Algorithm (NSGA-II), to offer valuable insights into solving large-sized instances of this challenging problem.

This study addresses a multiobjective unrelated parallel machine scheduling problem with sequence-dependent setup times and periodic machine maintenance activities. An MIP model is introduced to formulate the problem, and an Epsilon-constraint method is applied for a solution. To handle the NP-hard nature of the problem for larger instances, an NSGA-II is developed. The research involves the creation of 45 problem instances for computational experiments, which evaluate the performance of the algorithms in terms of proposed measures.

The research findings demonstrate the effectiveness of the proposed solution approaches for the multiobjective unrelated parallel machine scheduling problem. Computational experiments on 45 generated problem instances reveal that the NSGA-II algorithm outperforms the Epsilon-constraint method, particularly for larger instances. The algorithms successfully minimize total tardiness, earliness and total completion times, showcasing their practical applicability and efficiency in handling real-world scheduling scenarios.

This study contributes original value by addressing a complex multiobjective unrelated parallel machine scheduling problem with real-world constraints, including sequence-dependent setup times and periodic machine maintenance activities. The introduction of an MIP model, the application of the Epsilon-constraint method and the development of the NSGA-II algorithm offer innovative approaches to solving this NP-hard problem. The research provides valuable insights into efficient scheduling methods applicable in various industries, enhancing decision-making processes and operational efficiency.

Compared to traditional (domestic) e-commerce consumers, cross-border electronic commerce (CBEC) consumers may face greater information asymmetry in the CBEC purchase process. Given this background, however, the literature has paid limited attention to the informational antecedents that influence consumers' perceptions of transaction costs and their CBEC purchase intentions. To fill this gap, this study integrates the elaboration likelihood model (ELM) and transaction cost theory (TCT) to develop a model for exploring how product (website informativeness, product diagnosticity and website interactivity as the central route) and external (country brand, website policy and vendor reputation as the peripheral route) informational antecedents affect consumers’ evaluations of transaction costs in terms of uncertainty and asset specificity and their CBEC purchase intentions.

This study employs a survey approach to validate the model with 766 Generation Z CBEC consumers based on judgment sampling. The partial least squares (PLS) technique is adopted for data analysis.

The results show that all the proposed central and peripheral informational antecedents reduce consumers’ perceptions of uncertainty and asset specificity, which in turn negatively influences their CBEC purchase intentions.

Through this investigation, this study increases our understanding of how product and external informational antecedents affect consumers’ evaluations of transaction costs, which subsequently determine their CBEC purchase decisions. This study offers theoretical contributions to existing CBEC research and has practical implications for CBEC organizations and managers.

The purpose of this paper is to develop a typology of heuristics in business relationships. We distinguish between four categories: (1) general heuristics used in the context of a business relationship but that may also (and are often) used in other contexts; (2) relational context heuristics that are typically used in a relational context; (3) relational information heuristics that rely on relational information and (4) genuine relational heuristics that use relational information and are applied in relational contexts.

We draw on existing literature on heuristics and business relationships to inform our conceptual paper.

We apply this typology and discuss specific heuristics that fall under the different categories of our typology. These include word-of-mouth, tit-for-tat, imitation, friendliness, recognition and trust.

We contribute to the heuristics literature by providing a novel typology of heuristics in business relationships. Emphasizing the interdependence between heuristics and business relationships, we identify genuine relational heuristics that capture the bidirectional relationships between business relationships and heuristics. Second, we contribute to the business relationships literature by providing a conceptual framework for understanding the types of heuristics managers use in business relationships and by discussing examples of specific heuristics and how they are applied in relational contexts.

We contribute to practice by providing a simple framework for making sense out of the “universe” of heuristics for business relationships.

Our paper provides a novel typology for understanding heuristics in business relationships.