Search results

The Multi-Stakeholder Recommendation System learns consumer and producer preferences to make fair and balanced recommendations. Exclusive consumer-focused studies have improved the recommendation accuracy but lack in addressing producers' priorities for promoting their diverse items to target consumers, resulting in minimal utility gain for producers. These techniques also neglect latent and implicit stakeholders' preferences across item categories. Hence, this study proposes a personalized diversity-based optimized multi-stakeholder recommendation system by developing the deep learning-based diversity personalization model and establishing the trade-off relationship among stakeholders.

The proposed methodology develops the deep autoencoder-based diversity personalization model to investigate the producers' latent interest in diversity. Next, this work builds the personalized diversity-based objective function by evaluating the diversity distribution of producers' preferences in different item categories. Next, this work builds the multi-stakeholder, multi-objective evolutionary algorithm to establish the accuracy-diversity trade-off among stakeholders.

The experimental and evaluation results over the Movie Lens 100K and 1M datasets demonstrate that the proposed models achieve the minimum average improvement of 40.81 and 32.67% over producers' utility and maximum improvement of 7.74 and 9.75% over the consumers' utility and successfully deliver the trade-off recommendations.

The proposed algorithm for measuring and personalizing producers' diversity-based preferences improves producers' exposure and reach to various users. Additionally, the trade-off recommendation solution generated by the proposed model ensures a balanced enhancement in both consumer and producer utilities.

Communities representing groups of agents with similar interests or functions are one of the essential features of complex networks. Finding communities in real-world networks is critical for analyzing complex systems in various areas ranging from collaborative information to political systems. Given the different characteristics of networks and the capability of community detection in handling a plethora of societal problems, community detection methods represent an emerging area of research. Contributing to this field, the authors propose a new community detection algorithm based on the hybridization of node and link granulation.

The proposed algorithm utilizes a rough set-theoretic concept called closure on networks. Initial sets are constructed by using neighborhood topology around the nodes as well as links and represented as two different categories of granules. Subsequently, the authors iteratively obtain the constrained closure of these sets. The authors use node mutuality and link mutuality as merging criteria for node and link granules, respectively, during the iterations. Finally, the constrained closure subsets of nodes and links are combined and refined using the Jaccard similarity coefficient and a local density function to obtain communities in a binary network.

Extensive experiments conducted on twelve real-world networks followed by a comparison with state-of-the-art methods demonstrate the viability and effectiveness of the proposed algorithm.

The study also contributes to the ongoing effort related to the application of soft computing techniques to model complex systems. The extant literature has integrated a rough set-theoretic approach with a fuzzy granular model (Kundu and Pal, 2015) and spectral clustering (Huang and Xiao, 2012) for node-centric community detection in complex networks. In contributing to this stream of work, the proposed algorithm leverages the unexplored synergy between rough set theory, node granulation and link granulation in the context of complex networks. Combined with experiments of network datasets from various domains, the results indicate that the proposed algorithm can effectively reveal co-occurring disjoint, overlapping and nested communities without necessarily assigning each node to a community.

This study carries important practical implications for complex adaptive systems in business and management sciences, in which entities are increasingly getting organized into communities (Jacucci et al., 2006). The proposed community detection method can be used for network-based fraud detection by enabling experts to understand the formation and development of fraudulent setups with an active exchange of information and resources between the firms (Van Vlasselaer et al., 2017). Products and services are getting connected and mapped in every walk of life due to the emergence of a variety of interconnected devices, social networks and software applications.

The proposed algorithm could be extended for community detection on customer trajectory patterns and design recommendation systems for online products and services (Ghose et al., 2019; Liu and Wang, 2017). In line with prior research, the proposed algorithm can aid companies in investigating the characteristics of implicit communities of bloggers or social media users for their services and products so as to identify peer influencers and conduct targeted marketing (Chau and Xu, 2012; De Matos et al., 2014; Zhang et al., 2016). The proposed algorithm can be used to understand the behavior of each group and the appropriate communication strategy for that group. For instance, a group using a specific language or following a specific account might benefit more from a particular piece of content than another group. The proposed algorithm can thus help in exploring the factors defining communities and confronting many real-life challenges.

