Results 81 to 90 of about 46,625 (244)
Havacılık ve Uzay Teknolojileri Dergisi, 2021 Nowadays, the use of metaheuristic optimization algorithms is becoming widespread because of easy applying and be able to provide requirements in the solution of high level complex optimization problems.
Kunter Sercan SEZER, Nevra BAYHAN
doaj
A study on exponential-size neighborhoods for the bin packing problem with conflicts
, 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
International 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
Leveraging Public Transit for Robotic Deliveries: A Column Generation Approach
Naval Research Logistics (NRL), EarlyView.ABSTRACT Autonomous mobile robots (AMRs) are small, electric, wheeled vehicles that operate at pedestrian speeds. In the last‐mile delivery service considered in this study, a fleet of AMRs is deployed across multiple recharging depots within a service area, from which they depart to perform point‐to‐point deliveries. We consider an operational setting
Yishay Shapira, Mor Kaspi
wiley +1 more source
IEEE AccessSustainable development has emerged as a global priority, and industries are increasingly striving to align their operations with sustainable practices.
Absalom El-Shamir Ezugwu
doaj +1 more source
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
Networks, 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
International Journal of Turkish Education SciencesThis 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
Sustainable Development, EarlyView.ABSTRACT This study presents an analysis of the literature on artificial intelligence (AI), blockchain and internet of things (IoT) for the sustainable development of the service industry of freight transport and logistics service providers (LSPs).
Roberto Cerchione +2 more
wiley +1 more source
Small, EarlyView.We report a magnetic particle anchored locked aptamer platform integrated with hyperbranched HCR and DNAzyme amplification for enzyme‐free, ultrasensitive detection of cardiac troponin I. The assay achieves a 0.25 ng/L detection limit within 25 minutes and enables cross‐species MI detection, with machine learning classification reaching 90% accuracy ...
Sayantan Tripathy +9 more
wiley +1 more source
, 2015 We consider the university course timetabling problem, which is one of the most studied problems in educational timetabling. In particular, we focus our attention on the formulation known as the curriculum-based course timetabling problem, which has been
Bellio, Ruggero +4 more
core +1 more source