Suggested Topics within your search.
Suggested Topics within your search.
-
341
A neo-cooperation search based evolutionary algorithm for multi-objective electric rope shovel production scheduling
Published 2025-04-01“…Therefore, the electric rope shovel production scheduling problem turns out to be challenging for general optimizers, requiring to find the optimal operation sequence, make trade-offs between multiple conflicting objectives, and satisfy a series of strict constraints. …”
Get full text
Article -
342
Multiperiod Location–Allocation Optimization of Construction Logistics Centers for Large-Scale Projects in Complex Environmental Regions
Published 2025-03-01“…However, the CLC location–allocation problem, which considers periodic demand and transportation risk, has not been adequately solved. …”
Get full text
Article -
343
Optimality Conditions and Stability Analysis for the Second-Order Cone Constrained Variational Inequalities
Published 2025-04-01Get full text
Article -
344
On Wolfe duality for mathematical programs with equilibrium constraints using directional convexificators
Published 2025-08-01“…Abstract In this paper, we consider a mathematical programming problem with equilibrium constraints (MPEC), where its functions are not necessarily smooth, continuous, or locally Lipschitz. …”
Get full text
Article -
345
A Two-Stage Offline-to-Online Multiobjective Optimization Strategy for Ship Integrated Energy System Economical/ Environmental Scheduling Problem
Published 2021-01-01“…The economical/environmental scheduling problem (EESP) of the ship integrated energy system (SIES) has high computational complexity, which includes more than one optimization objective, various types of constraints, and frequently fluctuated load demand. …”
Get full text
Article -
346
Flexible Capacitated Vehicle Routing Problem Solution Method Based on Memory Pointer Network
Published 2025-03-01“…To address these limitations, we propose a flexible CVRP model, referred to as Flexible CVRP, which modifies the optimization objectives and constraints. This allows CVRP to provide a sensible solution even when no feasible solution exists in the traditional sense. …”
Get full text
Article -
347
Interdisciplinary Methodology for Resource Allocation Problems Using Artificial Neural Networks and Software Robots
Published 2025-01-01“…By embedding human-centered constraints directly into the optimization process, this study offers a pathway to mitigate potential issues such as worker overload and improve overall worker satisfaction. …”
Get full text
Article -
348
Evaluation of Disassembling Process Inference Based on Positional Relations Matrix
Published 2025-04-01“…We have evaluated the practicality of the proposed disassembling process inference based on a number of disassembling problems which were generated by means of a problem-generation system based on random number generator. …”
Get full text
Article -
349
High-Level Synthesis under Fixed-Point Accuracy Constraint
Published 2012-01-01Get full text
Article -
350
The Interplay Between Loss Functions and Structural Constraints in Dependency Parsing
Published 2019-12-01“… Dependency parsing can be cast as a combinatorial optimization problem with the objective to find the highest-scoring graph, where edge scores are learnt from data. …”
Get full text
Article -
351
Flow direction algorithm for optimal coordination of directional overcurrent relays considering arc flash
Published 2025-03-01“…The objective of this study is to reduce the overall operation time of primary relays under certain constraints and thus reduce the amount of IE. The FDA is designed to address the highly nonlinear optimization problem of DOCRs coordination. …”
Get full text
Article -
352
Simulation-based deep reinforcement learning for multi-objective identical parallel machine scheduling problem
Published 2024-01-01“…In the shipbuilding industry, traditional optimization studies based on linear programming and constraint programming have been conducted to solve mid-term or long-term scheduling problems. …”
Get full text
Article -
353
Approximation method of multiple consistency constraint under differential privacy
Published 2021-06-01“…Under differential privacy, to solve the optimal publishing problem with multiple consistency constraints, an approximation method of multiple consistency constraints was proposed by the theoretical analysis of the principle of optimal consistency release.The main idea was to divide the consistency constraint problem into several consistency constraint sub-problems and then achieve the original problem's optimal consistency release by solving each consistency constraint sub-problem repeatedly and independently.The advantage was that after the consistency constraint problem divided, the sub-problems were often easier to solve, or the technology to achieve optimal and consistent release of sub-problems is quite mature.Therefore more complex differential privacy optimal release problem could be solved.After analysis, the approximation method's convergence was fully demonstrated, ensuring that any partition of consistency constrained sub-problems can always achieve the optimal consistency release of the original problem.Furthermore, taking the sales histogram publishing as an example, based on the approximation method of multiple consistency constraints, a parallel algorithm was designed with optimal consistency release under differential privacy.The experimental results show that the algorithm's efficiency is 400 times higher than that of the general solution, and the algorithm can process millions of large-scale data.…”
Get full text
Article -
354
Parallel-Batch Scheduling and Transportation Coordination with Waiting Time Constraint
Published 2014-01-01“…This paper addresses a parallel-batch scheduling problem that incorporates transportation of raw materials or semifinished products before processing with waiting time constraint. …”
Get full text
Article -
355
Finding the Shortest Path with Vertex Constraint over Large Graphs
Published 2019-01-01Get full text
Article -
356
Network moving target defense technique based on optimal forwarding path migration
Published 2017-03-01“…Moving target defense is a revolutionary technology which changes the situation of attack and defense.How to effectively achieve forwarding path mutation is one of the hotspot in this field.Since existing mechanisms are blindness and lack of constraints in the process of mutation,it is hard to maximize mutation defense benefit under the condition of good network quality of services.A novel of network moving target defense technique based on optimal forwarding path migration was proposed.Satisfiability modulo theory was adopted to formally describe the mutation constraints,so as to prevent transient problem.Optimization combination between routing path and mutation period was chosen by using optimal routing path generation method based on security capacity matrix so as to maximum defense benefit.Theoretical and experimental analysis show the defense cost and benefit in resisting passive sniffing attacks.The capability of achieving maximum defense benefit under the condition of ensuring network quality of service is proved.…”
Get full text
Article -
357
A solution to the Single-School school bus routing problem considering accessibility and economy
Published 2025-07-01“…The school bus routing problem (SBRP) involves the optimal placement of bus stops and design of bus routes. …”
Get full text
Article -
358
Solvability of the Quaternary Continuous Classical Boundary Optimal Control Dominated by Quaternary Parabolic System
Published 2024-06-01“… The purpose of this paper is to study the solvability of the quaternary continuous classical boundary optimal control vector problem dominated by quaternary nonlinear parabolic boundary value problem with state constraints. …”
Get full text
Article -
359
Minimization of Resource Consumption with URLLC Constraints for Relay-Assisted IIoT
Published 2025-08-01“…In relay-assisted Industrial Internet of Things (IIoT) systems with ultra-reliable low-latency communication (uRLLC) requirements, finite blocklength coding imposes stringent resource constraints. In this work, the packet error probability (PEP) and blocklength allocation across two-hop links are jointly optimized to minimize total blocklength (resource consumption) while satisfying reliability, latency, and throughput requirements. …”
Get full text
Article -
360
JCN: Joint Constraint-Based Human Pose Refinement Networks
Published 2025-01-01“…We propose our approach to two critical problems in pose estimation, occlusion and background interference, for which the model often needs local information for inference. …”
Get full text
Article