This work is based on a theoretical argument that communities in networks are not only based on compatibility among nodes but also on the compatibility among links. Building up on the aforementioned argument, the authors propose a community detection method that considers the relationship among both the entities in a network (nodes and links) as opposed to traditional methods, which are predominantly based on relationships among nodes only.

Driven by sustainable production, mobile robots are introduced as a new clean-energy material handling tool for mixed-model assembly lines (MMALs), which reduces energy consumption and lineside inventory of workstations (LSI). Nevertheless, the previous part feeding scheduling method was designed for conventional material handling tools without considering the flexible spatial layout of the robotic mobile fulfillment system (RMFS). To fill this gap, this paper focuses on a greening mobile robot part feeding scheduling problem with Just-In-Time (JIT) considerations, where the layout and number of pods can be adjusted.

A novel hybrid-load pod (HL-pod) and mobile robot are proposed to carry out part feeding tasks between material supermarkets and assembly lines. A bi-objective mixed-integer programming model is formulated to minimize both total energy consumption and LSI, aligning with environmental and sustainable JIT goals. Due to the NP-hard nature of the proposed problem, a chaotic differential evolution algorithm for multi-objective optimization based on iterated local search (CDEMIL) algorithm is presented. The effectiveness of the proposed algorithm is verified by dealing with the HL-pod-based greening part feeding scheduling problem in different problem scales and compared to two benchmark algorithms. Managerial insights analyses are conducted to implement the HL-pod strategy.

The CDEMIL algorithm's ability to produce Pareto fronts for different problem scales confirms its effectiveness and feasibility. Computational results show that the proposed algorithm outperforms the other two compared algorithms regarding solution quality and convergence speed. Additionally, the results indicate that the HL-pod performs better than adopting a single type of pod.

This study proposes an innovative solution to the scheduling problem for efficient JIT part feeding using RMFS and HL-pods in automobile MMALs. It considers both the layout and number of pods, ensuring a sustainable and environmental-friendly approach to production.

The proposed model has been aimed to predict stock market signals by designing an accurate model. In this sense, the stock market is analysed by the technical analysis of Japanese Candlestick, which is combined by the following meta heuristic algorithms: support vector machine (SVM), meta-heuristic algorithms, particle swarm optimization (PSO), imperialist competition algorithm (ICA) and genetic algorithm (GA).

In addition, among the developed algorithms, the most effective one is chosen to determine probable sell and buy signals. Moreover, the authors have proposed comparative results to validate the designed model in this study with the same basic models of three articles in the past. Hence, PSO is used as a classification method to search the solution space absolutelyand with the high speed of running. In terms of the second model, SVM and ICA are examined by the time. Where the ICA is an improver for the SVM parameters. Finally, in the third model, SVM and GA are studied, where GA acts as optimizer and feature selection agent.

Results have been indicated that, the prediction accuracy of all new models are high for only six days, however, with respect to the confusion matrixes results, it is understood that the SVM-GA and SVM-ICA models have correctly predicted more sell signals, and the SCM-PSO model has correctly predicted more buy signals. However, SVM-ICA has shown better performance than other models considering executing the implemented models.

In this study, the authors to analyze the data the long length of time between the years 2013–2021, makes the input data analysis challenging. They must be changed with respect to the conditions.

In this study, two methods have been developed in a candlestick model, they are raw based and signal-based approaches which the hit rate is determined by the percentage of correct evaluations of the stock market for a 16-day period.

Recent United Nations Climate Change Conferences recognise extreme climate change of heatwaves, floods and droughts as threatening risks to the resilience and success of public–private partnership (PPP) infrastructure projects. Such conferences together with available project reports and empirical studies recommend project managers and practitioners to adopt smart technologies and develop robust measures to tackle climate risk exposure. Comparatively, artificial intelligence (AI) risk management tools are better to mitigate climate risk, but it has been inadequately explored in the PPP sector. Thus, this study aims to explore the tools and roles of AI in climate risk management of PPP infrastructure projects.

