A5059488979- Vehicle Routing Optimization Methods
- Optimization and Packing Problems
- Power System Reliability and Maintenance
- Optimal Power Flow Distribution
- Urban and Freight Transport Logistics
- Transportation and Mobility Innovations
- Reliability and Maintenance Optimization
- Metaheuristic Optimization Algorithms Research
- Advanced Optical Network Technologies
- Electric Vehicles and Infrastructure
- Advanced Manufacturing and Logistics Optimization
- VLSI and FPGA Design Techniques
- Smart Parking Systems Research
- Sustainable Supply Chain Management
- Advanced Multi-Objective Optimization Algorithms
- Smart Grid Energy Management
- Power Line Communications and Noise
- Complexity and Algorithms in Graphs
- Transportation Planning and Optimization
- RFID technology advancements
- Energy Load and Power Forecasting
- Maritime Ports and Logistics
- Business and Management Studies
- Advanced Graph Theory Research
- Facility Location and Emergency Management
Universidade Estadual de Campinas (UNICAMP)
2014-2024
Hospital de Clínicas da Unicamp
2018-2020
Albert Einstein College of Medicine
2018
Institute of Refrigeration
2018
Universidade do Estado de Minas Gerais
2018
Universidade Federal de Minas Gerais
2018
Associação Paulista para o Desenvolvimento da Medicina
2018
San Antonio College
2018
Financiadora de Estudos e Projetos
2018
Pontifícia Universidade Católica de Minas Gerais
2018
Reliability analysis of power systems has been attracting increasing attention. Regulatory agencies establish reliability standards that, if infringed, result in costly fines for the utility suppliers. A special concern pertains to distribution networks on which most failures occur. The allocation switches is a possible strategy improve reliability, by allowing network reconfiguration isolate contingencies and restore dark areas. This paper proposes an optimization methodology allocate...
The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective to find minimum cost set of tours servicing subset required edges under vehicle capacity constraints. There are numerous applications for 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) proposed compared other...
The capacitated redistricting problem (CRP) has the objective to redefine, under a given criterion, an initial set of districts urban area represented by geographic network. Each node in network different types demands and each district limited capacity. Real-world applications consider more than one criteria design districts, leading multicriteria CRP (MCRP). Examples are found political districting, sales design, street sweeping, garbage collection mail delivery. This work addresses MCRP...
Estimating future streamflows is a key step in producing electricity for countries with hydroelectric plants. Accurate predictions are particularly important due to environmental and economic impact they lead. In order analyze the forecasting capability of models regarding monthly seasonal streamflow series, we realized an extensive investigation considering: six versions unorganized machines—extreme learning machines (ELM) without regularization coefficient (RC), echo state network (ESN)...
This work carried out an empirical study with the objective of determining most efficient strategy in guaranteeing radiality distribution network during reconfiguration. The reconfiguration problem a aims to reduce technical losses by changing paths that energy takes through until it reaches consumers. In this problem, mandatory constraint is ensure operates radially. However, literature does not present consensus on best way guarantee restriction. Computational experiments were using two...
The Open Capacitated Arc Routing Problem (OCARP) is a NP-hard combinatorial optimization problem where, given an undirected graph, the objective to find minimum cost set of tours that services subset edges with positive demand under capacity constraints. This related (CARP) but differs from it since OCARP does not consider depot, and are constrained form cycles. Applications literature discussed. A new integer linear programming formulation given, followed by some properties problem....
There is an increasing interest in the analysis of power distribution systems, including demands to improve networks reliability. Regulatory agencies define reliability indices quantify and evaluate electric quality. In order system provide a good quality service, this work proposes install minimum amount switch devices at appropriate locations network. A methodology presented effectively evaluate, even for large real impact on following contigen-cies. Firstly, are propose constructive...
This paper presents a general framework for live detection of broilers in poultry houses. The challenges image recognition are posted by crowded scenes, poor quality and difficulty acquiring benchmark labeled samples. proposed consists on the use thresholding, morphological transformations, feature engineering, addition to supervised unsupervised learning techniques. Results show effectiveness detect individual house image. Descriptive attributes related spatial distribution movement can be...
A relevant research topic in optimization of power distribution networks is to find the best relationship between system reliability and allocation maintenance resources. This paper presents a mathematical formulation that seeks optimal preventive budget regarding constraints. dynamic programming approach proposed deal with this problem. Some reductions are applied order avoid combinatorial explosion. Case studies presented compare performance hybrid genetic algorithm previously developed.
This work aims to investigate the Green Vehicle Routing Problem (G-VRP), which is an NP-Hard problem that generalizes (VRP) and integrates it with green logistics. In G-VRP, electric vehicles limited autonomy can be recharged at Alternative Fuel Stations (AFSs) keep visiting customers. research proposes MILP formulations, valid inequalities, preprocessing conditions.
This paper introduces the Capacitated Covering Salesman Problem (CCSP), approaching notion of service by coverage in capacitated vehicle routing problems. In CCSP, locations where vehicles can transit are provided, some which have customers with demands. The objective is to through a fleet based depot, minimizing total distance traversed vehicles. CCSP unique sense that customers, be serviced, do not need visited vehicle. Instead, they serviced if within area assumption motivated...
<title>Abstract</title> Wireless Sensor Networks (WSNs) have become ubiquitous across various domains, from household applications to industrial grounds, and critical areas like emergency response environmental monitoring. While numerous optimization techniques emerged in the literature enhance network performance by strategically allocating sensor nodes, most studies this field rely on heuristic methods. Designing topology of WSNs is crucial for optimizing node energy consumption,...