Neural architecture search (NAS) has shown great potential in discovering powerful and flexible network models, becoming an important branch of automatic machine learning (AutoML). Although search methods based on reinforcement learning and evolutionary algorithms can find high-performance architectures, these search methods typically require hundreds of GPU days. Unlike searching in a discrete search space based on reinforcement learning and evolutionary algorithms, the differentiable neural architecture search (DARTS) continuously relaxes the search space, allowing for optimization using gradient-based methods. Based on DARTS, we propose NDARTS in this article. The new algorithm uses the Implicit Function Theorem and the Neumann series to approximate the hyper-gradient, which obtains better results than DARTS. In the simulation experiment, an ablation experiment was carried out to study the influence of the different parameters on the NDARTS algorithm and to determine the optimal weight, then the best performance of the NDARTS algorithm was searched for in the DARTS search space and the NAS-BENCH-201 search space. Compared with other NAS algorithms, the results showed that NDARTS achieved excellent results on the CIFAR-10, CIFAR-100, and ImageNet datasets, and was an effective neural architecture search algorithm.
{"title":"NDARTS: A Differentiable Architecture Search Based on the Neumann Series","authors":"Xiaoyu Han, Chenyu Li, Zifan Wang, Guohua Liu","doi":"10.3390/a16120536","DOIUrl":"https://doi.org/10.3390/a16120536","url":null,"abstract":"Neural architecture search (NAS) has shown great potential in discovering powerful and flexible network models, becoming an important branch of automatic machine learning (AutoML). Although search methods based on reinforcement learning and evolutionary algorithms can find high-performance architectures, these search methods typically require hundreds of GPU days. Unlike searching in a discrete search space based on reinforcement learning and evolutionary algorithms, the differentiable neural architecture search (DARTS) continuously relaxes the search space, allowing for optimization using gradient-based methods. Based on DARTS, we propose NDARTS in this article. The new algorithm uses the Implicit Function Theorem and the Neumann series to approximate the hyper-gradient, which obtains better results than DARTS. In the simulation experiment, an ablation experiment was carried out to study the influence of the different parameters on the NDARTS algorithm and to determine the optimal weight, then the best performance of the NDARTS algorithm was searched for in the DARTS search space and the NAS-BENCH-201 search space. Compared with other NAS algorithms, the results showed that NDARTS achieved excellent results on the CIFAR-10, CIFAR-100, and ImageNet datasets, and was an effective neural architecture search algorithm.","PeriodicalId":7636,"journal":{"name":"Algorithms","volume":"34 50","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139237093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper assesses algorithms proposed for constructing confidence ellipses in multidimensional scaling (MDS) solutions and proposes a new approach to interpreting these confidence ellipses via hierarchical cluster analysis (HCA). It is shown that the most effective algorithm for constructing confidence ellipses involves the generation of simulated distances based on the original multivariate dataset and then the creation of MDS maps that are scaled, reflected, rotated, translated, and finally superimposed. For this algorithm, the stability measure of the average areas tends to zero with increasing sample size n following the power model, An−B, with positive B values ranging from 0.7 to 2 and high R-squared fitting values around 0.99. This algorithm was applied to create confidence ellipses in the MDS plots of squared Euclidean and Mahalanobis distances for continuous and binary data. It was found that plotting confidence ellipses in MDS plots offers a better visualization of the distance map of the populations under study compared to plotting single points. However, the confidence ellipses cannot eliminate the subjective selection of clusters in the MDS plot based simply on the proximity of the MDS points. To overcome this subjective selection, we should quantify the formation of clusters of proximal samples. Thus, in addition to the algorithm assessment, we propose a new approach that estimates all possible cluster probabilities associated with the confidence ellipses by applying HCA using distance matrices derived from these ellipses.
{"title":"Assessing Algorithms Used for Constructing Confidence Ellipses in Multidimensional Scaling Solutions","authors":"P. Nikitas, E. Nikita","doi":"10.3390/a16120535","DOIUrl":"https://doi.org/10.3390/a16120535","url":null,"abstract":"This paper assesses algorithms proposed for constructing confidence ellipses in multidimensional scaling (MDS) solutions and proposes a new approach to interpreting these confidence ellipses via hierarchical cluster analysis (HCA). It is shown that the most effective algorithm for constructing confidence ellipses involves the generation of simulated distances based on the original multivariate dataset and then the creation of MDS maps that are scaled, reflected, rotated, translated, and finally superimposed. For this algorithm, the stability measure of the average areas tends to zero with increasing sample size n following the power model, An−B, with positive B values ranging from 0.7 to 2 and high R-squared fitting values around 0.99. This algorithm was applied to create confidence ellipses in the MDS plots of squared Euclidean and Mahalanobis distances for continuous and binary data. It was found that plotting confidence ellipses in MDS plots offers a better visualization of the distance map of the populations under study compared to plotting single points. However, the confidence ellipses cannot eliminate the subjective selection of clusters in the MDS plot based simply on the proximity of the MDS points. To overcome this subjective selection, we should quantify the formation of clusters of proximal samples. Thus, in addition to the algorithm assessment, we propose a new approach that estimates all possible cluster probabilities associated with the confidence ellipses by applying HCA using distance matrices derived from these ellipses.","PeriodicalId":7636,"journal":{"name":"Algorithms","volume":"2004 13","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139239171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Langyu Wang, Yan Zhang, Yahong Lin, Shuai Yan, Yuanyuan Xu, Bo Sun
Aiming at the problem of insufficient feature extraction, low precision, and recall in sea surface ship detection, a YOLOv5 algorithm based on lightweight convolution and attention mechanism is proposed. We combine the receptive field enhancement module (REF) with the spatial pyramid rapid pooling module to retain richer semantic information and expand the sensory field. The slim-neck module based on a lightweight convolution (GSConv) is added to the neck section, to achieve greater computational cost-effectiveness of the detector. And, to lift the model’s performance and focus on positional information, we added the coordinate attention mechanism. Finally, the loss function CIoU is replaced by SIoU. Experimental results using the seaShips dataset show that compared with the original YOLOv5 algorithm, the improved YOLOv5 algorithm has certain improvements in model evaluation indexes, while the number of parameters in the model does not increase significantly, and the detection speed also meets the requirements of sea surface ship detection.
{"title":"Ship Detection Algorithm Based on YOLOv5 Network Improved with Lightweight Convolution and Attention Mechanism","authors":"Langyu Wang, Yan Zhang, Yahong Lin, Shuai Yan, Yuanyuan Xu, Bo Sun","doi":"10.3390/a16120534","DOIUrl":"https://doi.org/10.3390/a16120534","url":null,"abstract":"Aiming at the problem of insufficient feature extraction, low precision, and recall in sea surface ship detection, a YOLOv5 algorithm based on lightweight convolution and attention mechanism is proposed. We combine the receptive field enhancement module (REF) with the spatial pyramid rapid pooling module to retain richer semantic information and expand the sensory field. The slim-neck module based on a lightweight convolution (GSConv) is added to the neck section, to achieve greater computational cost-effectiveness of the detector. And, to lift the model’s performance and focus on positional information, we added the coordinate attention mechanism. Finally, the loss function CIoU is replaced by SIoU. Experimental results using the seaShips dataset show that compared with the original YOLOv5 algorithm, the improved YOLOv5 algorithm has certain improvements in model evaluation indexes, while the number of parameters in the model does not increase significantly, and the detection speed also meets the requirements of sea surface ship detection.","PeriodicalId":7636,"journal":{"name":"Algorithms","volume":"8 2","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139247803","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Juan F. Gomez, Antonio R. Uguina, Javier Panadero, Angel A. Juan
The capacitated dispersion problem, which is a variant of the maximum diversity problem, aims to determine a set of elements within a network. These elements could symbolize, for instance, facilities in a supply chain or transmission nodes in a telecommunication network. While each element typically has a bounded service capacity, in this research, we introduce a twist. The capacity of each node might be influenced by a random Bernoulli component, thereby rendering the possibility of a node having zero capacity, which is contingent upon a black box mechanism that accounts for environmental variables. Recognizing the inherent complexity and the NP-hard nature of the capacitated dispersion problem, heuristic algorithms have become indispensable for handling larger instances. In this paper, we introduce a novel approach by hybridizing a heuristic algorithm with reinforcement learning to address this intricate problem variant.
{"title":"A Learnheuristic Algorithm for the Capacitated Dispersion Problem under Dynamic Conditions","authors":"Juan F. Gomez, Antonio R. Uguina, Javier Panadero, Angel A. Juan","doi":"10.3390/a16120532","DOIUrl":"https://doi.org/10.3390/a16120532","url":null,"abstract":"The capacitated dispersion problem, which is a variant of the maximum diversity problem, aims to determine a set of elements within a network. These elements could symbolize, for instance, facilities in a supply chain or transmission nodes in a telecommunication network. While each element typically has a bounded service capacity, in this research, we introduce a twist. The capacity of each node might be influenced by a random Bernoulli component, thereby rendering the possibility of a node having zero capacity, which is contingent upon a black box mechanism that accounts for environmental variables. Recognizing the inherent complexity and the NP-hard nature of the capacitated dispersion problem, heuristic algorithms have become indispensable for handling larger instances. In this paper, we introduce a novel approach by hybridizing a heuristic algorithm with reinforcement learning to address this intricate problem variant.","PeriodicalId":7636,"journal":{"name":"Algorithms","volume":"85 ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139249670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Contrast enhancement techniques serve the purpose of diminishing image noise and increasing the contrast of relevant structures. In the context of medical images, where the differentiation between normal and abnormal tissues can be quite subtle, precise interpretation might become challenging when noise levels are relatively elevated. The Fast Local Laplacian Filter (FLLF) is proposed to deliver a more precise interpretation and present a clearer image to the observer; this is achieved through the reduction of noise levels. In this study, the FLLF strengthened images through its unique contrast enhancement capabilities while preserving important image details. It achieved this by adapting to the image’s characteristics and selectively enhancing areas with low contrast, thereby improving the overall visual quality. Additionally, the FLLF excels in edge preservation, ensuring that fine details are retained and that edges remain sharp. Several performance metrics were employed to assess the effectiveness of the proposed technique. These metrics included Peak Signal-to-Noise Ratio (PSNR), Mean Squared Error (MSE), Root Mean Squared Error (RMSE), Normalization Coefficient (NC), and Correlation Coefficient. The results indicated that the proposed technique achieved a PSNR of 40.12, an MSE of 8.6982, an RMSE of 2.9492, an NC of 1.0893, and a Correlation Coefficient of 0.9999. The analysis highlights the superior performance of the proposed method when contrast enhancement is applied, especially when compared to existing techniques. This approach results in high-quality images with minimal information loss, ultimately aiding medical experts in making more accurate diagnoses.
{"title":"Fast Local Laplacian Filter Based on Modified Laplacian through Bilateral Filter for Coronary Angiography Medical Imaging Enhancement","authors":"S. Khan, Muzammil Khan, Yasser Alharbi","doi":"10.3390/a16120531","DOIUrl":"https://doi.org/10.3390/a16120531","url":null,"abstract":"Contrast enhancement techniques serve the purpose of diminishing image noise and increasing the contrast of relevant structures. In the context of medical images, where the differentiation between normal and abnormal tissues can be quite subtle, precise interpretation might become challenging when noise levels are relatively elevated. The Fast Local Laplacian Filter (FLLF) is proposed to deliver a more precise interpretation and present a clearer image to the observer; this is achieved through the reduction of noise levels. In this study, the FLLF strengthened images through its unique contrast enhancement capabilities while preserving important image details. It achieved this by adapting to the image’s characteristics and selectively enhancing areas with low contrast, thereby improving the overall visual quality. Additionally, the FLLF excels in edge preservation, ensuring that fine details are retained and that edges remain sharp. Several performance metrics were employed to assess the effectiveness of the proposed technique. These metrics included Peak Signal-to-Noise Ratio (PSNR), Mean Squared Error (MSE), Root Mean Squared Error (RMSE), Normalization Coefficient (NC), and Correlation Coefficient. The results indicated that the proposed technique achieved a PSNR of 40.12, an MSE of 8.6982, an RMSE of 2.9492, an NC of 1.0893, and a Correlation Coefficient of 0.9999. The analysis highlights the superior performance of the proposed method when contrast enhancement is applied, especially when compared to existing techniques. This approach results in high-quality images with minimal information loss, ultimately aiding medical experts in making more accurate diagnoses.","PeriodicalId":7636,"journal":{"name":"Algorithms","volume":"35 5","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139252625","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The economy and energy saving effects of integrated energy system dispatch plans are influenced by the coupling of different energy devices. In order to consider the impact of changes in equipment load rates on the optimization and scheduling of the system under long-term operation, a method for energy and component cycle optimization considering energy device capacity and load has been proposed. By improving the initial parameters of the components, energy economic parameters, and operational optimization parameters, the system is subjected to long-term scheduling and multi-cycle operational optimization analysis to evaluate the energy saving and emission reduction potential as well as the economic feasibility of the system. Finally, through numerical analysis, the effectiveness of this optimization approach in achieving energy savings, emission reductions, and cost benefits for the system is validated. Furthermore, compared to existing optimization methods, this approach also assesses the economic feasibility of the system. The case study resulted in a pre-tax IRR of 23.14% and a pre-tax NPV of 66.38 million. It is inferred that the system could generate profits over a 10-year operation period, thereby offering a more rational and cost-effective scheduling scheme for the integrated energy system.
{"title":"Period Cycle Optimization of Integrated Energy Systems with Long-Term Scheduling Consideration","authors":"Daoyu Ye, Shengxiang Deng","doi":"10.3390/a16110530","DOIUrl":"https://doi.org/10.3390/a16110530","url":null,"abstract":"The economy and energy saving effects of integrated energy system dispatch plans are influenced by the coupling of different energy devices. In order to consider the impact of changes in equipment load rates on the optimization and scheduling of the system under long-term operation, a method for energy and component cycle optimization considering energy device capacity and load has been proposed. By improving the initial parameters of the components, energy economic parameters, and operational optimization parameters, the system is subjected to long-term scheduling and multi-cycle operational optimization analysis to evaluate the energy saving and emission reduction potential as well as the economic feasibility of the system. Finally, through numerical analysis, the effectiveness of this optimization approach in achieving energy savings, emission reductions, and cost benefits for the system is validated. Furthermore, compared to existing optimization methods, this approach also assesses the economic feasibility of the system. The case study resulted in a pre-tax IRR of 23.14% and a pre-tax NPV of 66.38 million. It is inferred that the system could generate profits over a 10-year operation period, thereby offering a more rational and cost-effective scheduling scheme for the integrated energy system.","PeriodicalId":7636,"journal":{"name":"Algorithms","volume":"20 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139260944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Over the past decade, the demand and research for indoor localization have burgeoned and Wi-Fi fingerprinting approach has been widely considered because it is cheap and accessible. However, most existing methods lack in terms of positioning accuracy and high computational complexity. To cope with these issues, we formulate a two-stage, coarse and accurate positioning narrow-down approach (NDA). Furthermore, a three-step source domain refinement (SDR) scheme that involves outlier removal, stable AP’s weight enhancement, and a data averaging technique by applying the K-means clustering algorithm is also proposed. The collaboration of SDR scheme with the training data selection, area division, and overlapping schemes reduces the computational complexity and improves coarse positioning accuracy. The effect of the proposed SDR scheme on the performance of the support vector machine (SVM) and random forest algorithms is also presented. In the final/accurate positioning phase, a set of lightweight neural networks (DNNs), trained on different sub-areas, predict the user’s location. This approach significantly increases positioning accuracy while reducing the online computational complexity at the same time. The experimental results show that the proposed approach outperforms the best solutions presented in the literature.
在过去的十年中，室内定位的需求和研究急剧增加，Wi-Fi 指纹识别方法因其成本低廉、易于使用而被广泛采用。然而，大多数现有方法都存在定位精度低、计算复杂度高等问题。为了解决这些问题，我们提出了一种两阶段、粗略且精确的定位缩小方法（NDA）。此外，我们还提出了一种三步源域细化（SDR）方案，包括去除离群点、增强稳定 AP 的权重以及应用 K-means 聚类算法的数据平均技术。SDR 方案与训练数据选择、区域划分和重叠方案相结合，降低了计算复杂度，提高了粗定位精度。此外，还介绍了所提出的 SDR 方案对支持向量机（SVM）和随机森林算法性能的影响。在最后/精确定位阶段，一组根据不同子区域训练的轻量级神经网络（DNN）将预测用户的位置。这种方法大大提高了定位精度，同时降低了在线计算复杂度。实验结果表明，所提出的方法优于文献中介绍的最佳解决方案。
{"title":"A Narrow-Down Approach Based on Machine Learning for Indoor Localization","authors":"Sahibzada Muhammad Ahmad Umair, T. Arslan","doi":"10.3390/a16110529","DOIUrl":"https://doi.org/10.3390/a16110529","url":null,"abstract":"Over the past decade, the demand and research for indoor localization have burgeoned and Wi-Fi fingerprinting approach has been widely considered because it is cheap and accessible. However, most existing methods lack in terms of positioning accuracy and high computational complexity. To cope with these issues, we formulate a two-stage, coarse and accurate positioning narrow-down approach (NDA). Furthermore, a three-step source domain refinement (SDR) scheme that involves outlier removal, stable AP’s weight enhancement, and a data averaging technique by applying the K-means clustering algorithm is also proposed. The collaboration of SDR scheme with the training data selection, area division, and overlapping schemes reduces the computational complexity and improves coarse positioning accuracy. The effect of the proposed SDR scheme on the performance of the support vector machine (SVM) and random forest algorithms is also presented. In the final/accurate positioning phase, a set of lightweight neural networks (DNNs), trained on different sub-areas, predict the user’s location. This approach significantly increases positioning accuracy while reducing the online computational complexity at the same time. The experimental results show that the proposed approach outperforms the best solutions presented in the literature.","PeriodicalId":7636,"journal":{"name":"Algorithms","volume":"41 2","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139264378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Swarm intelligence has promising applications for firm search and decision-choice problems and is particularly well suited for examining how other firms influence the focal firm’s search. To evaluate search performance, researchers examining firm search through simulation models typically build a performance landscape. The NK model is the leading tool used for this purpose in the management science literature. We assess the usefulness of the NK landscape for simulated swarm search. We find that the strength of the swarm model for examining firm search and decision-choice problems—the ability to model the influence of other firms on the focal firm—is limited to the NK landscape. Researchers will need alternative ways to create a performance landscape in order to use our full swarm model in simulations. We also identify multiple opportunities—endogenous landscapes, agent-specific landscapes, incomplete information, and costly movements—that future researchers can include in landscape development to gain the maximum insights from swarm-based firm search simulations.
蜂群智能在企业搜索和决策选择问题上有着广阔的应用前景，尤其适用于研究其他企业如何影响焦点企业的搜索。为了评估搜索绩效，研究人员通常会通过仿真模型建立一个绩效景观来研究企业搜索。NK 模型是管理科学文献中用于此目的的主要工具。我们评估了 NK 景观对模拟蜂群搜索的实用性。我们发现，蜂群模型在研究公司搜索和决策选择问题方面的优势--模拟其他公司对焦点公司影响的能力--仅限于 NK 景观。研究人员需要采用其他方法来创建绩效格局，以便在模拟中使用我们的完整蜂群模型。我们还发现了多种机会--内生景观、代理特定景观、不完全信息和代价高昂的移动--未来的研究人员可以将这些机会纳入景观开发中，以便从基于蜂群的企业搜索模拟中获得最大的洞察力。
{"title":"Search on an NK Landscape with Swarm Intelligence: Limitations and Future Research Opportunities","authors":"Ren-Raw Chen, Cameron D. Miller, P. Toh","doi":"10.3390/a16110527","DOIUrl":"https://doi.org/10.3390/a16110527","url":null,"abstract":"Swarm intelligence has promising applications for firm search and decision-choice problems and is particularly well suited for examining how other firms influence the focal firm’s search. To evaluate search performance, researchers examining firm search through simulation models typically build a performance landscape. The NK model is the leading tool used for this purpose in the management science literature. We assess the usefulness of the NK landscape for simulated swarm search. We find that the strength of the swarm model for examining firm search and decision-choice problems—the ability to model the influence of other firms on the focal firm—is limited to the NK landscape. Researchers will need alternative ways to create a performance landscape in order to use our full swarm model in simulations. We also identify multiple opportunities—endogenous landscapes, agent-specific landscapes, incomplete information, and costly movements—that future researchers can include in landscape development to gain the maximum insights from swarm-based firm search simulations.","PeriodicalId":7636,"journal":{"name":"Algorithms","volume":"37 6","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139266862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In many states in the United States, school bus fleets are assigned to serve students sequentially at three levels—high school, middle school, and elementary school; however, in past studies, each of these stages in the problem was considered separately. This study introduces a novel integrated school bus problem that considers the sequential operation of fleets for all three levels in a unified framework. An example of a hypothetical network was developed and tested to demonstrate the developed algorithm. The algorithm successfully handled the integration of school buses’ optimal route generation while meeting all constraints. The results showed that the routings with the integrated single-framework algorithm can reduce the total costs by 4.5% to 12.4% compared to the routings with the separated level algorithm. Also, it showed that the total costs of the integrated routing framework for different morning and afternoon time windows are 8.28% less than the same routings (identically reversed) for the morning and afternoon time windows.
{"title":"Optimal Integrated Single-Framework Algorithm for the Multi-Level School Bus Network Problem","authors":"A. Nickkar, Young-Jae Lee","doi":"10.3390/a16110528","DOIUrl":"https://doi.org/10.3390/a16110528","url":null,"abstract":"In many states in the United States, school bus fleets are assigned to serve students sequentially at three levels—high school, middle school, and elementary school; however, in past studies, each of these stages in the problem was considered separately. This study introduces a novel integrated school bus problem that considers the sequential operation of fleets for all three levels in a unified framework. An example of a hypothetical network was developed and tested to demonstrate the developed algorithm. The algorithm successfully handled the integration of school buses’ optimal route generation while meeting all constraints. The results showed that the routings with the integrated single-framework algorithm can reduce the total costs by 4.5% to 12.4% compared to the routings with the separated level algorithm. Also, it showed that the total costs of the integrated routing framework for different morning and afternoon time windows are 8.28% less than the same routings (identically reversed) for the morning and afternoon time windows.","PeriodicalId":7636,"journal":{"name":"Algorithms","volume":"73 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139269753","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Theodoros Tzelepis, George Matlis, Nikos Dimokas, Petros Karvelis, P. Malliou, A. Beneka
In recent years the number of people who exercise every day has increased dramatically. More precisely, due to COVID period many people have become recreational runners. Recreational running is a regular way to keep active and healthy at any age. Additionally, running is a popular physical exercise that offers numerous health advantages. However, recreational runners report a high incidence of musculoskeletal injuries due to running. The healthcare industry has been compelled to use information technology due to the quick rate of growth and developments in electronic systems, the internet, and telecommunications. Our proposed intelligent system uses data mining algorithms for the rehabilitation guidance of recreational runners with musculoskeletal discomfort. The system classifies recreational runners based on a questionnaire that has been built according to the severity, irritability, nature, stage, and stability model and advise them on the appropriate treatment plan/exercises to follow. Through rigorous testing across various case studies, our method has yielded highly promising results, underscoring its potential to significantly contribute to the well-being and rehabilitation of recreational runners facing musculoskeletal challenges.
{"title":"An Intelligent Injury Rehabilitation Guidance System for Recreational Runners Using Data Mining Algorithms","authors":"Theodoros Tzelepis, George Matlis, Nikos Dimokas, Petros Karvelis, P. Malliou, A. Beneka","doi":"10.3390/a16110523","DOIUrl":"https://doi.org/10.3390/a16110523","url":null,"abstract":"In recent years the number of people who exercise every day has increased dramatically. More precisely, due to COVID period many people have become recreational runners. Recreational running is a regular way to keep active and healthy at any age. Additionally, running is a popular physical exercise that offers numerous health advantages. However, recreational runners report a high incidence of musculoskeletal injuries due to running. The healthcare industry has been compelled to use information technology due to the quick rate of growth and developments in electronic systems, the internet, and telecommunications. Our proposed intelligent system uses data mining algorithms for the rehabilitation guidance of recreational runners with musculoskeletal discomfort. The system classifies recreational runners based on a questionnaire that has been built according to the severity, irritability, nature, stage, and stability model and advise them on the appropriate treatment plan/exercises to follow. Through rigorous testing across various case studies, our method has yielded highly promising results, underscoring its potential to significantly contribute to the well-being and rehabilitation of recreational runners facing musculoskeletal challenges.","PeriodicalId":7636,"journal":{"name":"Algorithms","volume":"46 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139270918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：