Systematically, this study compiles and analyses 36 peer-reviewed journal articles sourced from Scopus, Web of Science, Google Scholar and PubMed.

The results demonstrate deep learning, building information modelling, robotic automations, remote sensors and fuzzy logic as major key AI-based risk models (tools) for PPP infrastructures. The roles of AI in climate risk management of PPPs include risk detection, analysis, controls and prediction.

For researchers, the findings provide relevant guide for further investigations into AI and climate risks within the PPP research domain.

This article highlights the AI tools in mitigating climate crisis in PPP infrastructure management.

This article provides strong arguments for the utilisation of AI in understanding and managing numerous challenges related to climate change in PPP infrastructure projects.

The time-varying equivalent linear temperature gradient (ELTG) significantly affects the development of faulting and must therefore be accounted for in pavement design. The same is true for faulting of bonded concrete overlays of asphalt (BCOA) with slabs larger than 3 x 3 m. However, the evaluation of ELTG in Mechanistic-Empirical (ME) BCOA design is highly time-consuming. The use of an effective ELTG (EELTG) is an efficient alternative to calculating ELTG. In this study, a model to quickly evaluate EELTG was developed for faulting in BCOA for panels 3 m or longer in size, whose faulting is sensitive to ELTG.

A database of EELTG responses was generated for 144 BCOAs at 169 locations throughout the continental United States, which was used to develop a series of prediction models. Three methods were evaluated: multiple linear regression (MLR), artificial neural networks (ANNs), and multi-gene genetic programming (MGGP). The performance of each method was compared, considering both accuracy and model complexity.

It was shown that ANNs display the highest accuracy, with an R² of 0.90 on the validation dataset. MLR and MGGP models achieved R² of 0.73 and 0.71, respectively. However, these models consisted of far fewer free parameters as compared to the ANNs. The model comparison performed in this study highlights the need for researchers to consider the complexity of models so that their direct implementation is feasible.

This research produced a rapid EELTG prediction model for BCOAs that can be incorporated into the existing faulting model framework.

Advancement in optimization of VLSI circuits involves reduction in chip size from micrometer to nanometer level as well as fabrication of a billions of transistors in a single die where global routing problem remains significant with a trade-off of power dissipation and interconnect delay. This paper aims to solve the increased complexity in VLSI chip by minimization of the wire length in VLSI circuits using a new approach based on nature-inspired meta-heuristic, invasive weed optimization (IWO). Further, this paper aims to achieve maximum circuit optimization using IWO hybridized with particle swarm optimization (PSO).

This paper projects the complexities of global routing process of VLSI circuit design in mapping it with a well-known NP-complete problem, the minimum rectilinear Steiner tree (MRST) problem. IWO meta-heuristic algorithm is proposed to meet the MRST problem more efficiently and thereby reducing the overall wire-length of interconnected nodes. Further, the proposed approach is hybridized with PSO, and a comparative analysis is performed with geosteiner 5.0.1 and existing PSO technique over minimization, consistency and convergence against available benchmark.

This paper provides high performance–enhanced IWO algorithm, which keeps in generating low MRST value, thereby successful wire length reduction of VLSI circuits is significantly achieved as evident from the experimental results as compared to PSO algorithm and also generates value nearer to geosteiner 5.0.1 benchmark. Even with big VLSI instances, hybrid IWO with PSO establishes its robustness over achieving improved optimization of overall wire length of VLSI circuits.

This paper includes implications in the areas of optimization of VLSI circuit design specifically in the arena of VLSI routing and the recent developments in routing optimization using meta-heuristic algorithms.

This paper fulfills an identified need to study optimization of VLSI circuits where minimization of overall interconnected wire length in global routing plays a significant role. Use of nature-based meta-heuristics in solving the global routing problem is projected to be an alternative approach other than conventional method.

