46 resultados para Vehicle Routing Problem Multi-Trip Ricerca Operativa TSP VRP


Relevância:

30.00% 30.00%

Publicador:

Resumo:

A multi-agent system with a percolation approach to simulate the driving pattern of Plug-In Electric Vehicle (PEV), especially suited to simulate the PEVs behavior on any distribution systems, is presented. This tool intends to complement information about the driving patterns database on systems where that kind of information is not available. So, this paper aims to provide a framework that is able to work with any kind of technology and load generated of PEVs. The service zone is divided into several sub-zones, each subzone is considered as an independent agent identified with corresponding load level, and their relationships with the neighboring zones are represented as network probabilities. A percolation approach is used to characterize the autonomy of the battery of the PVEs to move through the city. The methodology is tested with data from a mid-size city real distribution system. The result shows the sub-area where the battery of PEVs will need to be recharge and gives the planners of distribution systems the necessary input for a medium to long term network planning in a smart grid environment. © 2012 IEEE.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This paper proposes strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem (TEP). The concept of the binary numeral system (BNS) is used to reduce the number of binary and continuous variables related to the candidate transmission lines and network constraints that are connected with them. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) and additional constraints, obtained from power flow equilibrium in an electric power system are employed for more reduction in search space. The multistage TEP problem is modeled like a mixed binary linear programming problem and solved using a commercial solver with a low computational time. The results of one test system and two real systems are presented in order to show the efficiency of the proposed solution technique. © 1969-2012 IEEE.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

The purpose of this study is to develop a dynamic vibration absorber using viscoelastic material with nonlinear essential stiffness and time-dependent damping properties for a non-ideal vibrating system with Sommerfeld effect, resonance capture, and jump phenomenon. The absorber is a mass-bar subsystem that consists of a viscoelastic bar with memory attached to mass, in which the internal dissipative forces depend on current, deformations, and its operational frequency varies with limited temperature. The non-ideal vibrating system consists of a linear (nonlinear) oscillator (plane frame structure) under excitation, via spring connector, of a DC-motor with limited power supply. A viscoelastic dynamic absorber modeled with elastic stiffness essentially nonlinearities was developed to further reduce the Sommerfeld effect and the response of the structure. The numerical results show the performance of the absorber on the non-ideal system response through the resonance curves, time histories, and Poincarésections. Furthermore, the structure responses using the viscoelastic damper with and without memory were studied. © IMechE 2012.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This paper tackles a Nurse Scheduling Problem which consists of generating work schedules for a set of nurses while considering their shift preferences and other requirements. The objective is to maximize the satisfaction of nurses' preferences and minimize the violation of soft constraints. This paper presents a new deterministic heuristic algorithm, called MAPA (multi-assignment problem-based algorithm), which is based on successive resolutions of the assignment problem. The algorithm has two phases: a constructive phase and an improvement phase. The constructive phase builds a full schedule by solving successive assignment problems, one for each day in the planning period. The improvement phase uses a couple of procedures that re-solve assignment problems to produce a better schedule. Given the deterministic nature of this algorithm, the same schedule is obtained each time that the algorithm is applied to the same problem instance. The performance of MAPA is benchmarked against published results for almost 250,000 instances from the NSPLib dataset. In most cases, particularly on large instances of the problem, the results produced by MAPA are better when compared to best-known solutions from the literature. The experiments reported here also show that the MAPA algorithm finds more feasible solutions compared with other algorithms in the literature, which suggest that this proposed approach is effective and robust. © 2013 Springer Science+Business Media New York.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Goal Programming (GP) is an important analytical approach devised to solve many realworld problems. The first GP model is known as Weighted Goal Programming (WGP). However, Multi-Choice Aspirations Level (MCAL) problems cannot be solved by current GP techniques. In this paper, we propose a Multi-Choice Mixed Integer Goal Programming model (MCMI-GP) for the aggregate production planning of a Brazilian sugar and ethanol milling company. The MC-MIGP model was based on traditional selection and process methods for the design of lots, representing the production system of sugar, alcohol, molasses and derivatives. The research covers decisions on the agricultural and cutting stages, sugarcane loading and transportation by suppliers and, especially, energy cogeneration decisions; that is, the choice of production process, including storage stages and distribution. The MCMIGP allows decision-makers to set multiple aspiration levels for their problems in which the more/higher, the better and the less/lower, the better in the aspiration levels are addressed. An application of the proposed model for real problems in a Brazilian sugar and ethanol mill was conducted; producing interesting results that are herein reported and commented upon. Also, it was made a comparison between MCMI GP and WGP models using these real cases. © 2013 Elsevier Inc.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Pós-graduação em Matemática - IBILCE

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Prostate cancer is a serious public health problem accounting for up to 30% of clinical tumors in men. The diagnosis of this disease is made with clinical, laboratorial and radiological exams, which may indicate the need for transrectal biopsy. Prostate biopsies are discerningly evaluated by pathologists in an attempt to determine the most appropriate conduct. This paper presents a set of techniques for identifying and quantifying regions of interest in prostatic images. Analyses were performed using multi-scale lacunarity and distinct classification methods: decision tree, support vector machine and polynomial classifier. The performance evaluation measures were based on area under the receiver operating characteristic curve (AUC). The most appropriate region for distinguishing the different tissues (normal, hyperplastic and neoplasic) was defined: the corresponding lacunarity values and a rule's model were obtained considering combinations commonly explored by specialists in clinical practice. The best discriminative values (AUC) were 0.906, 0.891 and 0.859 between neoplasic versus normal, neoplasic versus hyperplastic and hyperplastic versus normal groups, respectively. The proposed protocol offers the advantage of making the findings comprehensible to pathologists. (C) 2014 Elsevier Ltd. All rights reserved.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Pós-graduação em Engenharia Elétrica - FEIS

Relevância:

30.00% 30.00%

Publicador:

Resumo:

The increasing number of space debris in operating regions around the earth constitutes a real threat to space missions. The goal of the research is to establish appropriate scientific-technological conditions to prevent the destruction and/or impracticability of spacecraft in imminent collision in these regions. A definitive solution to this problem has not yet been reached with the degree of precision that the dynamics of spatial objects (vehicle and debris) requires mainly due to the fact that collisions occur in chains and fragmentation of these objects in the space environment. This fact threatens the space missions on time and with no prospects for a solution in the near future. We present an optimization process in finding the initial conditions (CIC) to collisions, considering the symmetry of the distributions of maximum relative positions between spatial objects with respect to the spherical angles. For this, we used the equations of the dynamics on the Clohessy-Witshire, representing a limit of validation that is highly computationally costly. We simulate different maximum relative positions values of the corresponding initial conditions given in terms of spherical angles. Our results showed that there are symmetries that significantly reduce operating costs, such that the search of the CIC is advantageously carried out up to 4 times the initial processing routine. Knowledge of CIC allows the propulsion system operating vehicle implement evasive maneuvers before impending collisions with space debris.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)