Life cycle cost of conventional,battery electric,and fuel cell electric vehicles considering traffic and environmental policies in China

Electric vehicles (EVs) are considered a promising alternative to conventional vehicles (CVs) to alleviate the oil crisis and reduce urban air pollution and carbon emissions. Consumers usually focus on the tangible cost when choosing an EV or CV but overlook the time cost for restricting purchase or driving and the environmental cost from gas emissions, falling to have a comprehensive understanding of the economic competitiveness of CVs and EVs. In this study, a life cycle cost model for vehicles is conducted to express traffic and environmental policies in monetary terms, which are called intangible cost and external cost, respectively. Battery electric vehicles (BEVs), fuel cell electric vehicles (FCEVs), and CVs are compared in four first-tier, four new first-tier, and 4 s-tier and below cities in China. The comparison shows that BEVs and FCEVs in most cities are incomparable with CVs in terms of tangible cost. However, the prominent traffic and environmental policies in first-tier cities, especially in Beijing and Shanghai, greatly increase the intangible and external costs of CVs, making consumers more inclined to purchase BEVs and FCEVs. The main policy benefits of BEVs and FCEVs come from three aspects: government subsidies, purchase and driving restrictions, and environmental taxes. With the predictable reduction in government subsidies, traffic and environmental policies present important factors influencing the competitiveness of BEVs and FCEVs. In first-tier cities, BEVs and FCEVs already have a competitive foundation for large-scale promotion. In new first-tier and second-tier and below cities, stricter traffic and environmental policies need to be formulated to offset the negative impact of the reduction in government subsidies on the competitiveness of BEVs and FCEVs. Additionally, a sensitivity analysis reveals that increasing the mileage and reducing fuel prices can significantly improve the competitiveness of BEVs and FCEVs, respectively.     

Experimental investigation of supercapacitor based regenerative energy storage for a fuel cell vehicle equipped with an alternator

Recently, researchers have devoted more attention to supercapacitors (SCs) to integrate with batteries in energy storage systems (ESSs) for vehicle applications. In this study, we attempted to characterize the use of SCs in the ESS for a PEM fuel cell vehicle equipped with an alternator to maximize the performance of regenerative braking. We applied lithium-ion batteries (LIBs) and SCs as energy storage devices to examine their effect on ESS. Then we used a hysteresis brake to apply controllable braking force on the flywheel to form hybrid braking (HB) and made efforts to study its behavior to suggest a braking control strategy. We also ran the whole system over the rotational speed to cover the range of driving speed. At last, we sized the SCs for the most commonly used fuel cell electric vehicle (FCEV) in Korea, i.e., Hyundai NEXO, based on the results obtained from the above study by alternator efficiencies.     

基于词性特征的明喻识别及要素抽取方法

比喻是一种利用事物之间的相似点建立关系的修辞方式。明喻是比喻中最常见的形式,具有明显的喻词,例如"像",用于关联本体和喻体。近年来高考语文散文类鉴赏题中多有考查明喻句的试题,为了解答此类鉴赏题,需要识别比喻句中的本体和喻体要素。该文提出了基于词性特征的明喻识别及要素抽取方法。首先将句子中词向量化表示与词性特征向量化表示进行融合,将融合后的向量输入到BiLSTM中进行训练,然后利用CRF解码出全局最优标注序列;最后得到明喻识别和要素抽取的结果。公开数据集上的实验结果表明,该方法优于已有的单任务方法;同时也将该文方法应用于北京高考语文鉴赏题中比喻句的识别与要素抽取,验证了方法的可行性。     

Automatic design for shop scheduling strategies based on hyper-heuristics: A systematic review

Against the background of smart manufacturing and Industry 4.0, how to achieve real-time scheduling has become a problem to be solved. In this regard, automatic design for shop scheduling based on hyper-heuristics has been widely studied, and a number of reviews and scheduling algorithms have been presented. Few studies, however, have specifically discussed the technical points involved in algorithm development. This study, therefore, constructs a general framework for automatic design for shop scheduling strategies based on hyper-heuristics, and various state-of-the-art technical points in the development process are summarized. First, we summarize the existing types of shop scheduling strategies and classify them using a new classification method. Second, we summarize an automatic design algorithm for shop scheduling. Then, we investigate surrogate-assisted methods that are popular in the current algorithm field. Finally, current problems and challenges are discussed, and potential directions for future research are proposed.     

Deep reinforcement learning-based cooperative interactions among heterogeneous vehicular networks

