考虑订单取件时间和柔性时间窗的取送货车辆路径问题

研究了同城配送中考虑订单取货时间和柔性时间窗的取送货车辆路径问题,考虑同城配送中订单起终点,订单取货时间和订单配送的柔性时间窗,车容量限制等因素。首先构建以配送成本与超时惩罚成本之和最小化为目标的混合整数线性模型。其次,设计了含多种有效不等式及其对应分离算法的改进分支切割算法对该模型进行精确求解。最后通过实验测试分析了不等式的性能,验证了算法的有效性,实验表明适当的减少车辆数和增大装载能力能够有效的减少成本。     

线型/圈型网络上单台车辆分群调度问题

本文研究线型/圈型网络上单台车辆分群调度问题。给定一个线型/圈型网络,若干客户分布其中。所有客户被划分成若干个子集,每个子集称为一个群。每个客户有一个释放时间和一个服务时间。给定一台车辆,其需要服务所有客户,且每个群内的客户连续服务。问题的要求是计算一个时间表,使得车辆能够按要求服务完所有客户并返回初始出发位置所花费的时间最少。针对该问题,就线型网络和圈型网络,分别给出一个7/4和一个13/7近似算法。     

Qualitative properties of pulsating fronts for reaction–advection–diffusion equations in periodic excitable media

In this paper, we study the pulsating fronts of reaction–advection-diffusion equations with two types of nonlinear term in periodic excitable media. Firstly, for the case with combustion nonlinearity, the unique front is proved to decay exponentially when it approaches the unstable limiting state. Secondly, for the degenerate monostable type nonlinearity, it is shown that the front with critical speed is unique, monotone and decays exponentially at negative end, while the fronts of noncritical speeds decay to zero non-exponentially.     

A two-phase algorithm for the partial accessibility constrained vehicle routing problem

In the partial accessibility constrained vehicle routing problem, a route can be covered by two types of vehicles, i.e. truck or truck + trailer. Some customers are accessible by both vehicle types, whereas others solely by trucks. After introducing an integer programming formulation for the problem, we describe a two-phase heuristic method which extends a classical vehicle routing algorithm. Since it is necessary to solve a combinatorial problem that has some similarities with the generalized assignment problem, we propose an enumerative procedure in which bounds are obtained from a Lagrangian relaxation. The routine provides very encouraging results on a set of test problems.     

8,10-二炔廿五碳酸LB膜的周期结构

合成了8,10-二炔廿五碳酸,在玻璃片、石英片和镀金片上沉积了它的LB膜,X-射线衍射研究了LB膜的周期结构和聚合对它的影响。在2θ=1°—15°范围内观察到了多达7个布拉格衍射峰。由此计算了等同周期和分子在基片上的倾斜角。用分子模型计算了衍射峰强度,得到了与实验结果相符合的衍射峰强度奇偶起伏现象。     

The Capacitated Team Orienteering Problem: A Bi-level Filter-and-Fan method

This paper focuses on vehicle routing problems with profits and addresses the so-called Capacitated Team Orienteering Problem. Given a set of customers with a priori known profits and demands, the objective is to find the subset of customers, for which the collected profit is maximized, and to determine the visiting sequence and assignment to vehicle routes assuming capacity and route duration restrictions. The proposed method adopts a hierarchical bi-level search framework that takes advantage of different search landscapes. At the upper level, the solution space is explored on the basis of the collected profit, using a Filter-and-Fan method and a combination of profit oriented neighborhoods, while at the lower level the routing of customers is optimized in terms of traveling distance via a Variable Neighborhood Descent method. Computational experiments on benchmark data sets illustrate the efficiency and effectiveness of the proposed approach. Compared to existing results, new upper bounds are produced with competitive computational times.     

A Study of the Connectivity Over Time Behavior of On-Demand Ad Hoc Path Selection Schemes

Selecting the most appropriate path between each pair of nodes in an ad hoc network is an issue with major impact on network performance. Many schemes were proposed and compared in the literature, using various criteria. However, the connectivity over time behavior of these schemes, which is important to some practical applications, was not well studied, especially with regards to the terrain type. In this work we use simulation to study this aspect of network performance. We demonstrate that a different connectivity requirement and a different time horizon may dictate a different scheme to use. We also demonstrate that path selection schemes are not equally sensitive to the terrain.     

Combined Path and Maximum Empty Static Routing Algorithms with Wavelength Assignment for Future Transport Networks

Abstract

In this article, two static routing algorithms have been proposed and compared to some of the existing algorithms on the basis of blocking probability. The two proposed static routing and wavelength assignment algorithms reduce the blocking probability to maximize the utilization of the network. All of these algorithms are analyzed and compared with four wavelength assignment schemes, which are first-fit, random, most used, and least used. It is shown that our proposed static algorithms give the best performance for first-fit wavelength assignment and most used wavelength assignment strategies with reduced complexity. For least used wavelength assignment and random wavelength assignment, 1 fixed and 2 alternate routing algorithm gives the lowest blocking probability.     

无人机视角下的林木爆燃火特性研究

森林火灾“爆燃”现象的特征是突然发生的高强度、高蔓延速度的燃烧。目前为止，关于“爆燃火”的原因还没有达成共识。以无人机视角下对林木爆燃火特性研究，以四川木里特大森林火灾为研究对象，通过分析凉山州某森林扑火部队3月31日木里森林火灾当天KWT（科卫泰）无人机航拍火场画面，结合无人机实时影像及实地调研数据，分析了峡谷地形林火蔓延时空特征，探讨了峡谷中风向风速变化时空分布规律，研究了地形变化条件下，不同海拔高度风速特征，建立了无人机倾角测量风速模型（其中为风速m·s-1，为无人机倾角°）。结果表明，高山峻岭特殊地形环境下每天4:00—12:00时间段为静风期，为峡谷林火扑救最佳时期；午后15:00—17:00和晚上20:00—22:00为山谷地形风速活跃期；仿真软件数据显示山顶、谷底与山腰不同海拔位置的风速风向不统一，谷底会产生乱流现象，且风速与海拔不存在正相关关系，小气候在复杂地形中占主导影响地位；在谷口至山谷深处的中间位置会出现气流速度的波峰状态，并易形成乱流，为爆燃火发生提供了客观必要条件。该研究可为复杂地形环境下，森林草原火灾扑救安全提供数据和技术支撑。     

基于聚类和动态规划的组合路径策略

为提高电商仓库的拣货作业效率,本文提出了基于聚类和动态规划的组合路径策略,实现了生成路径消耗时间和路径长度之间的平衡,并将这一策略成功地应用到多区型仓库。该策略分四步:首先,根据待拣储位分布特征,运用聚类分析法对其进行分类;然后,以各类的首末储位作为节点,运用动态规划法对已得分类进行排序,得到相应的类序;其次,得到各类内部路径;最后,依次拣取待拣商品,并返回出发点完成拣货作业。在提出新的路径策略后,通过仿真方法将新策略与三种传统路径策略(穿越策略、最大间隙策略和混合策略)和一种优质算法(蚁群算法)进行了对比分析,结果表明:该策略具备良好的适用性和实用性。