Search results for "Search algorithm"
showing 10 items of 73 documents
A tabu search algorithm for a two-dimensional non-guillotine cutting problem
2007
In this paper we study a two-dimensional non-guillotine cutting problem, the problem of cutting rectangular pieces from a large stock rectangle so as to maximize the total value of the pieces cut. The problem has many industrial applications whenever small pieces have to be cut from or packed into a large stock sheet. We propose a tabu search algorithm. Several moves based on reducing and inserting blocks of pieces have been defined. Intensification and diversification procedures, based on long-term memory, have been included. The computational results on large sets of test instances show that the algorithm is very efficient for a wide range of packing and cutting problems.
Path relinking and GRG for artificial neural networks
2006
Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is approximated. ANNs can be viewed as models of real systems, built by tuning parameters known as weights. In training the net, the problem is to find the weights that optimize its performance (i.e., to minimize the error over the training set). Although the most popular method for training these networks is back propagation, other optimization methods such as tabu search or scatter search have been successfully applied to solve this problem. In this paper we propose a path relinking implementation to solve the neural ne…
Robust estimation of partial directed coherence by the vector optimal parameter search algorithm
2009
We propose a method for the accurate estimation of Partial Directed Coherence (PDC) from multichannel time series. The method is based on multivariate vector autoregressive (MVAR) model identification performed through the recently proposed Vector Optimal Parameter Search (VOPS) algorithm. Using Monte Carlo simulations generated by different MVAR models, the proposed VOPS algorithm is compared with the traditional Vector Least Squares (VLS) identification method. We show that the VOPS provides more accurate PDC estimates than the VLS (either overall and single-arc errors) in presence of interactions with long delays and missing terms, and for noisy multichannel time series. ©2009 IEEE.
Adaptive and Dynamic Ant Colony Search Algorithm for Optimal Distribution Systems Reinforcement Strategy
2006
The metaheuristic technique of Ant Colony Search has been revised here in order to deal with dynamic search optimization problems having a large search space and mixed integer variables. The problem to which it has been applied is an electrical distribution systems management problem. This kind of issues is indeed getting increasingly complicated due to the introduction of new energy trading strategies, new environmental constraints and new technologies. In particular, in this paper, the problem of finding the optimal reinforcement strategy to provide reliable and economic service to customers in a given time frame is investigated. Utilities indeed need efficient software tools to take deci…
Multiobjective ant colony search algorithm optimal electrical distribution system planning
2005
A dynamic multiobjective, MO, algorithm based on the ant colony search, the multiobjective ant colony search algorithm, MOACS, is presented. The application domain is that of dynamic planning for electrical distribution systems. A time horizon of H years has been considered during which the distribution system are modified according to the new internal (loads) and external (market, reliability, power quality) requirements. In this scenario, the objectives the Authors consider most important for utilities in strategical planning are: the quality requirement connected to the decrease of the expected number of interruptions per year and customer, in the considered time frame, and the choice fo…
Fuzzified Game Tree Search – Precision vs Speed
2012
Most game tree search algorithms consider finding the optimal move. That is, given an evaluation function they guarantee that selected move will be the best according to it. However, in practice most evaluation functions are themselves approximations and cannot be considered "optimal". Besides, we might be satisfied with nearly optimal solution if it gives us a considerable performance improvement. In this paper we present the approximation based implementations of the fuzzified game tree search algorithm. The paradigm of the algorithm allows us to efficiently find nearly optimal solutions so we can choose the "target quality" of the search with arbitrary precision --- either it is 100% (pr…
Notice of Violation of IEEE Publication Principles<BR>An adaptive routing mechanism for P2P resource discovery
2005
The key to the usability of large-scale decentralize peer-to-peer (P2P) systems, and one of the most challenge design aspects, is efficient mechanism for distributed resource discovery. Unstructured P2P networks are very attractive because they do not suffer the limitations of centralized systems an the drawbacks of highly structured approaches. However the search algorithms are usually based on simple flooding scheme generating large loads on the network participants. In this paper to address this major limitation, we present the design an evaluation of an innovative searching protocol in unstructured P2P networks. The approach aims at dynamically adapting the network topology to peers' in…
All-sky search for long-duration gravitational wave transients in the first Advanced LIGO observing run
2018
Made available in DSpace on 2018-11-26T17:45:14Z (GMT). No. of bitstreams: 0 Previous issue date: 2018-03-22 Australian Research Council Council of Scientific and Industrial Research of India Department of Science and Technology, India Science AMP; Engineering Research Board (SERB), India Ministry of Human Resource Development, India Spanish Agencia Estatal de Investigacion Vicepresidencia i Conselleria d'Innovacio, Recerca i Turisme Conselleria d'Educacio i Universitat del Govern de les Illes Balears Conselleria d'Educacio, Investigacio, Cultura i Esport de la Generalitat Valenciana National Science Centre of Poland Swiss National Science Foundation (SNSF) Russian Foundation for Basic Rese…
The Corona of the Sun as a Star
2006
We study the physics of the solar corona as a whole, i.e. of the Sun as a Star, in order to understand its global features and to provide a template for stellar coronae. In this process we strive to understand the features of various structures which compose the solar corona. This process in not straightforward given the problems of observing the Sun as a whole: e.g., no recent X‐ray wide‐band, medium‐resolution, spectrum of the Sun is avaible, unlike stars and no X‐ray spectral monitoring of the Sun at various activity phases is available. The presentation will discuss our work in this field; we present the method we have devised, based on Yohkoh/SXT data, to derive the Differential Emissi…
Nonadiabatic quantum search algorithms
2007
7 pages, 4 figures.-- PACS nrs.: 03.67.Lx, 05.45.Mt, 72.15.Rn.-- ISI Article Identifier: 000251326400049.-- ArXiv pre-print available at: http://arxiv.org/abs/0706.1139