Search alternatives:
cost » most (Expand Search)
post » most (Expand Search)
Showing 321 - 340 results of 2,361 for search '(( improved cost optimization algorithm ) OR ( improve post optimization algorithm ))', query time: 0.36s Refine Results
  1. 321

    Peak-to-average power ratio reduction of orthogonal frequency division multiplexing signals using improved salp swarm optimization-based partial transmit sequence model by Vandana Tripathi, Prabhat Patel, Prashant Kumar Jain, Shailja Shukla

    Published 2025-04-01
    “…Among the available methods, partial transmit sequence (PTS) is an efficient PAPR reduction method but can be computationally expensive while deter-mining optimal phase factors (OPFs). Therefore, an optimization algorithm, namely, the improved salp swarm optimization algorithm (ISSA), is incorpo-rated with the PTS to reduce the PAPR of the OFDM signals with limited com-putational cost. …”
    Get full text
    Article
  2. 322

    Path Planning of UAV Using Levy Pelican Optimization Algorithm In Mountain Environment by Guiliang Zhou, Shuaiqi Lü, Lina Mao, Kaiwen Xu, Tianwen Bao, Xu Bao

    Published 2024-12-01
    “…Research has found that the improved LPOA optimizes the total target cost of the algorithm by 9.75% and optimizes the planned average shortest path by 20.30%.…”
    Get full text
    Article
  3. 323

    Minimum cost of job assignment in polynomial time by adaptive unbiased filtering and branch-and-bound algorithm with the best predictor by Jeeraporn Werapun, Witchaya Towongpaichayont, Anantaporn Hanskunatai

    Published 2025-06-01
    “…The minimum cost of job assignment (Min-JA) is one of the practical NP-hard problems to manage the optimization in science-and-engineering applications. …”
    Get full text
    Article
  4. 324

    The Application of the SubChain Salp Swarm Algorithm in the Less-Than-Truckload Freight Matching Problem by Yibo Sun, Lei Yue, Yi Liu, Weitong Chen, Zhe Sun

    Published 2025-04-01
    “…Traditional LTL matching methods are challenged by delays in updating logistic information and higher distribution costs. In order to solve LTL challenges, we developed a novel SubChain Salp Swarm Algorithm (SSSA) by improving the traditional Salp Swarm Algorithm with the utilization of a SubChain operation. …”
    Get full text
    Article
  5. 325

    Exploring Evolutionary Algorithms for Optimal Power Flow: A Comprehensive Review and Analysis by Harish Pulluri, Vedik Basetti, B. Srikanth Goud, CH. Naga Sai Kalyan

    Published 2024-10-01
    “…To address these challenges, a variety of classical, evolutionary, and improved optimization techniques have been developed. …”
    Get full text
    Article
  6. 326
  7. 327
  8. 328
  9. 329

    Use Linear Weighted Genetic Algorithm to Optimize the Scheduling of Fog Computing Resources by Ruisheng Li

    Published 2021-01-01
    “…When the user does not specify the preference weight, a set of optimal solutions can be obtained through the improved nondominated sorting genetic algorithm with elite strategy. …”
    Get full text
    Article
  10. 330

    An Optimization Method for Multi-Robot Automatic Welding Control Based on Particle Swarm Genetic Algorithm by Lu Chen, Jie Tan, Tianci Wu, Zengxin Tan, Guobo Yuan, Yuhao Yang, Chiang Liu, Haoyu Zhou, Weisi Xie, Yue Xiu, Gun Li

    Published 2024-10-01
    “…This paper introduces an optimization method for multi-robot automated control welding based on a Particle Swarm Genetic Algorithm (PSGA), aiming to address issues such as high costs, large footprint, and excessive production cycles in multi-robot welding production lines. …”
    Get full text
    Article
  11. 331
  12. 332
  13. 333

    Using The Hybrid GA-Ant Algorithm To Find The Optimal Path In Computer Networks by Ibtisam Turki

    Published 2022-06-01
    “…In order to research and find the optimal path, the improved ant algorithm was used to explore the network, using smart beams, getting the paths generated by ants and then using them as inputs into the genetic algorithm in the form of arranged pairs of chromosomes. …”
    Get full text
    Article
  14. 334

    Optimization model for enterprise financial management utilizing genetic algorithms and fuzzy logic by Sujuan Wang, Musadaq Mansoor

    Published 2025-04-01
    “…A multi-objective mathematical model is first developed to establish key optimization goals, including cost reduction, improved capital utilization, and increased economic benefits. …”
    Get full text
    Article
  15. 335

    The Local Path Planning Algorithm for Amphibious Robots Based on an Improved Dynamic Window Approach by Xiaoqiang Dai, Chengye Liu, Qiang Lai, Xin Huang, Qingjun Zeng, Ming Liu

    Published 2025-02-01
    “…The speed resolution adaptive adjustment algorithm improves the ability to pass through a complex multiple-obstacle area, and the dynamic obstacle prediction algorithm optimizes obstacle avoidance paths. …”
    Get full text
    Article
  16. 336

    Research on Parallel Multi-objective Optimal Submarine Cable Route Planning Algorithm by JIANG Jiarui, ZHAO Zanshan, DUAN Maosheng, GAO Guanjun

    Published 2025-04-01
    “…【Objective】In order to solve the problem that the traditional Ant Colony Optimization (ACO) algorithm updates the same map, resulting in the inability of parallel planning, a parallel multi-objective optimization submarine cable route planning algorithm is proposed in this paper, which realizes the precise planning of local areas.…”
    Get full text
    Article
  17. 337

    Modeling and Optimization of Concrete Mixtures Using Machine Learning Estimators and Genetic Algorithms by Ana I. Oviedo, Jorge M. Londoño, John F. Vargas, Carolina Zuluaga, Ana Gómez

    Published 2024-06-01
    “…ML models are used to predict compressive strength, while genetic algorithms optimize the mixture cost under quality constraints. …”
    Get full text
    Article
  18. 338

    Synchronous End-to-End Vehicle Pedestrian Detection Algorithm Based on Improved YOLOv8 in Complex Scenarios by Shi Lei, He Yi, Jeffrey S. Sarmiento

    Published 2024-09-01
    “…First of all, we have improved YOLOv8 by designing a deformable convolutional improved backbone network and attention mechanism, optimized the network structure, and improved the detection accuracy and speed. …”
    Get full text
    Article
  19. 339

    Optimization of Time-Varying Temperature Profiles for Enhanced Beer Fermentation by Evolutive Algorithms by Pablo Ruarte, Nadia Pantano, Marianela Noriega, Cecilia Fernández, Emanuel Serrano, Gustavo Scaglia

    Published 2024-12-01
    “…The optimized profiles not only enhance fermentation efficiency, but also improve the ethanol yield and reduce undesirable flavor compounds, providing a substantial improvement over current industrial practices. …”
    Get full text
    Article
  20. 340

    Location privacy protection method based on lightweight K-anonymity incremental nearest neighbor algorithm by Saite CHEN, Weihai LI, Yuanzhi YAO, Nenghai YU

    Published 2023-06-01
    “…The use of location-based service brings convenience to people’s daily lives, but it also raises concerns about users’ location privacy.In the k-nearest neighbor query problem, constructing K-anonymizing spatial regions is a method used to protects users’ location privacy, but it results in a large waste of communication overhead.The SpaceTwist scheme is an alternative method that uses an anchor point instead of the real location to complete the k-nearest neighbor query,which is simple to implement and has less waste of communication overhead.However,it cannot guarantee K-anonymous security, and the specific selection method of the anchor point is not provided.To address these shortcomings in SpaceTwist, some schemes calculate the user’s K-anonymity group by introducing a trusted anonymous server or using the way of user collaboration, and then enhance the end condition of the query algorithm to achieve K-anonymity security.Other schemes propose the anchor point optimization method based on the approximate distribution of interest points, which can further reduce the average communication overhead.A lightweight K-anonymity incremental nearest neighbor (LKINN) location privacy protection algorithm was proposed to improve SpaceTwist.LKINN used convex hull mathematical tool to calculate the key points of K-anonymity group, and proposed an anchor selection method based on it, achieving K-anonymity security with low computational and communication costs.LKINN was based on a hybrid location privacy protection architecture, making only semi-trusted security assumptions for all members of the system, which had lax security assumptions compared to some existing research schemes.Simulation results show that LKINN can prevent semi-trusted users from stealing the location privacy of normal users and has smaller query response time and communication overhead compare to some existing schemes.…”
    Get full text
    Article