Search alternatives:
cost » most (Expand Search), post (Expand Search)
Showing 821 - 840 results of 2,081 for search 'improve cost optimization algorithm', query time: 0.18s Refine Results
  1. 821

    Qualitative Simulation Algorithm for Resource Scheduling in Enterprise Management Cloud Mode by Jiaohui Yu

    Published 2021-01-01
    “…Aiming at the problem of resource scheduling optimization in enterprise management cloud mode, a customizable fuzzy clustering cloud resource scheduling algorithm based on trust sensitivity is proposed. …”
    Get full text
    Article
  2. 822

    Precise wind allocation scheme decision based on attraction-repulsion algorithm by NI Jingfeng, CHEN Dunwei, LIU Yujiao

    Published 2025-04-01
    “…Performance test results showed that AROA had a significant advantage in comprehensive optimization performance compared to Genetic Algorithm (GA), Simulated Annealing-Improved Particle Swarm Optimization (SA-IPSO), and Monotonic Basin Hopping (MBH). …”
    Get full text
    Article
  3. 823

    A Projection Strategy for Improving the Preconditioner in the LOBPCG by Ma Tailai, Sun Shuli, Zheng Fangyi, Chen Pu

    Published 2025-06-01
    “…This oblique projection technique can find a more accurate approximate solution which minimizes the 2-norm residuals in the search subspace without significantly increasing computational cost, thereby improving the quality of the preconditioner, thus accelerating convergence of the LOBPCG.Numerical experiments show that the projection strategy can improve the LOBPCG algorithm significantly in terms of efficiency and stability.…”
    Get full text
    Article
  4. 824

    Adjacency List Algorithm for Traffic Light Control Systems in Urban Networks by Sergio Rojas-Blanco, Alberto Cerezo-Narváez, Manuel Otero-Mateo, Sol Sáez-Martínez

    Published 2024-12-01
    “…An adjacency list is more efficient than matrices in terms of space and computational cost, allowing for the identification of critical signals before applying advanced optimization techniques such as neural networks or hypergraphs. …”
    Get full text
    Article
  5. 825

    Fast Adaptive CU Partition Decision Algorithm for VVC Intra Coding by Lina Si, Wendi Zhu, Qiuwen Zhang

    Published 2023-01-01
    “…The algorithm has the capability to make partition decisions for CUs of diverse sizes (smaller than <inline-formula> <tex-math notation="LaTeX">$32\times 32$ </tex-math></inline-formula>) and completely bypass the intricate process of Rate-distortion Optimization (RDO), resulting in a significant reduction in encoding time. …”
    Get full text
    Article
  6. 826

    Supply Chains Problem During Crises: A Data-Driven Approach by Farima Salamian, Amirmohammad Paksaz, Behrooz Khalil Loo, Mobina Mousapour Mamoudan, Mohammad Aghsami, Amir Aghsami

    Published 2024-12-01
    “…The solution methodology combines the Grasshopper Optimization Algorithm (GOA) and the ɛ-constraint method, efficiently addressing the multi-objective nature of the problem. …”
    Get full text
    Article
  7. 827

    A Defect Detection Algorithm for Optoelectronic Detectors Utilizing GLV-YOLO by Xinfang Zhao, Qinghua Lyu, Hui Zeng, Zhuoyi Ling, Zhongsheng Zhai, Hui Lyu, Saffa Riffat, Benyuan Chen, Wanting Wang

    Published 2025-02-01
    “…The experimental results showed that the proposed algorithm achieved 98.9% accuracy, with 2.1 million parameters and a computational cost of 7.0 GFLOPs. …”
    Get full text
    Article
  8. 828

    Metaheuristics in Logistics: Increasing the Efficiency of Algorithms by Defining Appropriate Parameter Settings by Tamara J. Bíró, Péter Németh

    Published 2024-12-01
    “…In many cases, when applying a metaheuristic, it works properly with the variables of a given task and there is no specific interval where a given algorithm can still be effective. To increase efficiency and reduce costs, the authors defined a general parameter definition by applying the Ant Colony Optimization algorithm applicable to the simple Traveling Salesman Problem with the number of cities n=50, where for values of 30 = n = 50, the defined parameter setting structure can be properly applied based on the results. …”
    Get full text
    Article
  9. 829

    A BIT* algorithm with dilated vertices-based path stretching strategy by Xuanle Wu, Pu Li, Zhicheng Hou

    Published 2025-09-01
    “…In addition, DS-BIT* performs bidirectional improvement of the final path at the end of the algorithm, further reducing the final path cost. …”
    Get full text
    Article
  10. 830

    Assessing and Reducing Energy Consumption of Grain Cleaning and Drying Equipment by Yu. N. Sap’yan, V. A. Kolos, M. I. Suleymanov, E. N. Kabakova

    Published 2019-12-01
    “…(Conclusions) The paper provides the offered criteria and a developed algorithm for energy-saving optimization of grain drying equipment, which reduces the direct energy consumption of production lines and energy costs. …”
    Get full text
    Article
  11. 831

    Research on the A* Algorithm for Automatic Guided Vehicles in Large-Scale Maps by Yuandong Chen, Jinhao Pang, Yuchen Gou, Zhiming Lin, Shaofeng Zheng, Dewang Chen

    Published 2024-11-01
    “…In terms of the improvement of the heuristic function, this study adopted the diagonal distance as the benchmark for cost estimation, and it innovatively introduces the angle coefficient to reflect the complexity of path turning, thus providing the algorithm with a more accurate guidance for the search direction. …”
    Get full text
    Article
  12. 832

    Research on rock strength prediction model based on machine learning algorithm by Xiang Ding, Mengyun Dong, Wanqing Shen

    Published 2024-12-01
    “…By selecting different features, the optimal feature combination for predicting rock compressive strength was obtained, and the optimal parameters for different models were obtained through the Sparrow Search Algorithm (SSA). …”
    Get full text
    Article
  13. 833

    A Contribution of Shortest Paths Algorithms to the NetworkX Python Library by Miguel Cruz, Rui Carvalho, André Costa, Luis Pinto, Luis Dias, Paulino Cerqueira, Rodrigo Machado, Tiago Batista, Pedro Castro, Jorge Ribeiro

    Published 2025-07-01
    “…We have also done the benchmarking of the A*, comparing it with the new ones, and concluded the better efficiency of the A* extensions in tri-objective scenario parameters (length, cost and toll). Despite the extensive utilisation of A* and its notable efficacy in identifying optimal paths, its performance is suboptimal in specific scenarios, such as when confronted with memory constraints and dynamic environments. …”
    Get full text
    Article
  14. 834

    Heap Optimization in A* Pathfinding for Horror Games by Risaldi Angga Buana Putra, Ary Setijadi Prihatmanto, Rahadian Yusuf, Agus Sukoco

    Published 2025-03-01
    “…This paper examines the implementation of the A* pathfinding algorithm with binary heap optimization in a horror game environment. …”
    Get full text
    Article
  15. 835

    Optimization of Hybrid Laminates with Extension-Shear Coupling by Da Cui, Daokui Li

    Published 2018-01-01
    “…The extension-shear-coupled effect of hybrid laminates is optimized with improved differential evolution algorithm. …”
    Get full text
    Article
  16. 836

    Optimal Management in the Operation of Complex Technical Systems by Dyadyura K., Oborskyi G., Prokopovych I., Khamitov V., Holubiev M.

    Published 2024-06-01
    “…Additionally, proof of the existence of an optimal verification strategy was given. An algorithm for determining the moments of verification was developed to ensure the minimum cost. …”
    Get full text
    Article
  17. 837

    Revocation encryption scheme based on domestic cryptographic algorithm SM9 by XIE Zhenjie, ZHANG Wanli, ZHANG Yao, ZHAO Fangfang, LIU Shengli

    Published 2025-05-01
    “…To address the limitations of lengthy system public keys and inefficient decryption in existing identity-based revocation encryption schemes, an optimized revocation encryption scheme was proposed based on SM9, China’s independently developed identity-based cryptographic algorithm. …”
    Get full text
    Article
  18. 838

    Power inspection UAV task assignment matrix reversal genetic algorithm by Kai Liu, Meizhao Liu, Ming Tang, Chen Zhang

    Published 2024-01-01
    “…Specifically, TMGA reduces the average task time by 37% compared to the Cluster Grouping Consensus-base Bundle Algorithm and improves task unit utility by 56.91% compared to the Genetic Algorithm.…”
    Get full text
    Article
  19. 839

    B∗ Algorithm: Multiobjective Path Planning for Flexible Buses Traffic System by Zhida Ke, Rong-Guei Tsai, Chengtao Xu, Yicong Yu, Zhiming Huang, Xiaolan Chen, Lin Lin, Delin Luo, Shanna He

    Published 2024-01-01
    “…Advances in vehicle intelligence have ushered in the rapid development of intelligent connected vehicles and the emergence of the Internet of Vehicles (IoV), greatly improving the passenger travel experience. However, as a new mode of transport, flexible public transportation presents challenges for operators in terms of reducing costs and improving passenger experiences through complex route planning. …”
    Get full text
    Article
  20. 840

    Application of Genetic Algorithms to Solve MTSP Problems with Priority (Case Study at the Jakarta Street Lighting Service) by Sugih Sudharma Tjandra, Fran Setiawan, Hanoum Salsabila

    Published 2022-12-01
    “… Transportation is one thing that is very important and is the highest cost in the supply chain. One way to reduce these costs is to optimize vehicle routes. …”
    Get full text
    Article