90 resultados para Multicast Packing Problem. Multiobjective Optimization. Network Optimization. Multicast
Resumo:
Pós-graduação em Engenharia Elétrica - FEIS
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Due to the renewed interest in distributed generation (DG), the number of DG units incorporated in distribution systems has been rapidly increasing in the past few years. This situation requires new analysis tools for understanding system performance, and taking advantage of the potential benefits of DG. This paper presents an evolutionary multi-objective programming approach to determine the optimal operation of DG in distribution systems. The objectives are the minimization of the system power losses and operation cost of the DG units. The proposed approach also considers the inherent stochasticity of DG technologies powered by renewable resources. Some tests were carried out on the IEEE 34 bus distribution test system showing the robustness and applicability of the proposed methodology. © 2011 IEEE.
Resumo:
The aim of this work is the application of the Interior Point and Branch and Bound methods in multiobjective optimization models related to sugarcane harvest residual biomass. These methods showed their viability to help on choosing the sugarcane planting varieties, searching to optimize cost and energy balance of harvest residual biomass, which have conflitant objectives. These methods provide satisfactory results, with fair computing performance and reliable and consistent solutions to the analyzed models. © 2011 IEEE.
Resumo:
This paper proposes a methodology to consider the effects of the integration of DG on planning. Since DG has potential to defer investments in networks, the impact of DG on grid capacity is evaluated. A multi-objective optimization tool based on the meta-heuristic MEPSO is used, supporting an alternative approach to exploiting the Pareto front features. Tests were performed in distinct conditions with two well-known distribution networks: IEEE-34 and IEEE-123. The results combined minimization and maximization in order to produce different Pareto fronts and determine the extent of the impact caused by DG. The analysis provides useful information, such as the identification of futures that should be considered in planning. A future means a set of realizations of all uncertainties. MEPSO also presented a satisfactory performance in obtaining the Pareto fronts. © 2011 IEEE.
Resumo:
The urbanization of modern societies has imposed to the planners and decision-makers a more precise attention to facts not considered before. Several aspects, such as the energy availability and the deleterious effect of pollution on the populations, must be considered in the policy decisions of cities urbanization. The current paradigm presents centralized power stations supplying a city, and a combination of technologies may compose the energy mix of a country, such as thermal power plants, hydroelectric plants, wind systems and solar-based systems, with their corresponding emission pattern. A goal programming multi-objective optimization model is presented for the electric expansion analysis of a tropical city, and also a case study for the city of Guaratinguetá, Brazil, considering a particular wind and solar radiation patterns established according to actual data and modeled via the time series analysis method. Scenarios are proposed and the results of single environmental objective, single economic objective and goal programming multi-objective modeling are discussed. The consequences of each dispatch decision, which considers pollutant emission exportation to the neighborhood or the need of supplementing electricity by purchasing it from the public electric power grid, are discussed. The results revealed energetic dispatch for the alternatives studied and the optimum environmental and economic solution was obtained. © 2012 Elsevier Ltd.
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.
Resumo:
Pós-graduação em Engenharia Elétrica - FEIS
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.
Resumo:
We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.