Results 111 to 120 of about 373,349 (265)
How Much Is Too Much? Facing Practical Limitations in Hyper-Heuristic Design for Packing Problems
Hyper-heuristics, or simply heuristics to choose heuristics, represent a powerful approach to tackling complex optimization problems. These methods decide which heuristic to apply throughout the solving process, aiming to improve the solving process ...
José Carlos Ortiz-Bayliss +2 more
doaj +1 more source
Trust‐region filter algorithms utilizing Hessian information for gray‐box optimization
Abstract Optimizing industrial processes often involves gray‐box models that couple algebraic glass‐box equations with black‐box components lacking analytic derivatives. Such systems challenge derivative‐based solvers. The classical trust‐region filter (TRF) algorithm provides a robust framework but requires extensive parameter tuning and numerous ...
Gul Hameed +4 more
wiley +1 more source
Improved Heuristics for the Early/Tardy Scheduling Problem with No Idle Time [PDF]
In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. We present two new heuristics, a dispatch rule and a greedy procedure, and also consider the best of the existing dispatch rules.
Jorge M. S. Valente, Rui A. F. S. Alves
core
A trust‐region funnel algorithm for gray‐box optimization
Abstract Gray‐box optimization, where parts of optimization problems are represented by algebraic models while others are treated as black‐box models lacking analytic derivatives, remains a challenge. Trust‐region (TR) methods provide a robust framework for gray‐box problems through local reduced models (RMs) for black‐box components, but they are ...
Gul Hameed +4 more
wiley +1 more source
Abstract This article demonstrates the integration of in‐line mass spectrometry as a process analytical technology (PAT) tool with model‐based soft sensors in a continuous filtration‐drying carousel system for solid–liquid separation (SLS) of crystal slurries.
Inyoung Hur +3 more
wiley +1 more source
Graph‐based imitation and reinforcement learning for efficient Benders decomposition
Abstract This work introduces an end‐to‐end graph‐based agent for accelerating the computational efficiency of Benders Decomposition. The agent's policy is parameterized by a graph neural network, which takes as input a bipartite graph representation of the master problem and proposes a candidate solution.
Bernard T. Agyeman +3 more
wiley +1 more source
Enhancing the adaptability of Unmanned Aerial Vehicle (UAV) swarm control models to cope with different complex working scenarios is an important issue in this research field.
Yuan Wang +4 more
doaj +1 more source
Worst case analysis for a general class of on-line lot-sizing heuristics. [PDF]
In this paper we analyze the worst case performance of heuristics for the classical economic lot-sizing problem with time-invariant cost parameters. We consider a general class of on-line heuristics that is often applied in a rolling horizon environment.
Heuvel, W. van den, Wagelmans, A.P.M.
core +1 more source
AI in chemical engineering: From promise to practice
Abstract Artificial intelligence (AI) in chemical engineering has moved from promise to practice: physics‐aware (gray‐box) models are gaining traction, reinforcement learning complements model predictive control (MPC), and generative AI powers documentation, digitization, and safety workflows.
Jia Wei Chew +4 more
wiley +1 more source
Integrating customer relationship management strategies in (B2C) e-commerce environments
Creating value and generating a total customer experience(TCE ) is important for E -Commerce in order to attract customers. However, with increasing competition in the marketplace, it is becoming increasingly difficult to retain customers.
Dawson, Liisa +2 more
core

