Results 81 to 90 of about 45,948 (211)

A study on exponential-size neighborhoods for the bin packing problem with conflicts

open access: yes, 2017
We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the characteristics of both bin packing and vertex coloring, arises in various ...
Capua, Renatha   +3 more
core   +1 more source

Ellipsoid‐Based Interval‐Type Uncertainty Model Updating Based on Riemannian Manifold and Gaussian Process Model

open access: yesInternational Journal of Mechanical System Dynamics, EarlyView.
ABSTRACT Modern engineering systems require advanced uncertainty‐aware model updating methods that address parameter correlations beyond conventional interval analysis. This paper proposes a novel framework integrating Riemannian manifold theory with Gaussian Process Regression (GPR) for systems governed by Symmetric Positive‐Definite (SPD) matrix ...
Yanhe Tao   +3 more
wiley   +1 more source

Farmer Ants Optimization Algorithm: A Novel Metaheuristic for Solving Discrete Optimization Problems

open access: yesInformation
Currently, certain complex issues are classified as NP-hard problems, for which there is no exact solution, or they cannot be solved in a reasonable amount of time. As a result, metaheuristic algorithms have been developed as an alternative.
Ali Asghari   +4 more
doaj   +1 more source

State Transition Algorithm

open access: yes, 2012
In terms of the concepts of state and state transition, a new heuristic random search algorithm named state transition algorithm is proposed. For continuous function optimization problems, four special transformation operators called rotation ...
A. H. Wright   +33 more
core   +1 more source

Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs

open access: yesNetworks, EarlyView.
ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w)$$ G=\left(V,\kern0.3em E,\kern0.3em w\right) $$ is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP$$ \mathbf{NP} $$‐hard. Next to 13 novel data
Jannick Borowitz   +2 more
wiley   +1 more source

Designing a Draft for a Metaheuristic Curriculum Evaluation Model (MCEM) Based on the Examination of Various Metaheuristic Artificial Intelligence Optimization Applications

open access: yesUluslararası Türk Eğitim Bilimleri Dergisi
This paper explores the integration of metaheuristic artificial intelligence (AI) optimization algorithms into the process of curriculum evaluation, proposing a novel approach that could enhance educational outcomes.
Volkan Duran, Gülay Ekici
doaj   +1 more source

HyLPD Digital Twin Control for UAV Stability in High‐Wind Conditions

open access: yesOptimal Control Applications and Methods, EarlyView.
This work introduces a novel HyLPD, a hybrid control framework combining Linear Quadratic Regulator (LQR) for baseline stability and Deep Deterministic Policy Gradient (DDPG) for adaptive compensation, tailored for UAVs under high‐wind conditions.
Cara Rose   +2 more
wiley   +1 more source

End‐to‐End Portfolio Optimization with Hybrid Quantum Annealing

open access: yesAdvanced Quantum Technologies, EarlyView.
This works presents a hybrid quantum‐classical framework for portfolio optimization that combines quantum assisted asset selection and rebalancing with classical weight allocation. The approach processes real market data, embeds it into Quadratic Unconstrained Binary Optimization formulations, and evaluates performance within a unified workflow ...
Sai Nandan Morapakula   +5 more
wiley   +1 more source

A new approach to minimize the makespan of various resource-constrained project scheduling problems [PDF]

open access: yes, 2014
Conferência realizada de 30 de março a 2 de abril de 2014This abstract presents a new solution approach to solve the resource-constrained project scheduling problem in the presence of multiple modes with mode identity constraints and two types of logical
Coelho, José, Vanhoucke, Mario
core  

Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence

open access: yes, 2013
This paper considers the problem of scheduling jobs on single and parallel machines where all the jobs possess different processing times but a common due date.
Awasthi, Abhishek   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy