Results 11 to 20 of about 870,191 (292)
A Hybrid Exact Algorithm for the TSPTW [PDF]
The Traveling Salesman Problem with Time Windows (TSPTW) is the problem of finding a minimum-cost path visiting a set of cities exactly once, where each city must be visited within a specific time window. We propose a hybrid approach for solving the TSPTW that merges Constraint Programming propagation algorithms for the feasibility viewpoint (find a ...
Filippo Focacci +2 more
openaire +1 more source
On Hybrid Multigrid-Schwarz Algorithms [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sébastien Loisel +2 more
openaire +2 more sources
Real-Time Path Planning for Power Tower Inspection Based on Hybrid Algorithm
The sequence of conventional shooting viewpoints for power tower is fixed and the inspection distance of multi-rotor UAV is not optimal. In addition, as the dimension increases, the path planning algorithm cannot meet the requirements of real-time path ...
Zheng HUANG +4 more
doaj +1 more source
Liquid + Liquid Equilibria of the Ternary System Water + Glycerol + 1-Butanol System: Experimental Data and Modeling [PDF]
In this study, solubility and tie-line data of ternary system water + glycerol + 1-butanol were determined at 293.2, 298.2, and 303.2 K and atmospheric pressure. This thermodynamic system is relevant for the production and purification of biofuels. Phase
Noureddine Boumaza +2 more
doaj +1 more source
An Architecture for Adaptive Algorithmic Hybrids [PDF]
We describe a cognitive architecture for creating more robust intelligent systems. Our approach is to enable hybrids of algorithms based on different computational formalisms to be executed. The architecture is motivated by some features of human cognitive architecture and the following beliefs: 1) Most existing computational methods often exhibit some
Nicholas L. Cassimatis +6 more
openaire +2 more sources
Optimal Constructions of Hybrid Algorithms [PDF]
We study on-line strategies for solving problems with hybrid algorithms. There is a problem Q and w basic algorithms for solving Q. For some lambda <= w, we have a computer with lambda disjoint memory areas, each of which can be used to run a basic algorithm and store its intermediate results.
Ming-Yang Kao +3 more
openaire +3 more sources
Odd-flavor Simulations by the Hybrid Monte Carlo [PDF]
The standard hybrid Monte Carlo algorithm is known to simulate even flavors QCD only. Simulations of odd flavors QCD, however, can be also performed in the framework of the hybrid Monte Carlo algorithm where the inverse of the fermion matrix is ...
de Forcrand, Philippe, Takaishi, Tetsuya
core +2 more sources
Simulation of n_f =3 QCD by Hybrid Monte Carlo [PDF]
Simulations of odd flavors QCD can be performed in the framework of the hybrid Monte Carlo algorithm where the inverse of the fermion matrix is approximated by a polynomial. In this exploratory study we perform three flavors QCD simulations.
Alexandrou +14 more
core +2 more sources
Parameter estimation is an important issue in nonlinear science, which can be formulated as a multi-dimensional problem. Numbers of nature-inspired meta-heuristic algorithms have been applied for parameter estimation of chaotic systems; however, many of ...
Jiamin Wei, Yongguang Yu
doaj +1 more source
An Effective Metaheuristic Approach for Building Energy Optimization Problems
Mathematical optimization can be a useful strategy for minimizing energy usage while designing low-energy buildings. To handle building energy optimization challenges, this study provides an effective hybrid technique based on the pelican optimization ...
Xinzhe Yuan +5 more
doaj +1 more source

