Optimal development of alternative fuel station networks considering node capacity restrictions

A potential solution to reduce greenhouse gas (GHG) emissions in the transport sector is the use of alternative fuel vehicles (AFV). As global GHG emission standards have been in place for passenger cars for several years, infrastructure modelling for new AFV is an established topic. However, as the regulatory focus shifts towards heavy-duty vehicles (HDV), the market diffusion of AFV-HDV will increase as will planning the relevant AFV infrastructure for HDV. Existing modelling approaches need to be adapted, because the energy demand per individual refill increases significantly for HDV and there are regulatory as well as technical limitations for alternative fuel station (AFS) capacities at the same time. While the current research takes capacity restrictions for single stations into account, capacity limits for locations (i.e. nodes) – the places where refuelling stations are built such as highway entries, exits or intersections – are not yet considered. We extend existing models in this respect and introduce an optimal development for AFS considering (station) location capacity restrictions. The proposed method is applied to a case study of a potential fuel cell heavy-duty vehicle AFS network. We find that the location capacity limit has a major impact on the number of stations required, station utilization and station portfolio variety.     

国六车载加油蒸气回收系统研究

文章为国六车载加油蒸气回收系统提供了一种系统解决方案。该系统解决方案包含:炭罐和加油管设计方法,以获得较低的加油污染物排放;油箱油气分离器优化设计方法,以减少油箱动态泄漏以防止炭罐污染;主机厂生产线加油方法,以改善新油箱加油提前跳枪问题。     

Stochastic dynamic itinerary interception refueling location problem with queue delay for electric taxi charging stations

A new facility location model and a solution algorithm are proposed that feature (1) itinerary-interception instead of flow-interception; (2) stochastic demand as dynamic service requests; and (3) queueing delay. These features are essential to analyze battery-powered electric shared-ride taxis operating in a connected, centralized dispatch manner. The model and solution method are based on a bi-level, simulation–optimization framework that combines an upper level multiple-server allocation model with queueing delay and a lower level dispatch simulation based on earlier work by Jung and Jayakrishnan. The solution algorithm is tested on a fleet of 600 shared-taxis in Seoul, Korea, spanning 603 km², a budget of 100 charging stations, and up to 22 candidate charging locations, against a benchmark “naïve” genetic algorithm that does not consider cyclic interactions between the taxi charging demand and the charger allocations with queue delay. Results show not only that the proposed model is capable of locating charging stations with stochastic dynamic itinerary-interception and queue delay, but that the bi-level solution method improves upon the benchmark algorithm in terms of realized queue delay, total time of operation of taxi service, and service request rejections. Furthermore, we show how much additional benefit in level of service is possible in the upper-bound scenario when the number of charging stations is unbounded.     

The Hybrid Vehicle Routing Problem

In this paper the Hybrid Vehicle Routing Problem (HVRP) is introduced and formalized. This problem is an extension of the classical VRP in which vehicles can work both electrically and with traditional fuel. The vehicle may change propulsion mode at any point of time. The unitary travel cost is much lower for distances covered in the electric mode. An electric battery has a limited capacity and may be recharged at a recharging station (RS). A limited number of RS are available. Once a battery has been completely discharged, the vehicle automatically shifts to traditional fuel propulsion mode. Furthermore, a maximum route duration is imposed according to contracts regulations established with the driver. In this paper, a Mixed Integer Linear Programming formulation is presented and a Large Neighborhood Search based Matheuristic is proposed. The algorithm starts from a feasible solution and consists into destroying, at each iteration, a small number of routes, letting unvaried the other ones, and reconstructing a new feasible solution running the model on only the subset of customers involved in the destroyed routes. This procedure allows to completely explore a large neighborhood within very short computational time. Computational tests that show the performance of the matheuristic are presented. The method has also been tested on a simplified version of the HVRP already presented in the literature, the Green Vehicle Routing Problem (GVRP), and competitive results have been obtained.