3,343 research outputs found
Integration and Control of Distributed Renewable Energy Resources
The deployment of distributed renewable energy resources (DRERs) has accelerated globally due to environmental concerns and an increasing demand for electricity. DRERs are considered to be solutions to some of the current challenges related to power grids, such as reliability, resilience, efficiency, and flexibility. However, there are still several technical and non-technical challenges regarding the deployment of distributed renewable energy resources. Technical concerns associated with the integration and control of DRERs include, but are not limited, to optimal sizing and placement, optimal operation in grid-connected and islanded modes, as well as the impact of these resources on power quality, power system security, stability, and protection systems. On the other hand, non-technical challenges can be classified into three categories—regulatory issues, social issues, and economic issues. This Special Issue will address all aspects related to the integration and control of distributed renewable energy resources. It aims to understand the existing challenges and explore new solutions and practices for use in overcoming technical challenges
Internet of Things in urban waste collection
Nowadays, the waste collection management has an important role in urban areas. This paper faces this issue and proposes the application of a metaheuristic for the optimization of a weekly schedule and routing of the waste collection activities in an urban area. Differently to several contributions in literature, fixed periodic routes are not imposed. The results significantly improve the performance of the company involved, both in terms of resources used and costs saving
A hyper-heuristic with two guidance indicators for bi-objective mixed-shift vehicle routing problem with time windows
In this paper, a Mixed-Shift Vehicle Routing Problem is proposed based on a real-life container transportation problem. In a long planning horizon of multiple shifts, transport tasks are completed satisfying the time constraints. Due to the different travel distances and time of tasks, there are two types of shifts (long shift and short shift) in this problem. The unit driver cost for long shifts is higher than that of short shifts. A mathematical model of this Mixed-Shift Vehicle Routing Problem with Time Windows (MS-VRPTW) is established in this paper, with two objectives of minimizing the total driver payment and the total travel distance. Due to the large scale and nonlinear constraints, the exact search showed is not suitable to MS-VRPTW. An initial solution construction heuristic (EBIH) and a selective perturbation Hyper-Heuristic (GIHH) are thus developed. In GIHH, five heuristics with different extents of perturbation at the low level are adaptively selected by a high level selection scheme with the Hill Climbing acceptance criterion. Two guidance indicators are devised at the high level to adaptively adjust the selection of the low level heuristics for this bi-objective problem. The two indicators estimate the objective value improvement and the improvement direction over the Pareto Front, respectively. To evaluate the generality of the proposed algorithms, a set of benchmark instances with various features is extracted from real-life historical datasets. The experiment results show that GIHH significantly improves the quality of the final Pareto Solution Set, outperforming the state-of-the-art algorithms for similar problems. Its application on VRPTW also obtains promising results
Multi-objective vehicle routing and loading with time window constraints:a real-life application
Motivated by a real-life application, this research considers the multi-objective vehicle routing and loading problem with time window constraints which is a variant of the Capacitated Vehicle Routing Problem with Time Windows with one/two-dimensional loading constraints. The problem consists of routing a number of vehicles to serve a set of customers and determining the best way of loading the goods ordered by the customers onto the vehicles used for transportation. The three objectives pertaining to minimisation of total travel distance, number of routes to use and total number of mixed orders in the same pallet are, more often than not, conflicting. To achieve a solution with no preferential information known in advance from the decision maker, the problem is formulated as a Mixed Integer Linear Programming (MILP) model with one objective—minimising the total cost, where the three original objectives are incorporated as parts of the total cost function. A Generalised Variable Neighbourhood Search (GVNS) algorithm is designed as the search engine to relieve the computational burden inherent to the application of the MILP model. To evaluate the effectiveness of the GVNS algorithm, a real instance case study is generated and solved by both the GVNS algorithm and the software provided by our industrial partner. The results show that the suggested approach provides solutions with better overall values than those found by the software provided by our industrial partner
On the interaction between Autonomous Mobility-on-Demand systems and the power network: models and coordination algorithms
We study the interaction between a fleet of electric, self-driving vehicles
servicing on-demand transportation requests (referred to as Autonomous
Mobility-on-Demand, or AMoD, system) and the electric power network. We propose
a model that captures the coupling between the two systems stemming from the
vehicles' charging requirements and captures time-varying customer demand and
power generation costs, road congestion, battery depreciation, and power
transmission and distribution constraints. We then leverage the model to
jointly optimize the operation of both systems. We devise an algorithmic
procedure to losslessly reduce the problem size by bundling customer requests,
allowing it to be efficiently solved by off-the-shelf linear programming
solvers. Next, we show that the socially optimal solution to the joint problem
can be enforced as a general equilibrium, and we provide a dual decomposition
algorithm that allows self-interested agents to compute the market clearing
prices without sharing private information. We assess the performance of the
mode by studying a hypothetical AMoD system in Dallas-Fort Worth and its impact
on the Texas power network. Lack of coordination between the AMoD system and
the power network can cause a 4.4% increase in the price of electricity in
Dallas-Fort Worth; conversely, coordination between the AMoD system and the
power network could reduce electricity expenditure compared to the case where
no cars are present (despite the increased demand for electricity) and yield
savings of up $147M/year. Finally, we provide a receding-horizon implementation
and assess its performance with agent-based simulations. Collectively, the
results of this paper provide a first-of-a-kind characterization of the
interaction between electric-powered AMoD systems and the power network, and
shed additional light on the economic and societal value of AMoD.Comment: Extended version of the paper presented at Robotics: Science and
Systems XIV, in prep. for journal submission. In V3, we add a proof that the
socially-optimal solution can be enforced as a general equilibrium, a
privacy-preserving distributed optimization algorithm, a description of the
receding-horizon implementation and additional numerical results, and proofs
of all theorem
- …