Most real-world vehicle nodes can be structured into an interconnected network of vehicles. Through structuring these services and vehicle device interactions into multiple types, such internet of vehicles becomes multidimensional heterogeneous overlay networks. The heterogeneousness of the overlays makes it difficult for the overlay networks to coordinate with each other to improve their performance. Therefore, it poses an interesting but critical challenge to the effective analysis of heterogeneous virtual vehicular networks. A variety of virtual vehicular networks can be easily deployed onto the native network by applying the concept of SDN (Software Defined Networking). These virtual networks reflect their heterogeneousness due to their different performance goals, and they compete for the same physical resources of the underlying network, so that a sub-optimal performance of the virtual networks may be achieved. Therefore, we propose a Deep Reinforcement Learning (DRL) approach to make the virtual networks cooperate with each other through the SDN controller. A cooperative solution based on the asymmetric Nash bargaining is proposed for co-existing virtual networks to improve their performance. Moreover, the Markov Chain model and DRL resolution are introduced to leverage the heterogeneous performance goals of virtual networks. The implementation of the approach is introduced, and simulation results confirm the performance improvement of the latency sensitive, loss-rate sensitive and throughput sensitive heterogeneous vehicular networks using our cooperative solution.     

Lagrangian relaxation hybrid with evolutionary algorithm for short-term generation scheduling

Short-term generation scheduling is an important function in daily operational planning of power systems. It is defined as optimal scheduling of power generators over a scheduling period while respecting various generator constraints and system constraints. Objective of the problem includes costs associated with energy production, start-up cost and shut-down cost along with profits. The resulting problem is a large scale nonlinear mixed-integer optimization problem for which there is no exact solution technique available. The solution to the problem can be obtained only by complete enumeration, often at the cost of a prohibitively computation time requirement for realistic power systems. This paper presents a hybrid algorithm which combines Lagrangian Relaxation (LR) together with Evolutionary Algorithm (EA) to solve the problem in cooperative and competitive energy environments. Simulation studies were carried out on different systems containing various numbers of units. The outcomes from different algorithms are compared with that from the proposed hybrid algorithm and the advantages of the proposed algorithm are briefly discussed.     

An agile model for the eco-design of electric vehicle Li-ion batteries

Numerous design choices need to be made at several levels when designing high-tech products: technology, processes, architecture, components, materials… and these choices need to be made in relation to the product life cycle with the corresponding experts for each stage of the life cycle. At the same time, to ensure product sustainability, a specific focus on the future potential environmental impacts is highly recommended. In this research, an agile model is proposed to help designers make decisions while monitoring environmental performance indicators of high-tech solutions. The concept of Critical Product Life Cycle Parameters had to be introduced to facilitate the eco-design of the final product. The approach is illustrated by the Electric Vehicle Li-Ion Batteries case study.     

基于多尺度双线性卷积神经网络的多角度下车型精细识别

针对多角度下车辆出现一定的尺度变化和形变导致很难被准确识别的问题，提出基于多尺度双线性卷积神经网络（MS-B-CNN）的车型精细识别模型。首先，对双线性卷积神经网络（B-CNN）算法进行改进，提出MS-B-CNN算法对不同卷积层的特征进行了多尺度融合，以提高特征表达能力；此外，还采用基于中心损失函数与Softmax损失函数联合学习的策略，在Softmax损失函数基础上分别对训练集每个类别在特征空间维护一个类中心，在训练过程中新增加样本时，网络会约束样本的分类中心距离，以提高多角度情况下的车型识别的能力。实验结果显示，该车型识别模型在CompCars数据集上的正确率达到了93.63%，验证了模型在多角度情况下的准确性和鲁棒性。     

Supply chain planning and scheduling integration using Lagrangian decomposition in a knowledge management environment

The integration of planning and scheduling decisions in rigorous mathematical models usually results in large scale problems. In order to tackle the problem complexity, decomposition techniques based on duality and information flows between a master and a set of subproblems are widely applied. In this sense, ontologies improve information sharing and communication in enterprises and can even represent holistic mathematical models facilitating the use of analytic tools and providing higher flexibility for model building. In this work, we exploit this ontologies’ capability to address the optimal integration of planning and scheduling using a Lagrangian decomposition approach. Scheduling/planning sub-problems are created for each facility/supply chain entity and their dual solution information is shared by means of the ontological framework. Two case studies based on a STN representation of supply chain planning and scheduling models are presented to emphasize the advantages and limitations of the proposed approach.     

Multi-resource scheduling for FPGA systems

In modern cloud data centers, reconfigurable devices (FPGAs) are used as an alternative to Graphics Processing Units to accelerate data-intensive computations (e.g., machine learning, image and signal processing). Currently, FPGAs are configured to execute fixed workloads, repeatedly over long periods of time. This conflicts with the needs, proper to cloud computing, to flexibly allocate different workloads and to offer the use of physical devices to multiple users. This raises the need for novel, efficient FPGA scheduling algorithms that can decide execution orders close to the optimum in a short time. In this context, we propose a novel scheduling heuristic where groups of tasks that execute together are interposed by hardware reconfigurations. Our contribution is based on gathering tasks around a high-latency task that hides the latency of tasks, within the same group, that run in parallel and have shorter latencies. We evaluated our solution on a benchmark of 37500 random workloads, synthesized from realistic designs (i.e., topology, resource occupancy). For this testbench, on average, our heuristic produces optimum makespan solutions in 47.4% of the cases. It produces acceptable solutions for moderately constrained systems (i.e., the deadline falls within 10% of the optimum makespan) in 90.1% of the cases.