509 research outputs found
Microgrids: Planning, Protection and Control
This Special Issue will include papers related to the planning, protection, and control of smart grids and microgrids, and their applications in the industry, transportation, water, waste, and urban and residential infrastructures. Authors are encouraged to present their latest research; reviews on topics including methods, approaches, systems, and technology; and interfaces to other domains such as big data, cybersecurity, human–machine, sustainability, and smart cities. The planning side of microgrids might include technology selection, scheduling, interconnected microgrids, and their integration with regional energy infrastructures. The protection side of microgrids might include topics related to protection strategies, risk management, protection technologies, abnormal scenario assessments, equipment and system protection layers, fault diagnosis, validation and verification, and intelligent safety systems. The control side of smart grids and microgrids might include control strategies, intelligent control algorithms and systems, control architectures, technologies, embedded systems, monitoring, and deployment and implementation
Advanced Path Planning and Collision Avoidance Algorithms for UAVs
The thesis aims to investigate and develop innovative tools to provide autonomous flight capability to a fixed-wing unmanned aircraft. Particularly it contributes to research on path optimization, tra jectory tracking and collision avoidance with two algorithms designed respectively for path planning and navigation. The complete system generates the shortest path from start to target avoiding known obstacles represented on a map, then drives the aircraft to track the optimum path avoiding unpredicted ob jects sensed in flight.
The path planning algorithm, named Kinematic A*, is developed on the basis of graph search algorithms like A* or Theta* and is meant to bridge the gap between path-search logics of these methods and aircraft kinematic constraints. On the other hand the navigation algorithm faces concurring tasks of tra jectory tracking and collision avoidance with Nonlinear Model Predictive Control.
When A* is applied to path planning of unmanned aircrafts any aircraft kinematics is taken into account, then practicability of the path is not guaranteed. Kinematic A* (KA*) generates feasible paths through graph-search logics and basic vehicle characteristics. It includes a simple aircraft kinematic-model to evaluate moving cost between nodes of tridimensional graphs. Movements are constrained with minimum turning radius and maximum rate of climb. Furtermore, separation from obstacles is imposed, defining a volume around the path free from obstacles (tube-type boundaries). Navigation is safe when the tracking error does not exceed this volume.
The path-tracking task aims to link kinematic information related to desired aircraft positions with dynamic behaviors to generate commands that minimize the error between reference and real tra jectory. On the other hand avoid obstacles in flight is one of the
most challenging tasks for autonomous aircrafts and many elements must be taken into account in order to implement an effective collision avoidance maneuver. Second part of the thesis describes a Nonlinear Model Predictive Control (NMPC) application to cope
with collision avoidance and path tracking tasks. First contribution is the development of a navigation system able to match concurring problems: track the optimal path provided with KA* and avoid unpredicted obstacles detected with sensors. Second Contribution is the Sense & Avoid (S&A) technique exploiting spherical camera and visual servoing control logics
Network Maintenance and Capacity Management with Applications in Transportation
abstract: This research develops heuristics to manage both mandatory and optional network capacity reductions to better serve the network flows. The main application discussed relates to transportation networks, and flow cost relates to travel cost of users of the network. Temporary mandatory capacity reductions are required by maintenance activities. The objective of managing maintenance activities and the attendant temporary network capacity reductions is to schedule the required segment closures so that all maintenance work can be completed on time, and the total flow cost over the maintenance period is minimized for different types of flows. The goal of optional network capacity reduction is to selectively reduce the capacity of some links to improve the overall efficiency of user-optimized flows, where each traveler takes the route that minimizes the traveler’s trip cost. In this dissertation, both managing mandatory and optional network capacity reductions are addressed with the consideration of network-wide flow diversions due to changed link capacities.
This research first investigates the maintenance scheduling in transportation networks with service vehicles (e.g., truck fleets and passenger transport fleets), where these vehicles are assumed to take the system-optimized routes that minimize the total travel cost of the fleet. This problem is solved with the randomized fixed-and-optimize heuristic developed. This research also investigates the maintenance scheduling in networks with multi-modal traffic that consists of (1) regular human-driven cars with user-optimized routing and (2) self-driving vehicles with system-optimized routing. An iterative mixed flow assignment algorithm is developed to obtain the multi-modal traffic assignment resulting from a maintenance schedule. The genetic algorithm with multi-point crossover is applied to obtain a good schedule.
Based on the Braess’ paradox that removing some links may alleviate the congestion of user-optimized flows, this research generalizes the Braess’ paradox to reduce the capacity of selected links to improve the efficiency of the resultant user-optimized flows. A heuristic is developed to identify links to reduce capacity, and the corresponding capacity reduction amounts, to get more efficient total flows. Experiments on real networks demonstrate the generalized Braess’ paradox exists in reality, and the heuristic developed solves real-world test cases even when commercial solvers fail.Dissertation/ThesisDoctoral Dissertation Industrial Engineering 201
Renewable hydrogen supply chains: A planning matrix and an agenda for future research
Worldwide, energy systems are experiencing a transition to more sustainable systems. According to the Hydrogen Roadmap Europe (FCH EU, 2019), hydrogen will play an important role in future energy systems due to its ability to support sustainability goals and will account for approximately 13% of the total energy mix in the coming future. Correct hydrogen supply chain (HSC) planning is therefore vital to enable a sustainable transition, in particular when hydrogen is produced by water electrolysis using electricity from renewable sources (renewable hydrogen). However, due to the operational characteristics of the renewable HSC, its planning is complicated. Renewable hydrogen supply can be diverse: Hydrogen can be produced de-centrally with renewables, such as wind and solar energy, or centrally by using electricity generated from a hydro power plant with a large volume. Similarly, demand for hydrogen can also be diverse, with many new applications, such as fuels for fuel cell electrical vehicles and electricity generation, feedstocks in industrial processes, and heating for buildings. The HSC consists of various stages (production, storage, distribution, and applications) in different forms, with strong interdependencies, which further increase HSC complexity. Finally, planning of an HSC depends on the status of hydrogen adoption and market development, and on how mature technologies are, and both factors are characterised by high uncertainties. Directly adapting the traditional approaches of supply chain (SC) planning for HSCs is insufficient. Therefore, in this study we develop a planning matrix with related planning tasks, leveraging a systematic literature review to cope with the characteristics of HSCs. We focus only on renewable hydrogen due to its relevance to the future low-carbon economy. Furthermore, we outline an agenda for future research, from the supply chain management perspective, in order to support renewable HSC development, considering the different phases of renewable HSCs adoption and market development
Applications of biased-randomized algorithms and simheuristics in integrated logistics
Transportation and logistics (T&L) activities play a vital role in the development of many businesses from different industries. With the increasing number of people living in urban areas, the expansion of on-demand economy and e-commerce activities, the number of services from transportation and delivery has considerably increased. Consequently, several urban problems have been potentialized, such as traffic congestion and pollution. Several related problems can be formulated as a combinatorial optimization problem (COP). Since most of them are NP-Hard, the finding of optimal solutions through exact solution methods is often impractical in a reasonable amount of time. In realistic settings, the increasing need for 'instant' decision-making further refutes their use in real life. Under these circumstances, this thesis aims at: (i) identifying realistic COPs from different industries; (ii) developing different classes of approximate solution approaches to solve the identified T&L problems; (iii) conducting a series of computational experiments to validate and measure the performance of the developed approaches. The novel concept of 'agile optimization' is introduced, which refers to the combination of biased-randomized heuristics with parallel computing to deal with real-time decision-making.Las actividades de transporte y logística (T&L) juegan un papel vital en el desarrollo de muchas empresas de diferentes industrias. Con el creciente número de personas que viven en áreas urbanas, la expansión de la economía a lacarta y las actividades de comercio electrónico, el número de servicios de transporte y entrega ha aumentado considerablemente. En consecuencia, se han potencializado varios problemas urbanos, como la congestión del tráfico y la contaminación. Varios problemas relacionados pueden formularse como un problema de optimización combinatoria (COP). Dado que la mayoría de ellos son NP-Hard, la búsqueda de soluciones óptimas a través de métodos de solución exactos a menudo no es práctico en un período de tiempo razonable. En entornos realistas, la creciente necesidad de una toma de decisiones "instantánea" refuta aún más su uso en la vida real. En estas circunstancias, esta tesis tiene como objetivo: (i) identificar COP realistas de diferentes industrias; (ii) desarrollar diferentes clases de enfoques de solución aproximada para resolver los problemas de T&L identificados; (iii) realizar una serie de experimentos computacionales para validar y medir el desempeño de los enfoques desarrollados. Se introduce el nuevo concepto de optimización ágil, que se refiere a la combinación de heurísticas aleatorias sesgadas con computación paralela para hacer frente a la toma de decisiones en tiempo real.Les activitats de transport i logística (T&L) tenen un paper vital en el desenvolupament de moltes empreses de diferents indústries. Amb l'augment del nombre de persones que viuen a les zones urbanes, l'expansió de l'economia a la carta i les activitats de comerç electrònic, el nombre de serveis del transport i el lliurament ha augmentat considerablement. En conseqüència, s'han potencialitzat diversos problemes urbans, com ara la congestió del trànsit i la contaminació. Es poden formular diversos problemes relacionats com a problema d'optimització combinatòria (COP). Com que la majoria són NP-Hard, la recerca de solucions òptimes mitjançant mètodes de solució exactes sovint no és pràctica en un temps raonable. En entorns realistes, la creixent necessitat de prendre decisions "instantànies" refuta encara més el seu ús a la vida real. En aquestes circumstàncies, aquesta tesi té com a objectiu: (i) identificar COP realistes de diferents indústries; (ii) desenvolupar diferents classes d'aproximacions aproximades a la solució per resoldre els problemes identificats de T&L; (iii) la realització d'una sèrie d'experiments computacionals per validar i mesurar el rendiment dels enfocaments desenvolupats. S'introdueix el nou concepte d'optimització àgil, que fa referència a la combinació d'heurístiques esbiaixades i aleatòries amb informàtica paral·lela per fer front a la presa de decisions en temps real.Tecnologies de la informació i de xarxe
Future Smart Grid Systems
This book focuses on the analysis, design and implementation of future smart grid systems. This book contains eleven chapters, which were originally published after rigorous peer-review as a Special Issue in the International Journal of Energies (Basel). The chapters cover a range of work from authors across the globe and present both the state-of-the-art and emerging paradigms across a range of topics including sustainability planning, regulations and policy, estimation and situational awareness, energy forecasting, control and optimization and decentralisation. This book will be of interest to researchers, practitioners and scholars working in areas related to future smart grid systems
USING THE VEHICLE ROUTING PROBLEM (VRP) TO PROVIDE LOGISTICS SOLUTIONS IN AGRICULTURE
Agricultural producers consider utilizing multiple machines to reduce field completion times for improving effective field capacity. Using a number of smaller machines rather than a single big machine also has benefits such as sustainability via less compaction risk, redundancy in the event of an equipment failure, and more flexibility in machinery management. However, machinery management is complicated due to logistics issues.
In this work, the allocation and ordering of field paths among a number of available machines have been transformed into a solvable Vehicle Routing Problem (VRP). A basic heuristic algorithm (a modified form of the Clarke-Wright algorithm) and a meta-heuristic algorithm, Tabu Search, were employed to solve the VRP. The solution considered optimization of field completion time as well as improving the field efficiency. Both techniques were evaluated through computer simulations with 2, 3, 5, or 10 vehicles working simultaneously to complete the same operation. Furthermore, the parameters of the VRP were changed into a dynamic, multi-depot representation to enable the re-route of vehicles while the operation is ongoing.
The results proved both the Clarke-Wright and Tabu Search algorithms always generated feasible solutions. The Tabu Search solutions outperformed the solutions provided by the Clarke-Wright algorithm. As the number of the vehicles increased, or the field shape became more complex, the Tabu Search generated better results in terms of reducing the field completion times. With 10 vehicles working together in a real-world field, the benefit provided by the Tabu Search over the Modified Clarke-Wright solution was 32% reduction in completion time. In addition, changes in the parameters of the VRP resulted in a Dynamic, Multi-Depot VRP (DMDVRP) to reset the routes allocated to each vehicle even as the operation was in progress. In all the scenarios tested, the DMDVRP was able to produce new optimized routes, but the impact of these routes varied for each scenario.
The ability of this optimization procedure to reduce field work times were verified through real-world experiments using three tractors during a rotary mowing operation. The time to complete the field work was reduced by 17.3% and the total operating time for all tractors was reduced by 11.5%.
The task of a single large machine was also simulated as a task for 2 or 3 smaller machines through computer simulations. Results revealed up to 11% reduction in completion time using three smaller machines. This time reduction improved the effective field capacity
- …