79 resultados para Routing path
em Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho"
Resumo:
The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required edges under vehicle capacity constraints. There are numerous applications for the CARP, such as street sweeping, garbage collection, mail delivery, school bus routing, and meter reading. A Greedy Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed and compared with other successful CARP metaheuristics. Some features of this GRASP with PR are (i) reactive parameter tuning, where the parameter value is stochastically selected biased in favor of those values which historically produced the best solutions in average; (ii) a statistical filter, which discard initial solutions if they are unlikely to improve the incumbent best solution; (iii) infeasible local search, where high-quality solutions, though infeasible, are used to explore the feasible/infeasible boundaries of the solution space; (iv) evolutionary PR, a recent trend where the pool of elite solutions is progressively improved by successive relinking of pairs of elite solutions. Computational tests were conducted using a set of 81 instances, and results reveal that the GRASP is very competitive, achieving the best overall deviation from lower bounds and the highest number of best solutions found. © 2011 Elsevier Ltd. All rights reserved.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Nowadays, fraud detection is important to avoid nontechnical energy losses. Various electric companies around the world have been faced with such losses, mainly from industrial and commercial consumers. This problem has traditionally been dealt with using artificial intelligence techniques, although their use can result in difficulties such as a high computational burden in the training phase and problems with parameter optimization. A recently-developed pattern recognition technique called optimum-path forest (OPF), however, has been shown to be superior to state-of-the-art artificial intelligence techniques. In this paper, we proposed to use OPF for nontechnical losses detection, as well as to apply its learning and pruning algorithms to this purpose. Comparisons against neural networks and other techniques demonstrated the robustness of the OPF with respect to commercial losses automatic identification.
Resumo:
Absorbance detection in capillary electrophoresis (CE), offers an excellent mass sensitivity, but poor concentration detection limits owing to very small injection volumes (normally I to 10 nL). This aspect can be a limiting factor in the applicability of CE/UV to detect species at trace levels, particularly pesticide residues. In the present work, the optical path length of an on-column detection cell was increased through a proper connection of the column (75 mu m i.d.) to a capillary detection cell of 180 mu m optical path length in order to improve detectability. It is shown that the cell with an extended optical path length results in a significant gain in terms of signal to noise ratio. The effect of the increase in the optical path length has been evaluated for six pesticides, namely, carbendazim, thiabendazole, imazalil, procymidone triadimefon, and prochloraz. The resulting optical enhancement of the detection cell provided detection limits of ca. 0.3 mu g/mL for the studied compounds, thus enabling the residue analysis by CE/UV.
Resumo:
An interferometric technique was used to determine the temperature coefficient of the optical path length (dS/dT) as a function of the temperature in several optical glasses. The temperature range was between 25degreesC and 180degreesC. The studied samples included undoped and doped oxide glasses, such as low silica calcium aluminosilicate, phosphates, borates and also chalcogenides. The oxide glasses had dS/dT between 10 X 10(-6) K-1 and 20x10(-6) K-1, while for the chalcogenides, these were around 70 x 10(-6)K(-1). The results showed that dS/dTs increased with the temperature in all samples. For samples doped with Nd the dS/dT values were found to be independent of concentration. on the other hand, for the phosphate glass doped with Cr, dS/dT increased about 5% when compared with the Nd doped one. In conclusion, the used interferometric method, which is a considerably simpler and a lower cost technique, and is a useful tool to measure dS/dT in semi-transparent glasses as a function of the composition and temperature. (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
The recently introduced dressed coordinates are studied in the path-integral approach. These coordinates are defined in the context of a harmonic oscillator linearly coupled to massless scalar field and it is shown that in this model the dressed coordinates appear as a coordinate transformation preserving the path-integral functional measure. The analysis also generalizes the sum rules established in a previous work. (c) 2006 Elsevier B.V. All rights reserved.
Resumo:
This paper considers the Schrodinger propagator on a cone with the conical singularity carrying magnetic flux (flux cone). Starting from the operator formalism, and then combining techniques of path integration in polar coordinates and in spaces with constraints, the propagator and its path integral representation are derived. The approach shows that effective Lagrangian contains a quantum correction term and that configuration space presents features of nontrivial connectivity.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)