Noise Aware Path Planning and Power Management of Hybrid Fuel UAVs

Hybrid fuel Unmanned Aerial Vehicles (UAV), through their combination of multiple energy sources, offer several advantages over the standard single fuel source configuration, the primary one being increased range and efficiency. Multiple power or fuel sources also allow the distinct pitfalls of each source to be mitigated while exploiting the advantages within the mission or path planning. We consider here a UAV equipped with a combustion engine-generator and battery pack as energy sources. We consider the path planning and power-management of this platform in a noise-aware manner. To solve the path planning problem, we first present the Mixed Integer Linear Program (MILP) formulation of the problem. We then present and analyze a label-correcting algorithm, for which a pseudo-polynomial running time is proven. Results of extensive numerical testing are presented which analyze the performance and scalability of the labeling algorithm for various graph structures, problem parameters, and search heuristics. It is shown that the algorithm can solve instances on graphs as large as twenty thousand nodes in only a few seconds.Comment: 11 pages, 12 figure

Vehicle routing and location routing with intermediate stops:A review

This paper reviews the literature on vehicle routing problems and location rout-8 ing problems with intermediate stops. We classify publications into different categories from both an application-based perspective and a methodological perspective. In addition, we analyze the papers with respect to the algorithms and benchmark instances they present. Furthermore, we provide an overview of trends in the literature and identify promising areas for further research.</p

Vehicle routing and location routing with intermediate stops:A review

This paper reviews the literature on vehicle routing problems and location rout-8 ing problems with intermediate stops. We classify publications into different categories from both an application-based perspective and a methodological perspective. In addition, we analyze the papers with respect to the algorithms and benchmark instances they present. Furthermore, we provide an overview of trends in the literature and identify promising areas for further research.</p

An Efficient Wireless Recharging Mechanism for Achieving Perpetual Lifetime of Wireless Sensor Networks

[[abstract]]Energy recharging has received much attention in recent years. Several recharging mechanisms were proposed for achieving perpetual lifetime of a given Wireless Sensor Network (WSN). However, most of them require a mobile recharger to visit each sensor and then perform the recharging task, which increases the length of the recharging path. Another common weakness of these works is the requirement for the mobile recharger to stop at the location of each sensor. As a result, it is impossible for recharger to move with a constant speed, leading to inefficient movement. To improve the recharging efficiency, this paper takes “recharging while moving” into consideration when constructing the recharging path. We propose a Recharging Path Construction (RPC) mechanism, which enables the mobile recharger to recharge all sensors using a constant speed, aiming to minimize the length of recharging path and improve the recharging efficiency while achieving the requirement of perpetual network lifetime of a given WSN. Performance studies reveal that the proposed RPC outperforms existing proposals in terms of path length and energy utilization index, as well as visiting cycle.[[notice]]補正完

THE PARTIALLY RECHARGEABLE ELECTRIC VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND CAPACITATED CHARGING STATIONS

Electric vehicles are potentially beneficial for both the environment and an organization\u27s bottom line. These benefits include, but are not limited to, reduced fuel costs, government tax incentives, reduced greenhouse gas emissions, and the ability to promote a company\u27s green image. In order to decide whether or not to convert or purchase electric trucks and install charging facilities, decision makers need to consider many factors including onboard battery capacity, delivery or service assignments, scheduling and routes, as well as weather and traffic conditions in a well-defined modeling framework. We develop a model to solve the partially rechargeable electric vehicle routing problem with time windows and capacitated charging stations. Given destination data and vehicle properties, our model determines the optimal number of vehicles or charging stations needed to meet the network\u27s requirements. Analyzing the model shows the relationships between vehicle range, battery recharge time, and fleet size

Optimization of Electric Bus Scheduling for Mixed Passenger and Freight Flow in an Urban-Rural Transit System

Transport accessibility and urban-rural connectivity are seen as critical aspects of rural economic development. In the transit network, passenger flow between urban-rural corridors demonstrates directional imbalances and low utilization of scarce resources. Freight transportation, on the other hand, lags due to poor geography, high operating costs, and scattered demand. This paper proposes a new mode of public transit that integrates passenger and freight transport, providing a carrier for logistics while compensating for the low utilization of passenger transport. In this mode, each timetabled round trip is divided into one dedicated passenger trip with high demand and one mixed-flow trip with on-demand requests. A space-time-state network is constructed considering the picking-up time window, loading/unloading service time, and electric bus energy replenishment. A mixed-integer linear programming model is developed to optimize the bus schedule that covers the travel demands and the charging requests with minimized travel costs. A Lagrangian relaxation framework with a dynamic programming algorithm and sub-gradient method is presented for problem-solving. The real-life rural-urban transport instance and a simulated network demonstrate the operation of the new mode and validate the efficiency of the proposed method. The innovative concept and the optimization framework are expected to serve as a reference for public administration to alleviate passenger and freight transportation bottlenecks in the urban-rural context

Evaluating battery charging and swapping strategies in a robotic mobile fulfilment system

Robotic mobile fulfillment systems (RMFS) have seen many implementations in recent years, due to their high flexibility and low operational cost. Such a system stores goods in movable shelves and uses movable robots to transport the shelves. The robot is battery powered and the battery depletes during operations, which can seriously affect the performance of the system. This study focuses on battery management problem in an RMFS, considering a battery swapping and a battery charging strategy with plug-in or inductive charging. We build a semi-open queueing network (SOQN) to estimate system performance, modeling the battery charging process as a single queue and the battery swapping process as a nested SOQN. We develop a decomposition method to solve the analytical models and validate them through simulation. Our models can be used to optimize battery recovery strategies and compare their cost and throughput time performance. The results show that throughput time performance can be significantly affected by the battery recovery policy, that inductive charging performs best, and that battery swapping outperforms plug-in charging by as large as 4.88%, in terms of retrieval transaction throughput time. However, the annual cost of the RMFS using the battery swapping strategy is generally higher than that of the RMFS using the plug-in charging strategy. In the RMFS that uses the inductive charging strategy, a critical price of a robot can be found, for a lower robot price and a small required retrieval transaction throughput time, inductive charging outperforms both plug-in charging and battery swapping strategies in terms of annual cost. We also find that ignoring the battery recovery will underestimate the number of robots required and the system cost for more than 15%