Explore the vast range of titles available.

The aim of different strategies is to precisely define which patients have a poor prognosis and to be able to easily guide them to other options using a cartesian scientific approach.Wang et al.for example, proposed a prognostic prediction model based on differential gene expression between muscle invasive bladder cancer (BLC) and non-muscle invasive BLC. [...]Wang et al.computed an optimal predictive model disulfidptosis score (DS) in patients with lung adenocarcinoma. [...]Liang et al.investigated the predictive value of disulfidptosis-related genes in breast cancer (BC) and their relationship with TME.

This article demonstrates an ontology-based technique that aids in envisioning the problem domain before software development, presenting an approach to assist decision-making for reliable and optimal healthcare administration. The proposed approach is designed for utilization by a Web-Based Decision Support System (WebDSS). The purpose of the study is to aid readers in comprehending how ontologies in healthcare management platforms can be modeled using UML and OWL. For the conceptualization and the design, service modelling and the semantics of the web language are crucial. We demonstrate the use of the Unified Modeling Language (UML) and the Ontology Web Language (OWL) in the administration of healthcare operations and key elements of the model-base of healthcare administration systems. Highly educated systems with automated assistance will allow decision-makers to more effectively incorporate aspects of sustainability into their decisions. In order to generate semantic ontologies for medical management, the present study proposes an ontology creation technique and a Semantic Web framework called Protégé. Web-based technologies, decision trees, data mining, and computational algorithms are implemented by WebDSS to assess medical resources administration information in real-time. These methods are employed to develop a decision making framework for this study. Time series graphs, email reports, and webpages are used to display the test findings. When healthcare thresholds are surpassed, the system uses text messages as email reports to automatically deliver warnings. Our study's primary contribution is the creation of a useful tool that makes it easier for academics studying medical concerns to locate online sites with information.

As climate change has become a pressing concern, promoting electric vehicles’ (EVs) usage has emerged as a popular response to the pollution caused by fossil-fuel automobiles. Locating charging stations in areas with an expanding charging infrastructure is crucial to the accessibility and future success of EVs. Nonetheless, suitable planning and deployment for EV fast-charging stations is one of the most critical determinants for large-scale EV adoption. Installing charging stations in existing fuel/gas stations in the city may be an effective way to persuade people to adopt EVs. In this paper, we aim to optimally locate a fast-charging station in an existing gas station in the real-world scenario of Aichi Prefecture, Japan. The purpose is to locate and size fast-charging stations in such ways that drivers can get access to these charging facilities within a rational driving range while considering real-world constraints. Furthermore, we include the investment cost and the EVs users' convenience cost. This problem is formulated by five integer linear programming using a weighted set covering models. The developed model determines where to locate charging stations as well as how many chargers should be installed in each charging station. The experimental results demonstrate that an appropriate location scheme can be obtained using the model M5. A computational experiment identifies the best infrastructure solutions for policymakers to consider in the context of growing environmental policies.

Companies are constantly looking for new strategies to improve their logistics performance and ensure their competitiveness in the global market. This article provides a new scheme for managing the selection of shared customers for a logistics company. The new mechanism proposes the use of the auction as a tool to manage the selection of shared clients through the coalition pool. Thus, all unprofitable shared customers will be pushed to the pool for outsourcing by the other collaborating carriers. Then, some profitable auctioned ones will be selected. The selection system is designed based on solving a vehicle routing problem that aims to maximize the carrier's profit in a decentralized context. At first, a mixed integer linear programing model is derived to solve the deterministic version of the problem. Then in order to efficiently address the stochastic version of the problem, a simulation-based optimization model is developed. This model is employed to solve a real case study of a parcel delivery company, considering the travel times as a bimodal distribution. A comparative study is conducted to demonstrate the effectiveness of the auction approach in managing shared customers. The results of our study reveal that the proposed auction approach efficiently manages the shared customers which leads to the substantial increase of 22.65% in profits for the delivery company. These findings have significant implications for logistics companies seeking to improve their performance and competitiveness in the global market.

An accurate forecast of current and future demand is an essential initial step for almost all the facets of supply chain optimization, including inventory strategy, production scheduling, distribution management, and marketing policies. Simply put, a more accurate demand prediction can lead to a more optimized supply chain process, allowing for better inventory control and higher customer satisfaction. Classical demand predictions are based principally on qualitative approaches relying on data from experts' opinions; quantitative forecasts based on historical data through statistical and artificial neural network models or a mix of qualitative and quantitative techniques that is also widely used and has shown good performances. Detergents and cleaning products demand is extremely volatile and has undergone substantial change, especially during the COVID-19 health crisis. In this paper, we present a hybrid Neural Network approach for accurate demand forecasts of the detergent manufacturing industry. It mainly consists of the combination of Long Short-Term Memory (LSTM) with Convolution Neural Network (CNN) based approaches. We performed a series of experiments on real data sets and assessed the performance of the proposed CNN-LSTM hybrid model. Numerical results showed that the combination of LSTM layers with complementary CNN layers provides more accurate results than other state-of-the-art forecasting models.

We propose a generalized version of the Prize Collecting Steiner Tree Problem (PCSTP), which offers a fundamental unifying model for several well-known -hard tree optimization problems. The PCSTP also arises naturally in a variety of network design applications including cable television and local access networks. We reformulate the PCSTP as a minimum spanning tree problem with additional packing and knapsack constraints and we explore various nondifferentiable optimization algorithms for solving its Lagrangian dual. We report computational results for nine variants of deflected subgradient strategies, the volume algorithm (VA), and the variable target value method used in conjunction with the VA and with a generalized Polyak–Kelley cutting plane technique. The performance of these approaches is also compared with an exact stabilized constraint generation procedure.

We aim to derive effective lower bounds for the Discrete Cost Multicommodity Network Design Problem (DCMNDP). Given an undirected graph, the problem requires installing at most one facility on each edge such that a set of point-to-point commodity flows can be routed and costs are minimized. In the literature, the Lagrangian relaxation is usually applied to an arc-based formulation to derive lower bounds. In this work, we investigate a path-based formulation and we solve its Lagrangian relaxation using several non-differentiable optimization techniques. More precisely, we devised six variants of the deflected subgradient procedures, using various direction-search and step-length strategies. The computational performance of these Lagrangian-based approaches are evaluated and compared on a set of randomly generated instances, and real-world problems.