求解带时间窗车辆路径问题的改进粒子群算法

通过分析已有粒子群算法对有时间窗约束的车辆路径问题求解质量不高的原因,提出了一种基于粒子交换原理的整数粒子更新方法。采用构造的双层粒子进化算法分别对8个和20个任务点的有时间窗约束的车辆路径问题求解,数值实验结果表明算法的求解精度和耗时均优于已有算法。     

User experimentation: an evaluation of velocity control techniques in immersive virtual environments

While many of the existing velocity control techniques are well designed, the techniques are often application-specific, making it difficult to compare their effectiveness. In this paper, we evaluate five known velocity control techniques using the same experimental settings. We compare the techniques based on the assumption that a good travel technique should be easy to learn and easy to use, should cause the user to have few collisions with the VE, should allow the user to complete tasks faster, and should promote better recollection of the environment afterwards. In our experiments, we ask twenty users to use each velocity control technique to navigate through virtual corridors while performing information-gathering tasks. In all cases, the users use pointing to indicate the direction of travel. We then measure the users’ ability to recollect the information they see in the VE, as well as how much time they spend in the VE and how often they collide with the virtual walls. After each test, we use questionnaires to evaluate the ease of learning and ease of use of the velocity control technique, and the users’ sense of presence in the environment. Each of the travel techniques is then evaluated based on the users’ performances in the VE and the results of their questionnaires.     

A hybrid clustering and graph based algorithm for tagSNP selection

TagSNP selection, which aims to select a small subset of informative single nucleotide polymorphisms (SNPs) to represent the whole large SNP set, has played an important role in current genomic research. Not only can this cut down the cost of genotyping by filtering a large number of redundant SNPs, but also it can accelerate the study of genome-wide disease association. In this paper, we propose a new hybrid method called CMDStagger that combines the ideas of the clustering and the graph algorithm, to find the minimum set of tagSNPs. The proposed algorithm uses the information of the linkage disequilibrium association and the haplotype diversity to reduce the information loss in tagSNP selection, and has no limit of block partition. The approach is tested on eight benchmark datasets from Hapmap and chromosome 5q31. Experimental results show that the algorithm in this paper can reduce the selection time and obtain less tagSNPs with high prediction accuracy. It indicates that this method has better performance than previous ones.     

Network Design with Edge-Connectivity and Degree Constraints

We consider the following network design problem; Given a vertex set V with a metric cost c on V, an integer k≥1, and a degree specification b, find a minimum cost k-edge-connected multigraph on V under the constraint that the degree of each vertex v∈V is equal to b(v). This problem generalizes metric TSP. In this paper, we show that the problem admits a ρ-approximation algorithm if b(v)≥2, v∈V, where ρ=2.5 if k is even, and ρ=2.5+1.5/k if k is odd. We also prove that the digraph version of this problem admits a 2.5-approximation algorithm and discuss some generalization of metric TSP.     

Application of maximum entropy principle for reliability-based design optimization

The maximum entropy principle (MEP) is used to generate a natural probability distribution among the many possible that have the same moment conditions. The MEP can accommodate higher order moment information and therefore facilitate a higher quality PDF model. The performance of the MEP for PDF estimation is studied by using more than four moments. For the case with four moments, the results are compared with those by the Pearson system. It is observed that as accommodating higher order moment, the estimated PDF converges to the original one. A sensitivity analysis formulation of the failure probability based on the MEP is derived for reliability-based design optimization (RBDO) and the accuracy is compared with that by finite difference method (FDM). Two RBDO examples including a realistic three-dimensional wing design are solved by using the derived sensitivity formula and the MEP-based moment method. The results are compared with other methods such as TR-SQP, FAMM + Pearson system, FFMM + Pearson system in terms of accuracy and efficiency. It is also shown that an improvement in the accuracy by including more moment terms can increase numerical efficiency of optimization for the three-dimensional wing design. The moment method equipped with the MEP is found flexible and well adoptable for reliability analysis and design.     

A combinatorial intra-enterprise exchange for logistics services

The exchange of cargo capacities is a well established approach in logistics. However, only few logistics marketplaces are able to take into consideration synergies that can be generated by combining different transportation routes of different logistics carrierps. In order to exploit these synergies, we designed and implemented the combinatorial exchange mechanism ComEx for the intra-enterprise exchange of delivery orders in a logistics company organized in a profit center structure. Each profit center is able to release delivery orders to an adjacent profit center if the geographic locations of the customers allow for a reduced-cost delivery by the adjacent profit center. We demonstrate that by using the ComEx mechanism, the total cost of transportation of our logistics company can be reduced by up to 14%. Since our iterative auction mechanism is very complex and therefore resource-intensive, we reduce the complexity by applying a convex hull approach combined with a distance-based cost estimator.

Nonlinear vehicle side-slip estimation with friction adaptation

A nonlinear observer for estimation of the longitudinal velocity, lateral velocity, and yaw rate of a vehicle, designed for the purpose of vehicle side-slip estimation, is modified and extended in order to work for different road surface conditions. The observer relies on a road-tire friction model and is therefore sensitive to changes in the adhesion characteristics of the road surface. The friction model is parametrized with a single friction parameter, and an update law is designed. The adaptive observer is proven to be uniformly globally asymptotically stable and uniformly locally exponentially stable under a persistency-of-excitation condition and a set of technical assumptions, using results related to Matrosov's theorem. The observer is tested on recorded data from two test vehicles and shows good results on a range of road surfaces.     

一种基于马尔可夫链的车辆自组网可生存性模型

根据车辆自组网（VANET）的特点和实际应用,分析了VANET的可生存性要素,给出了VANET的可生存性定义,分析了VANET的服务、威胁与策略,提出了基于马尔可夫链的平均可生存性量化模型,并通过模拟验证了该模型的正确性。理论和模拟结果均表明,保证基本服务和防止严重威胁可以有效保障VANET的可生存性。     

无人机遥感影像获取及后续处理探讨

作为卫星遥感和航空遥感的有益补充,无人机航空遥感系统获取遥感影像具有多种特性。通过4次无人机航拍试验,根据所获取的遥感影像和飞行辅助数据,对航拍数据进行拼接。从航拍的多个方面对飞行试验以及实验成果进行了质量评价。并提出了无人机应用于航拍时存在的问题及一些改进方法。     

智能车辆定位系统设计

车辆定位与导航系统是智能交通系统中当前需求较为迫切、应用比较广泛的一个重要的应用系统,是国际上公认的解决城市交通问题的有效途径之一。本文通过分析给出了智能车辆定位与导航系统的组成,并详细分析了核心技术。最后,给出了系统的硬件平台。