This study aims to propose and develop a new digital collaborative supply chain (CSC) model completely based on the emerging Industry 4.0 technologies. The digital model aims to support the main factors likely to affect CSC. This proposed model combines the most well-known digital tools such as blockchain technology, Internet of Things (IoT) and cloud computing (CC).

Motivated by its effective solution to enhance trust, traceability, transparency and minimize costs and risks, the combination of the most well-known digital tools such as blockchain technology, IoT and CC to develop a new digital CSC model is addressed in this research. This study first investigates and conducts a deep review analysis that explores how Industry 4.0 technologies can enable collaboration mechanisms. Second, based on an analysis of literature review, the main factors likely to affect CSC have been identified and analysed. Finally, the authors combine digital tools to support the identified factors to enhance transparency, traceability and trust by proposing a new digital CSC model. This proposed model will be used as a referential guide to encourage and motivate SC actors to collaborate in digital CSC.

This work provides many important contributions to theory and practice. First, role and impacts of the most well-known digital tools such as blockchain technology, IoT and CC for digitizing CSC have separately presented and developed. Second, the authors conceptualized a framework by developing a new digital CSC model. This conceptual digital model can be used as a referential guide for all SC actors in order to motivate them to collaborate in a modern, intelligent, secure and reliable SC. It can also support all factors affecting CSC.

The originality of this study is first investigating separately the roles and impacts of each digital tool on CSC performance. Second, the authors combine the most well-known digital tools such as blockchain technology, IoT and CC in order to develop an efficient, smart, modern and new digital CSC model. In this combination, CC is used as platform as a service enabling to link and connect the blockchain and IoT to support the main factors affecting CSC. Unlike to digital CSC model with only one digital tool, the proposed model is more realistic since depending on the information to be shared with other actors, the most appropriate tool will be automatically detected and used. This solution offers a large choice to SC actors for real time data and information sharing. In addition, the proposed model will largely enhance traceability, transparency and trust in CSC.

The purpose of this paper is to propose a competitiveness measurement system for start-ups considering multiple critical success factors.

The methodological approach uses concepts from key performance indicators (KPIs) and multi-criteria decision analysis (MCDA) based on the fuzzy AHP (FAHP) methodology to weight the criteria related to fundamental points of view (FPVs) and critical success factors (CSFs).

Data collection was performed with 21 specialists and 28 start-ups, which returned the weights and performance of CSFs and FPVs related to the start-ups’ competitiveness. The results show only one start-up had a highly competitive global performance. In addition, all start-ups showed low competitiveness related to industry 4.0 technologies.

The article collaborates with existing research as a starting point for discussions on the subject, considering that previous research did not address the measurement of the start-ups’ competitiveness level through multiple factors, as developed in this article. In addition, we provide decision-makers and other stakeholders in the start-up ecosystem with a robust measurement system to assess business competitiveness and diagnose the company’s situation.

This study aims to conduct a comprehensive review of scholarly literature on the educational impacts of the metaverse, systematically identifying emerging themes, challenges and implications for metaverse education.

The study uses systematic literature review techniques using the Scopus database to investigate empirical studies and systematic reviews specifically examining the convergence of the metaverse and education.

The study shows that the metaverse has a substantial influence on education, emphasising immersive learning, real social interactions and the transformation of traditional frameworks. This paper identifies nine themes, illuminating the growing relevance of metaverse tools in academic institutions, influencing learning methods, outcomes and positive student dispositions.

This study provides a foundation for further investigations into the metaverse’s potential to disseminate knowledge and enhance comprehension of metaverse technologies. It explores the metaverse’s potential in relation to progress, upcoming trends and cultural awareness while highlighting obstacles that must be addressed for effective metaverse teaching.

This research paper makes a substantial scholarly contribution by undertaking a systematic analysis of empirical studies and identifying emerging themes in the area of metaverse education. It offers substantial insights into the transformative potential of metaverse education and its implications for pedagogical and instructional approaches in the digitised era through the analysis of fundamental inquiries.