The transition to new forms of urban transport, which are environment friendly, efficient, and cost-effective has become a pressing issue modern times. Battery electric buses being deployed worldwide, marking change in public transport planning operations. emergence fast ultra-fast wireless charging for brought about the need processes associated decision-support models their deployment. object...

We address a dynamic covering location problem of an Unmanned Aerial Vehicle Base Station (UAV-BS), where the sequence single UAV-BS in wireless communication network is determined to satisfy data demand arising from ground users. This especially relevant context smart grid and disaster relief. The vertical movement ability non-convex functions restrict utilizing classical planar approaches. Th...

The use of axle counters makes it possible to automate the processes station car model formation and renewal. existing approaches define installation sites for at necks, fixed by regulatory documentation, are in location counting points next all insulating joints track chains that leads equipment redundancy. At same time, application qua only control device freedom faces a number obstacles amon...

The Energy Independence and Security Act of 2007 targets use of 36 billion gallons of biofuels per year by 2022. Achieving this may require substantial changes to current transportation fuel systems for distribution, dispensing, and use in vehicles. The U.S. Department of Energy and the National Renewable Energy Laboratory designed a system dynamics approach to help focus government action by d...

a r t i c l e i n f o The fixed-route vehicle-refueling problem (FRVRP) is a mathematical problem widely used in the U.S. trucking industry. The FRVRP seeks the best refueling policy (sequence of fuel stations to use, along with the fueling quantity at each station) for a given (fixed) origin–destination route that minimizes a vehicle's refueling cost. While effective, the current FRVRP methods...

In the gas station problem we want to find the cheapest path between two vertices of an n-vertex graph. Our car has a specific fuel capacity and at each vertex we can fill our car with gas, with the fuel cost depending on the vertex. Furthermore, we are allowed at most ∆ stops for refuelling. In this short paper we provide an algorithm solving the problem in O(∆n2 + n2 logn) steps improving an ...