Suggested Topics within your search.
Suggested Topics within your search.
-
361
Optimization of through-bolt steel beam connection to CFST column reinforced with rib plates using RSM method and MCEO algorithm
Published 2021-09-01“…In order to overcome problems, optimization is performed to increase the load-bearing capacity of the connection and to satisfy the constraints. …”
Get full text
Article -
362
Optimizing the Shape of Signals with Quadrature Amplitude Modulation According to the Criterion of Given Reduction Rate of Out-of-Band Emissions
Published 2022-09-01“…The optimization problem was solved according to the criterion of minimizing out-of-band emissions with the constraint on bit error rate performance in case of amplitude-phase modulation. …”
Get full text
Article -
363
-
364
-
365
Mixing cubic quasi-interpolation spline collocation method and optimal control techniques to solve polyharmonic (p=2 and p=3) problem
Published 2025-05-01“…This case is reformulated as an optimal control problem, for which we prove the existence and uniqueness of the solution. …”
Get full text
Article -
366
A Deep Reinforcement Learning-Driven Seagull Optimization Algorithm for Solving Multi-UAV Task Allocation Problem in Plateau Ecological Restoration
Published 2025-06-01“…A multi-objective, multi-constraint collaborative task allocation problem (MOMCCTAP) model was developed, incorporating constraints such as UAV collaboration, task completion priorities, and maximum range restrictions. …”
Get full text
Article -
367
Study on distributed and dynamic resource management for delay-sensitive sensor network
Published 2017-07-01“…The delay-aware dynamic resource management problem was investigated in sensor network,with a focus on resource allocation among the sensors and power control along the time.By taking account of average delay requirements and power constraints,the considered problem was formulated into a stochastic optimization problem.Inspired by Lyapunov optimization theory,the intractable stochastic optimization problem was transformed into a tractable deterministic optimization problem,which was a mixed-integer resource management problem.By exploiting the specific problem structure,the mixed-integer resource management problem was equivalently transformed into a single variable problem,and the cooperative distributed method was present to effectively solve it with guaranteed global optimality.Finally,a dynamic resource management algorithm was proposed to solve the original stochastic optimization problem.Simulation results show the performance of the proposed dynamic algorithm and reveal that there exists a fundamental tradeoff between delay requirements and power consumption.…”
Get full text
Article -
368
Two TOPSIS-Based Approaches for Multi-Choice Rough Bi-Level Multi-Objective Nonlinear Programming Problems
Published 2025-04-01Get full text
Article -
369
A two-stage robust optimization model for emergency service facilities location-allocation problem under demand uncertainty and sustainable development
Published 2025-01-01“…This paper delves into the ESF network design problem under demand uncertainty and formulates this problem as a two-stage robust optimization model. …”
Get full text
Article -
370
A Distributional Robust Distribution Network Reconfiguration Method Based on Compressed Switch Candidate Set
Published 2024-10-01“…In the large-scale multi-moment distribution network reconfiguration (DNR) problem, a large number of switches to be optimized seriously reduces the solution efficiency of distribution network reconfiguration. …”
Get full text
Article -
371
BFO-ACO roaming path planning based on multi-constraint scenarios
Published 2022-07-01“…In recent years, when the path planning based on ant colony algorithm is used to find the optimal path under multiple constraints, it is easy to fall into the local optimal solution and lead to slow convergence. …”
Get full text
Article -
372
Constraint Composite Graph-Based Weighted CSP Solvers: An Empirical Study
Published 2024-05-01“…The Weighted Constraint Satisfaction Problem (WCSP) is a very expressive framework for optimization problems. …”
Get full text
Article -
373
-
374
A Concise Review of Home Health Care Routing and Scheduling Problem
Published 2025-12-01“…The Home Health Care Routing and Scheduling Problem (HHCRSP) plays a crucial role in optimizing the delivery of home-based healthcare services by efficiently allocating caregivers to patient locations while adhering to logistical, operational, and regulatory constraints. …”
Get full text
Article -
375
Counting workflow satisfiability with exclusion constraints based on backtracking tree-decomposition
Published 2016-10-01“…The classic backtracking tree-decomposition method was employed to solve #WS(≠)via a polynomial-time counting reduction to a counting constraint satisfiability problem. Experiments show that, the proposed optimized algorithm declined in running time, and has well synthetical performance for workflows with low-density constraints compared to the existing #WS(≠)algorithms.…”
Get full text
Article -
376
Trajectory Planning of First Stage Rocket Powered Vertical Recovery Using a Hybrid Optimization Method
Published 2019-01-01“…Standard trajectory design is the basis of rocket recovery guidance law. For this problem, a new hybrid optimization method combining the exterior penalty method, the genetic algorithm (GA) and the sequential quadratic programming (SQP) was proposed. …”
Get full text
Article -
377
Innovative hybrid algorithm for efficient routing of limited capacity vehicles
Published 2025-03-01“…This study addresses the critical challenges posed by the capacitated vehicle routing problem (CVRP), particularly in the logistics of cement transportation under capacity constraints. …”
Get full text
Article -
378
Link-disjoint routing algorithm under multiple additive QoS constraints
Published 2010-01-01“…The problem of finding link-disjoint paths under multiple additive QoS constraints was studied.Since the existing algorithms depended on network’s structure and could not guarantee to find feasible solutions for arbitrary net-works,a novel algorithm called multiple constrained link-disjoint path routing algorithm(MCLPRA) was proposed.MCLPRA was based on SAMCRA and didn’t rely on the network’s structure.By introducing the parameter to control its search depth,dividing the solution space into different classes and performing searching according to the classes respectively,MCLPRA was able to obtain the feasible solutions for arbitrary networks.Theoretic analysis shows that MCLPRA can get the feasible and optimal solutions when traditional schemes can not.Comprehensive simulations also show that MCLPRA has better performances than existing algorithms in terms of higher average successful rate of getting feasible solutions with shorter average total length of the obtained path pair.…”
Get full text
Article -
379
Designing Equilibria in Concurrent Games with Social Welfare and Temporal Logic Constraints
Published 2024-12-01Get full text
Article -
380
ASYMPTOTIC EXPANSION OF A SOLUTION FOR ONE SINGULARLY PERTURBED OPTIMAL CONTROL PROBLEM IN \(\mathbb{R}^n\) WITH A CONVEX INTEGRAL QUALITY INDEX
Published 2017-07-01“…The paper deals with the problem of optimal control with a convex integral quality index for a linear steady-state control system in the class of piecewise continuous controls with a smooth control constraints. …”
Get full text
Article